ACM Home Page
Please provide us with feedback. Feedback
Reducing synchronization overhead in parallel simulation
Full text Publisher SitePublisher Site PdfPdf (1.08 MB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the tenth workshop on Parallel and distributed simulation table of contents
Philadelphia, Pennsylvania, United States
Pages: 86 - 95  
Year of Publication: 1996
ISBN:0-8186-7539-X
Also published in ...
Authors
Ulana Legedza  Large-Scale Parallel Software Group, MIT Laboratory for Computer Science, Cambridge, MA
William E. Weihl  Large-Scale Parallel Software Group, MIT Laboratory for Computer Science, Cambridge, MA
Sponsors
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/238788.238822
What is a DOI?

ABSTRACT

Synchronization is often the dominant cost in conservative parallel simulation, particularly in simulations of parallel computers, in which low-latency simulated communication requires frequent synchronization. We present and evaluate LOCAL BARRIERS and PREDICTIVE BARRIER SCHEDULING, two techniques for reducing synchronization overhead in the simulation of message-passing multicomputers. Local barriers use nearest-neighbor synchronization to reduce waiting time at synchronization points. Predictive barrier scheduling, a novel technique that schedules synchronizations using both compile-time and runtime analysis, reduces the frequency of synchronization operations. In contrast to other work in this area, both techniques reduce synchronization overhead without decreasing the accuracy of network simulation. These techniques were evaluated by comparing their performance to that of periodic global synchronization. Experiments show that local barriers improve performance by up to 24% for communication-bound applications, while predictive barrier scheduling improves performance by up to 65% for applications with long local computation phases. Because the two techniques are complementary, we advocate a combined approach. This work was done in the context of PARALLEL PROTEUS, a new parallel simulator of message-passing multicomputers.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
5
 
6
 
7
8
 
9
Thinking Machines Corporation. CM-5 technical summary, 1992.
 
10
Philip M. Dickens. Personal communication. January 1996.
 
11
 
12
13
 
14
 
15
Kirk Johnson, David Chaiken, and Alan Mainwaring. NWO-P: Parallel simulation of the Alewife machine. In Proceedings of the 1993 MIT Student Workshop on Supercomputing Technolo. gies, August 1993.
16
 
17
 
18
David Nicol and Richard Fujimoto. Parallel simulation today. Technical Report 92-62, ICASE, 1992.
19
20
21

CITED BY  14
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Ulana Legedza: colleagues
William E. Weihl: colleagues

Peer to Peer - Readers of this Article have also read: