BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:gron

The blue social bookmark and publication sharing system.

entry of gron and 1 other user:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism

by: Stefan Marr, Stijn Verhaegen, Bruno De Fraine, Theo D'Hondt, and Wolfgang De Meuter

In: Proceedings of the 12th IEEE International Conference on High Performance Computing and CommunicationsIEEE Computer Society (September 2010) , p. 130-137.

Resources (URL, PDF, PS...)

URL:	http://www.computer.org/portal/web/csdl/doi/10.1109/HPCC.2010.30
DOI:	10.1109/HPCC.2010.30

This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with dynamic, two-phase, and point-to-point synchronization. It retains the scalability of classical tree barriers, but provides unbounded dynamicity by employing a tailor-made insertion tree data structure. It is the first completely documented implementation strategy for a scalable phaser synchronization construct. Our evaluation shows that it can be used as a drop-in replacement for classic barriers without harming performance, despite its additional complexity and potential for performance optimizations. Furthermore, our approach overcomes performance and scalability limitations which have been present in other phaser proposals.

BibTeX record

@inproceedings{InsertionTreePhasers,
  abstract = {This paper presents an algorithm and a data structure for scalable dynamic synchronization in
fine-grained parallelism. The algorithm supports the full generality of phasers with
dynamic, two-phase, and point-to-point synchronization. It retains the scalability of 
classical tree barriers, but provides unbounded dynamicity by employing a tailor-made
insertion tree data structure.

It is the first completely documented implementation strategy for a scalable phaser
synchronization construct. Our evaluation shows that it can be used
as a drop-in replacement for classic barriers without harming performance, despite its additional
complexity and potential for performance optimizations.
Furthermore, our approach overcomes performance and scalability limitations
which have been present in other phaser proposals.},
  added-at = {2010-09-22T15:13:52.000+0200},
  author = {Marr, Stefan and Verhaegen, Stijn and Fraine, Bruno De and D'Hondt, Theo and Meuter, Wolfgang De},
  biburl = {http://www.bibsonomy.org/bibtex/2e0e488ee39b6fcbeedb6f7d221df958a/gron},
  booktitle = {Proceedings of the 12th IEEE International Conference on High Performance Computing and Communications},
  doi = {10.1109/HPCC.2010.30},
  interhash = {db46bfb816422a5055237a1b387e3dfe},
  intrahash = {e0e488ee39b6fcbeedb6f7d221df958a},
  isbn = {978-0-7695-4214-0},
  keywords = {Barrier MeMyPublication Phasers X10 algorithm benchmarks clocks evaluation habanero insertionTree myown tree},
  month = {September},
  note = {Best Student Paper Award
Acceptance Rate: 19,1% (58/304)},
  pages = {130-137},
  publisher = {IEEE Computer Society},
  timestamp = {2010-09-22T15:13:52.000+0200},
  title = {Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization  for Fine-grained Parallelism},
  url = {http://www.computer.org/portal/web/csdl/doi/10.1109/HPCC.2010.30},
  year = 2010
}

Endnote record

%0 Conference Paper
%1 InsertionTreePhasers
%A Marr, Stefan
%A Verhaegen, Stijn
%A Fraine, Bruno De
%A D'Hondt, Theo
%A Meuter, Wolfgang De
%B Proceedings of the 12th IEEE International Conference on High Performance Computing and Communications
%@ 978-0-7695-4214-0
%D 2010
%I IEEE Computer Society
%K 
%P 130-137
%T Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization  for Fine-grained Parallelism
%R 10.1109/HPCC.2010.30
%U http://www.computer.org/portal/web/csdl/doi/10.1109/HPCC.2010.30
%X This paper presents an algorithm and a data structure for scalable dynamic synchronization in
fine-grained parallelism. The algorithm supports the full generality of phasers with
dynamic, two-phase, and point-to-point synchronization. It retains the scalability of 
classical tree barriers, but provides unbounded dynamicity by employing a tailor-made
insertion tree data structure.

BibSonomy :: publication ::

Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record