Patent application number | Description | Published |
20080235307 | LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 09-25-2008 |
20080235308 | LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 09-25-2008 |
20080250089 | IMPROVING LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 10-09-2008 |
Patent application number | Description | Published |
20120180057 | Activity Recording System for a Concurrent Software Environment - An activity recording system for a concurrent software environment executing software threads in a computer system, the activity recording system comprising: a thread state indicator for recording an indication of a synchronization state of a software thread, the indication being associated with an identification of the software thread; a time profiler for polling values of a program counter for a processor of the computer system at regular intervals, the time profiler being adapted to identify and record one or more synchronization states of the software thread based on the polled program counter value and the recorded indication of state. | 07-12-2012 |
20120198111 | MANAGING A RESOURCE LOCK - Controlling access to a resource by a plurality of resource requesters is disclosed. The resource lock operates in a contention efficient (heavyweight) operating mode, and in response to a request from a resource requester to acquire the resource lock, a count of a total number of acquisitions of the resource lock in the contention efficient operating mode is incremented. In response to access to the resource not being contended by more than one resource requester, a count of a number of uncontended acquisitions of the resource lock in the contention efficient operating mode is incremented, and a contention rate is calculated as the number of uncontended acquisitions in the contention efficient operating mode divided by the total number of acquisitions in the contention efficient operating mode. In response to the contention rate meeting a threshold contention rate, the resource lock is changed to a non-contention efficient (lightweight) operating mode. | 08-02-2012 |
20130163408 | REALLOCATING SECONDARY DESTINATIONS ON A NETWORK SWITCH - A method, system and program product that in response to a segmented server going offline reallocates only those primary and secondary destinations that need to be reallocated on an evenhanded basis, so there is at most a difference of one in the number of buckets allocated to each segmented server before and after re-allocation. | 06-27-2013 |
Patent application number | Description | Published |
20080216079 | MANAGING A RESOURCE LOCK - A method of operating a resource lock for controlling access to a resource by a plurality of resource requesters, the resource lock operating in a contention efficient (heavyweight) operating mode, and the method being responsive to a request from a resource requester to acquire the resource lock, the method comprising the steps of: incrementing a count of a total number of acquisitions of the resource lock in the contention efficient operating mode; in response to a determination that access to the resource is not contended by more than one resource requester, performing the steps of: a) incrementing a count of a number of uncontended acquisitions of the resource lock in the contention efficient operating mode; b) calculating a contention rate as the number of uncontended acquisitions in the contention efficient operating mode divided by the total number of acquisitions in the contention efficient operating mode; and c) in response to a determination that the contention rate meets a threshold contention rate, causing the resource lock to change to a non-contention efficient (lightweight) operating mode. | 09-04-2008 |
20090150875 | EFFICIENT OBJECT PROFILING FOR OPTIMIZING OBJECT LOCALITY - A computer-implementable method, system and apparatus. The frequency of reference to an object, also known as “hotness,” can be collected as a part of a profiling phase during a runtime operation of data-processing system by permitting each reference to the object during the runtime operation to randomly guess a predetermined value associated with the object, such that a correct guess thereof implies that the object is referenced frequently. Thereafter, the frequency of reference to the object can be validated by identifying a particular value in a header associated with the object, in response to collecting the frequency of reference to the object during the profiling phase, thereby increasing the scalability and efficiency of the runtime operation while permitting data associated with the frequency of reference to the object to other applications for immediate use. | 06-11-2009 |
20090249353 | COMPUTER OPERATIONS CONTROL BASED ON PROBABLISTIC THRESHOLD DETERMINATIONS - Decisions whether or not to initiate certain types of computer operations, such as Just In Time (JIT) compiling or garbage collection can be made using a probabilistic threshold monitor. A decision whether to drive a threshold indicator bit to a set state is made on the detection of each of a certain kind of event occurring over a predetermined interval. The probability that the bit will be driven to a set state upon the detection of any given event is controlled. At the end of the predetermined interval, a computer operation is initiated if the threshold indicator bit is found to be in its set state. | 10-01-2009 |
20100169593 | Defer Separating Children in Parallel Copying Garbage Collection - Automatic memory management with a generational copy collector garbage collection algorithm running on parallel threads to perform simultaneous and independent copying and scanning. An object is scanned. It is determined whether an object referenced within the slot of the object being scanned may be copied to the same generation as the scanned object. A mark may be made to indicate that the referenced object may be copied to a different generation than the scanned object. The mark defers the copying of the referenced object. | 07-01-2010 |