Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-grained Parallelism
Upcoming SlideShare
Loading in …5
×

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

755 views
696 views

Published on

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.

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
755
On SlideShare
0
From Embeds
0
Number of Embeds
70
Actions
Shares
0
Downloads
8
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • Shirako et al.X10 Vijay Saraswat
  • Shirako + Sarkar
  • So I went to the whiteboard drew a tree and figured out how to do it slightly different
  • How to build a tree to synchronize dynamic parallelism?
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • Example tree like in paper, briefly the different properties, and that they are aggregations of the subtree
  • In the general case: - propagate the phase count minimum up the tree - while doing this, wait for racing values, by checking that the found value is the expected from the last visited node, if it is not, wait until it is, thus the racing activity passed
  • In the general case: - propagate the phase count minimum up the tree - while doing this, wait for racing values, by checking that the found value is the expected from the last visited node, if it is not, wait until it is, thus the racing activity passed
  • In the general case: - propagate the phase count minimum up the tree - while doing this, wait for racing values, by checking that the found value is the expected from the last visited node, if it is not, wait until it is, thus the racing activity passed
  • In the general case: - propagate the phase count minimum up the tree - while doing this, wait for racing values, by checking that the found value is the expected from the last visited node, if it is not, wait until it is, thus the racing activity passed
  • ×