US 7,558,910 B2Grant
Detecting access to a memory location in a multithreaded environment
Issue Date:2009-07-07
•48 Claims
•26 Drawing Sheets
Abstract
Various techniques for manipulating data using access states of memory, access control fields of pointers and operations, and exception raising and exception trapping in a multithreaded computer system. In particular, the techniques include synchronization support for a thread blocked in a word, demand evaluation of values, parallel access of multiple threads to a list, synchronized and unsynchronized access to a data buffer, use of forwarding to avoid checking for an end of a buffer, use of sentinel word to detect access past a data structure, concurrent access to a word of memory using different synchronization access modes, and use of trapping to detect access to restricted memory.
Metadata
Assignee
- Cray Inc.
Inventors
- Gail A. Alverson
- Charles David Callahan, II
- Simon H. Kahan
- Brian D. Koblenz
- Allan Porterfield
- Burton J. Smith
Application Information
Application Number:US 10/697,128
Filing Date:2003-10-30
Priority Date:1998-11-13
Art Unit:2195
Classifications
IPC:
G06F13/00G06F9/34G06F9/455G06F9/46G06F3/00
Patent Drawings (26 sheets)
Description
Cross-Reference to Related Application
[0001] This application is a continuation of U.S. patent application Ser. No. 09/361,671 filed Jul. 27, 1999, now U.S. Pat. No. 6,862,635 which is a continuation of U.S. patent application Ser. No. 09/192,207 filed Nov. 13, 1998, now abandoned which are hereby incorporated by reference.
Technical Field
[0002] This invention relates generally to synchronization techniques for computer systems.
Background of the Invention
[0003] Parallel computer architectures generally provide multiple processors that can each be executing different tasks simultaneously. One such parallel computer architecture is referred to as a multithreaded architecture (MTA). The MTA supports not only multiple processors but also multiple streams executing simultaneously in each processor. The processors of an MTA computer are interconnected via an interconnection network. Each processor can communicate with every other processor through the interconnection network. FIG. 1 provides a high-level overview of an MTA computer. Each processor 101 is connected to the interconnection network and memory 102. Each processor contains a complete set of registers 101a for each stream. In addition, each processor also supports multiple protection domains 101b so that multiple user programs can be executing simultaneously within that processor.
[0004] Each MTA processor can execute multiple threads of execution simultaneously. Each thread of execution executes on one of the 128 streams supported by an MTA processor. Every clock time period, the processor selects a stream that is ready to execute and allows it to issue its next instruction. Instruction interpretation is pipelined by the processor, the network, and the memory. Thus, a new instruction from a different stream may be issued in each time period without interfering with other instructions that are in the pipeline. When an instruction finishes, the stream to which it belongs becomes ready to execute the next instruction. Each instruction may contain up to three operations (i.e., a memory reference operation, an arithmetic operation, and a control operation) that are executed simultaneously.
[0005] The state of a stream includes one 64-bit Stream Status Word (“SSW”), 32 64-bit General Registers (“R0-R31”), and eight 32-bit Target Registers (“T0-T7”). Each MTA processor has 128 sets of SSWs, of general registers, and of target registers. Thus, the state of each stream is immediately accessible by the processor without the need to reload registers when an instruction of a stream is to be executed.
[0006] The MTA uses program addresses that are 32 bits long. The lower half of an SSW contains the program counter (“PC”) for the stream. The upper half of the SSW contains various mode flags (e.g., floating point rounding, lookahead disable), a trap disable mask (e.g., data alignment and floating point overflow), and the four most recently generated condition codes. The 32 general registers are available for general-purpose computations. Register R0 is special, however, in that it always contains a 0. The loading of register R0 has no effect on its contents. The instruction set of the MTA processor uses the eight target registers as branch targets. However, most control transfer operations only use the low 32 bits to determine a new program counter. One target register (T0) points to the trap handler, which may be an unprivileged program. When a trap occurs, the trapping stream starts executing instructions at the program location indicated by register T0. Trap handling is lightweight and independent of the operating system and other streams. A user program can install trap handlers for each thread to achieve specific trap capabilities and priorities without loss of efficiency.
[0007] Each MTA processor supports as many as 16 active protection domains that define the program memory, data memory, and number of streams allocated to the computations using that processor. Each executing stream is assigned to a protection domain, but which domain (or which processor, for that matter) need not be known by the user program.
[0008] The MTA divides memory into program memory, which contains the instructions that form the program, and data memory, which contains the data of the program. The MTA uses a program mapping system and a data mapping system to map addresses used by the program to physical addresses in memory. The mapping systems use a program page map and a data segment map. The entries of the data segment map and program page map specify the location of the segment in physical memory along with the level of privilege needed to access the segment.
[0009] The number of streams available to a program is regulated by three quantities slim, scur, and sres associated with each protection domain. The current numbers of streams executing in the protection domain is indicated by scur; it is incremented when a stream is created and decremented when a stream quits. A create can only succeed when the incremented scur does not exceed sres, the number of streams reserved in the protection domain. The operations for creating, quitting, and reserving streams are unprivileged. Several streams can be reserved simultaneously. The stream limit slim is an operating system limit on the number of streams the protection domain can reserve.
[0010] When a stream executes a CREATE operation to create a new stream, the operation increments scur, initializes the SSW for the new stream based on the SSW of the creating stream and an offset in the CREATE operation, loads register (T0), and loads three registers of the new stream from general purpose registers of the creating stream. The MTA processor can then start executing the newly created stream. A QUIT operation terminates the stream that executes it and decrements both sres and scur. A QUIT_PRESERVE operation only decrements scur, which gives up a stream without surrendering its reservation.
[0011] The MTA supports four levels of privilege: user, supervisor, kernel, and IPL. The IPL level is the highest privilege level. All levels use the program page and data segment maps for address translation, and represent increasing levels of privilege. The data segment map entries define the minimum levels needed to read and write each segment, and the program page map entries define the exact level needed to execute from each page. Each stream in a protection domain may be executing at a different privileged level.
[0012] Two operations are provided to allow an executing stream to change its privilege level. A “LEVEL_ENTER lev” operation sets the current privilege level to the program page map level if the current level is equal to lev. The LEVEL_ENTER operation is located at every entry point that can accept a call from a different privilege level. A trap occurs if the current level is not equal to lev. The “LEVEL_RETURN lev” operation is used to return to the original privilege level. A trap occurs if lev is greater than the current privilege level.
[0013] An exception is an unexpected condition raised by an event that occurs in a user program, the operating system, or the hardware. These unexpected conditions include various floating point conditions (e.g., divide by zero), the execution of a privileged operation by a non-privileged stream, and the failure of a stream create operation. Each stream has an exception register. When an exception is detected, then a bit in the exception register corresponding to that exception is set. If a trap for that exception is enabled, then control is transferred to the trap handler whose address is stored in register T0. If the trap is currently disabled, then control is transferred to the trap handler when the trap is eventually enabled assuming that the bit is still set in the exception register. The operating system can execute an operation to raise a domain_signal exception in all streams of a protection domain. If the trap for the domain_signal is enabled, then each stream will transfer control to its trap handler.
[0014] Each memory location in an MTA computer has four access state bits in addition to a 64-bit value. These access state bits allow the hardware to implement several useful modifications to the usual semantics of memory reference. These access state bits are two data trap bits, one full/empty bit, and one forward bit. The two data trap bits allow for application-specific lightweight traps, the forward bit implements invisible indirect addressing, and the full/empty bit is used for lightweight synchronization. The behavior of these access state bits can be overridden by a corresponding set of bits in the pointer value used to access the memory. The two data trap bits in the access state are independent of each other and are available for use, for example, by a language implementer. If a trap bit is set in a memory location, then an exception will be raised whenever that location is accessed if the trap bit is not disabled in the pointer. If the corresponding trap bit in the pointer is not disabled, then a trap will occur.
[0015] The forward bit implements a kind of “invisible indirection.” Unlike normal indirection, forwarding is controlled by both the pointer and the location pointed to. If the forward bit is set in the memory location and forwarding is not disabled in the pointer, the value found in the location is interpreted as a pointer to the target of the memory reference rather than the target itself. Dereferencing continues until either the pointer found in the memory location disables forwarding or the addressed location has its forward bit cleared.
[0016] The full/empty bit supports synchronization behavior of memory references. The synchronization behavior can be controlled by the full/empty control bits of a pointer or of a load or store operation. The four values for the full/empty control bits are shown below.
[0017]
When the access control mode (i.e., synchronization mode) is future, loads and stores wait for the full/empty bit of memory location to be accessed to be set to full before the memory location can be accessed. When the access control mode is sync, loads are treated as “consume” operations and stores are treated as “produce” operations. A load waits for the full/empty bit to be set to full and then sets the full/empty bit to empty as it reads, and a store waits for the full/empty bit to be set to empty and then sets the full/empty bit to full as it writes. A forwarded location (i.e., its forward bit is set) that is not disabled (i.e., by the access control of a pointer) and that is empty (i.e., full/empty bit is set to empty) is treated as “unavailable” until its full/empty bit is set to full, irrespective of access control.
| VALUE | MODE | LOAD | STORE |
|---|---|---|---|
| 0 | normal | read | write regardless |
| regardless | and set full | ||
| 1 | reserved | reserved | |
| 2 | future | wait for full | wait for full |
| and leave full | and leave full | ||
| 3 | sync | wait for full | wait for empty |
| and set empty | and set full | ||
When the access control mode (i.e., synchronization mode) is future, loads and stores wait for the full/empty bit of memory location to be accessed to be set to full before the memory location can be accessed. When the access control mode is sync, loads are treated as “consume” operations and stores are treated as “produce” operations. A load waits for the full/empty bit to be set to full and then sets the full/empty bit to empty as it reads, and a store waits for the full/empty bit to be set to empty and then sets the full/empty bit to full as it writes. A forwarded location (i.e., its forward bit is set) that is not disabled (i.e., by the access control of a pointer) and that is empty (i.e., full/empty bit is set to empty) is treated as “unavailable” until its full/empty bit is set to full, irrespective of access control.
[0018] The full/empty bit may be used to implement arbitrary indivisible memory operations. The MTA also provides a single operation that supports extremely brief mutual exclusion during “integer add to memory.” The FETCH_ADD operation loads the value from a memory location and stores the sum of that value and another value back into the memory location.
[0019] Each protection domain has a retry limit that specifies how many times a memory access can fail in testing full/empty bit before a data blocked exception is raised. If the trap for the data blocked exception is enabled, then a trap occurs. The trap handler can determine whether to continue to retry the memory access or to perform some other action. If the trap is not enabled, then the next instruction after the instruction that caused the data blocked exception is executed.
[0020] A speculative load occurs typically when a compiler generates code to issue a load operation for a data value before it is known whether the data value will actually be accessed by the program. The use of speculative loads helps reduce the memory latency that would result if the load operation was only issued when it was known for sure whether the program actually was going to access the data value. Because a load is speculative in the sense that the data value may not actually be accessed by the program, it is possible that a speculative load will load a data value that the program does not access. The following statements indicate program statement for which a compiler may generate a speculative load:
[0021]
The following statement illustrate the speculative load that is placed before the “if” statement.
| if i<N | |
| x=buffer[i] | |
| endif | |
The following statement illustrate the speculative load that is placed before the “if” statement.
[0022]
The compiler generated code to load the data value for buffer[i] into a general register “r” and placed it before the code generated for the “if” statement condition. The load of the data value could cause an exception. For example, if the index i was so large that an invalid memory location was being accessed. If the “if” statement condition is satisfied, then the exception would have eventually occurred, but at a later time. In addition, if the “if” statement condition is not satisfied, then no exception would occur. To prevent a speculative load from causing an exception to occur or occur too early, the MTA has a “poison” bit for each general register. Whenever a load occurs, the poison bit is set or cleared depending on whether an exception would have been raised. If the data in a general register is then used while the corresponding poison bit is set, then an exception is raised at the time of use. In the above example, the “r=buffer[i]” statement would not raise an exception, but would set the corresponding poison bit if the address is invalid. An exception, however, would be raised when the “x=r” statement is executed accessing that general register because its poison bit is set. The deferring of the exceptions and setting of the poison bits can be disabled by a speculative load flag in the SSW.
| r=buffer[i] | |
| if i<N | |
| x=r | |
| endif | |
The compiler generated code to load the data value for buffer[i] into a general register “r” and placed it before the code generated for the “if” statement condition. The load of the data value could cause an exception. For example, if the index i was so large that an invalid memory location was being accessed. If the “if” statement condition is satisfied, then the exception would have eventually occurred, but at a later time. In addition, if the “if” statement condition is not satisfied, then no exception would occur. To prevent a speculative load from causing an exception to occur or occur too early, the MTA has a “poison” bit for each general register. Whenever a load occurs, the poison bit is set or cleared depending on whether an exception would have been raised. If the data in a general register is then used while the corresponding poison bit is set, then an exception is raised at the time of use. In the above example, the “r=buffer[i]” statement would not raise an exception, but would set the corresponding poison bit if the address is invalid. An exception, however, would be raised when the “x=r” statement is executed accessing that general register because its poison bit is set. The deferring of the exceptions and setting of the poison bits can be disabled by a speculative load flag in the SSW.
[0023] FIG. 2A illustrates the layout of the 64-bit exception register. The upper 32-bits contain the exception flags, and the lower 32 bits contain the poison bits. Bits 40-44 contain the flags for the user exceptions, which include a create stream exception, a privileged instruction exception, a data alignment exception, and a data blocked exception. A data blocked exception is raised when a data memory retry exception, a trap 0 exception, a trap 1 exception, or a long memory latency timeout is generated. The program handling a data blocked exception is responsible for determining the cause of the data blocked exception. The exception register contains one poison bit for each of the 32 general registers. If the poison bit is set, then an attempt to access the content of the corresponding register will raise an exception.
[0024] FIG. 2B illustrates the layout of the 64-bit stream status word. The lower 32 bits contain the program counter, bits 32-39 contain mode bits, bits 40-51 contain a trap mask, and bits 52-63 contain the condition codes of the last four instructions executed. Bit 37 within the mode bits indicates whether speculative loads are enabled or disabled. Bit 48 within the trap mask indicates whether a trap on a user exception is enabled (bits 40-44 of the SSW). Thus, traps for the user exceptions are enabled or disabled as a group.
[0025] FIG. 2C illustrates the layout of a word of memory and in particular a pointer stored in a word of memory. Each word of memory contains a 64-bit value and a 4-bit access state. The 4-bit access state is described above. When the 64-bit value is used to point to a location in memory, it is referred to a “pointer.” The lower 48 bits of the pointer contains the address of the memory location to be accessed, and the upper 16 bits of the pointer contain access control bits. The access control bits indicate how to process the access state bits of the addressed memory location. One forward disable bit indicates whether forwarding is disabled, two full/empty control bits indicate the synchronization mode; and four trap 0 and 1 disable bits indicate whether traps are disabled for stores and loads, separately. If the forward disable bit is set, then no forwarding occurs regardless of the setting of the forward enable bit in the access state of the addressed memory location. If the trap 1 store disable bit is set, then a trap will not occur on a store operation, regardless of the setting of the trap 1 enable bit of the access state of the addressed memory location. The trap 1 load disable, trap 0 store disable, and trap 0 load disable bits operate in an analogous manner. Certain operations include a 5-bit access control operation field that supersedes the access control field of a pointer. The 5-bit access control field of an operation includes a forward disable bit, two full/empty control bits, a trap 1 disable bit, and a trap 0 disable bit. The bits effect the same behavior as described for the access control pointer field, except that each trap disable bit disables or enables traps on any access and does not distinguish load operations from store operations.
[0026] When a memory operation fails (e.g., synchronized access failure), an MTA processor saves the state of the operation. A trap handler can access that state. That memory operation can be redone by executing a redo operation (i.e., DATA_OP_REDO) passing the saved state as parameters of the operation. After the memory operation is redone (assuming it does not fail again), the trapping stream can continue its execution at the instruction after the trapping instruction.
[0027] The appendix contains the “Principles of Operation” of the MTA, which provides a more detailed description of the MTA.
Summary of the Invention
[0028] Embodiments of the present invention provide various techniques for synchronization. In one embodiment, the present invention provides a method and system for processing a thread waiting for synchronized access to a memory location. When access by a thread to the memory location is blocked, the system enables an exception to be raised when that memory location is accessed by another thread and blocks execution of the thread. When an exception is raised as a result of access by another thread to that memory location, the system completes the access by that other thread to that memory location. The system then restarts execution of the blocked thread. In this way, a thread does not need to periodically poll the memory location to determine whether the thread can be unblocked and there is no overhead when the thread does not need to wait.
[0029] Another aspect of the present invention provides a method and system for deferring calculation of a value until the value is accessed. The system first enables an exception to be raised when a memory location is accessed. When an exception is raised as a result of access to that memory location, the system calculates the value associated with the memory location. The system then provides the calculated value as the result of the access to that memory location. In this way, the value need only be calculated when, and if, it is needed.
[0030] Another aspect of the present invention provides a method and system for detecting access to uninitialized memory. The system first enables an exception to be raised when a memory location is accessed. When an exception is raised as a result of access to that memory location and when the access is a write access, the system disables the raising of the exception and then allows the write access to the memory location. When the access is a read access, the system indicates that access to uninitialized memory has occurred. In this way, the system can report a fatal error when a read occurs to uninitialized memory.
[0031] Another aspect of the present invention provides a method and system for detecting access to protected memory. The system first enables an exception to be raised when a memory location is accessed. When accessing the memory location with a trap for the exception enabled, the system detects and prevents access to that memory location. When accessing the memory location with a trap for the exception disabled, the system allows the access to that memory location. In this way, a protected program can access protected memory by disabling the trapping of the exception.
[0032] Another aspect of the present invention provides a method and system for accessing a collection of data items. When adding a data item to the collection, the system fetches and adds to a write counter that points to a bucket within a bucket array. The system then reads from the bucket pointed to by the fetched write pointer using a synchronization access mode of sync. The system stores the data item in association (e.g., a limited list associated with the bucket) with the bucket pointed to by the fetched write pointer. The system writes to the bucket pointed to by the fetched write pointer using a synchronization access mode of sync. In this way, multiple threads can be adding to the collection simultaneously since each thread can be writing to a different bucket.
[0033] Another aspect of the present invention provides a method and system for accessing a buffer of data. The system defines a write pointer to point to a location within the buffer. When adding data to the buffer, the system fetches the write pointer, adds an indication of a size of the data to the write pointer, and stores the data into the buffer starting at a location indicated by the fetched write pointer. The system then sets the synchronization access mode of the write pointer to be either normal or sync to effect the behavior of adding data to the buffer. When the synchronization access mode is sync, then data added to the buffer will not overwrite data that has not yet been read from the buffer. When the synchronization access mode is normal, that data will be overwritten.
Brief Description of the Drawings
[0034] FIG. 1 provides a high-level overview of an MTA computer. Each processor 101 is connected to the interconnection network and memory 102.
[0035] FIG. 2A illustrates the layout of the 64-bit exception register.
[0036] FIG. 2B illustrates the layout of the 64-bit stream status word.
[0037] FIG. 2C illustrates the layout of a word of memory and in particular a pointer stored in a word of memory.
[0038] FIG. 3 is a block diagram illustrating the synchronization support of the present invention.
[0039] FIG. 4 contains a table illustrating whether access to a word of memory would be successful.
[0040] FIG. 5 is a flow diagram of an example retry-limit trap handler for synchronization support.
[0041] FIG. 6 is a flow diagram of an example trap 0 handler for synchronization support.
[0042] FIG. 7 is a block diagram illustrating demand evaluation techniques of the present invention.
[0043] FIG. 8 is a flow diagram of an example routine to set up demand evaluation for a word of memory.
[0044] FIG. 9 is a flow diagram of an example trap handler for demand evaluation.
[0045] FIG. 10 is a flow diagram of an example trap handler for protected memory.
[0046] FIG. 11 is a flow diagram of an example trap handler for uninitialized memory.
[0047] FIG. 12 is a block diagram illustrating a parallel access list.
[0048] FIG. 13 is a flow diagram of an example initialize parallel list routine.
[0049] FIG. 14 is a flow diagram of an example write parallel list routine.
[0050] FIG. 15 is a flow diagram of an example read parallel list routine.
[0051] FIG. 16 is a block diagram illustrating the buffering techniques of the present invention.
[0052] FIG. 17 is a flow diagram of an example routine for initializing the buffer.
[0053] FIG. 18 is a flow diagram of an example write buffer routine.
[0054] FIG. 19 is a flow diagram of an example read buffer routine.
[0055] FIG. 20 illustrates the positioning of a sentinel word past an end of a buffer.
[0056] FIG. 21 is a block diagram illustrating the observed thread and the observer thread.
[0057] FIG. 22 is a flow diagram of one embodiment of the observer thread.
[0058] FIG. 23 is a flow diagram of an example trap handler for processing the data blocked exceptions of the observer thread.
[0059] FIG. 24 is a flow diagram of a second embodiment of the observer thread.
[0060] FIG. 25 is a block diagram illustrating the data structure with the trap 0 enable bit set in each word of the data structure.
Detailed Description of the Invention
[0061] Embodiments of the present invention provide various techniques for manipulating data using the access states of memory, access control fields of pointers and operations, and exception raising and exception trapping. In particular, the techniques include synchronization support for a thread blocked in a word, demand evaluation of values, parallel access of multiple threads to a list, synchronized and unsynchronized access to a data buffer, and other techniques as described below in detail.
Synchronization Support
[0062] FIG. 3 is a block diagram illustrating the synchronization support of the present invention. As described in the background, when a synchronized access (i.e., synchronization mode of sync or future) is made to a word of memory, if the access is not successful, then the access will be retried a certain number of times. When the retry limit has been reached, the data blocked exception is raised. The data blocked trap handler can return to the trapped access operation to continue retrying the access. Alternatively, the thread that attempted to execute the trapped instruction can be blocked from further execution until access is or may be successful. For example, the blocked thread could be restarted after a certain time interval. If the access is still not successful, the data blocked trap handler can again block that thread. Alternatively, if multiple threads are blocked on a word of memory (i.e., waiting for access to that word of memory), then a single stream can be dedicated to retrying access to that word of memory. Once access is successful, then that single stream can restart the blocked threads.
[0063] A problem with these approaches to handling data blocked exceptions is that processor resources are consumed when determining whether a blocked thread may become unblocked. One aspect of the present invention provides a data blocked handling system that handles data blocked exception raised by a retry limit exceeded event without consuming any resources until an operation is performed that may allow a blocked thread to successfully access the blocking word of memory. Block 302 illustrates the state of a word of memory when an access may be unsuccessful. In this example, full/empty bit is empty. As a result, any access operation that specifies a future access mode or a load operation that specifies a sync access mode will be unsuccessful. The data blocked handling system includes a retry-limit trap handler and a trap 0 handler. When the retry limit is exceeded (e.g., when a load in sync access mode is attempted on word 302), the retry-limit trap handler sets the trap 0 enable bit of the blocking word 303 and blocks the thread from further execution until the blocking word is accessed. When the blocking word is next accessed, a data blocked exception is raised by a trap 0 event and the trap 0 handler is invoked. The trap 0 handler can then allow that access to proceed (i.e., performing a redo operation) and restart the blocked thread. When the blocked thread retries the access to the blocking word, the access may be successful and, if so, the thread continues its execution. If, however, the access is not successful, then a data blocked exception is again raised by a retry limit exceeded event. The retry limit trap handler would then again block that thread until another thread attempts to access the blocking word. Alternatively, the trap 0 handler can determine whether the access by the blocked thread would be successful and only restart the blocked thread when the access would be successful. Also, the trap 0 handler can complete the memory operation for the blocked thread rather than simply allowing it to re-attempt the operation.
[0064] In one embodiment, the retry-limit trap handler initializes a waiter data structure 304. The term “waiter” refers to a thread that is blocked waiting on a word of memory. The retry-limit trap handler stores state information of the blocked thread in a waiter data structure. The retry-limit trap handler also stores the value of the blocking word in the waiter data structure. The retry-limit trap handler then stores a pointer to the waiter data structure as the value in the blocking word 303. When the trap 0 handler is invoked when the blocking word is accessed, the trap 0 handler can locate the state information for the blocked thread using the value stored in the blocking word. If multiple threads become blocked on the word, then the trap 0 handler can create a linked list of waiter data structures 306 and 307. When the trap 0 handler determines that an access to the blocking word would have been successful and would have changed the state of the full/empty bit, then the trap 0 handler can determine which blocked threads are blocked on accesses that would now succeed. The trap 0 handler then restarts those block threads.
[0065] FIG. 4 contains a table illustrating whether access to a word of memory would be successful. The table 401 contains a load column and a store column. Each of these columns contain three sub-columns, one for each of the three synchronization access modes: normal, sync, and future. The table 401 contains a full row and an empty row. Each row contains two sub-rows. One sub-row indicates whether the operation will succeed and the other sub-row indicates the resulting value of the full/empty bit. The asterisk in the full/empty sub-rows indicate that the access will change the full/empty bit. For example, a load access in sync mode with the full/empty bit of the accessed word set to full will succeed and will change the full/empty bit to full. In contrast, a store access operation in sync mode to a word with its full/empty bit set to full will block and, of course, have no immediate effect on the full/empty bit.
[0066] FIG. 5 is a flow diagram of an example retry-limit trap handler for synchronization support. In step 501, if the thread is locked, then the trap handler continues at step 508, else the trap handler continues at step 502. A stream executing a locked thread will not be assigned to another thread when the locked thread blocks. Rather, if the thread is locked, then the locked thread will continue to retry the access until it is successful (i.e., spin wait). In step 502, the trap handler saves the state of the thread into a waiter data structure. In step 503, the trap handler locks the blocking word. A word is locked by setting its full/empty bit to empty and setting the forward bit. Any access to a locked word will not be successful, unless the forwarding is disabled by the access control or unless the access is by an operation that ignores the access state of the word. In step 506, if the blocked operation can now succeed, then the trap handler continues at step 507, else the trap handler continues at step 504. Another thread may have accessed the blocked word in the interval between when the exception was raised and the blocked word was locked. Therefore, this check ensures that the thread is still blocked by checking the full/empty bit of the blocked word. In step 504, the trap handler writes the value of the blocked word to the waiter data structure. In one embodiment, the value of the blocked word is written to only one waiter data structure (e.g., the eldest waiter data structure in the list), rather than to each waiter data structure. In step 505, the trap handler writes the address of the waiter data structure into the blocking word. The trap handler also sets the trap 0 enable bit, clears the trap 1 enable bit, and unlocks the blocked word. This unlocks the blocking word and enables a trap 0 trap on the next access. The trap handler then returns so that another thread can be selected to execute on the stream. One skilled in the art would appreciate that the trap 1 could alternatively be used to detect access to the blocking word. In general, the use of trap 0 and trap 1, or both, are interchangeable. In step 507, the trap handler unlocks the blocked word. In step 508, the trap handler redoes the operation and continues executing the thread. A nested trap may occur when redoing an operation for a locked thread. So, in one embodiment, the nesting can be detected and area for saving the state of the trapping thread can be reused.
[0067] FIG. 6 is a flow diagram of an example trap 0 handler for synchronization support. In step 601, the trap handler locks the blocking word. In step 601A, if the trap 0 enable bit is cleared, then another thread has accessed the blocking word since the exception was raised for this thread and the trap handler continues at step 601B, else the trap handler continues at step 602. In step 601B, the trap handler redoes the trapping operation and returns to the thread after the trapping instruction. In step 602, the trap handler determines the effect of the access to the blocking word by accessing table 401. In step 603, if the full/empty bit would be changed by the access, then the trap handler continues at step 604, else the trap handler continues at step 610. In step 604, the trap handler selects the next waiter, starting with the eldest waiter. In step 605, if all the waiters are already selected, then the trap handler continues at step 608, else trap handler continues that step 606. In step 606, if the waiter can succeed with execution of its blocked operation as indicated by table 401, then the trap handler continues at step 607, else the trap handler loops to step 604 to select the next waiter. In step 607, the trap handler restarts the waiter. In step 607A, if the full/empty bit of the blocking word was changed by the restarted waiter, then no more waiters can continue and the trap handler continues at step 608, else the trap handler loops to 604 to select the next waiter. In step 608, if the waiter list is empty, then the trap handler continues at step 609, else the trap handler continues at step 612. In step 609, since no more threads are blocked on the blocking word, the trap handler writes the original value (or last value written to the blocking word) back to the blocking word and then returns to redo the access operation. In step 610, if the thread can succeed in executing its operation, then the trap handler continues at step 613, else the trap handler continues that step 611. In step 611, the trap handler adds the thread to the waiter list. In step 612, the trap handler unlocks the blocking word and returns to select another thread to execute on this stream. In step 613, the trap handler simulates the execution of the access operation. In step 614, the trap handler unlocks the blocking word and returns to the instruction after the trapping instruction. Alternatively, if the full/empty bit of the blocking word is full (step 603), then all waiters waiting for an operation with a synchronization access mode of future and waiting on a fetch and add operation with a synchronization mode of sync can have their operations redone and their streams restarted. The trap handler can then go directly from step 607 to step 608 because at most one waiter can continue.
Demand Evaluation
[0068] FIG. 7 is a block diagram illustrating demand evaluation techniques of the present invention. Demand evaluation refers to the concept of deferring the calculation of a data value until there is a demand to access that data value. When an initial access is made to reference the data value, the demand evaluation technique then invokes a function to calculate that data value. The calculated data value is then returned as the result of the access, and the data value is made available for subsequent access without the need to re-execute the function. If the data value is never accessed, then the overhead of executing that function is avoided. In one embodiment, the initial access to the data value is detected by setting the trap 1 enable bit in a word of memory 701 where the data value should be stored. When that word of memory is accessed, the trap 1 handler is invoked. The trap 1 handler then executes a function to calculate the data value. The trap 1 handler then stores the calculated data value into the word of memory and clears the trap 1 enable bit 702. The trap 1 handler then performs a redo operation to complete the execution of the trapping operation. This redo operation retrieves the calculated data value from the word of memory 702. Since the calculated value is stored in the word of memory and the trap 1 enable bit is cleared, the next load operation to that word of memory will retrieve the calculated data value without raising an exception.
[0069] In one embodiment, the demand evaluation techniques store in the address portion of the word of memory 701 the address of the function block 703. The function block contains the previous value that was stored in the word of memory 701, a pointer to the function that is to be invoked to calculate the data value, and the actual arguments to pass the function. When the trap 1 handler is invoked when the word of memory 701 is accessed, the trap handler uses that word of memory to locate the function block. If the access is to read the word of memory, then the trap 1 handler invokes the function passing the actual arguments. The function returns a calculated data value, which the trap 1 handler then stores in the word of memory 702. If the access is to write a value to the word of memory, then the trap 1 handler may recognize that access as an error. Alternatively, the value of the word of memory may be used as an argument that is passed to the function. Thus, the writing of a value to the word of memory would not cause an error. Rather, the writing of the value to the word of memory would result in the data value stored in the function block to be updated with the new value.
[0070] In addition to supporting demand evaluation, aspects of the present invention also support detecting access to “protected” memory and “uninitialized” memory. A protected memory location is one for which a fatal error should occur whenever that memory location is accessed. The access to protected memory can be detected by setting a trap enable bit in the protected word. The trap handler can then effect the fatal error. The same trap handler (e.g., trap 1 handler) can be used for demand evaluation and accesses to protected memory. To distinguish whether the trapping word is protected, rather than set up for demand evaluation, a distinguished value (e.g., zero) can be stored in the word. Alternately, any value not valid as a pointer can be used to denote protected memory. Once the trap handler detects this zero value, it will handle the trap as resulting from access of protected memory, rather than for a demand evaluation. Access to uninitialized memory can be detected in a similar way. A different distinguished value (e.g., 1) can be in the uninitialized word. The trap handler will allow write access to an uninitialized memory location to succeed and will also clear the trap enable bit. The trap handler will indicate a fatal error if a read access is attempted to the uninitialized memory. Alternatively, rather than using a distinguished value, both the trap 0 enable bit and the trap 1 enable bit can be set to indicate that memory is uninitialized and the trap handler can detect that both bits are set. Also, rather than a distinguished value, a side data structure, such as a hash table, could be used to determine which memory locations have functions associated with them.
[0071] FIG. 8 is a flow diagram of an example routine to set up demand evaluation for a word of memory. This routine is passed the address of the word of memory along with a pointer to the function block which contains a pointer to the function along with the actual arguments to be passed to the function. In step 801, the routine copies the value and its access state from the addressed word of memory into the function block. In step 802, the routine stores the pointer to the function block into the value of the word of memory. The routine also sets the trap 1 enable bit. The routine then returns.
[0072] FIG. 9 is a flow diagram of an example trap handler for demand evaluation. In step 901, the trap handler locks the trapping word of memory. In step 902, if the function associated with the trapping word is not found (e.g., the trap enable bit has been cleared), then another stream has accessed the trapping word of memory since the data blocked exception was raised for this stream. That other stream has already invoked the function and stored the calculated data value in the trapping word. Therefore, if the function is not found, then the trap handler performs a redo operation to effect the access to the trapping word of memory in step 902 and returns. If, however, the function is found, then the trap handler continues at step 903. In step 903, the trap handler unlocks the trapping word. In step 904, the trap handler invokes the function referenced by the function block. The function is preferably re-entrant and safe to be executed by multiple threads in parallel. The invoked function stores the calculated value in the trapping word, clears the trap 1 enable bit and unlocks the trapping word. In step 905, the trap handler performs the redo operation to complete the access to the trapping word and then returns.
[0073] FIG. 10 is a flow diagram of an example trap handler for protected memory. In step 1001, the trap handler locks the trapping word of memory. In step 1002, if the trap enable bit has been cleared, then the trap handler unlocks the trapping word and performs a redo operation to affect the access to the trapping word of memory in step 1003 and returns, else the trap handler continues at step 1004. In step 1004, if the operation is a load, if the synchronization access mode is normal, and if speculative loads are enabled, then the routine continues at step 1005, else routine continues at step 1007. In step 1005, the trap handler sets the poison bit for the destination register. In step 1006, the trap handler unlocks the trapping word and returns. In step 1007, the trap handler unlocks the trapping word and reports the fatal error and returns.
[0074] FIG. 11 is a flow diagram of an example trap handler for uninitialized memory. In step 1101, the trap handler locks the trapping word of memory. In step 1102, if the trap enable bit has been cleared, then the trap handler unlocks the trapping word and performs a redo operation to effect the access to the trapping word of memory in step 1103 and returns, else the trap handler continues at step 1104. In step 1104, if the access operation is a store, then a trap handler continues at step 1105, else the trap handler continues at step 1107. In step 1105, the trap handler clears the trap enable bit and unlocks the trapping word In step 1106, the trap handler redoes the store access operation on the trapping word and returns. This redo operation stores the value in a trapping word. In step 1107, if the operation is a load, the synchronization access mode is normal, and speculative loads are enabled, then the routine continues at step 1108, else routine continues at step 1110. In step 1108, the trap handler sets the poison bit for the destination register. In step 1109, the trap handler unlocks the trapping word and returns. In step 1110, the trap handler unlocks the trapping word, reports the fatal error and returns.
Parallel List Access
[0075] The parallel list access techniques of the present invention allow multiple streams to add items to a list of items simultaneously without encountering synchronization problems. Typically, when an item is added to (or removed from) a list, one thread needs to place a lock on the list to prevent all other threads from accessing the list while the item is being added. After the item is added, the locking thread can then unlock the list to allow the next thread to access the list. Thus, even though parallel threads may be executing, access to the list is serial. To overcome this serial access problem, one embodiment of the present invention provides for list access in parallel. FIG. 12 is a block diagram illustrating a parallel access list. The parallel access list includes read counter 1201, write counter 1202, a lower bound 1205, bucket array 1203, and list items 1204. Each bucket in the bucket array contains a pointer to a linked list of items. Items are added to the linked lists of the bucket array in a circular manner. That is, the first item is added to the linked list of bucket[0], the second item is added to the linked list of bucket[1], and so on. Similarly, items are removed from the linked lists of the bucket array in a circular matter. The read counter points to the bucket from which the next item in the list is to be read. The write counter points to the bucket into which the next item is to be added. The lower bound indicates a lower bound on the number of items in the parallel list. That is, it is guaranteed that there will be at least the lower bound number of items in the list. If the lower bound is zero or negative, then there may not be any items in the parallel list. To add an item to the parallel list, a thread fetches and adds a 1 to the write counter. The thread then uses the remainder of the fetched write counter divided by the size of the bucket array (N) (i.e., fetched write counter modulo N) as the index into the bucket array. The thread then adds the item to the linked list of the indexed bucket and then fetches and adds to the lower bound. The next thread to add an item to a list will also fetch and add a 1 to the write counter, which selects next bucket in the array. Because the fetch and add operation is atomic, reduced contention is encountered when accessing the read or the write counter. Moreover, sequential write accesses to the parallel list will access sequential buckets, and the items can be added to the list without interference. If, however, the number of read or write accesses that have not yet completed exceeds the number of buckets in the array, then multiple threads may be accessing the linked lists of a bucket simultaneously. To prevent this simultaneous access, each bucket in the array is accessed in a synchronization mode of sync. Although contention can occur when the number of simultaneous write or read accesses exceeds the number of buckets or when a read access and a write accesses attempt to access the same bucket simultaneously, multiple access can be simultaneous without contention. Moreover, the number of buckets in the bucket array can be selected to help minimize the contention.
[0076] FIG. 13 is a flow diagram of an example initialize parallel list routine. The initialize parallel list routine initializes the parallel list to be empty. In step 1301, the routine sets the read and write counters to zero. In step 1302, the routine sets the lower bound to zero. In step 1303, the routine sets each bucket in the array to a NULL value and sets its full/empty bit to full. A NULL value signifies the end of a linked list if a read or a write traverses the linked list. The routine then returns.
[0077] FIG. 14 is a flow diagram of an example write parallel list routine. This routine is passed an item to be added to the list and adds the passed item to the parallel list. In step 1401, the routine fetches and adds a 1 to the write counter. In step 1402, the routine sets the bucket array index (i) to the fetched write counter modulo the size of the bucket array (N). In step 1403, the routine retrieves the pointer stored in the indexed bucket. This read of the indexed bucket is with a synchronization mode of sync. That is, if the full/empty bit of the bucket is set to empty, then the read will block. The full/empty bit of the bucket will be set to empty if another item is in the process of being added to or removed from the list by another thread. When the full/empty bit is set to full, then the read will succeed and the full/empty bit is then set to empty to block simultaneous access to that bucket by another thread. In step 1404, the routine sets the next pointer in the passed item to the retrieved pointer. In step 1405, the routine sets the indexed bucket to point to the passed item, which sets the full/empty bit to full. Steps 1403 and 1405 effect looking and unlocking of the bucket. In step 1406, the routine fetches and adds to the lower bound. The routine then returns.
[0078] FIG. 15 is a flow diagram of an example read parallel list routine. This routine returns a pointer to an item removed from the parallel list or returns a NULL value if the lower bound is less than 1. The routine first checks the lower bound to determine whether the lower bound is less than 1. If so, the routine returns an indication that the parallel list is empty. If not, then there is at least one item in the parallel list. The routine then fetches and adds a −1 to the lower bound. If another thread had added a −1 to the lower bound in between the checking and fetching and adding by this thread, then the fetched lower bound may be less than 1. If so, the routine adds a 1 back to the lower bound and returns an indication that the parallel list is empty. Otherwise, the parallel list is not empty and the routine retrieves and returns an item. The first check for a lower bound less than 1 prevents starvation from multiple readers when a new item is added to an empty parallel list. Without this first check, the fetch and add of the lower bound may always be less than 1 for each of the multiple readers and thus no reader would recognize that an item has been added to the parallel list. The first check ensures that once the lower bound is less than 1, all the fetches and adds of 1 followed by fetches and adds of −1 will complete and at least one thread will recognize a lower bound of 1 and one thread will perform a fetch and add that returns the 1. In step 1501, if the lower bound is less than 1, then the routine returns an indication that the parallel list is empty, else the routine continues at step 1502. In step 1502, the routine fetches and adds a −1 to the lower bound. In step 1503, if the fetched lower bound is less than 1, then the routine fetches and adds a 1 to the lower bound in step 1504 and returns an indication that the parallel list is empty, else the routine continues at step 1505. In step 1505, the routine fetches and adds a 1 to the read counter. In step 1506, the routine sets the bucket array index (i) to the fetched read counter modulo the size of the bucket array (N). In step 1507, the routine retrieves the pointer stored in the indexed bucket. This reading of the indexed bucket is with a synchronization mode of sync. That is, if the full/empty bit of the bucket is set to empty, then the read will block until it is set to full. In step 1508, the routine sets the indexed bucket to the next pointer of the pointed to item which sets the full/empty bit to full and returns the pointed to item. Steps 1507 and 1508 effect locking and unlocking of the bucket. Alternatively, the routine can traverse the linked list and return the last item in the linked list if desired or a doubly linked list may be used rather than a singly linked list. Also, rather than a linked list, any other type of data structure can be used such as a binary tree or a hash table.
Data Buffering
[0079] The data buffering techniques of the present invention allows for multiple-producer and multiple-consumer accessing of a data buffer. The data buffering techniques provide for unsynchronized access and for synchronized access to the data buffer. With unsynchronized access, there is no consumer and data can be overwritten by the producers. With synchronized access, producers cannot overwrite data until it is consumed. The data buffer has a read pointer and a write pointer. By setting the synchronization access mode to normal or sync in the pointers, the access to the data buffer can be switched from unsynchronized to synchronized without modifying the accessing programs. When the access is unsynchronized, then a producer may overwrite existing data unless the producer implements a scheme for checking the read pointer. However, if the access is synchronized, then the producer cannot overwrite existing data and can avoid checking the read pointer. Thus, the desired behavior depends on whether it is acceptable to overwrite data that has not yet been read and can be controlled by the pointers with modification to the accessing code.
[0080] The data buffering technique also provides a mechanism in which the accessing programs need not include code for detecting the end of the buffer. Traditionally, when circular buffers are accessed, the accessing program needs to check for the end of the circular buffer and if at the end, wrap around the beginning of the circular buffer. With this data buffering technique however, such checking for the end of the buffer is not necessary. To avoid this checking, the data buffering technique sets the forward bit in the words following the end of the data buffer and stores a pointer in those words that point to the words at the beginning of the data buffer. For example, the first word following the end of the data buffer is set to point to the first word of the data buffer, the second word following the end of the data buffer is set to point to the second word of the data buffer, and so on. Since the forward bit is set in these words, any access to these words will be forwarded to the beginning of the data buffer. For example, if a program starts writing a block of data into the data buffer near the end of the data buffer, the first few words are added at the end of the buffer. When the remaining words are added to the locations past the end of the data buffer, the forward bit directs the access to the words at the beginning of the data buffer. In this way, the accessing program can avoid checking for an end of the data buffer condition so long as the amount of data to be added to the data buffer is less than the number of forwarding words adjacent to the end of the data buffer. If the amount of data in a block to be added is greater than the number of forwarding words, then a check for the end of the buffer is needed for all such blocks.
[0081] FIG. 16 is a block diagram illustrating the buffering techniques of the present invention. The buffer 1601 contains words with their forward enable bit cleared. However, the forwarding words 1602 adjacent to the end of the buffer have their forward enable bits set. The first forwarding word contains a pointer to the first word of the buffer, the second forwarding word contains a pointer to the second word of the buffer, and so on. The write pointer 1603 and the read pointer 1604 are used to access the buffer and have their synchronization access node set to normal or sync.
[0082] FIG. 17 is a flow diagram of an example routine for initializing the buffer. In step 1701, the routine clears the forward enable bit and sets the full/empty bit to empty for each word in the buffer. In steps 1702-1704, the routine loops setting the forwarding words adjacent to the end of the buffer. In step 1703, the routine initializes the index (i) to zero. In step 1703, if the index is equal to the number of forwarding words (M), then the routine returns, else the routine continues at step 1704. In step 1704, the routine sets a forwarding word to point to the indexed word in the buffer and sets the forward enable bit. The routine then loops to step 1703 to select the next forwarding word.
[0083] FIG. 18 is a flow diagram of an example write buffer routine. This routine is passed a block of data of an arbitrary size that is to be added to the buffer. This example routine assumes that the arbitrary size is less than the number of forwarding words at the end of the buffer and that the number of outstanding writes is less than the size of the buffer so that subsequent writes do not write past a word whose previous write has not yet completed. In step 1801, the routine fetches and adds the data size of the block of data to the write pointer. This fetching and adding adjusts the write pointer so that another thread can also fetch and add to the write pointer and simultaneously be adding a data block to the buffer. In step 1802, the routine sets the index (i) to the remainder of the fetched pointer divided by the size of the buffer (N). In steps 1803-1805, the routine loops copying the block of data to the buffer starting at the index. In step 1803, the routine initializes an index (j) into the block of data. In step 1804, if the index into the block of data is equal to the size of the block of data, then the routine returns, else the routine continues at step 1805. In step 1805, the routine copies the indexed (j) word of the block of data to the buffer at the indexed (i) location using the access control mode of the fetched pointer. The routine also increments the index (i) and the index (j). If the index (i) into the buffer points past the end of the buffer, that is into the forwarding words, then the copying is forwarded to the beginning of the buffer. The routine then loops to step 1804. In this way, a test for the end of buffer during or before the copying loop is avoided. Since the write pointer was incremented by the data size of the block, the write pointer will correctly point to the location immediately after the added data, near the beginning of the buffer. Also, the indexes could have the address of the buffer and the data block added to them once to once to avoid the addition of these addresses for each word being copied.
[0084] FIG. 19 is a flow diagram of an example read buffer routine. This routine returns a pointer to the block of data that has been read from the buffer. This routine assumes that the size of a block of data is stored as the first word of the block. Since the size is not known in advance of reading the block, a fetch and add will be insufficient to prevent simultaneous read access to the block. To prevent simultaneous access, the read pointer is accessed with a synchronization access mode of sync. In step 1901, the routine retrieves the read pointer. In step 1902, the routine sets the index (i) into the buffer to the remainder of retrieved pointer divided by the size of the buffer (N). In step 1903, the routine retrieves the data size from the buffer. In step 1904, the routine increments the read pointer by the data size. In steps. 1905-1907, the routine loops copying the data from the buffer. In step 1905, the routine sets the index (i) into the data block to zero. In step 1905, if the index (j) into the data block is equal to the size of the data, then the routine returns, else the routine continues at step 1907. In step 1907, the routine copies data from the buffer at the indexed location to the data block to be returned. The data is retrieved from the buffer using the access control mode of the read pointer. The routine also increments the index (i) into the buffer and index (j) into the data block. The routine then loops to step 1906.
Sentinel Words
[0085] The sentinel word technique of the present invention provides a mechanism for checking errant program writes past the end of or the front of a buffer. The sentinel word has its forward enable bit set and contains a pointer to an invalid memory location, such as the location at address 0. When a program attempts to write to a sentinel word, a data protection exception is raised and a trap occurs. When a program attempts to read the sentinel word when speculative loads are enabled, because the memory location is invalid, the poison bit corresponding to the destination register is set. An exception is thus not raised until an attempt is made to use the value in the destination register. Thus, the sentinel word will allow speculative loads to work efficiently. If, however, the sentinel word had a trap enable bit set in order to detect access to the sentinel word, then a compiler-generated speculative load would cause an extra trap, which is undesirable. FIG. 20 illustrates the positioning of a sentinel word past the end of a buffer. As long as the access control mode used to access the buffer does not disable forwarding, the access to the sentinel word can be detected.
Observer Thread
[0086] The observer thread technique of the present invention allows an observer thread to determine when an observed thread has written a value to a memory location. The observed thread writes to the memory location with a synchronization access mode of normal. The observer thread reads from the memory location with a synchronization access mode of sync. Whenever the observed thread writes a value to the word, the full/empty bit of the word is set to full. The observer thread reads that memory location with a synchronization access mode of sync. The observer thread will block until the full/empty bit of the word is set to full. When the full/empty bit is eventually set to full, the observer thread will become unblocked and read the value out of the word, which sets the full/empty bit to empty. The observer thread can then take some action based on the read value. FIG. 21 is a block diagram illustrating the observed thread and the observer thread. The memory location 2101 has its full/empty bit set to full whenever the observed thread 2102 stores a value in the memory location. The observer thread 2103 reads from that memory location with a synchronization access mode of sync, which sets the full/empty bit to empty, and then issues another read to observe the next change in value.
[0087] FIG. 22 is a flow diagram of one embodiment of the observer thread. In this embodiment, the observer thread blocks on the memory location waiting for the full/empty bit to be set to full. In step 2201, the observer thread locks the stream, which means that no other thread will be allowed to execute on the stream when a data block occurs. In step 2202, the observer thread issues a read with a synchronization access mode of sync to the memory location. In step 2203, the routine saves the read value and loops step 2202 to issue the next.
[0088] FIG. 23 is a flow diagram of an example trap handler for processing the data blocked exceptions of the observer thread. In step 2301, the trap handler locks the blocking word. In step 2302, if the stream is locked and the retry limit has been exceeded, then the trap handler unlocks the blocking word in step 2303 and returns, else the trap handler blocks the thread.
[0089] FIG. 24 is a flow diagram of a second embodiment of the observer thread. In this embodiment, the observer thread disables the data blocked trap and provides custom handling when a retry-limit exception is raised. In step 2401, the observer thread disables the data blocked traps. In step 2402, the observer thread issues a read with a synchronization access mode of sync to the observed memory location. In step 2403, if the retry-limit exception was raised, then the observer thread continues at step 2405, else the observer thread continues at step 2404. In step 2404, the observer thread saves the read value. In step 2405, the observer thread clears the retry exception flag and loops to step 2402 to issue the next read.
Restricted Data Structure Access
[0090] The restricted data structure access technique of the present invention helps detect when a portion of a program is improperly accessing a data structure. FIG. 25 is a block diagram illustrating the data structure with the trap 1 enable bit set in each word of the data structure. Whenever an unauthorized portion of the computer program accesses the data structure while trap 1 is enabled, the trap 0 handler is invoked. However, an authorized portion of computer program can access the data structure with a pointer that specifies that trap 1 is disabled. In this way, an unauthorized access to the data structure can be detected.
Execution Based on Memory Access
[0091] Embodiments of the present invention provide various techniques for executing instructions based on access (i.e., load or store) of a memory location. When a memory location with one of its trap bits enabled is accessed, the trap handler is invoked. The trap handler can execute a set of instructions that have been previously designated for that memory location. For example, as discussed above, when the access is a load from the memory location, the trap handler can invoke a function that calculates a data value that is provided as a result of the load. When the access is a store, the trap handler can execute a set of instructions that cannot be executed until a data value is stored in that memory location, but can be executed as soon as a data value is stored. Such execution of a set of instructions is based on “data flow” principles. According to data flow principles, a set of instructions can begin execution as soon as all its input data has been generated. Thus, when the data value is stored in the memory location, the trap handler can determine whether all the inputs for a set of instructions are available. Each memory location that contains an input for the set of instructions can have its trap bit enabled. In this way, each time an input is stored, the trap handler can determine whether all the inputs have already been generated. If so, the set of instructions can be executed or scheduled for execution. A single memory location may also be input to multiple sets of instructions. Thus, the trap handler may determine which sets of instructions use that memory location as input and may store an indication that an input for each set has been generated.
[0092] The access of a memory location can also be used to perform complex initialization processing. For example, the initial access of a memory location that points to a data structure, such as a hash table, can be trapped and memory for the data structure can be allocated. When a program first accesses the memory location, the trap handler can allocate the memory for the hash table and store the base address of the hash table in the memory location. The trap handler can disable the trap after initialization or indicate that a different set of instructions is to be executed next time that memory location is accessed. For example, if the data structure is a queue, then the storing of a value into a memory location can be trapped and the value added to the end of the queue, and the loading of the value from that memory location can be trapped and a value removed from the from of the queue.
[0093] Multiple threads may access a memory location with a set of instructions associated with it. For example, multiple threads may want to access a queue through a memory location. The need for access to the memory location may change as the threads execute. When no more threads need access to that memory location, the data structures used to keep track of the associated set of instructions is can be deallocated. A reference count is associated with that memory location to keep track of the number of threads that need accesses to the memory location. Whenever a thread wants access to the memory location, the thread registers itself with that memory location. The registration process increments the reference count for that memory location. An unregistration process decrements the reference count and deallocates any data structures associated with that memory location when the reference count equals 0. Alternatively, if the memory location is used to access a queue and each thread adds values to and removes values from a queue in pairs, then when the reference count goes to 1, the trap bit of the memory location can be disabled. In this way, no trapping occurs when only one thread is accessing the memory location. If, however, more than one thread is registered to access the memory location, then the trap bit can be enabled to effect the queue processing.
[0094] The set of instructions associated with a trap handler need not return to the code that accessed the memory location. In particular, the set of instructions need not return to complete the execution of the instruction that accessed the memory location. Rather, the set of instructions can continue execution at some other location. For example, the set of instructions can execute a Unix-type long jump to a program location that was specified in a Unix-type set jump. In this way, access to the memory location under certain conditions (e.g., a particular value in the memory location) can permanently alter the execution of a program.
[0095] In one embodiment, execution based on memory access is used to implement watchpoints of a debugger. Whenever a programmer wants to know when a memory location is modified or accessed, the programmer requests the debugger to set a watchpoint at that memory location. When the debugger is executing as a thread of the program, the debugger can enable a trap bit on that memory location to effect the setting of the watchpoint. The debugger can install its own trap handler. When the trap handler is invoked, the debugger knows that the watched memory location has been accessed. The debugger can then report the access along with the old and the new values to the programmer. The debugger would typically only report the access when the access modifies the value in the memory location or when the access is synchronized (i.e., synchronization access mode of sync or future). The debugger may, however, report whenever any of the access state bits of the memory location are modified. A memory location may not always contain the data value currently associated with that memory location. For example, if the memory location has a thread blocked waiting for a synchronization event to occur at that memory location, then that memory location may contain a reference to a waiter data structure as discussed above. In such a situation, the trap handler can retrieve the actual data value from a waiter data structure and provide it to the programmer as the value of the watched memory location. In one embodiment, the debugger can set a watch point on the value of an expression such as “A+B,” when programmer wants to know the value of the expression whenever one of its variables changes. The debugger implements the watching of the expression by trapping access to the memory locations where each variable is stored. For example, the trap bit would be enabled for the memory location corresponding to variables A and B to detect a change in the expression “A+B.” Whenever a trap results from access to either of these memory locations, the debugger notifies the programmer that the value of the expression has changed. When a variable is input to more than one expression that is being watched, then the trap handler can indicate that both expressions have been modified.
[0096] From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. The computer instructions implementing the aspects of the present invention and the data structures can be stored on computer-readable medium, such as a memory device, CD-ROM, or disk, or transmitted over transmission mechanism, such as an optic fiber. Accordingly, the invention is not limited except as by the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
The invention claimed is:
1. A method in a computer system having a processor and a memory for implementing a circular buffer having a size, comprising:
providing a buffer having a plurality of words in the memory, each word having an associated disabled forwarding bit;
providing a pointer pointing to a word within the buffer;
providing a number of forwarding words located adjacent to an end of the buffer in the memory, each forwarding word having an associated enabled forwarding bit and each forwarding word storing a pointer to a word within the buffer, the first forwarding word storing a pointer pointing to the first word in the buffer, each subsequent forwarding word storing a pointer pointing to the word in the buffer immediately following the word in the buffer pointed to by the pointer stored in the immediately preceding forwarding word, wherein the number of forwarding words is less than or equal to the number of words in the buffer;
receiving from the processor a request to access a number of sequential words wherein a starting position for accessing data in the buffer is based on the pointer modulo the size of the buffer, a maximum number of words of the buffer to be accessed at a time corresponding to the number of forwarding words;
selecting the word pointed to by the pointer modulo the size of the buffer;
for each word to be accessed, starting with the selected word,
retrieving the forwarding bit associated with the word to be accessed,
when it is determined that the retrieved forwarding bit is disabled, accessing the word directly, and
when it is determined that the retrieved forwarding bit is enabled, retrieving the pointer stored in the word and directing the access to the word within the buffer pointed to by the retrieved pointer; and
incrementing the pointer by the number of words being accessed
so that the buffer is accessed without checking for the end of the buffer.
2. The method of claim 1 wherein the buffer is pointed to by a write pointer whose value modulo a size of the buffer indicates the starting position for storing data in the buffer.
3. The method of claim 1 wherein the buffer is pointed to by a read pointer whose value modulo a size of the buffer indicates the starting position for reading data from the buffer.
4. The method of claim 1 wherein the access is a read.
5. The method of claim 1 wherein the access is a write.
6. The method of claim 1 wherein the access is using a pointer.
7. The method of claim 6 wherein the pointer is a write pointer.
8. The method of claim 6 wherein the pointer is a read pointer.
9. The method of claim 6 wherein the pointer has a synchronization access mode.
10. The method of claim 9 wherein the synchronization access mode is sync.
11. The method of claim 9 wherein the synchronization access mode is normal.
12. The method of claim 9 wherein the synchronization access mode can be set.
13. The method of claim 1 wherein the access does not include code for detecting the end of the buffer.
14. The method of claim 1 further comprising:
when adding data to the buffer,
receiving an indication of data to be written, the data having a size;
fetching a write pointer;
adding an indication of the size of the data to the write pointer; and
copying the data into the buffer starting at a location indicated by the fetched write pointer.
15. The method of claim 14 wherein the fetching and adding includes executing a fetch and add operation.
16. The method of claim 14 wherein when the copying would occur in a word located past an end of the buffer, the copying automatically circles to the other end of the buffer.
17. The method of claim 14 wherein the adding includes calculating a modulo of a sum of the addition and a size of the buffer.
18. The method of claim 1 further comprising:
when reading data from the buffer,
receiving an indication of a location where read data is to be stored;
fetching a read pointer;
reading a size of the data to be read from the buffer; and
copying data from the buffer to the indicated location.
19. The method of claim 18 further comprising setting the read pointer to a sum of the read pointer and the size of the data modulo a size of the buffer.
20. The method of claim 18 wherein the read pointer is accessed with a synchronization access mode of sync.
21. The method of claim 18 wherein the data is read from the buffer using an access control mode of the read pointer.
22. The method of claim 1 wherein when the access has a synchronization access mode of sync, read access to a location in the buffer is permitted only when the location is full.
23. The method of claim 22 wherein after the read access, the location is set to empty.
24. The method of claim 1 wherein when the access has a synchronization access mode of sync, write access to a location in the buffer is permitted only when the location is empty.
25. The method of claim 24 wherein after the write access, the location is set to full.
26. The method of claim 1 including storing a pointer to an invalid location in a location adjacent to the forwarding words with forwarding of that location enabled so that when the location adjacent to the forwarding words is accessed, an exception is raised.
27. The method of claim 1 wherein the buffer is accessed by multiple readers and writers.
28. The method of claim 1 wherein the buffer is accessed by multiple producers.
29. The method of claim 1 wherein the buffer is accessed by multiple consumers.
30. A computer system for implementing a circular buffer having a size, the computer system having a processor, the system comprising:
a buffer having a plurality of words, each word in the buffer having an associated forwarding bit that is disabled;
a component that stores in each of a set of forwarding words located adjacent to an end of a buffer, an address of a location within the buffer, the first forwarding word storing a pointer pointing to the first word in the buffer, each subsequent forwarding word storing a pointer pointing to the word in the buffer immediately following the word in the buffer pointed to by the pointer stored in the immediately preceding forwarding word and wherein the number of forwarding words is less than or equal to the number of words in the buffer;
a component that enables a forwarding bit associated with each of the forwarding words;
a component that receives a request to access a number of sequential words, wherein the starting position for accessing the buffer is determined based on an access pointer modulo the size of the buffer;
a component that selects the word pointed to by the access pointer modulo the size of the buffer;
a component that, for each word to be accessed starting with the selected word,
retrieves the forwarding bit associated with the word to be accessed,
when it is determined that the retrieved forwarding bit is disabled, accesses the word directly, and
when it is determined that the retrieved forwarding bit is enabled, retrieves the pointer stored in the word and directs the access to the word within the buffer pointed to by the retrieved pointer; and
a component that increments the access pointer by the number of words accessed so that the incremental pointer points to a location for the next access.
31. The system of claim 30 wherein the buffer is accessed by multiple readers and writers.
32. The system of claim 30 wherein the buffer is pointed to by a read pointer whose value modulo a size of the buffer indicates the starting position for reading data from the buffer.
33. The system of claim 30 wherein the access is a read.
34. The system of claim 30 wherein the access is a write.
35. The system of claim 30 wherein the access is using a pointer.
36. The system of claim 35 wherein the pointer is a write pointer.
37. The system of claim 35 wherein the pointer is a read pointer.
38. The system of claim 35 wherein the pointer has a synchronization access mode.
39. The system of claim 38 wherein the synchronization access mode is sync.
40. The system of claim 38 wherein the synchronization access mode is normal.
41. The system of claim 38 wherein the synchronization access mode can be set.
42. The system of claim 30 wherein the access does not include code for detecting the end of the buffer.
43. A computer storage medium containing instructions for implementing a circular buffer having a size that when executed by a computer causes the computer to perform the steps of:
providing a buffer with storage locations, each storage location having an associated forwarding bit that is disabled, wherein the buffer has a beginning and an end and an access pointer pointing to the next storage location to be accessed, such that when the buffer is accessed, the access pointer is incremented by the number of storage locations being accessed so that the access pointer points to a storage location for the next access;
providing a number of forwarding words adjacent to the end of the buffer, each forwarding word having an associated forwarding bit that is enabled, the first forwarding word storing a pointer pointing to the first storage location in the buffer, each subsequent forwarding word storing a pointer pointing to the storage location in the buffer immediately following the storage location in the buffer pointed to by the pointer stored in the immediately preceding forwarding word, wherein the number of forwarding words is less than or equal to the number of storage locations in the buffer;
receiving a request to access a number of storage locations, wherein a starting position for accessing storage locations in the buffer is determined based on the access pointer modulo the size of the buffer;
selecting the storage location pointed to by the access pointer modulo the size of the buffer;
for each storage location to be accessed, starting with the selected storage location,
when the storage location to be accessed is not a forwarding word, accessing the storage location directly, and
when the storage location to be accessed is a forwarding word, retrieving the pointer stored in the forwarding word and directing the access to the storage location within the buffer pointed to by the retrieved pointer; and
incrementing the access pointer by the number of storage locations accessed.
44. The computer storage medium of claim 43 further comprising multiple forwarding words wherein each forwarding word has a pointer to a storage location.
45. The computer storage medium of claim 43 wherein the access pointer is a read pointer.
46. The computer storage medium of claim 45 wherein the value of the read pointer modulo a size of the buffer indicates a starting position for reading data from the buffer.
47. The computer storage medium of claim 43 wherein the access pointer is a write pointer.
48. The computer storage medium of claim 47 wherein the value of the write pointer modulo a size of the buffer indicates a starting position for storing data in the buffer.
Patent Citations (111)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4316245(A) | 1982-02-01 | Luu et al. | Applicant |
| US4321451(A) | 1982-03-01 | Inoue et al. | Applicant |
| US4395757(A) | 1983-07-01 | Bienvenu et al. | Applicant |
| US4725946(A) | 1988-02-01 | Prange et al. | Applicant |
| US4779187(A) | 1988-10-01 | Letwin | Applicant |
| US4819234(A) | 1989-04-01 | Huber | Applicant |
| US4860285(A) | 1989-08-01 | Miller et al. | Applicant |
| US4872167(A) | 1989-10-01 | Maezawa et al. | Applicant |
| US4887204(A) | 1989-12-01 | Johnson et al. | Examiner |
| US5125087(A) | 1992-06-01 | Randell | Applicant |
| US5168554(A) | 1992-12-01 | Luke | Applicant |
| US5247675(A) | 1993-09-01 | Farrell et al. | Applicant |
| US5274809(A) | 1993-12-01 | Iwasaki et al. | Applicant |
| US5285527(A) | 1994-02-01 | Crick et al. | Examiner |
| US5295451(A) | 1994-03-01 | Takenoya et al. | Applicant |
| US5301325(A) | 1994-04-01 | Benson | Applicant |
| US5333280(A) | 1994-07-01 | Ishikawa et al. | Applicant |
| US5440708(A) | 1995-08-01 | Takagi et al. | Applicant |
| US5442789(A) | 1995-08-01 | Baker et al. | Applicant |
| US5450575(A) | 1995-09-01 | Sites | Applicant |
| US5504932(A) | 1996-04-01 | Vassiliadis et al. | Applicant |
| US5515538(A) | 1996-05-01 | Kleiman | Applicant |
| US5533192(A) | 1996-07-01 | Hawley et al. | Applicant |
| US5535412(A) | 1996-07-01 | Nadehara | Examiner |
| US5542058(A) | 1996-07-01 | Brown, III et al. | Applicant |
| US5546301(A) | 1996-08-01 | Agrawal et al. | Applicant |
| US5557747(A) | 1996-09-01 | Rogers et al. | Applicant |
| US5557761(A) | 1996-09-01 | Chan | Applicant |
| US5560029(A) | 1996-09-01 | Papadopoulos et al. | Applicant |
| US5564051(A) | 1996-10-01 | Halliwell et al. | Applicant |
| US5581764(A) | 1996-12-01 | Fitzgerald | Applicant |
| US5594864(A) | 1997-01-01 | Trauben | Applicant |
| US5598560(A) | 1997-01-01 | Benson | Applicant |
| US5600837(A) | 1997-02-01 | Artieri | Applicant |
| US5606559(A) | 1997-02-01 | Badger et al. | Examiner |
| US5623621(A) | 1997-04-01 | Garde | Examiner |
| US5632032(A) | 1997-05-01 | Ault et al. | Applicant |
| US5652889(A) | 1997-07-01 | Sites | Applicant |
| US5666523(A) | 1997-09-01 | D'Souza | Applicant |
| US5712996(A) | 1998-01-01 | Schepers | Applicant |
| US5754855(A) | 1998-05-01 | Miller et al. | Applicant |
| US5757678(A) | 1998-05-01 | Leeke | Applicant |
| US5768591(A) | 1998-06-01 | Robinson | Applicant |
| US5768592(A) | 1998-06-01 | Chang | Applicant |
| US5774721(A) | 1998-06-01 | Robinson | Applicant |
| US5787245(A) | 1998-07-01 | You et al. | Applicant |
| US5805878(A) | 1998-09-01 | Rahman et al. | Examiner |
| US5805892(A) | 1998-09-01 | Nakajima | Applicant |
| US5812811(A) | 1998-09-01 | Dubey et al. | Applicant |
| US5826265(A) | 1998-10-01 | Van Huben et al. | Applicant |
| US5828880(A) | 1998-10-01 | Hanko | Applicant |
| US5832484(A) | 1998-11-01 | Sankaran et al. | Applicant |
| US5835963(A) | 1998-11-01 | Yoshioka et al. | Applicant |
| US5860144(A) | 1999-01-01 | Frank et al. | Examiner |
| US5867643(A) | 1999-02-01 | Sutton | Applicant |
| US5867734(A) | 1999-02-01 | Drews | Examiner |
| US5877766(A) | 1999-03-01 | Bates et al. | Applicant |
| US5881264(A) | 1999-03-01 | Kurosawa | Applicant |
| US5887166(A) | 1999-03-01 | Mallick et al. | Applicant |
| US5901315(A) | 1999-05-01 | Edwards et al. | Applicant |
| US5903730(A) | 1999-05-01 | Asai et al. | Applicant |
| US5913925(A) | 1999-06-01 | Kahle et al. | Applicant |
| US5923900(A) | 1999-07-01 | Soell et al. | Examiner |
| US5926227(A) | 1999-07-01 | Schoner et al. | Applicant |
| US5931926(A) | 1999-08-01 | Yeung et al. | Applicant |
| US5953530(A) | 1999-09-01 | Rishi et al. | Applicant |
| US5960434(A) | 1999-09-01 | Schimmel | Applicant |
| US5961639(A) | 1999-10-01 | Mallick et al. | Applicant |
| US5966539(A) | 1999-10-01 | Srivastava | Applicant |
| US5974483(A) | 1999-10-01 | Ray et al. | Examiner |
| US5978902(A) | 1999-11-01 | Mann | Applicant |
| US5983332(A) | 1999-11-01 | Watkins | Examiner |
| US6002872(A) | 1999-12-01 | Alexander, III et al. | Applicant |
| US6002879(A) | 1999-12-01 | Radigan et al. | Applicant |
| US6009269(A) | 1999-12-01 | Burrows et al. | Applicant |
| US6029005(A) | 2000-02-01 | Radigan | Applicant |
| US6044419(A) | 2000-03-01 | Hayek et al. | Examiner |
| US6044434(A) | 2000-03-01 | Oliver | Examiner |
| US6049671(A) | 2000-04-01 | Slivka et al. | Applicant |
| US6058493(A) | 2000-05-01 | Talley | Applicant |
| US6059840(A) | 2000-05-01 | Click, Jr. | Applicant |
| US6072952(A) | 2000-06-01 | Janakiraman | Applicant |
| US6075929(A) | 2000-06-01 | MacLaren | Examiner |
| US6094716(A) | 2000-07-01 | Witt | Applicant |
| US6101524(A) | 2000-08-01 | Choi et al. | Applicant |
| US6105110(A) | 2000-08-01 | Watkins | Examiner |
| US6112293(A) | 2000-08-01 | Witt | Applicant |
| US6115802(A) | 2000-09-01 | Tock et al. | Applicant |
| US6128677(A) | 2000-10-01 | Miller et al. | Applicant |
| US6151658(A) | 2000-11-01 | Magro | Examiner |
| US6151701(A) | 2000-11-01 | Humphreys et al. | Applicant |
| US6151704(A) | 2000-11-01 | Radigan | Applicant |
| US6154796(A) | 2000-11-01 | Kuo et al. | Applicant |
| US6161160(A) | 2000-12-01 | Niu et al. | Applicant |
| US6182195(B1) | 2001-01-01 | Laudon et al. | Applicant |
| US6209003(B1) | 2001-03-01 | Mattis et al. | Applicant |
| US6252876(B1) | 2001-06-01 | Brueckheimer et al. | Applicant |
| US6263410(B1) | 2001-07-01 | Kao et al. | Applicant |
| US6314471(B1) | 2001-11-01 | Alverson et al. | Applicant |
| US6341301(B1) | 2002-01-01 | Hagan | Applicant |
| US6473818(B1) | 2002-10-01 | Niu et al. | Examiner |
| US6738894(B1) | 2004-05-01 | Iwata et al. | Applicant |
| DE19710252(A1) | 1998-02-01 | Applicant | |
| EP171044(A2) | 1986-02-01 | Examiner | |
| EP422945 | 1991-04-01 | Applicant | |
| EP455966 | 1991-11-01 | Applicant | |
| EP537098 | 1993-04-01 | Applicant | |
| EP855648 | 1998-07-01 | Applicant | |
| EP864979 | 1998-09-01 | Applicant | |
| GB2307760 | 1997-06-01 | Applicant | |
| JP2253462(A) | 1990-10-01 | Examiner |
Non-Patent Literature (42)
- “Method of Tracing Events in Multi-Threaded OS/2 Applications,” IBM Tech. Disclosure Bulletin, Sep. 1993, pp. 19-22.Applicant
- Adelberg, Brad et al., “The Strip Rule System for Efficiently Maintaining Derived Data,” Sigmod Record, Association for Computing Machinery, New York, vol. 26, No. 2, Jun. 1, 1997.Applicant
- Agrawal, Gagan et al., “Interprocedural Data Flow Based Optimizations for Compilation of Irregular Problems,” Annual Workshop on Languages and Compilers for Parallel Computing, 1995.Applicant
- Agrawal, Hiralal, “Dominators, Super Blocks and Program Coverage,” 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, Jan. 17-21, 1994.Applicant
- Alverson, Gail et al., “Processor Management in the Tera MTA System,” 1995.Applicant
- Alverson, Gail et al., “Scheduling on the Tera MTA,” Job Scheduling Strategies for Parallel Processing, 1995.Applicant
- Alverson, Gail et al., “Tera Hardware-Software Cooperation,” Proceedings of Supercomputing 1997, San Jose, California, Nov. 1997.Applicant
- Alverson, Robert et al, “The Tera Computer System,” Proceedings of 1990 ACM International Conference on Supercomputing, Jun. 1990.Applicant
- Anderson, Jennifer, et al., “Continuous Profiling: Where Have All the Cycles Gone?,” Operating Systems Review, ACM Headquarters, New York, vol. 31, No. 5, Dec. 1, 1997.Applicant
- Bailey, D.H. et al., “The NAS Parallel Benchmarks—Summary and Preliminary Results,” Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, California, 1991.Applicant
- Briggs, Preston et al., “Coloring Heuristics for Register Allocation,” Department of Computer Science, Rice University, Houston, Texas, Jun. 1989.Applicant
- Briggs, Preston et al., “Coloring Register Pairs,” ACM Letters on Programming Languages and Systems, vol. 1, No. 1, Mar. 1992, pp. 3-13.Applicant
- Briggs, Preston et al., “Effective Partial Redundancy Elimination,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 29, No. 6 Jun. 1, 1994.Applicant
- Callahan, David et al., A Future-Based Parallel Language for a General-Purpose Highly-Parallel Computer, Languages and Compilers for Parallel Computing, MIT Press, 1990.Applicant
- Callahan, David et al., “Improving Register Allocation for Subscripted Variables,” Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, White Plains, New York, Jun. 20-22, 1990.Applicant
- Callahan, David et al., “Register Allocation via Hierarchical Graph Coloring,” Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Canada, Jun. 26, 28-1991.Applicant
- Callahan, David, “Recognizing and Parallelizing Bounded Recurrences,” Aug. 1991.Applicant
- Chaudhuri, Surajit et al., “An Overview of Data Warehousing and OLAP Technology,” Sigmod Record, Association for Computing, New York, vol. 26, No. 1, Mar. 1997.Applicant
- Chow, Fred C. et al.,“The Priority-Based Coloring Approach to Register Allocation,” ACM Transactions on Programming Languages and Systems, vol. 12, No. 4, Oct. 1990, pp. 501-536.Applicant
- Click, Cliff, “Global Code Motion, Global Value Numbering,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 30, No. 6, Jun. 1, 1995.Applicant
- Cook, Jonathan E. et al., “Event Based Detection of Concurrency,” SIGSOFT '98 ACM, 1998, pp. 34-45.Applicant
- Davidson, Jack W. et al., “Reducing the Cost of Branches by Using Registers, Proceedings of the 17th Annual Symposium on Computer Architecture,” Seattle, Washington, May 28-31, 1990.Applicant
- Galarowicz, Jim et al., “Analyzing Message Passing Programs on the Cray T3E with PAT and VAMPIR,” Research Report, “Online!”, May 1998.Applicant
- George, Lal et al., “Iterated Register Coalescing,” ACM Transactions on Programming Languages and Systems, vol. 18, No. 3, May 1996, pp. 300-324.Applicant
- Goldman, Kenneth J., “Introduction to Data Structures,” 1996 (retrieved from Internet, http://www.cs.wustl.edu{kjg/CS101—SP97/Notes?DataStructures/structures.html.Applicant
- Hayashi, H. et al., “ALPHA: A High Performance Lisp Machine Equipped with a New Stack Structure and Garbage Collection System,” 10th Annual International Symposium on Computer Architecture, 1983.Applicant
- Ji, Minwen et al., “Performance Measurements for Multithreaded Programs,” SIGMETRICS '98, ACM, 1998, pp. 168-170.Applicant
- Knoop, Jens et al., “The Power of Assignment Motion,” ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, La Jolla, California, Jun. 18-21, 1995.Applicant
- Kolte, Priyadarshan et al., “Load/Store Range Analysis for Global Register Allocation,” ACM-SIGPLAN, Jun. 1993.Applicant
- Korry, Richard et al., “Memory Management in the Tera MTA System,” 1995.Applicant
- Lang, Tomas et al., “Reduced Register Saving/Restoring a Single-Window Register Files,” Computer Architecture News, vol. 14, No. 3, Jun. 1986.Applicant
- Linton, Mark A., “The Evolution of Dbx, ” USENIX Summer Conference, Jun. 11-15, 1990.Applicant
- Major System Characteristics of the TERA MTA, 1995.Applicant
- Ram, Aswhin et al., “Parallel Garbage Collection Without Synchronization Overhead,” 12th Annual Symposium on Computer Architecture, Jun. 17, 1985.Applicant
- Shim, SangMin et al., “Split-Path Enhanced Pipeline Scheduling for Loops with Control Flows,” IEEE Dec. 2, 1998.Applicant
- Smith, Burton, “Opportunities for Growth in High Performance Computing,”, Nov. 1995.Applicant
- Smith, Burton, “The End of Architecture,” Keynote Address Presented at the 17th Annual Symposium on Computer Architecture, Seattle, Washington, May 29, 1990.Applicant
- Smith, Burton, The Quest for General-Purpose Parallel Computing.Applicant
- Sreedhar, Vugranam C. et al., “Incremental Computation of Dominator Trees,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 30, No. 3, Mar. 1, 1995.Applicant
- Tera Computer Company, “TERA MTA Principles of Operation”, Nov. 18, 1997, 257 pages.Applicant
- Touzeau, Roy F., “A Fortran Compiler for the FPS-164 Scientific Computer,” Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, SIGPLAN Notices 19(6):48-57, Jun. 1984.Applicant
- Tsai, Jenn-Yuan et al., “Performance Study of a Concurrent Multithreaded Processor,” IEEE, 1998, pp. 24-35.Applicant