Abstract
The authors examine the function of a connection network between massive numbers of processing elements (PEs) and a single host by comparing the data structure machine (DSM), whose major connection network is a computationally powerful binary tree with the host connected at the root, and the Connection Machine (CM), which provides a very rich and general PE-to-PE connection network, but whose connection to the host is little more than a buffered wire. The binary tree network used in the DSM can be utilized to achieve asymptotic improvements in speed for algorithms that maintain, locate, the utilize data parallelism in data structures that can be characterized by a high degree of locality. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
