Multi-threaded garbage collector employing cascaded memory...

Details Multi-threaded garbage collector employing cascaded memory... Multi-threaded garbage collector employing cascaded memory...

2006-03-21

2006-03-21

Kim, Hong (Department: 2186)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C711S170000, C711S154000, C710S036000, C718S100000

Reexamination Certificate

active

07016923

ABSTRACT:
A computer system employing a plurality of concurrent threads to perform tasks that dynamically identify further similar tasks employs a double-ended queue (“deque”) to list the dynamically identified tasks. If a thread's deque runs out of tasks while other threads' deques have tasks remaining, the thread whose deque has become empty will remove one or more entries from another thread's deque and perform the tasks thereby identified. When a thread's deque becomes too full, it may allocate space for another deque, transfer entries from its existing deque, place an identifier of the existing deque into the new deque, and adopt the new deque as the one that it uses for storing and retrieving task identifiers. Alternatively, it may transfer some of the existing deque's entries into a newly allocated array and place an identifier of that array into the existing deque. The thread thereby deals with deque overflows without introducing additional synchronization requirements or restricting the deque's range of use.

REFERENCES:
patent: 4907151 (1990-03-01), Bartlett
patent: 5321841 (1994-06-01), East et al.
patent: 6438573 (2002-08-01), Nilsen
patent: 6526422 (2003-02-01), Flood et al.
patent: 6823351 (2004-11-01), Flood et al.
patent: 6826583 (2004-11-01), Flood et al.
patent: 6934741 (2005-08-01), Shavit et al.
patent: 2002/0120663 (2002-08-01), Binns
patent: 2003/0005025 (2003-01-01), Shavit et al.
patent: 2003/0005029 (2003-01-01), Shavit et al.
patent: 2003/0005114 (2003-01-01), Shavit et al.
patent: 2004/0064814 (2004-04-01), Bowers et al.
Jones and Lins, “Garbage Collection: Algorithms for Automatic Dynamic Memory Management,” 1996, pp. 165-179, Wiley, New York.
Paul Wilson, “Uniprocessor Garbage Collection Techniques,” Technical Report, University of Texas, 1994.
Hudson and Moss, “Incremental Collection of Mature Objects,” Proceedings of International Workshop on Memory Management, 1992, Springer-Verlag.
Grarup and Seligmann, “Incremental Mature Garbage Collection,” M.Sc. Thesis, Available at http://www.daimi.au.dk/˜jacobse/Papers/.
Seligmann and Grarup, “Incremental Mature Garbage Collection Using the Train Algorith,” Proceedings of ECOOP '95, Ninth European Conference on Object-Oriented Programming, 1995, http://www.daimi.au.dk/˜jacobse/Papers/.
Clark and Mason, “Compacting Garbage Collection can be Fast and Simple,” Software-Practice and Experience, Feb. 1996, pp. 177-194, vol. 26, No. 2.
Henry Baker, “List Processing in Real Time on a Serial Computer,” Communications of the ACM 21, Apr. 4, 1978, pp. 280-294.
Appel, Ellis, and Li, “Real-time Concurrent Collection on Stock Multiprocessors,” ACM SIGPLAN Notices, 1988.
Rodney A. Brooks, “Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardware,” Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, pp. 108-113, Aug. 1984. Austin, Texas.
Herlihy and Moss, “Lock-Free Garbage Collection for Multiprocessors,” ACM SPAA, 1991, pp. 229-236.
Bacon, Attanasio, Lee, Rajan, and Smith, “Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector,” SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, Utah, Jun. 2001.
James Stamos, “Static Grouping of Small Objects to Enhance Performance of a Paged Virtual Memory,” ACM Transactions on Computer Systems, vol. 2, No. 2, pp. 155-180, May 1984.
David A. Moon, “Garbage Collection in a Large Lisp System,” Conference Record of the 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas, Aug. 1984, pp. 235-246.
Robert Courts, “Improving Locality of Reference in a Garbage-Collecting Memory Management System,” Communications of the ACM, Sep. 1988, pp. 1128-1138, vol. 31, No. 9.
Wilson, Lam, and Moher, “Effective Static-Graph Reorganization to Improve Locality in Garbage Collected Systems,” Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun. 1991, Toronto, Ontario, Canada.
Lam, Wilson, and Moher, “Object Type Directed Garbage Collection to Improve Locality,” Proceedings of the International Workshop on Memory Management '92, St. Malo, France, Sep. 1992, pp. 404-425.
Chilimbi and Larus, “Using Generational Garbage Collection to Implement Cache-Conscious Data Placement,” International Symposium on Memory Management, Oct. 1998.
Lieberman and Hewitt, “A real-time garbage collector based on the lifetimes of objects,” Communications of the ACM, 1983, pp. 419-429, vol. 26, No. 6.
David Ungar, “Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm,” ACM SIGPLAN Notices, Apr. 1984, pp. 157-167, vol. 19, No. 5.
Andrew W. Appel, “Simple Generational Garbage Collection and Fast Allocation,” Software Practice and Experience, 1989, pp. 171-183, vol. 19, No. 2.
Hudson and Diwan, “Adaptive Garbage Collection for Modula-3 and Smalltalk,” in OOPSLA/ECOOP Workshop on Garbage Collection in Object-Oriented Systems, Oct. 1990, Edited by Eric Jul and Niels-Cristial Juul.
Hudson and Hosking, “Remembered sets can also play cards,” in OOPSLA/ECOOP Workshop on Garbage Collection in Object-Oriented Systems, Oct. 1993, Edited by Moss, Wilson, and Zorn.
Hosking and Moss, “Protection traps and alternatives for memory management of an object-oriented language,” ACM Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles, Dec. 1993, pp. 106-119, vol. 27, No. 5.
Hosking, Moss, and Stefanovic, “A Comparative Performance Evaluation of Write Barrier Implementation,” in OOPSLA ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, Oct. 1992, pp. 92-109, vol. 27, No. 10, ACM SIGPLAN Notices, Vancouver, BC, ACM Press.
Patrick G. Sobalvarro, “A Lifetime-based Garbage Collector for LISP Systems on General-Purpose Computers,” Massachusetts Institute of Technology, AITR-1417, 1988.
Arora, Blumofe, and Plaxton, “Thread Scheduling for Multiprogrammed Multiprocessors,” Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, Jun. 1998.
Douglas W. Clark, “An Efficient List-Moving Algorithm Using Constant Workspace,” Communications of the ACM, Jun. 1976, pp. 352-354, vol. 19, No. 6.
C. J. Cheney, “A Nonrecursive List Compacting Algorithm,” Communications of the ACM, Nov. 1970, pp. 677-678, vol. 13, No. 11.
Goldstein, Schauser, and Culler, “Lazy Threads: Implementing a Fast parallel Call,” Journal of Parallel and Distributed Computing, Aug. 1996, pp. 5-20, vol. 37, No. 1.
Wulf, Shaw, Hilfinger, and Flon, “Fundamental Structures of Computer Science,” Addison-Wesley, 1981, pp. 233-236, 275-281.
Blumofe and Papadopoulos, “Hood: A User-level Thread Library for Multiprogramming Multiprocessors,” The University of Texas at Austin, Aug. 1998.
Flood, Detlefs, Shavit, and Zhang, “Parallel Garbage Collection for Shared Memory Multiprocessors,” Usenix Java Virtual Machine Research and Technology Symposium (JVM 2001) Apr. 2001.

Affiliated with

Also associated with

Rating

Multi-threaded garbage collector employing cascaded memory... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-threaded garbage collector employing cascaded memory..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-threaded garbage collector employing cascaded memory... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3600026