Universitätsbibliothek Erlangen Zur Homepage der Universitätsbibliothek Erlangen
Zur Homepage der Universität Erlangen

Eingang zum Volltext in OPUS


Hinweis zum Urheberrecht

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bvb:29-opus-22686
URL: http://www.opus.ub.uni-erlangen.de/opus/volltexte/2011/2268/


Irregular data-parallelism in a parallel object-oriented language by means of Collective Replication

Haumacher, Bernhard ; Philippsen, Michael ; Tichy, Walter F.

Department Informatik

pdf-Format:
Dokument 1.pdf (756 KB)


SWD-Schlagwörter: Massive Parallelität , Compiler , Mehrkernprozessor , Nebenläufigkeit
Freie Schlagwörter (Englisch): Parallelism , Concurrency , Programming Languages , Compilers , Cluster computing , Multicore
Fakultät: Technische Fakultät
DDC-Sachgruppe: Informatik
Sonstige beteiligte Institution: Karlsruhe Institute of Technology, Computer Science Department, Institute for Programming Structures
Dokumentart: Report (Bericht)
Schriftenreihe: Technical reports / Department Informatik, ISSN 2191-5008
Bandnummer: CS-2010,4
Sprache: Englisch
Erstellungsjahr: 2010
Publikationsdatum: 19.01.2011
Kurzfassung in Englisch: In parallel object-oriented languages it is hard to elegantly express efficient data-parallel operations on objects of an irregularly-shaped object structure that is spread across the parallel computing environment.

This paper presents a new programming model that smoothly integrates both task and data parallelism in a distributed object-oriented context. So called Collective Replication combines enhanced data locality for parallel tasks with data-parallel computations on irregular data structures. Collectively replicated objects exploit the bulk- synchronous data-parallel pattern in an object-oriented language and relieve the programmer from explicitly coding the communication step even for irregular data structures. To make the consistency protocol efficient, only modified fields are shipped instead of whole objects. Moreover, a novel graph coloring approach is used to broadcast updates to all replicas; this technique avoids bottlenecks and is more efficient than known approaches.

We suggest Java language extensions that can be han- dled by a pre-processor and achieve good performance on a set of benchmark applications.


Home | Suchen | Veröffentlichen
 Sie benötigen weitere Informationen? Fragen Sie uns!


Letzte Änderung: 01.11.10