A high-performance memory allocator for object-oriented systems

IEEE Transactions on Computers

Volumn 45, Issue 3, 1996, Pages 357-366

  Chang, J Morris ^a,b   Gehringer, Edward F ^a,c  

^a IEEE

^b Illinois Institute of Technology   (United States)

^c North Carolina State University   (United States)

Author keywords

Binary tree; Bit vector allocation; Buddy system; Dynamic memory management; Internal fragmentation; Object oriented systems

Indexed keywords

EID: 0001259260     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.485574     Document Type: Article

References (20)

1. A.A. Abonamah, "Resource Allocation Strategies for Hypercube Architectures," Information Sciences, vol. 64, no. 3, pp. 251-269, Oct. 1992.
2. R.E. Berkley and T.P. Lee, "A Lazy Buddy System Bounded by Two Coalescing Delays per Class," Proc. 12th Symp. Operating Systems Principles, vol. 23, no. 5, pp. 167-176, Dec. 1989.
3. L. Bic and A.C. Shaw, The Logical Design of Operating Systems, second edition, pp. 210-216. Englewood Cliffs, N.J.: Prentice Hall, 1988.
4. B. Calder, D. Grunwald, and B. Zorn, "Quantifying Behavioral Differences Between C and C++ Programs," Technical Report CU-CS-698-94, Computer Science Dept., Univ. of Colorado, Jan. 1994. Submitted to J. Programming Languages.
5. J.M. Chang and E.F. Gehringer, "Object Caching for Performance in Object-Oriented Systems," Proc. IEEE Int'l Conf. Computer Design, pp. 379-385, Oct. 1991.
6. J.M. Chang, "A Coprocessor Architecture for Memory Management in Object-Oriented Systems," PhD thesis, North Carolina State Univ., Aug. 1993.
7. J.M. Chang and E.F. Gehringer, "Evaluation of an Object-Caching Coprocessor Design for Object-Oriented Systems," Proc. IEEE Int'l Conf.. Computer Design, pp. 132-139, Oct. 3-6, 1993.
8. n Word Blocks," Comm. ACM, vol. 7, pp. 589-592, Sept. 1971.
9. A. Kaufman, "Tailored-List and Recombination-Delaying Buddy System," ACM Trans. Programming Languages and Systems, vol. 6, no. 1, pp. 119-125, Jan. 1984.
10. K.C. Knowlton, "A Fast Storage Allocator," Comm. ACM, vol. 8, pp. 623-625, Oct. 1965.
11. D.E. Knuth, The Art of Computer Programming Vol. I: Fundamental Algorithms. Addison-Wesley, 1968.
12. P.D. Koch, "Disk File Allocation Based on the Buddy System," ACM Trans. Computer Systems, vol. 5, no. 4, pp. 353-370, Nov. 1987.
13. I.P. Page and J. Hagins, "Improving the Performance of Buddy Systems," IEEE Trans. Computers, vol. 35, no. 5, pp. 441-447, May 1986.
14. J.L. Peterson and T.A. Norman, "Buddy Systems," Comm. ACM, vol. 20, pp. 421-431, June 1977.
15. E.V. Puttkamer, "A Simple Hardware Buddy System Memory Allocator," IEEE Trans. Computers, vol. 24, no. 10, pp. 953-957, Oct. 1975.
16. I. Williams and M. Wolczko, "An Object-Based Memory Architecture," Proc. Fourth Workshop Persistent Object Systems, pp. 111-127, Martha's Vineyard, Mass., Sept. 1990.
17. P.R. Wilson and T.G. Moher, "Design of the Opportunistic Garbage Collector," Proc. OOPSLA '89 (ACM SIGPLAN Notices, vol. 24, no. 10), pp. 23-35, Oct. 1989.
18. B. Zorn, "Custo-Malloc: Efficient Synthesized Memory Allocators," Technical Report CU-CS-602-92, Computer Science Dept., Univ. of Colorado, July 1992.
19. B. Zorn, "The Empirical Measurements of Six Allocation-Intensive C Programs," ACM SIGPLAN Notices, vol. 27, no. 12, pp. 71-80, Dec. 1992.
20. B. Zorn, "The Measured Cost of Conservative Garbage Collection," Software-Practice and Experience, vol. 23, no. 7, pp. 733-756, July 1993.