article

Free access

Empirical measurements of six allocation-intensive C programs

Authors:

Benjamin Zorn,

Dirk GrunwaldAuthors Info & Claims

ACM SIGPLAN Notices, Volume 27, Issue 12

Pages 71 - 80

https://doi.org/10.1145/142181.142200

Published: 01 December 1992 Publication History

PDF eReader

Abstract

Dynamic memory management is an important part of a large class of computer programs and high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. This paper presents empirical data from a collection of six allocation-intensive C programs. Extensive statistics about the allocation behavior of the programs measured, including the distributions of object sizes, lifetimes, and interarrival times, are presented. This data is valuable for the following reasons: first, the data from these programs can be used to design high-performance algorithms for dynamic memory management. Second, these programs can be used as a benchmark test suite for evaluating and comparing the performance of different dynamic memory management algorithms. Finally, the data presented gives readers greater insight into the storage allocation patterns of a broad range of programs. The data presented in this paper is an abbreviated version of more extensive statistics that are publically available on the internet.

References

[1]

[1] A. P. Batson and R. E. Brundage. Segment sizes and lifetimes in Algol-60 programs. Communications of the ACM, 20(1):36-44, January 1977.

Digital Library

Google Scholar

[2]

[2] A. P. Batson, S. M. Ju, and D. C. Wood. Measurements of segment size. Communications of the ACM, 13(3):155-159, March 1970.

Digital Library

Google Scholar

[3]

[3] G. Bozman, W. Buco, T. P. Daly, and W. H. Tetzlaff. Analysis of free-storage algorithms--revisited. IBM Systems Journal, 23(1):44-64, 1984.

Digital Library

Google Scholar

[4]

[4] R. P. Brent. Efficient implementation of a first-fit strategy for dynamic storage allocation. ACM Transactions on Programming Languages and Systems, 11(3):388-403, July 1989.

Digital Library

Google Scholar

[5]

[5] John DeTreville. Heap usage in the Topaz environment. Technical Report 63, Digital Equipment Corporation System Research Center, Palo Alto, CA, August 1990.

Google Scholar

[6]

[6] Dirk Grunwald and Benjamin Zorn. CUSTOMALLOC: Efficient synthesized memory allocators. Technical Report CS-CS-602-92, Department of Computer Science, University of Colorado, Boulder, Boulder, CO, July 1992.

Google Scholar

[7]

[7] Raj Jain. The Art of Computer Systems Performance Evaluation. Wiley Professional Computing. John Wiley and Sons, Inc., New York, 1991.

Google Scholar

[8]

[8] James R. Larus. Abstract execution: A technique for efficiently tracing programs. Software-- Practice and Experience, 20(12):1241-1258, December 1990.

Digital Library

Google Scholar

[9]

[9] B. H. Margolin, R. P. Parmelee, and M. Schatzoff. Analysis of free-storage algorithms. IBM Systems Journal, 10(4):283-304, 1971.

Digital Library

Google Scholar

[10]

[10] Rodney R. Oldehoeft and Stephen J. Allan. Adaptive exact-fit storage management. Communications of the ACM, 28(5):506-511, May 1985.

Digital Library

Google Scholar

[11]

[11] Thomas Standish. Data Structures Techniques. Addison-Wesley Publishing Company, 1980.

Digital Library

Google Scholar

[12]

[12] Charles B. Weinstock. Dynamic Storage Allocation Techniques. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1976.

Digital Library

Google Scholar

[13]

[13] Benjamin Zorn. The measured cost of conservative garbage collection. Technical Report CU-CS- 573-92, Department of Computer Science, University of Colorado, Boulder, Boulder, CO, February 1992.

Google Scholar

[14]

[14] Benjamin Zorn and Dirk Grunwald. Evaluating models of memory allocation. Technical Report CS-CS-603-92, Department of Computer Science, University of Colorado, Boulder, Boulder, CO, July 1992.

Google Scholar

Cited By

View all

