Irregular parallel algorithms in Java

Blount B, Chatterjee S, Philippsen M (1999)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 1999

Publisher: Springer

Series: Lecture Notes in Computer Science

City/Town: Berlin Heidelberg

Book Volume: 1586

Pages Range: 1026-1035

Conference Proceedings Title: Parallel and Distributed Processing

Event location: San Juan, Puerto Rico, USA US

ISBN: 978-3-540-65831-3


DOI: 10.1007/BFb0097988


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 forall 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.

Authors with CRIS profile

How to cite


Blount, B., Chatterjee, S., & Philippsen, M. (1999). Irregular parallel algorithms in Java. In Rolim, José (Eds.), Parallel and Distributed Processing (pp. 1026-1035). San Juan, Puerto Rico, USA, US: Berlin Heidelberg: Springer.


Blount, Brian, Siddhartha Chatterjee, and Michael Philippsen. "Irregular parallel algorithms in Java." Proceedings of the 6th Int. Workshop on Solving Irregularly Structured Problems in Parallel, San Juan, Puerto Rico, USA Ed. Rolim, José, Berlin Heidelberg: Springer, 1999. 1026-1035.

BibTeX: Download