Heap and stack layout for multithreaded processes in a...

Details Heap and stack layout for multithreaded processes in a... Heap and stack layout for multithreaded processes in a...

2003-10-15

2008-11-04

An, Meng-Ai (Department: 2195)

Electrical computers and digital processing systems: memory

Addressing combined with specific memory configuration or...

C718S100000, C718S104000

Reexamination Certificate

active

07447829

ABSTRACT:
A method and system in accordance with the present invention comprises a thread stack/thread heap combination, wherein the thread heap is for thread local memory usage and wherein the thread stack and thread heap grow in opposite directions. In the present invention the thread specific heap is allocated next to the thread's stack and grows in the opposite direction from that of the stack. This improvement allows the current space management of thread stacks, which spread out the memory placement of multiple stacks to avoid collision, to also be used for the heaps without additional overhead or complexity. It also allows the existing growth scheme of adding memory pages to the process for the stack to be used again because the growth is simply in the opposite direction. Thread specific heaps eliminate the need for expensive synchronization when allocating from a shared heap in a multiprocessor environment.

REFERENCES:
patent: 5566321 (1996-10-01), Pase et al.
patent: 6412053 (2002-06-01), Bonola
patent: 6427195 (2002-07-01), McGowen et al.
patent: 6433586 (2002-08-01), Ooishi
patent: 6499094 (2002-12-01), Fraser et al.
patent: 6505275 (2003-01-01), Weissman et al.
patent: 6507903 (2003-01-01), Beatty, III et al.
patent: 2001/0000821 (2001-05-01), Kolodner et al.
patent: 2001/0025295 (2001-09-01), Kawachiya et al.
patent: 2002/0095453 (2002-07-01), Steensgaard
patent: 2002/0104077 (2002-08-01), Charnell et al.
patent: 2002/0129306 (2002-09-01), Flanagan et al.
patent: 2002/0199069 (2002-12-01), Joseph
patent: 2003/0018826 (2003-01-01), Chaudhry et al.
patent: 2003/0221067 (2003-11-01), Jacobs et al.
Hammersley, S.D. et al., “Sharing a Single Stack Among Multiple Concurrent Threads,” IBM Technical Disclosure Bulletin, vol. 36, No. 10, Oct. 1993, pp. 235-237.
Carlson, W.C. et al., “Thread Stack Monitor for Multithreaded Applications,” IBM Technical Disclosure Bulletin, vol. 39, No. 3, Mar. 1996, pp. 283-284.
Henderson, Fergus, “Accurate Garbage Collection in an Uncooperative Environment,” Dept. of Computer Science & Software Engineering, The University of Melbourne, Victoria, Australia, 7 pages.
Kuechlin, Wolfgang W. et al., “On Multi-Threaded List-Processing and Garbage Collection,” IEEE, 1991, pp. 894-897.
“Staggering Call Stack Offsets for Multiple Duplicate Control Threads,” IBM Docket ROC920020014US1, 9 pages.
Conference on Programming Language Design and Implementation Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1997, Las Vegas, Nevada, 5 pages.
Fine-grain multithreading with minimal compiler support-a cost effective approach to implementing efficient multithreading languages; Tarua K; Yonezawa A; SIGPLAN Notices, vol. 32, No. 5, pp. 320-333, May 1997.
“Staggering Call Stack Offsets for Multiple Duplicate Control Threads,” IBM Docket ROC920020014US1, 9 pages, date unknown.

Affiliated with

Also associated with

Rating

Heap and stack layout for multithreaded processes in a... 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 and stack layout for multithreaded processes in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heap and stack layout for multithreaded processes in a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4030439