DocumentCode :
2964153
Title :
Exploiting shape in parallel programming
Author :
Jay, C. Barry ; Clarke, David G. ; Edwards, Jenny J.
Author_Institution :
Sch. of Comput. Sci., Univ. of Technol., Sydney, NSW, Australia
fYear :
1996
fDate :
11-13 Jun 1996
Firstpage :
295
Lastpage :
302
Abstract :
Shape theory is a new approach to data types and programming based on the separation of a data type into its “shape” and “data” parts. Shape is common in parallel computing. This paper identifies areas where the explicit use of shape reduces the burden of programming a parallel computer, using examples from an implementation of Cholesky decomposition
Keywords :
parallel programming; spatial data structures; Cholesky decomposition; data type; data types; parallel programming; shape theory; Australia; Computer languages; Concurrent computing; Data structures; Message passing; Parallel processing; Parallel programming; Program processors; Programming profession; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on
Print_ISBN :
0-7803-3529-5
Type :
conf
DOI :
10.1109/ICAPP.1996.562888
Filename :
562888
Link To Document :
بازگشت