DocumentCode
2290589
Title
Efficient algorithms for prefix and general prefix computations on distributed shared memory systems with applications
Author
Kamakoti, V. ; Balakrishnan, N.
Author_Institution
Supercomput. Educ. & Res. Centre, Indian Inst. of Sci., Bangalore, India
fYear
1997
fDate
10-13 Dec 1997
Firstpage
44
Lastpage
51
Abstract
The paper presents efficient scalable algorithms for performing prefix (PC) and general prefix (GPC) computations on a distributed shared memory, (DSM) system with applications. PC and GPC are generic techniques that can be used to design sequential and parallel algorithms for a number of problems from diverse areas (K. Arvind et al., 1995; V. Kamakoti and C. Pandurangan, 1992)
Keywords
distributed memory systems; parallel algorithms; shared memory systems; DSM; GPC; PC computations; distributed shared memory systems; general prefix computations; generic techniques; parallel algorithms; prefix computations; Algorithm design and analysis; Concurrent computing; Distributed computing; Parallel algorithms; Parallel processing; Phase change random access memory; Programming profession; Scalability; Software systems; Supercomputers;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on
Conference_Location
Seoul
Print_ISBN
0-8186-8227-2
Type
conf
DOI
10.1109/ICPADS.1997.652528
Filename
652528
Link To Document