Xu SLiu EHuang WLie D(2023)MIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds CheckingProceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses10.1145/3607199.3607212(609-622)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3607199.3607212
Zhou JLi DLiu T(2023)Profile Dynamic Memory Allocation in Autonomous Driving Software2023 10th International Conference on Dependable Systems and Their Applications (DSA)10.1109/DSA59317.2023.00127(905-914)Online publication date: 10-Aug-2023
https://doi.org/10.1109/DSA59317.2023.00127
Xu SHuang WLie DSherwood TBerger EKozyrakis C(2021)In-fat pointer: hardware-assisted tagged-pointer spatial memory safety defense with subobject granularity protectionProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446761(224-240)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3445814.3446761
Show More Cited By

Index Terms

Empirical measurements of six allocation-intensive C programs
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Allocation / deallocation strategies

Recommendations

Memory Subsystem Performance of Programs with Intensive Heap Allocation
Memory management thread for heap allocation intensive sequential applications
MEDEA '09: Proceedings of the 10th workshop on MEmory performance: DEaling with Applications, systems and architecture

Dynamic memory management is one of the most ubiquitous and expensive operations in many C/C++ applications. Some C/C++ programs might spend up to one third of their execution time in dynamic memory management routines. With multicore processors as a ...
Makalu: fast recoverable allocation of non-volatile memory
OOPSLA 2016: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications

Byte addressable non-volatile memory (NVRAM) is likely to supplement, and perhaps eventually replace, DRAM. Applications can then persist data structures directly in memory instead of serializing them and storing them onto a durable block device. ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 27, Issue 12

Dec. 1992

82 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/142181

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1992

Published in SIGPLAN Volume 27, Issue 12

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
320
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)16

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xu SLiu EHuang WLie D(2023)MIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds CheckingProceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses10.1145/3607199.3607212(609-622)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3607199.3607212
Zhou JLi DLiu T(2023)Profile Dynamic Memory Allocation in Autonomous Driving Software2023 10th International Conference on Dependable Systems and Their Applications (DSA)10.1109/DSA59317.2023.00127(905-914)Online publication date: 10-Aug-2023
https://doi.org/10.1109/DSA59317.2023.00127
Xu SHuang WLie DSherwood TBerger EKozyrakis C(2021)In-fat pointer: hardware-assisted tagged-pointer spatial memory safety defense with subobject granularity protectionProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446761(224-240)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3445814.3446761
Wu FWeimer WHarman MJia YKrinke JEsparcia-Alcázar A(2015)Deep Parameter OptimisationProceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739480.2754648(1375-1382)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739480.2754648
Aigner MHütter TKirsch CMiller APayer HPreishuber M(2014)ACDC-JSACM SIGPLAN Notices10.1145/2775052.266108950:2(67-78)Online publication date: 14-Oct-2014
https://dl.acm.org/doi/10.1145/2775052.2661089
Aigner MHütter TKirsch CMiller APayer HPreishuber MBlack ATratt L(2014)ACDC-JSProceedings of the 10th ACM Symposium on Dynamic languages10.1145/2661088.2661089(67-78)Online publication date: 20-Oct-2014
https://dl.acm.org/doi/10.1145/2661088.2661089
Aigner MKirsch C(2013)ACDCACM SIGPLAN Notices10.1145/2555670.246416148:11(75-84)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2555670.2464161
Aigner MKirsch CCheng PPetrank E(2013)ACDCProceedings of the 2013 international symposium on memory management10.1145/2491894.2464161(75-84)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2491894.2464161
Aigner MKirsch CCheng PPetrank E(2013)ACDCProceedings of the 2013 international symposium on memory management10.1145/2464157.2464161(75-84)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2464157.2464161
Tiwari DSanghoon Lee Tuck JYan Solihin (2010)MMT: Exploiting fine-grained parallelism in dynamic memory management2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)10.1109/IPDPS.2010.5470428(1-12)Online publication date: Apr-2010
https://doi.org/10.1109/IPDPS.2010.5470428
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Memory Subsystem Performance of Programs with Intensive Heap Allocation

Memory management thread for heap allocation intensive sequential applications

Makalu: fast recoverable allocation of non-volatile memory

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations