Article

Predicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocessors

Authors:

Toshio Endo,

Kenjiro Taura,

Akinori YonezawaAuthors Info & Claims

IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium

Page 43

Published: 23 April 2001 Publication History

Abstract

No abstract available.

References

[1]

Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. The Journal of Parallel and Distributed Computing , 37(1):55- 69, August 1996.

Crossref

Google Scholar

[2]

Hans-Juergen Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software Practice and Experience , 18(9):807-820, 1988.

Crossref

Google Scholar

[3]

Alan Charlesworth, Nicholas Aneshansley, Mark Haakmeester, Dan Drogichen, Gary Gilbert, Ricki Williams, and Andrew Phelps. The Starfire SMP interconnect. In Proceedings of ACM/IEEE Conference on High Performance Networking and Computing (SC97) , November 1997.

Crossref

Google Scholar

[4]

David Culler, Richard Karp, David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. LogP: Towards a realistic model of parallel computation. In Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , 1993.

Crossref

Google Scholar

[5]

Toshio Endo. A scalable mark-sweep garbage collector on large-scale shared-memory machines. master thesis, Department of Information Science, The University of Tokyo, February 1998.

Google Scholar

[6]

Toshio Endo, Kenjiro Taura, and Akinori Yonezawa. A scalable mark-sweep garbage collector on large-scale shared-memory machines. In Proceedings of ACM/IEEE Conference on High Performance Networking and Computing (SC97) , November 1997.

Crossref

Google Scholar

[7]

Matthew I. Frank, Anant Agarwal, and Mary K. Vernon. LoPC: Modeling contention in parallel algorithms. In Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , pages 276-287, June 1997.

Crossref

Google Scholar

[8]

Matteo Frigo. Portable High-Performance Programs . PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1999.

Crossref

Google Scholar

[9]

T. Kasami. An efficient recognition and syntax algorithm for context-free languages. Technical report, Air Force Cambridge Research Lab, 1965.

Google Scholar

[10]

James Laudon and Daniel Lenoski. The SGI Origin: A ccNUMA highly scalable server. In Proceedings of the 24th International Symposium on Computer Architecture , pages 241-251, 1997.

Crossref

Google Scholar

[11]

E. Mohr, D. Kranz, and R. Halstead. Lazy task creation: a technique for increasing the granularity of parallel programs. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming , pages 185-197, June 1990.

Crossref

Google Scholar

[12]

Kenjiro Taura, Kunio Tabata, and Akinori Yonezawa. StackThreads/MP: Integrating futures into calling standards. In Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , pages 60-71, May 1999.

Crossref

Google Scholar

Cited By

View all

Eran HPetrank E(2013)A study of data structures with a deep heap shapeProceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness10.1145/2492408.2492413(1-8)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2492408.2492413
Iyengar BGehringer EWolf MManivannan K(2012)Scalable concurrent and parallel markACM SIGPLAN Notices10.1145/2426642.225900647:11(61-72)Online publication date: 15-Jun-2012
https://dl.acm.org/doi/10.1145/2426642.2259006
Iyengar BGehringer EWolf MManivannan KVechev MMcKinley K(2012)Scalable concurrent and parallel markProceedings of the 2012 international symposium on Memory Management10.1145/2258996.2259006(61-72)Online publication date: 15-Jun-2012
https://dl.acm.org/doi/10.1145/2258996.2259006
Show More Cited By

Index Terms

Predicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocessors

Recommendations

Predicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocessors
IPDPS '01: Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS'01) - Volume 1

This paper describes a performance prediction model of parallel mark-sweep garbage collectors (GC) on shared memory multiprocessors. The prediction model takes the heap snapshot and memory access cost parameters (latency and occupancy) as inputs, and ...
Parallel garbage collection for shared memory multiprocessors
JVM'01: Proceedings of the 2001 Symposium on Java^TM Virtual Machine Research and Technology Symposium - Volume 1

We present a multiprocessor "stop-the-world" garbage collection framework that provides multiple forms of load balancing. Our parallel collectors use this framework to balance the work of root scanning, using static overpartitioning, and also to balance ...
Assessing the scalability of garbage collectors on many cores

Managed Runtime Environments (MRE) are increasingly used for application servers that use large multi-core hardware. We find that the garbage collector is critical for overall performance in this setting. We explore the costs and scalability of the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium

April 2001

ISBN:0769509908

Publisher

IEEE Computer Society

United States

Publication History

Published: 23 April 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Eran HPetrank E(2013)A study of data structures with a deep heap shapeProceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness10.1145/2492408.2492413(1-8)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2492408.2492413
Iyengar BGehringer EWolf MManivannan K(2012)Scalable concurrent and parallel markACM SIGPLAN Notices10.1145/2426642.225900647:11(61-72)Online publication date: 15-Jun-2012
https://dl.acm.org/doi/10.1145/2426642.2259006
Iyengar BGehringer EWolf MManivannan KVechev MMcKinley K(2012)Scalable concurrent and parallel markProceedings of the 2012 international symposium on Memory Management10.1145/2258996.2259006(61-72)Online publication date: 15-Jun-2012
https://dl.acm.org/doi/10.1145/2258996.2259006
Siebert F(2010)Concurrent, parallel, real-time garbage-collectionACM SIGPLAN Notices10.1145/1837855.180665445:8(11-20)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1837855.1806654
Barabash KPetrank E(2010)Tracing garbage collection on highly parallel platformsACM SIGPLAN Notices10.1145/1837855.180665345:8(1-10)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1837855.1806653
Siebert FVitek JLea D(2010)Concurrent, parallel, real-time garbage-collectionProceedings of the 2010 international symposium on Memory management10.1145/1806651.1806654(11-20)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806651.1806654
Barabash KPetrank EVitek JLea D(2010)Tracing garbage collection on highly parallel platformsProceedings of the 2010 international symposium on Memory management10.1145/1806651.1806653(1-10)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806651.1806653
Siebert FJones RBlackburn S(2008)Limits of parallel marking garbage collectionProceedings of the 7th international symposium on Memory management10.1145/1375634.1375638(21-29)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375634.1375638

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations