Abstract
Mattern's GVT algorithm is a time management algorithm that helps achieve the synchronization in parallel and distributed systems. This algorithm uses ring structure to establish cuts C1 and C2 to calculate the GVT. The latency of calculating the GVT is vital in parallel/distributed systems which is extremely high if calculated using this algorithm. However, using synchronous barriers with the Matterns algorithm can help improving the GVT computation process by minimizing the GVT latency. In this paper, we incorporate the butterfly barrier to employ two cuts C1 and C2 and obtain the resultant GVT at an affordable latency. Our analysis shows that the proposed GVT computation algorithm significantly improves the overall performance in terms of memory saving and latency.
Original language | English (US) |
---|---|
Title of host publication | Advanced Techniques in Computing Sciences and Software Engineering |
Publisher | Springer Publishing Company |
Pages | 589-593 |
Number of pages | 5 |
ISBN (Print) | 9789048136599 |
DOIs | |
State | Published - 2010 |
Event | 2008 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008 - Duration: Dec 5 2008 → Dec 13 2008 |
Publication series
Name | Advanced Techniques in Computing Sciences and Software Engineering |
---|
Other
Other | 2008 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008 |
---|---|
Period | 12/5/08 → 12/13/08 |
All Science Journal Classification (ASJC) codes
- Software