US 7,035,989 B1Grant
Adaptive memory allocation
Issue Date:2006-04-25
•18 Claims
•6 Drawing Sheets
Abstract
This functions maintains two trees: a fast access tree referring to memory blocks of a size most often requested, and a general access tree referring to memory blocks of a size less often requested. After satisfying a request for a memory block, the function adjusts the trees to ensure that the fast access tree refers to memory blocks of the size most often requested. By providing such functionality, the function improves its performance over time through self-adaptation.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Paul Hinker
- Bradley Lewis
- Michael Boucher
Application Information
Application Number:US 09/504,876
Filing Date:2000-02-16
Priority Date:2000-02-16
Art Unit:2185
Classifications
IPC:
G06F12/02
Patent Drawings (6 sheets)
Description
Field of the Invention
[0001] This invention relates generally to data processing systems, and more particularly, to methods for optimizing the allocation and deallocation of shared memory to programs executing in a data processing system.
Background of the Invention
[0002] During execution, programs typically make many dynamic memory access requests. Such requests involve requesting allocation of memory from a system call (e.g., malloc), utilizing the memory, and deallocating the memory using a system call (e.g., free). Dynamic memory allocation is a fundamental and very important part of many computer programs. It is therefore desirable to improve the performance of memory access functions.
Summary of the Invention
[0003] In accordance with methods and systems consistent with the present invention, an improved memory access function (e.g., malloc) is provided that dynamically improves its performance by changing its operation at runtime. The memory access function adapts its operation based on previous memory access requests to be able to provide the fastest response to those kinds of memory access requests that it predicts will be the most common. For purposes of this description “access to system memory” includes both requests for allocation of system memory and release of system memory, or deallocation. Similarly, a “memory request” refers to either an allocation (a request for system memory), or a deallocation (a return of previously requested memory).
[0004] In accordance with methods and systems consistent with the present invention, as embodied and broadly described herein, a method is provided in a data processing system for allocating memory. The method receives a memory request for a reference to a block of memory. Then it returns the reference to the block of memory to satisfy the request. Next, it adjusts an operation of the memory access function based on the memory request.
[0005] Furthermore, in accordance with methods and system consistent with the present invention, as embodied and broadly described herein, a system for providing access to memory includes a memory which further includes a program including a memory access function that provides access to memory and adjusts its operation according to a memory request for a reference to a block of memory, and a processor for executing the program.
Brief Description of the Drawings
[0006] FIG. 1 depicts a block diagram of a data processing system suitable for practicing methods and systems consistent with the present invention;
[0007] FIG. 2 depicts in greater details the general access tree and the fast access tree depicted in FIG. 1 ;
[0008] FIGS. 3A & 3B depict a flow diagram illustrating operations performed to allocate memory in accordance with the principles of the present invention; and
[0009] FIG. 4 depicts a flow diagram illustrating operations performed to deallocate memory in accordance with the principles of the present invention.
Detailed Description
[0010] Methods and systems consistent with the present invention provide a function called “smart-alloc” that adapts in real-time the memory allocation process to threads executing in a data processing system. More specifically, smart-alloc observes past memory allocation behavior and adjusts the process of providing memory access such that the most frequently requested memory blocks of a specific size are allocated faster than less frequently requested memory block sizes. Smart-alloc is a language-independent library function which may be linked to one or more programs operating in a multi-processing environment.
Overview
[0011] When a program begins execution, smart-alloc secures access to an amount of memory that may be accessed as needed by threads executing within the program. Upon receiving a pointer from a system memory call to an amount of memory requested, smart-alloc divides the memory into blocks of varying sizes, grouping blocks of like size together in a linked-list, referred to as a free memory linked-list. Smart-alloc creates two trees that point to the free memory linked-lists: a fast access tree and a general access tree. As a program executes, the fast access tree points to the most frequently accessed memory block sizes, and the general access tree points to block sizes not pointed to by the fast access tree. Each free memory linked-list will be pointed to by either the general access tree, or the fast access tree, but not both.
[0012] Upon receiving a request from an executing thread for access to memory, smart-alloc increments a counter associated with the block size that will be used to satisfy the memory request. To satisfy the memory request, smart-alloc first determines whether the fast access tree points to memory blocks of the size needed to satisfy the request. If the fast access tree includes memory blocks of the size needed to satisfy the request, smart-alloc satisfies the request from the fast access tree. Otherwise, smart-alloc satisfies the request from the general access tree. If a request is satisfied from the general access tree, smart-alloc compares the value of the counter associated with the allocated block size to the counter values for block sizes included in the fast access tree to determine whether the general access tree refers to block sizes most frequently requested. If the counter value for the allocated block size (from the general access tree) is greater than any of the counter values of block sizes included in the fast access tree, smart-alloc replaces that general access tree pointer to the block size having the highest counter value with a pointer from the fast access tree, and replaces the pointer to the block size included in the fast access tree having the lowest counter value with a pointer from the general access tree. This process ensures that the fast access tree continues to point to the most frequently requested block sizes.
[0013] Smart-alloc also receives requests from executing threads desiring to release references to blocks of memory. After receiving a released reference, smart-alloc adds the reference to the free memory linked-list that includes memory blocks corresponding to the size of the returned reference.
Implementation Details
[0014] FIG. 1 depicts a block diagram of a data processing system 100 suitable for practicing methods and implementing systems consistent with the present invention. Data processing system 100 includes computer 102 connected to network 105. Computer 102 includes secondary storage 110, processors 120a . . . n, output device 130, input device 140, and memory 150. Memory 150 includes programs 155, 160, and 165, operating system 170, and shared memory 180. Operating system 170 includes a system shared memory access function, malloc 182. Each of programs 155, 160, and 165 includes smart-alloc 185, a shared memory access function operating in accordance with the principles of the present invention. Each instance of smart-alloc 185 includes two data structures, a fast access tree 186 and a general access tree 187 that are used by smart-alloc 185 when allocating and deallocating memory.
[0015] Programs 155, 160, and 165 share access to shared memory 180. Programs 155, 160, and 165 may include a single thread or multiple threads. Although multiple processors are shown, one skilled in the art will appreciate that programs 155, 160, and 165 may execute on a single processor to implement methods and practice systems consistent with the present invention.
[0016] Operating system 170 represents the Solaris® operating system from Sun Microsystems, Inc., which specifically facilitates multi-threaded program execution, although any operating system may be used to implement methods and systems consistent with the present invention.
[0017] Although aspects of this implementation are depicted as being stored in memory 150, one skilled in the art will appreciate that all or part of systems and methods consistent with the present invention may be stored on or read from other computer readable media, such as secondary storage devices, like hard disks, floppy disks, and CD-ROM; a digital signal received from a network such as the Internet; or other forms of RAM or ROM, either currently known or later developed. Sun, Sun Microsystems, and the Sun logo are trademark or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.
[0018] FIG. 2 depicts general access tree 202 and fast access tree 204 pointing to free memory linked-lists 262–272. In this example, general access tree 202 includes two main branches: branch 206 including pointers to free memory linked-lists containing references to memory blocks of a size less than or equal to 4K and branch 208 including pointers to free memory linked-lists containing references to memory blocks of a size greater than 4K. Branches 210, 215, and 225 serve as head pointers to free memory linked-lists 262, 266, and 272, which include memory blocks of size 1K, 4K, and 64K, respectively. Fast access tree 204 also includes two main branches, 230 and 240. Fast access tree 204 further includes head pointers 250, 255, and 260 to free memory linked-lists 264, 268, and 270, including memory blocks of size 2K, 8K, and 16K, respectively, indicating that these memory block sizes were most frequently accessed by the threads executing in the associated program. General access tree 202 may include additional branches that include head pointers to additional free memory linked-lists. Fast access tree 204, however, only includes head pointers to a specific number of free memory linked-lists, typically no more than eight. A “head pointer” is a pointer to the beginning of a free memory linked-list. Thus, because the fast access tree does not typically grow as large as the general access tree, accesses to the fast access tree are faster than accesses to the general access tree.
[0019] FIGS. 3A & 3B depict a flow diagram of a smart-alloc function operating in accordance with the principles of the present invention. First, smart-alloc requests access to an amount of memory from a system memory call included as part of an operating system (step 305). If the amount of memory is available (step 310), the system memory call returns to smart-alloc a pointer to the amount of memory requested (step 315). Upon receiving a pointer to a requested amount of memory, smart-alloc divides the memory into blocks of varying sizes and builds a free memory linked-list for each block size (step 318). The block sizes in the free memory linked-lists begin at 1K and increase in an amount equal to double the size of a previous block. For example, 1K, 2K, 4K, 8K, 16K, etc. Once the free memory linked-lists are created, smart-alloc creates the general access tree which includes head pointers to each of the free memory linked-lists (step 320). Initially, the fast access tree is empty. As a program executes and a series of memory requests are processed, the fast access tree is populated as discussed below.
[0020] Upon receiving a memory request from an executing thread (step 325), smart-alloc increments the value of a counter associated with the block size used to satisfy the request (step 330). Thus, if a thread requests 1026 bytes of memory and the free memory linked-lists include 1K and 2K blocks, a reference to the 2K block will be returned to the requesting thread, and the value of the counter associated with the 2K free memory linked-list will be incremented. If this memory request is satisfied from the fast access tree (step 335), processing ends.
[0021] Otherwise, if the memory request is satisfied from the general access tree (step 340), then the counter associated with the block size used to satisfy the request is compared with the counter for block sizes pointed to by the fast access tree (step 370). Smart-alloc then determines whether the block size should be added to the free memory linked-list pointed to by the fast access tree step 375 because it includes memory blocks of a size most often requested by the executing program. In this step, smart-alloc compares the value of the counter associated with a block size included in the general access tree with the value of the counter of a block size included in the fast access tree. If the counter value for the block in the general access tree is greater than the counter value for the block in the fast access tree, the pointer from the general access will be replaced with a pointer from the fast access tree. Additionally, the fast access tree pointer that points to the block size having the lowest counter value is replaced with the pointer from the general access tree (step 380). Changing the pointers in this manner ensures that the fast access tree continually points to the most frequently allocated block sizes, thereby increasing the efficiency of memory allocation. Otherwise, if the counter value associated with the block in the general access tree is not greater than the counter value of any of the free memory linked-lists pointed to by the fast access tree, processing ends.
[0022] If a memory request cannot be satisfied from either the general or fast access trees, smart-alloc requests additional memory from a system memory call (step 345). If the additional memory is available (step 350), a pointer to the amount of memory is returned to smart-alloc (step 355), the memory is divided into blocks that are added to the free memory linked-lists pointed to by a pointer from the general access tree (step 360), and processing continues to step 335. Otherwise, if the requested amount of memory is not available, the system memory call returns a null pointer to smart-alloc (step 365), and processing ends.
[0023] FIG. 4 depicts a flow diagram of operations performed by smart-alloc when a thread releases a reference to a block of memory. Upon receiving a reference to a block of memory from an executing thread (step 410), smart-alloc adds the reference to the appropriate free memory linked-list (step 430) and processing ends.
Conclusion
[0024] Methods and systems operating in accordance with the principles of the present invention optimize the process of allocating memory to threads executing in programs operating in a data processing system by adapting the allocation process according to the behavior of an executing program. This smart-alloc function is a library function that may be linked to any program executing in a data processing system. As discussed above, smart-alloc operates in the user space and does not require accessing the operating system each time memory is allocated or deallocated. These distributive and adaptive features of smart-alloc allow it to minimize the number of accesses to the operating system, a costly and time consuming event, and ultimately yields increased system performance.
[0025] Methods and systems consistent with the present invention are applicable to all single and multi-threaded programs written in all computer programming languages, including Fortran 77, Fortran 90, Java, C, and C++. Although maximum increases in efficiency will be realized in a multi-processor computing environment, methods and systems consistent with the present invention may also provide operational benefits in a single or multi-threaded, single processor environment.
[0026] Although the foregoing description has been described with reference to a specific implementation, those skilled in the art will know of various changes in form and detail which may be made without departing from the spirit and scope of the present invention as defined in the appended claims and the full scope of their equivalents.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method in a data processing system for allocating memory by a memory allocation function, comprising:
receiving a memory request for a reference to a block of memory;
returning the reference to the block of memory to satisfy the request;
forming a plurality of linked-lists referring to memory blocks of a plurality of sizes, each of the plurality of linked-lists referring to memory blocks of a common size;
setting a fast access tree to refer to a first one of the plurality of linked-lists; and
setting a general access tree to refer to a second one and a third one of the plurality of linked-lists, wherein a size of a memory block referred to by the first linked-list is larger than a size of a memory block referred to by the second linked-list and smaller than a size of a memory block referred to by the third linked-list.
2. The method of claim 1, further comprising adjusting a structure of the fast access tree and the general access tree based on the memory request.
3. The method of claim 2, further comprising searching the fast access tree to satisfy the memory request and, if the memory request is not satisfied, searching the general access tree to satisfy the memory request.
4. The method of claim 1, further including ensuring that the fast access tree refers to one of the plurality of linked-lists that is most frequently requested.
5. The method of claim 1, wherein receiving, returning, forming, and setting are performed in a user space of the memory.
6. A system for allocating memory, comprising:
means for receiving a memory request for a reference to a block of memory;
means for returning the reference to the block of memory to satisfy the request; and
means for forming a plurality of linked-lists referring to memory blocks of a plurality of sizes, each of the plurality of linked-lists referring to memory blocks of a common size;
means for setting a fast access tree to refer to a first one of the plurality of linked-lists;
means for setting a general access tree to refer to a second one and a third one of the plurality of linked-lists, wherein a size of a memory block referred to by the first linked-list is larger than a size of a memory block referred to by the second linked-list and smaller than a size of a memory block referred to by the third linked-list.
7. A data processing system for providing access to memory, comprising:
a memory including:
an access tree structure comprising a fast access tree and a general access tree;
a program including a memory access function that provides access to the memory, forms a plurality of linked-lists referring to memory blocks of a plurality of sizes, each of the plurality of linked-lists referring to memory blocks of a common size, sets the fast access tree to refer to a first one of the plurality of linked-lists, and sets the general access tree to refer to a second one and a third one of the plurality of linked-lists, wherein a size of a memory block referred to by the first linked-list is larger than a size of a memory block referred to by the second linked-list and smaller than a size of a memory block referred to by the third linked-list; and
a processor for executing the program.
8. The data processing system of claim 7, further including an operating system with a system memory function, and wherein the memory access function provides access to the memory by utilizing the system memory function.
9. The data processing system of claim 7, wherein the memory access function adjusts a structure of the fast access tree and the general access tree based on a memory request.
10. The data processing system of claim 7, wherein the fast access tree refers to one of the plurality of linked-lists that is most frequently accessed.
11. The data processing system of claim 7, wherein a most frequently accessed memory block size is included in the fast access tree.
12. The data processing system of claim 7, wherein a least frequently accessed memory block size is included in the general access tree.
13. The data processing system of claim 7, wherein the memory access function searches the fast access tree to satisfy a memory request and, if the memory request is not satisfied, searches the general access tree to satisfy the memory request.
14. The data processing system of claim 13, wherein each of the plurality of linked-lists has an associated counter indicating a number of times that the associated linked-list has been accessed.
15. A computer-readable medium including instructions for performing a method for allocating memory by a memory allocation function, the method comprising:
receiving a memory request for a reference to a block of memory;
returning the reference to the block of memory to satisfy the request;
forming a plurality of linked-lists referring to memory blocks of a plurality of sizes, each of the plurality of linked-lists referring to memory blocks of a common size;
setting a fast access tree to refer to a first one of the plurality of linked-lists;
setting a general access tree to refer to a second one and a third one of the plurality of linked-lists, wherein a size of a memory block referred to by the first linked-list is larger than a size of a memory block referred to by the second linked-list and smaller than a size of a memory block referred to by the third linked-list.
16. The computer-readable medium, including instructions for performing the method, of claim 15, the method further comprising adjusting a structure of the fast access tree and the general access tree based on the memory request.
17. The computer-readable medium, including instructions for performing the method, of claim 15, the method further comprising searching the fast access tree to satisfy the memory request and, if the memory request is not satisfied, searching the general access tree to satisfy the memory request.
18. The computer-readable medium, including instructions for performing the method, of claim 15, the method further comprising ensuring that the fast access tree refers to one of the plurality of linked-lists that is most frequently requested.
Patent Citations (161)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4675832(A) | 1987-06-01 | Robinson et al. | Applicant |
| US4685082(A) | 1987-08-01 | Cheung et al. | Applicant |
| US4812996(A) | 1989-03-01 | Stubbs | Applicant |
| US5073851(A) | 1991-12-01 | Masterson et al. | Applicant |
| US5075847(A) | 1991-12-01 | Fromme | Applicant |
| US5079707(A) | 1992-01-01 | Bird et al. | Applicant |
| US5119465(A) | 1992-06-01 | Jack et al. | Applicant |
| US5146593(A) | 1992-09-01 | Brandle et al. | Applicant |
| US5168563(A) | 1992-12-01 | Shenoy et al. | Applicant |
| US5179702(A) | 1993-01-01 | Spix et al. | Applicant |
| US5274813(A) | 1993-12-01 | Itoh | Applicant |
| US5274821(A) | 1993-12-01 | Rouquie | Applicant |
| US5297274(A) | 1994-03-01 | Jackson | Applicant |
| US5301312(A) | 1994-04-01 | Christopher, Jr. et al. | Applicant |
| US5325499(A) | 1994-06-01 | Kummer et al. | Applicant |
| US5325533(A) | 1994-06-01 | McInerney et al. | Applicant |
| US5353401(A) | 1994-10-01 | Iizawa et al. | Applicant |
| US5390314(A) | 1995-02-01 | Swanson | Applicant |
| US5438659(A) | 1995-08-01 | Notess et al. | Applicant |
| US5450542(A) | 1995-09-01 | Lehman et al. | Applicant |
| US5485619(A) | 1996-01-01 | Lai et al. | Applicant |
| US5497458(A) | 1996-03-01 | Finch et al. | Applicant |
| US5499349(A) | 1996-03-01 | Nikhil et al. | Applicant |
| US5500881(A) | 1996-03-01 | Levin et al. | Applicant |
| US5519866(A) | 1996-05-01 | Lawrence et al. | Applicant |
| US5530816(A) | 1996-06-01 | Holt | Applicant |
| US5535364(A) | 1996-07-01 | Resman et al. | Applicant |
| US5535393(A) | 1996-07-01 | Reeve et al. | Applicant |
| US5539907(A) | 1996-07-01 | Srivastava et al. | Applicant |
| US5553235(A) | 1996-09-01 | Chen et al. | Applicant |
| US5574922(A) | 1996-11-01 | James | Applicant |
| US5613063(A) | 1997-03-01 | Eustace et al. | Applicant |
| US5636374(A) | 1997-06-01 | Rodgers et al. | Applicant |
| US5640550(A) | 1997-06-01 | Coker | Applicant |
| US5673387(A) | 1997-09-01 | Chen et al. | Applicant |
| US5675790(A) | 1997-10-01 | Walls | Applicant |
| US5675802(A) | 1997-10-01 | Allen et al. | Applicant |
| US5689712(A) | 1997-11-01 | Heisch | Applicant |
| US5696937(A) | 1997-12-01 | White et al. | Applicant |
| US5710727(A) | 1998-01-01 | Mitchell et al. | Applicant |
| US5724262(A) | 1998-03-01 | Ghahramani | Applicant |
| US5734822(A) | 1998-03-01 | Houha et al. | Applicant |
| US5737605(A) | 1998-04-01 | Cunningham et al. | Applicant |
| US5740431(A) | 1998-04-01 | Rail | Applicant |
| US5740433(A) | 1998-04-01 | Carr et al. | Applicant |
| US5742793(A) | 1998-04-01 | Sturges et al. | Applicant |
| US5745897(A) | 1998-04-01 | Perkins et al. | Applicant |
| US5748892(A) | 1998-05-01 | Richardson | Applicant |
| US5748961(A) | 1998-05-01 | Hanna et al. | Applicant |
| US5754820(A) | 1998-05-01 | Yamagami | Applicant |
| US5761426(A) | 1998-06-01 | Ishizaki et al. | Applicant |
| US5774724(A) | 1998-06-01 | Heisch | Applicant |
| US5784698(A) | 1998-07-01 | Brady et al. | Applicant |
| US5787480(A) | 1998-07-01 | Scales et al. | Applicant |
| US5805795(A) | 1998-09-01 | Whitten | Applicant |
| US5812799(A) | 1998-09-01 | Zuravleff et al. | Applicant |
| US5835705(A) | 1998-11-01 | Larsen et al. | Applicant |
| US5850554(A) | 1998-12-01 | Carver | Applicant |
| US5860024(A) | 1999-01-01 | Kyle et al. | Applicant |
| US5864867(A) | 1999-01-01 | Krusche et al. | Applicant |
| US5867649(A) | 1999-02-01 | Larson | Applicant |
| US5867735(A) | 1999-02-01 | Zuravleff et al. | Applicant |
| US5872977(A) | 1999-02-01 | Thompson | Applicant |
| US5890171(A) | 1999-03-01 | Blumer et al. | Applicant |
| US5905488(A) | 1999-05-01 | Demers et al. | Applicant |
| US5905856(A) | 1999-05-01 | Ottensooser | Applicant |
| US5913223(A) | 1999-06-01 | Sheppard et al. | Applicant |
| US5920895(A) | 1999-07-01 | Perazzoli, Jr. et al. | Applicant |
| US5963975(A) | 1999-10-01 | Boyle et al. | Applicant |
| US5968114(A) | 1999-10-01 | Wentka et al. | Applicant |
| US5970510(A) | 1999-10-01 | Sher et al. | Applicant |
| US5974510(A) | 1999-10-01 | Cheng et al. | Applicant |
| US5974536(A) | 1999-10-01 | Richardson | Applicant |
| US5978892(A) | 1999-11-01 | Noel et al. | Applicant |
| US5987479(A) | 1999-11-01 | Oliver | Applicant |
| US5991708(A) | 1999-11-01 | Levine et al. | Applicant |
| US5991893(A) | 1999-11-01 | Snider | Applicant |
| US6006031(A) | 1999-12-01 | Andrews et al. | Applicant |
| US6009514(A) | 1999-12-01 | Henzinger et al. | Applicant |
| US6014517(A) | 2000-01-01 | Shagam et al. | Applicant |
| US6016474(A) | 2000-01-01 | Kim et al. | Applicant |
| US6018793(A) | 2000-01-01 | Rao | Applicant |
| US6023583(A) | 2000-02-01 | Honda | Applicant |
| US6044438(A) | 2000-03-01 | Olnowich | Applicant |
| US6049798(A) | 2000-04-01 | Bishop et al. | Applicant |
| US6049855(A) | 2000-04-01 | Jeddeloh | Applicant |
| US6052708(A) | 2000-04-01 | Flynn et al. | Applicant |
| US6052763(A) | 2000-04-01 | Maruyama | Applicant |
| US6055368(A) | 2000-04-01 | Kunioka | Applicant |
| US6065019(A) | 2000-05-01 | Ault et al. | Applicant |
| US6066181(A) | 2000-05-01 | DeMaster | Applicant |
| US6072951(A) | 2000-06-01 | Donovan et al. | Applicant |
| US6077312(A) | 2000-06-01 | Bates et al. | Applicant |
| US6081868(A) | 2000-06-01 | Brooks | Applicant |
| US6085029(A) | 2000-07-01 | Kolawa et al. | Applicant |
| US6088771(A) | 2000-07-01 | Steely, Jr. et al. | Applicant |
| US6098169(A) | 2000-08-01 | Ranganathan | Applicant |
| US6101325(A) | 2000-08-01 | Flaat | Applicant |
| US6101525(A) | 2000-08-01 | Hecker | Applicant |
| US6108343(A) | 2000-08-01 | Cruickshank et al. | Applicant |
| US6119198(A) | 2000-09-01 | Fromm | Applicant |
| US6125430(A) | 2000-09-01 | Noel et al. | Applicant |
| US6141692(A) | 2000-10-01 | Loewenstein et al. | Applicant |
| US6145054(A) | 2000-11-01 | Mehrotra et al. | Applicant |
| US6167565(A) | 2000-12-01 | Kanamori | Applicant |
| US6173327(B1) | 2001-01-01 | De Borst et al. | Applicant |
| US6173368(B1) | 2001-01-01 | Kreuger et al. | Applicant |
| US6205537(B1) | 2001-03-01 | Albonesi | Applicant |
| US6223134(B1) | 2001-04-01 | Rust et al. | Applicant |
| US6253252(B1) | 2001-06-01 | Schofield | Applicant |
| US6263485(B1) | 2001-07-01 | Schofield | Applicant |
| US6269457(B1) | 2001-07-01 | Lane | Applicant |
| US6282702(B1) | 2001-08-01 | Ungar | Applicant |
| US6286130(B1) | 2001-09-01 | Poulsen et al. | Applicant |
| US6295600(B1) | 2001-09-01 | Parady | Applicant |
| US6304951(B1) | 2001-10-01 | Mealey et al. | Applicant |
| US6311320(B1) | 2001-10-01 | Jibbe | Applicant |
| US6314429(B1) | 2001-11-01 | Simser | Applicant |
| US6317871(B1) | 2001-11-01 | Andrews et al. | Applicant |
| US6341338(B1) | 2002-01-01 | Dennie | Applicant |
| US6351845(B1) | 2002-02-01 | Hinker et al. | Applicant |
| US6353829(B1) | 2002-03-01 | Koblenz et al. | Applicant |
| US6353869(B1) | 2002-03-01 | Ofer et al. | Applicant |
| US6366994(B1) | 2002-04-01 | Kalyur | Applicant |
| US6369725(B1) | 2002-04-01 | Busaba | Applicant |
| US6430657(B1) | 2002-08-01 | Mittal et al. | Applicant |
| US6434714(B1) | 2002-08-01 | Lewis et al. | Applicant |
| US6438745(B1) | 2002-08-01 | Kanamaru et al. | Applicant |
| US6442162(B1) | 2002-08-01 | O'Neill et al. | Applicant |
| US6473833(B1) | 2002-10-01 | Arimilli et al. | Applicant |
| US6480818(B1) | 2002-11-01 | Alverson et al. | Applicant |
| US6496902(B1) | 2002-12-01 | Faanes et al. | Applicant |
| US6502136(B1) | 2002-12-01 | Higuchi et al. | Applicant |
| US6523090(B1) | 2003-02-01 | Tremblay | Applicant |
| US6542919(B1) | 2003-04-01 | Wendorf et al. | Applicant |
| US6574725(B1) | 2003-06-01 | Kranich et al. | Applicant |
| US6629214(B1) | 2003-09-01 | Arimilli et al. | Applicant |
| US6647546(B1) | 2003-11-01 | Hinker et al. | Applicant |
| US6684296(B1) | 2004-01-01 | Hayter et al. | Applicant |
| US2001/0003831(A1) | 2001-06-01 | Boland | Applicant |
| US2001/0051974(A1) | 2001-12-01 | Saad | Applicant |
| US2002/0046201(A1) | 2002-04-01 | Hembry | Applicant |
| US2002/0073360(A1) | 2002-06-01 | Lewis et al. | Applicant |
| US2002/0078010(A1) | 2002-06-01 | Ehrman et al. | Applicant |
| US2003/0061395(A1) | 2003-03-01 | Kingsbury et al. | Applicant |
| DE19934515(A1) | 2000-01-01 | Applicant | |
| EP390339(A2) | 1990-10-01 | Applicant | |
| EP703534(A1) | 1996-03-01 | Applicant | |
| EP817044(A2) | 1998-01-01 | Applicant | |
| EP965921(A2) | 1999-12-01 | Applicant | |
| EP1024432(A) | 2000-08-01 | Applicant | |
| EP1026592(A2) | 2000-08-01 | Applicant | |
| EP1081585(A1) | 2001-03-01 | Applicant | |
| FR2793908(A1) | 2000-11-01 | Applicant | |
| GB2324942(A) | 1998-11-01 | Applicant | |
| GB2343029 | 2000-04-01 | Applicant | |
| GB2357873 | 2001-07-01 | Applicant | |
| JP3-282731(A) | 1991-12-01 | Applicant | |
| JP7-056716(A) | 1995-03-01 | Applicant | |
| JP7-156716(A1) | 1995-03-01 | Applicant | |
| WO99/10812(A1) | 1999-03-01 | Applicant |
Non-Patent Literature (42)
- IBM Technical Disclosure Bulletin, “Caching Objects in a data Space,” Oct. 1, 1994, vol. 37, 587-590.Examiner
- Article “Caching Objects In A Data Space,” IBM Technical Disclosure Bulletin, IBM Corp., vol. 37, No. 10, Oct., 1994, pp. 587-590.Applicant
- “Algorithm Visualization System: Introduction,” available online at: www.cp/eng.chula.ac.th/faculty/spj/research/avis/intro.html as of Jun. 10, 1999, 2 pages.Applicant
- “GeoMAMOS Project Home Page,” available online at: www.ece.nwu.edu/˜theory/geomamos.html as of Jun. 10, 1999, 4 pages.Applicant
- “Introduction,” available online at: www.ece.edu/˜theory/gs—tech—1—html/section 3—1.html as of Jun. 10, 1999, 3 pages.Applicant
- “Pentium Processor Family User Manual vol. 3: Architecture and Programming Manual,” pp. 25-182, 25-183, 25-309, and 25-310, Intel Corp., (1994).Applicant
- “Purify for Windows NT, Product Overview,” Ver. 6.0, available online at: www.rational.com/products/purify—nt/prodinfo/index.jtmpl as of Jan. 11, 1999, 3 pages.Applicant
- “Scientific Simulations and Algorithm Visualizations Using NESL and Java,” available online at: www.cs.cmu.edu/˜scandal/applets/ as of Jun. 10, 1999, 1 page.Applicant
- “Visualization for Developing Geometric Algorithms,” available online at: www.ece.nwu.edu/˜theory/gs—tech—1—html/section3—3.html as of Jun. 10, 1999, 2 pages.Applicant
- Attali et al., “Semantic-Based Visualization for Parallel Object-Oriented Programming,” Proceedings of the 11th Annual Conference on Object Oriented Programing Systems, 1996, pp. 421-440.Applicant
- Barry Wilkinson et al., “Parallel Programming,” Prentice Hall, 1999.Applicant
- Conradi et al., “Version Models for Software Configuration Management,” ACM Computing Surveys, vol. 30, No. 2, Jun. 1998, pp. 232-282.Applicant
- David E. Culler et al., “Parallel Computer Architecture”, Morgan Kaufman Publishers, Inc., San Francisco, California, 1999.Applicant
- Ian Foster, “Designing and Building Parallel Programs”, Addison-Wesley Publishing Company, 1995.Applicant
- Kevin Dowd and Charles R. Severance, “High Performance Computing,” Second Edition, Chapter 10, Shared Memory Multiprocessors, Aug. 1998, pp. 216-218.Applicant
- Sun Microsystems Computer Company, “Prism 5.0 Reference Manual,” Revision A., Nov. 1997.Applicant
- Sun Microsystems, “UltraSPARC User's Manual,” UltraSPARC-1, UltraSPARC-II, Jul. 1997, pp. 319-325.Applicant
- Wasserman et al., “A Graphical, Extensible Integrated Environment for Software Development,” Proceedings of the ACD SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, 1986, pp. 131-142.Applicant
- Broberg et al., “Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads”, Department of Software Engineering and Computer Science, University of Karlskrona/Ronneby, Sweden, 7 pages.Applicant
- Haggander et al., “Optimizing Dynamic Memory Manager in a Multithreaded Application Executing on a Multiprocessor,” International Conference on Parallel Processing, Minneopolis, MN, Aug. 10-14, 1998, pp. 262-269.Applicant
- Larson et al., “Memory Allocation for Long-Running Server Applications,” ISMM 1998, International Symposium on Memory Management, Vancouver, BC, Canada, Oct. 17-19, 1998, vol. 34, No. 3, pp. 176-185.Applicant
- Nathan P. Kropp, Philip J. Koopman, Daniel P. Siewiorek, “Automated Robustness Testing of Off-the-Shelf Software Components,” Institute for Complex Engineered Systems, Carnegie Mellon University, Pittsburgh, PA, pp. 230-239, IEEE (1998).Applicant
- Valvano, “Debugging Strategies,” Chapter 6, pp. 6.1-6.10, Real Time Debugging, Online Manual, Jun. 7, 1999, Retrieved from the Internet: <URL:http://www.ece.utexas.edu/{valvano/EE360P/PDF/Ch6.pdf>.Applicant
- “dcpid—DIGITAL Continuous Profiling Infrastructure daemon”, Man pages for SCR-Installed Programs (Alpha/NT), Online <URL:http://research.compaq.com/SRC/dcpi/html/ntalpha/dcpi.html>, 1997, pp. 1-6.Applicant
- Browne et al., “PAPI: Portable Interface to Hardware Performance Counters,” Cewes Major Shared Resources Center Pet Technical Reports, vol. 99-06, 1999, Online, <URL:http://www.wes.hpc.mil/pet/tech—reports/reports/pdf/tr—9906.pdf>, pp. 3-13.Applicant
- IBM Technical Disclosure Bulletin, “Internal Performance Measurement Counters,” IBM Corp., vol. 34, No. 4A, Sep. 1991, pp. 51-52 (the whole document).Applicant
- IBM Technical Disclosure Bulletin, “Simultaneous Viewing of Performance Monitor Data Independent of Counters,” IBM Corp., vol. 39, No. 10, Oct. 1996, pp. 181-183.Applicant
- Zagha et al., “Performance Analysis Using the MIPS R10000 Performance Counters”, SC96 Technical Papers, Online, <URL:http://www.supercomp.org/sc96/proceedings/SC96PROC/ZAGHA/INDEX.HTM>, Nov. 1996, pp. 1-22.Applicant
- Metcalf, Michael, “CERN,” Geneva 1991, 1997 pp. 1-27, ftp://ftp>numerical.rl.ac.uk/pub/MandR/convert.f90.Applicant
- Handy, Jim, “The Cache Memory Book”, Second Edition, 1998, pp. 55, 66, 67, 155.Applicant
- IBM Technical Disclosure Bulletin, “Caching Objects in a Data Space,” Oct. 1, 1994, vol. No. 37, pp. 587-590.Applicant
- “Code Complete: A Practical Handbook of Software Construction,” Steve McConnell, Chapter 19-Self-Documenting Code, http://library.books24X7.com/book/id 2835/viewer.asp?pr=1, 1993, Microsoft Press, pp. 1-16.Applicant
- Buckley, A., “Conversion to Fortran 90: A Case Study,” ACM Transactions on Mathematical Software, 1994, pp. 308-353.Applicant
- Purtilo, J. et al., “Module Reuse by Interface Adaption”, Software—Practice and Experience, 1991, pp. 539-556.Applicant
- “Visual Basic 5.0 Introduction,” Windows 95 Student Manual, 1997, pp. V-VI; 1-278.Applicant
- Cantrill, B.M. et al., “ThreadMon: A Tool for Monitoring Multithreaded Program Performance,” System Sciences, pp. 253-265.Applicant
- Grundy, J.C., et al., “Supporting Flexible Consistency Management Via Discrete Change Description Propagation,” Software Practice & Experience, John Wiley & Sons Ltd., vol. 26, Sep. 1996 No. 9, pp. 1053-1083.Applicant
- Karavanic K.L. et al., “Integrated Visualization of Parallel Program Performance Data,” vol. 23, 1997, pp. 181-198.Applicant
- Purtilo, J., et al., “Module Reuse by Interface Adaptation,” Software—Practice and Experience, Jun. 1991, pp. 539-556.Applicant
- Xu, Miller & Naim, “Dynamic Instrumentation of Threaded Application,” Internet Article, Online,URL:ftp://ftp.cs.wisc.edu/paradyn/technical—papers/threads.pdf Oct. 29, 1998, pp. 1-17.Applicant
- Cooper, Keith D., et al., “An Experiment with Inline Substitution,” Software- Practice and Experience, vol. 21, No. 6, Jun. 1991, pp. 581-601.Applicant
- Holland, Angela, et al., “A Compiler for Selective Procedure Inlining,” ACM 31st Annual Southeast Conference, 1993, pp. 207-212.Applicant