Heap allocation

Details Heap allocation Heap allocation

2007-02-27

2007-02-27

Peugh, Brian R. (Department: 2187)

Electrical computers and digital processing systems: memory

Storage accessing and control

Memory configuring

C718S104000

Reexamination Certificate

active

10456896

ABSTRACT:
One or more electronically-accessible media including exemplary electronically-executable instructions that, when executed, direct an electronic apparatus to perform actions including: ascertaining, from multiple processors, a processor on which a requesting thread is executing; each processor of the multiple processors associated with each respective heap of multiple respective heaps; and selecting, for a memory allocation to the requesting thread, a respective heap that is associated with the processor on which the requesting thread is executing responsive to the action of ascertaining. An exemplary apparatus includes: at least one memory having multiple memory portions; multiple processors coupled to the at least one memory, each respective processor of the multiple processors executing a respective thread of multiple threads; and a memory allocator adapted to allocate memory resources from a memory portion of the multiple memory portions to each respective thread responsive to the respective processor on which each respective thread is executing.

REFERENCES:
patent: 5787447 (1998-07-01), Smithline et al.
patent: 5809554 (1998-09-01), Benayon et al.
patent: 6058460 (2000-05-01), Nakhimovsky
patent: 6336178 (2002-01-01), Favor
patent: 6553476 (2003-04-01), Ayaki et al.
patent: 6754788 (2004-06-01), Mathews et al.
patent: 2002/0194421 (2002-12-01), Berry et al.
Steensgaard, Microsoft Research, “Thread-Specific Heaps for Multi-Threaded Programs,” ACM Sigplan Notices, 2001, V 36, N1 (Jan.), pp. 18-24.
Imai et al., “Evaluation of Parallel Copying Garbage Collection on a Shared-Memory Multiprocessor,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 9, Sep. 1993, pp. 1030-1040.
Domani et al., IBM Haifa Research Laboratory, “Thread-Local Heaps for Java,” ACM Sigplan Notices, 2003, V 38, N2, S (Feb.), pp. 183-194.
Berger et al., “Hoard: A Scalable Memory Allocator for Multithreaded Applications,” ACM Sigplan Notices, 2000, V 35, N11 (Nov.), pp. 117-128.
R. Dimpsey et al., “Java server performance: A case study of building efficient, scalable Jvms,” IBM Corp, Network Comp Software Div., IBM Systems Journal, 2000, V 39, N1, pp. 151-174.

Affiliated with

Also associated with

Rating

Heap allocation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Heap allocation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heap allocation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3822134