DocumentCode :
2367377
Title :
Abstract data types for SIMD hypercube machines
Author :
Bastani, Farokh B. ; Leu, Dar-Ren
Author_Institution :
Dept. of Comput. Sci., Houston Univ., TX, USA
fYear :
1988
fDate :
10-12 Oct 1988
Firstpage :
609
Lastpage :
616
Abstract :
The authors investigate an efficient implementation of abstract data types on single-instruction multiple-data (SIMD) hypercube machines. Methods of merging distributed clients and servers to allow efficient parallel operations are presented. In particular, parallel primitives are proposed as well as normalized representation schemas for efficiently implementing various abstract data types. Since the performance of an abstract data type component can vary considerably depending on the placement of its data elements on the physical processors, mapping strategies to reduce communication costs are discussed. These abstract components can serve as building blocks for implementing other parallel components, such as parsers, constraint resolvers, and pattern recognizers
Keywords :
data structures; parallel processing; SIMD hypercube machines; abstract data types; building blocks; constraint resolvers; mapping strategies; merging distributed clients; normalized representation schemas; parsers; pattern recognizers; servers; Computer science; Costs; Data structures; Databases; Expert systems; Hypercubes; Network servers; Parallel processing; Parallel programming; Power system modeling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
Type :
conf
DOI :
10.1109/FMPC.1988.47504
Filename :
47504
Link To Document :
بازگشت