Programming the data structure accelerator

Author

Zippel, Richard

Author_Institution

Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

fYear

1990

fDate

22-25 Oct 1990

Firstpage

65

Lastpage

75

Abstract

A fine-grained, massively parallel SIMD (single-instruction-stream, multiple-data-stream) architecture, called the data structure accelerator, is presented, and its use in a number of problems in computational geometry is demonstrated. This architecture is extremely dense and highly scalable. Systems of 10⁶ processing elements can be feasibly embedded in workstations. It is proposed that this architecture be used in tandem with conventional, single-sequence machines and with small-scale, shared-memory multiprocessors. A language for programming such heterogeneous systems that smoothly incorporates the SIMD instructions of the data structure accelerator with conventional single sequence code is presented

Keywords

computational geometry; computer architecture; data structures; programming; computational geometry; data structure accelerator; heterogeneous systems; highly scalable; language for programming; massively parallel SIMD architecture; processing elements; shared-memory multiprocessors; single sequence code; single-sequence machines; Acceleration; Computational geometry; Computer aided instruction; Computer architecture; Computer science; Contracts; Costs; Data structures; Supercomputers; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)

Conference_Location

Jerusalem

Print_ISBN

0-8186-2078-1

Type

conf

DOI

10.1109/JCIT.1990.128270

Filename

128270