Boots – shoes – and leggings
Patent
1986-09-02
1989-08-22
Chan, Eddie P.
Boots, shoes, and leggings
36422711, 3642319, G06F 1300
Patent
active
048602019
ABSTRACT:
A plurality of parallel processing elements are connected in a binary tree configuration, with each processing element except those in the highest and lowest levels being in communication with a single parent processing element as well as first and second (or left and right) child processing elements. Each processing element comprises a processor, a read/write or random access memory, and an input/output (I/O) device. The I/O device provides interfacing between each processing element and its parent and children processing elements so as to provide significant improvements in propagation speeds through the binary tree. The I/O device allows the presently preferred embodiment of the invention to be clocked at 12 megahertz, producing in the case of a tree of 1023 processors, each having an average instruction cycle time of 1.8 .mu.s, a system with a raw computational throughput of approximately 570 million instructions per second. The I/O device communicates data and queries from the root processing element to all other N processing elements in the array in one processor instruction cycle instead of in O(log.sub.2 N) processor instruction cycles as in prior art binary tree arrays. Primitive queries are executed in parallel by each processing element and the results made available for reporting back to the root processing element. In several important cases, these results can be combined and reported back to the root processing element in a single processor instruction cycle instead of in O(log.sub.2 N) processor instruction cycles as in prior art binary tree arrays. Thus, the elapsed time for a broadcast and report operation is in effect a constant time regardless of the number of processors in the array.
REFERENCES:
patent: 4101960 (1978-07-01), Stokes et al.
patent: 4247892 (1981-01-01), Lawrence
patent: 4251861 (1981-02-01), Mago
patent: 4344134 (1982-08-01), Barnes
patent: 4388683 (1983-06-01), Beifuss et al.
patent: 4435758 (1984-03-01), Lorie et al.
patent: 4466060 (1984-08-01), Riddle
patent: 4543630 (1985-09-01), Neches
patent: 4583164 (1986-04-01), Tolle
patent: 4622632 (1986-11-01), Tanimoto et al.
patent: 4633431 (1986-12-01), Bar
D. P. Miranker, 11/15/83, "Performance Analysis of Two Competing DADO PE Designs".
S. Taylor, 7/29/83, "Prolog on the DADO Machine: A Parallel System for High-Speed Logic Programming".
S. J. Stolfo, Mar. 1982, "A Tree-Structured Machine Architecture for Production Systems".
S. J. Stolfo, Aug. 15, 1983, "The DADO Parallel Computer".
S. J. Stolfo, 9/15/80, "Learning Control of Production Systems".
M. van Biema, 2/6/84, "PSL: A Parallel Lisp for the DADO Machine".
M. D. Lerner, 2/4/85, "LISP Compiler for the DADO Parallel Computer".
S. J. Stolfo, 2/29/84, "PPL/M: The System Level Language for Programming the DADO Machine".
S. Alterman, 4/15/85, "The Application of the AI and DADO Parallel Processor Technology to Future Unmanned Vehicle Systems".
P. Waldes, 4/16/85, "Are Maintenance Expert Systems Practical Now?".
S. J. Stolfo, 5/5/84, "Is CAD/CAM Ready for AI?".
S. J. Stolfo, 5/5/83, "Knowledge Engineering: Theory and Practice".
S. J. Stolfo, 10/15/83, "ACE: An Expert System Supporting Analysis and Management Decision Making".
M. D. Lerner, 6/12/85, "An Overview of the DADO Parallel Computer".
S. J. Stolfo, 6/6/85, "DADO: A Parallel Computer for Artificial Intelligence".
S. J. Stolfo, 10/29/84, "The DADO Production System Machine".
S. J. Stolfo, 8/15/84, "DADO: A Parallel Processor for Expert Systems".
S. J. Stolfo, 1/18/83, "Architecture and Applications of DADO: A Large Scale Parallel Computer for Artificial Intelligence".
S. J. Stolfo, Apr., 1981, "Specialized Hardware for Production Systems".
S. J. Stolfo, 8/15/84, "Five Parallel Algorithms for Production System Execution on the DADO Machine".
S. J. Stolfo, 4/16/85, "More Rules May Mean Faster Execution".
S. J. Stolfo, 4/16/85, "A Simple Preprocessing Scheme to Extract and Balance Implicit Parallelism in the Concurrent Match of Production Rules".
T. Ishida, 10/25/84, "Towards the Parallel Execution of Rules in Production System Programs".
D. P. Miranker, 4/9/84, "Performance Estimates for the DADO Machine: A Comparison of TREAT and RETE".
A. Lowery, 10/15/84, "LPS Algorighms".
A. Lowery, 3/15/84, "LPS Algorithms: A Detailed Examination".
A. Lowery, 3/15/84, "LPS Algorithms: A Critical Analysis".
S. Taylor, 2/1/84, "Logic Programming Using Parallel Associative Operations".
S. J. Stolfo, 1/1/85, "On the Design of Parallel Production System Machines: What's in a LIP?".
T. Ishida, 3/28/84, "Simultanieous Firing of Production Rules on Tree Structured Machines".
S. J. Stolfo, 3/15/82, "DADO: A Tree-Structured Machine Architecture for Production Systems".
Chuan-Lin Wu and Tse-vun Feng, "Interconnection Networks for Parallel and Distributed Processing", (IEEE 1984).
S. A. Browning, "Computations on a Tree of Processors", Proc. VLSI Conf., California Institute of Technology/Pasedena, Jan. 22-24, 1979.
A. M. Despain et al., "The Computer as a Component", (Unpublished 1979).
G. A. Mago, "A Cellular Language-Directed Computer Architecture", Proc. VLSI Conf., California Institute of Technology, Jan. 22-24, 1979.
R. J. Swan et al., "The Structure and Architecture of Cm*: A Modular Multi-Microprocessor," Proc. 1977 NCC, (Jun., 1977).
J. R. Goodman, "Hypertree: A Multiprocessor Interconnection Topology", IEEE Trans. on Computers, vol. C-30, No. 12, pp. 923-933, (Dec., 1981), reprinted in the above-cited Wu and Feng reference at pp. 46-56.
J. L. Bently and H. T. Kung, "Two Papers on a Tree-Structured Parallel Computer", Technical Report, Dept. of Computer Sciences Carnegie-Mellon University, Sep. 1979.
J. L. Bently, "Decomposable Searching Problems", Information Processing Letters, vol. 8, No. 5, pp. 244-250, (Jun. 1978).
Carlo H. Sequin, "Single-Chip Computers, the New VLSI Building Blocks", Proc. VLSI Conf., California Institute of Technology, Pasedena, Calif., Jan. 1979.
Miranker Daniel P.
Stolfo Salvatore J.
Chan Eddie P.
Ruiz Adolfo
The Trustees of Columbia University in the City of New York
LandOfFree
Binary tree parallel processor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Binary tree parallel processor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary tree parallel processor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2420281