Abstract
This paper presents two garbage collection schemes for causalmessage logging with independent checkpointing. The first scheme allows each process to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme enables the process to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that combining the two schemes significantly reduces the garbage collection overhead compared with the traditional schemes.
Original language | English |
---|---|
Title of host publication | High Performance Computing - HiPC 2001 - 8th International Conference, Proceedings |
Editors | Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam |
Publisher | Springer Verlag |
Pages | 272-281 |
Number of pages | 10 |
ISBN (Print) | 3540430091, 9783540430094 |
DOIs | |
Publication status | Published - 2001 |
Event | 8th International Conference on High Performance Computing, HiPC 2001 - Hyderabad, India Duration: 2001 Dec 17 → 2001 Dec 20 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 2228 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 8th International Conference on High Performance Computing, HiPC 2001 |
---|---|
Country/Territory | India |
City | Hyderabad |
Period | 01/12/17 → 01/12/20 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2001.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science