Result: Irregular parallel algorithms in Java

Title:
Irregular parallel algorithms in Java
Source:
Parallel and distributed processing (San Juan PR, 12-16 April 1999)Lecture notes in computer science. :1026-1035
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 30 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
The University of North Carolina, Chapel Hill, NC 27599-3175, United States
The University of Karlsruhe, 76128 Karlsruhe, Germany
ISSN:
0302-9743
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1578493
Database:
PASCAL Archive

Further Information

The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data parallelism into the object model of Java by developing a library of collection classes and adding a foral statement to the language. The collection classes provide parallel implementations of operations on the collections. The forall statement allows operations over the elements of a collection to be expressed in parallel. We distinguish between shape and data components in the collection classes, and use this distinction to simplify algorithm expression and to improve performance. We present initial performance data on two benchmarks with irregular algorithms, EM3d and Convex Hull, and on several microbenchmark programs.