US 7,536,690 B2Grant
Deferred task swapping in a multithreaded environment
Issue Date:2009-05-19
•26 Claims
•24 Drawing Sheets
Abstract
A method and system that prepares a task for being swapped out from processor utilization that is executing on a computer with multiple processors that each support multiple streams. The task has one or more teams of threads, where each team represents threads executing on a single processor. The task designates, for each stream that is executing a thread, one stream as a team master stream and one stream as a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has saved its state and has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped when it has saved its state and each other team has notified that it is ready to be swapped out.
Metadata
Assignee
- Cray Inc.
Inventors
- Gail A. Alverson
- Charles David Callahan, II
- Susan L. Coatney
- Brian D. Koblenz
- Richard D. Korry
- Burton J. Smith
Application Information
Application Number:US 10/663,895
Filing Date:2003-09-16
Priority Date:1998-11-13
Art Unit:2195
Classifications
IPC:
G06F9/46G06F9/44
Patent Drawings (24 sheets)
Description
Cross-Reference to Related Application
[0001] This is a divisional of an claims priority to U.S. patent application Ser. No. 09/192,205, filed Nov. 13, 1998, now U.S. Pat No. 6,952,827, and which is hereby incorporated herein by reference.
Technical Field
[0002] The present invention relates to an interface between a user program and an operating system and, more particularly, to such an interface in a multithreaded environment.
Background
[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: the stream limit (slim), the current number of streams (scur), and the number of reserved streams (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]
| VALUE | MODE | LOAD | STORE | |
|---|---|---|---|---|
| 0 | normal | read regardless | write 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 | |||
[0018] 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.
[0019] 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.
[0020] 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.
[0021] 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.
[0022] The appendix contains the “Principles of Operation” of the MTA, which provides a more detailed description of the MTA.
Summary
[0023] Embodiments of the present invention provide a method system for placing a task with multiple threads in a known state, such as a quiescent state. To effect the placing of the task in the known state, each thread of the task is notified that it should enter the known state. In response to receiving the notification, each of the threads enter the known state. When in the known state, certain actions can be performed safely without concern without corrupting the state of the task. The known state of the task may be the execution of idle instructions by each of the threads or by stopping the execution of instructions by the threads (e.g., quitting the streams). The notification may be by raising a domain signal for the protection domain in which the task is executing. The notification may also be initiated by the task itself by, for example, sending a request to the operating system. Prior to entering the known state, the threads may save their state information so that when the known state is exited the threads can restore their saved state and continue execution. The task, in response to receiving the notification, may also notify the operating system that the task is blocked from further productive use of the processor until an event occurs. In this way, rather than having the task continue to execute idle instructions (e.g., instructions looping checking for an event to occur), the operating system may assign the processor to another task. The operating system may also defer re-assigning the processor to the task until an event occurs that is directed to that task. Once a task has entered the known state, various actions can be performed relative to the task. For example, the operating system may assign the processor resources used to by that task to another task. Also, a debugger, which may be executing as one of the threads of the task, can access the state information saved by the other threads of the task. A designated thread of the task may also process operating system signals when the other threads of the task are in the known state. After the signals are processed by the thread, the other threads can be allowed to exit the known state. More generally, after the actions to be performed while the task is in the known state, then the threads of the task can exit the known state. A task that has entered a known state may exit the known state by receiving a notification to exit the known state. Upon receiving the notification, each thread exits the known state by executing instructions that were to be executed prior to entering the known state or more generally continuing with productive work (e.g., non-idle instructions). Upon receiving the notification, one thread may be designated as a master thread for causing the other threads to exit their known state (e.g., creating streams). The master thread may also perform signal processing prior to allowing the other threads to exit their known state.
[0024] One embodiment of the present invention provides a method in a multithreaded computer for preparing a task to be “swapped out” from processor utilization by placing the task in a known state. The computer has a processor with multiple streams for executing threads of the task. To prepare for being swapped out, the task designates one stream that is executing a thread to be a master stream. The task then saves the state of each stream that is executing a thread. Under control of each stream that is not the master stream, the task quits the stream. Under control of the master stream, the task notifies the operating system that the task is ready to be swapped out. The operating system can then swap the task out from processor utilization. In another embodiment, the method prepares a task that is executing on a computer with multiple processors. The task has one or more “teams” of threads where each team represents threads executing on a single processor. The task designates, for each stream, one stream that is executing a thread to be a team master stream. The task then designates one stream that is executing a thread to be a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped out when each of the other teams have notified the operating system that that team is ready to be swapped out.
[0025] Other aspects of the present invention provide for a server to coordinate assignment of resources with various clients. The server initially assigns a resource to a client. The server then receives notification from the client assigned to the resource that the client is waiting for an occurrence of an event before the resource can be productively used. The server, upon receiving the notification, assigns the resource from the client and does not reassign that resource to the client until after the event occurs. In one embodiment, the server is an operating system, the clients are tasks, and the resource is a processor or protection domain. The server may receive the notification in response to a request that the task save its state information prior to having that resource un-assigned. After that external event occurs, the server can then reassign the resource to the task.
[0026] Another aspect of the present invention provides a method in a computer system for returning to a task a stream that is executing an operating system call that is blocked. The computer system has a processor with multiple streams. To return the stream, the operating system executing on a stream invokes a function provided by the task. The invoked function then executes instructions on that stream to effect the return of the stream to the task. The operating system then notifies the task when the operating system call is complete. Upon receiving the notification, the task can then continue the execution of the thread that invoked the blocking operating system call.
[0027] More generally, the present invention assigns a processor resource to a task after a thread of the task invokes an operating system call that will block waiting for the occurrence of an event. To assign the processor resource back to the task, the operating system invokes a routine of the task so that that routine can assign the processor resource to another thread of the task. In this way, the task can continue to execute other threads even though one of its threads may be blocked on operating system call.
[0028] Another aspect of the present invention provides, a method in a computer system for performing an inter-thread long jump from a long jump thread to a set jump thread. To effect the inter-thread long jump, the long jump thread receives an indication of a set jump location that was set by the set jump thread. The long jump thread then determines whether the set jump thread is the same thread that is currently executing. When the set jump thread is not the same thread that is currently executing, the long jump thread sets the state of the set jump thread to next execute a long jump indicating the set jump location. When the set jump thread executes its next instructions, an intra-thread long jump is performed.
Brief Description of the Drawings
[0029] FIG. 1 provides a high-level overview of the MTA.
[0030] FIG. 2 is a block diagram illustrating components of the operating system and user programs in one embodiment.
[0031] FIG. 3 is a flow diagram of the primary exception handler routine.
[0032] FIG. 4 is a flow diagram of the domain_signal_handler routine.
[0033] FIGS. 5A and 5B are flow diagrams of the last_stream_domain_signal_handler routine.
[0034] FIG. 6 is a flow diagram of the work_of_final_stream_in_task function.
[0035] FIG. 7 is a flow diagram of the process_signals function.
[0036] FIG. 8 is a flow diagram of the swap_restart_stream function.
[0037] FIG. 9 is a flow diagram of the slave_return_from_swap routine.
[0038] FIG. 10 is a block diagram of data structures used when swapping a task.
[0039] FIG. 11 is a flow diagram of the user_entry_stub routine.
[0040] FIG. 12 is a flow diagram of the rt_return_vp function.
[0041] FIG. 13 is a flow diagram of the rt_return_thread function.
[0042] FIG. 14 is a flow diagram of the tera_return_stream operating system call.
[0043] FIG. 15 is a flow diagram of a trap handler routine for handling data blocked exceptions that are raised when waiting for an operating system call to complete.
[0044] FIG. 16A is a diagram illustrating the synchronization of the user program and the operating system when the user program invokes an operating system call that blocks. FIG. 16B illustrates the Upcall Transfer (ut) data structure.
[0045] FIG. 17 is a flow diagram of the basic longjmp routine.
[0046] FIG. 18 is a flow diagram of the indirect_longjmp routine.
[0047] FIG. 19 is a flow diagram of the processing performed when the state of the thread is “blocked.”
[0048] FIG. 20 is a flow diagram of the processing performed when the state of the thread is running.
[0049] FIG. 21 is a flow diagram of the check_on_blocked_os_call routine.
Detailed Description
[0050] Embodiments of the present invention provide an interface between a user program and an operating system in an MTA computer. In one aspect of the present invention, the user program cooperates with the operating system in saving the state of the user program when the operating system wants to allocate the protection domain in which the user program is executing to another user program so that the other user program may start executing its instructions. The operating system allows each user program to execute for a certain time slice or quantum before “swapping out” the user program from its protection domain. The operating system notifies the user program when the quantum expires. Each stream that is allocated to that user program receives the notification. Upon receiving the notification, each stream saves its state and quits except for one stream that is designated as a master stream. The master stream saves its state and waits for all the other streams to quit. The master stream then notifies the operating system that the user program is ready to be swapped out of its protection domain. The master stream also notifies the operating system of the number of streams that were created (or alternatively reserved) when the quantum expired. When the operating system decides to allow the user program to start executing again (i.e., be “swapped in”), the operating system restarts the thread that was executing in the master stream. That thread then creates the other streams and restarts each of the threads executing where they left off using the saved state. The operating system may defer swapping in the user program until sufficient streams (as indicated by the user program when it was swapped out) are available so that when the user program is swapped in, it can create the same number of streams it quit when swapping out.
[0051] In another aspect of the present invention, the operating system returns streams to the user program when the thread that was executing on the stream is blocked on an operating system call. Each user program may be limited to a certain number of streams by the operating system. A user program can create streams up to this limit and start different threads executing in each of the created streams. When a thread makes an operating system call, the operating system starts executing on the same stream on which the thread was executing. When the operating system call blocks (e.g., waiting for user input), the operating system returns that stream to the user program so that the user program can schedule another thread to execute on that stream. The operating system eventually notifies the user program when the operating system call completes, and the user program can restart the thread that was blocked on that operating system call. In this way, the user program can continue to use all of its created streams even though a thread is blocked on an operating system call.
[0052] In another aspect of the present invention, Unix-type set jump and long jump inter-thread behavior is supported. When invoked, a set jump function stores the current state of the stream in a set jump buffer. The current state includes the return address for that invocation of the set jump function. When a long jump function is eventually invoked passing the set jump buffer as a parameter, the long jump function deallocates memory (e.g., stack frames) allocated since the set jump function was invoked, restores the stream state stored in the set jump buffer, and jumps to the return address. If the long jump function is invoked by a thread (“the long jump thread”) different from the thread (“the set jump thread”) that invoked the set jump function, the long jump function first locates the state information for the set jump thread. The long jump function then sets the program counter in that state information to point to an instruction that invokes the long jump function passing the set jump buffer. When the set jump thread then executes its next instruction, an intra-thread long jump is performed.
[0053] FIG. 2 is a block diagram illustrating components of the operating system 210 and user programs 220 in one embodiment. The operating system includes a processor scheduler 211, a task list 212, and instructions implementing various operation system calls 213. The processor scheduler assigns tasks to execute in the protection domains of a processor, such tasks are referred to as active tasks. The term “task” refers to a running user program that may currently be either active or inactive. Periodically (e.g., when a time quantum expires), the processor scheduler determines whether an inactive task should be made active. If all the protection domains are already assigned to active tasks, then the operating system will swap out an active task, making it inactive, and swap in an inactive task making it active. If an MTA computer has multiple processors, then the operating system may assign multiple protection domains on different processors to the task. In this way, computations of the task can be executed simultaneously, not only on multiple streams on one processor, but also on multiple streams on multiple processors. The threads of execution of a task that are executing on one processor are referred to as a “team” of the task. Thus, a task comprises one or more teams, and each team comprises one or more threads of execution.
[0054] Each user program 220 includes user code 221 and a user runtime 222. The user code is the application-specific code of the user program, and the user runtime is code provided to assist the user program in managing the scheduling of threads to streams. The user runtime includes virtual processor code 223 and a thread list 224. The virtual processor code is responsible for deciding which thread to assign to the stream on which the virtual processor code is executing. When a task creates a stream, the virtual processor code is executed to select which thread should be assigned to that stream. When a thread completes, the virtual processor code also is executed to determine the next thread to assign to that stream. If threads are not currently available to assign to the stream, the virtual processor code may quit the stream so that the stream can be assigned to another task. The user runtime also provides standard trap handlers for handling various exceptions with a standard behavior. The user code can override the standard behaviors by providing customized trap handlers for various exceptions.
Task Swap Out
[0055] The processor scheduler of the operating system coordinates the allocation of the processor to the various tasks that are currently ready to be executed. As described above, each processor has 16 protection domains and can thus be simultaneously executing up to 15 tasks with the operating system being executed in the other domain. The processor scheduler allows each task to execute for a certain time quantum. When the time quantum expires for a task, the processor scheduler raises the domain signal for the protection domain of that task to initiate a swap out for that task. The swapping in and swapping out of tasks requires cooperation on the part of the task. To swap out a task, the operating system asks the task to save its state and quit all its streams, but one. The one remaining stream then notifies the operating system that the state of the task has been saved and that another task can be swapped into that protection domain. If the task ignores the notification, then the operating system can abort the task.
[0056] The operating system notifies the task of the impending swap out by raising the domain_signal, which causes each stream of that task to trap (assuming the domain_signal trap is enabled) and to start executing its primary trap handler, whose address is stored in register T0. The primary trap handler saves the state of the thread executing on that stream and then invokes a domain_signal_handler routine. The task may be executing on multiple streams and on multiple processors. To ensure that the state of all executing threads are properly saved and that the task quits all its streams in an orderly manner, each team of the task designates one of the streams executing a thread of the task to be a team master stream, and the team master streams designate one of the team master streams to be a task master stream. In one embodiment, the team master stream is the thread that first increments a team master variable, and the task master stream is that team master stream that first notifies (or alternatively that last notifies) the operating system that its team is ready to be swapped out.
[0057] Each team master stream waits for all other streams of the team to quit and then performs some clean-up processing before notifying the operating system that all the other streams of the team have quit and that the team is ready to be swapped out. Analogously, the task master stream waits until all the team master streams have notified the operating system and performs some clean-up processing for the task before notifying the operating system that the task is ready to be swapped out. The team master streams and the task master stream notify the operating system by invoking an operating system call. The operating system then takes control of the last stream in each team and can start another task executing on that stream as part of swapping in that other task.
[0058] When the operating system eventually decides to swap in the task, the operating system returns from the operating system calls of the team master streams. A task master stream processes any Unix signals that have arrived and then releases all the other team master streams to restore the saved states. Each team master stream creates a stream for each thread that was running when the task was swapped out and sets the state of the created streams to the saved states of the threads.
[0059] FIGS. 3-11 illustrate the saving and restoring of a task state when the task is swapped out and then swapped in. In one embodiment, this saving and restoring is provided by the user runtime, which is started when the domain_signal_handler routine is invoked. The data structures used when the task state is saved and restored are shown in FIG. 10 . FIG. 3 is a flow diagram of the primary exception handler routine. The address of the primary exception handler routine is stored in register T0. The primary exception handler routine determines which exception has been generated and invokes an appropriate secondary exception handler to process the exception. In step 301, the routine saves the state of the thread in a save_area data structure and disables the domain signal trap. The primary exception handler may save only partial thread state information depending on the type of exception. For example, if the exception is a data blocked exception, then the primary exception handler may save very little state information so that the handling can be lightweight if the secondary handler decides to retry access to the blocked memory location. In step 302, if a domain_signal exception has been raised, then routine continues at step 303, else the routine continues to check for other exceptions. In step 303, the routine invokes the domain_signal_handler routine to process the exception. The domain_signal_handler routine returns after the task has been swapped out and then swapped in. In step 304, the routine restores the thread state and returns to the user code.
[0060] FIG. 4 is a flow diagram of the domain_signal_handler routine. This routine is invoked by the primary trap handler when the raising of the domain_signal caused the trap. The domain_signal of a protection domain is raised by the operating system when the operating system wants to swap out the task executing on that protection domain. The primary trap handler is executed by each stream in the protection domain and saves most of the state of the stream. This routine is passed a save_area data structure that contains that state. Each stream links its save_area data structure onto a linked list so that the state is available when the task is swapped in. If the stream is not a team master stream, that is, it is a slave stream, then the stream quits. If the stream is the team master stream, the routine then invokes the last_stream_domain_signal_handler routine, which does not return until the team master stream is swapped in. When that invoked routine returns, this routine returns to the primary trap handler, which restores, from the save_area data structure, the state of the stream at the time when the domain_signal was raised.
[0061] In step 401, the routine locks the thread. The locking of the thread means that the thread running on the stream will not give up the stream on a blocking call to the operating system or any other event such as a synchronization retry-limit exception. In step 402, the routine saves any remaining state that was not saved by the primary trap handler. In step 404, the routine invokes the preswap_parallel_work function to perform any necessary work for the running thread prior to swapping out the task. In step 405, the routine stores the address of the return point for this thread, upon swap in, in the return_linkage variable of the save_area data structure. In this embodiment, the address of slave_return_from_swap function is stored as the return point. In step 406, the routine fetches and adds to a team master variable. The first stream to fetch and add to the team master variable is the team master stream for the team. In step 407, if this stream is the team master stream, then the routine continues at step 408, else the routine continues at step 415. The team master stream executes steps 408-414. In step 408, the routine waits for all other streams within the team to quit. In step 409, the routine links the save_area data structure of the stream to the head of the linked list of save_area data structures. In step 410, the routine invokes the last_stream_domain_signal_handler routine. This invoked routine returns only after this thread starts running again after being swapped in. In step 411, the routine restores the remaining state that was saved in step 402. In step 412, the routine invokes the post_swap_parallel_work function to perform any necessary work after the thread is swapped in. In step 413, the routine clears the domain_signal flag in the save_area data structure, so that the exception is cleared when the primary trap handler restores the state from the save_area data structure. In step 414, the routine unlocks the thread and returns to the primary trap handler. Steps 415 and 416 are executed by the slave streams. In step 415, the routine links the save_area data structure to the linked list. In step 416, the routine quits the stream, which means that the stream is available to be allocated to another task, such as the task to be swapped in.
[0062] FIGS. 5A and 5B are flow diagrams of the last_stream_domain_signal_handler routine. This routine is invoked by the team master stream of each team. This routine increments a number of teams variable, which is then used for barrier synchronization when the task is swapped in. This routine then invokes an operating system call to notify the operating system that the team has completed saving its state and quitting the other streams. That operating system call does not return until the task is swapped back in, except for the call by the task master stream, which returns immediately. The task master stream is the last stream that makes this operating system call. The task master then performs an operating system call to notify the operating system that the task has completed saving its state. When swapped in, the first stream that fetches and adds to a signal wait variable is designated as the task master stream for the swap in. The task master stream creates a stream to process any Unix signals, and all the other team master streams wait until the Unix signal processing is complete. The routine then invokes a routine to restart the slave streams for the team.
[0063] In step 502, the routine fetches and adds to the num_teams variable in the task swap header data structure. In step 503, the routine invokes the tera_team_swapsave_complete operating system call passing the num_streams variable of the team swap header. This operating system call returns immediately when the last team master stream invokes it and returns as its return value a value of 1. For all other team master streams, this operating system call does not return until the task is swapped in. The last team master stream to invoke this operating system is designated as the task master stream. In step 504, if this stream is the task master stream, then the routine continues at step 505, else the routine continues at step 507. In step 505, the routine invokes the work_of_final_stream_in_task function. This invoked function does not return until the task is swapped in. Steps 507-521 represent processing that is performed when the task is swapped in. In steps 507-508, the routine fetches and adds a 1 to the signal_wait variable of the task swap header and waits until that variable equals the num_teams variable in the task swap header. Thus, each team master stream waits until all the other team master streams reach this point in the routine before proceeding. The first stream to increment the signal_wait variable is the task master stream for the swap in. Alternatively, the same stream that was designated as the task master for the swap out can also be the task master for the swap in. In steps 509-514, the routine enables trapping for the domain_signal so that subsequent raising of the domain_signal will cause a trap. The task master stream then processes the Unix signals. During the processing of Unix signals, another domain_signal may be raised. Thus, another swapout can occur before the states of the streams are completely restored. The trap handler handling the domain_signal can handle nested invocations in that the trap handler can be executed again during execution of the trap handler. Therefore, an array of team and swap header data structures is needed to handle this nesting. In step 509, the routine enables the trapping of the domain_signal. In step 510, if this stream is the task master stream, then the routine continues at step 511, else routine continues at step 513. In_step 511, the routine invokes the process_signals function to process the Unix signals. In one embodiment, the task master stream creates a thread to handle the Unix signals. In step 512, the routine sets the signal_wait$ synchronization variable of the task swap header to zero, in order to notify the other team master streams that the processing of the Unix signals is complete. In step 513, the routine waits for the notification that the task master stream has processed the Unix signals. In step 514, the routine disables the domain_signal to prevent nested handling of domain_signals. The first save_area data structure in the linked list contains the state of team master stream when the task was swapped out. In step 515, the routine gets the next save_area data structure from the team swap header. In step 516, the routine clears the team swap header. In steps 517 and 518, the routine fetches and adds a −1 to the num_teams variable in the task swap header and waits until that variable is equal to 0. Thus, each team master stream waits until all other team master streams reach this point in the processing. Thus, these steps implement a synchronization barrier. One skilled in the art would appreciate that such barriers can be implemented in different ways. In step 519, if this stream is the task master stream, then the routine continues at step 520, else routine continues at step 521. In step 520, the routine clears the task swap header, to initialize it for the next swap out. In step 523, the routine invokes the swap_restart_streams function to restart the slave streams of the team by creating streams, retrieving the save_area data structures, and initializing the created streams. This routine then returns.
[0064] FIG. 6 is a flow diagram of the work_of_final_stream_in_task function. This function determines whether the task is blocked and performs an operating system call to notify the operating system that the task has completed its save processing prior to being swapped out. The routine passes to the operating system call the indication of whether the task is blocked. If the task is blocked, the operating system can decide not to schedule this task until an external event occurs that would unblock this task. In this way, the operating system can allocate the resources of the processors to other tasks that are not blocked. A task is blocked when it is waiting only on an external event. In one embodiment, a task is considered blocked when all the streams of the task are executing the virtual processor code and the stream is not in the process of starting a thread, when no threads are ready to execute. However, other criteria can be used to determine whether a task is blocked. For example, the virtual processor code can increment a counter when it determines that it is blocked and when that counter equals the number of streams of the task, then the task can be considered to be blocked. More generally, a task can notify the operating system whenever it becomes blocked so that the operating system can decide whether to swap out the task. In step 601, the routine determines whether the task is blocked. In step 602, the routine invokes the tera_task_saveswap_complete operating system call passing an indication of whether the task is currently blocked. This invocation of the operating system call does not return until the task is swapped in. The routine then returns.
[0065] FIG. 7 is a flow diagram of the process_signals function. This function loops retrieving and processing each Unix signal. The user program may have registered with the user runtime customized signal handlers for processing the various Unix signals. In step 701, the function creates a thread control block for a new thread that is to process the Unix signals. In step 702, the function invokes the tera_get_signal_number operating system call. This operating system call returns the value of the signal number in the sig_num variable. If there are no Unix signals left to be handled, then this operating system call returns a 0. In step 703, the function saves the stream status word (SSW). In steps 704-708, the function executing in the new thread loops processing each signal. In step 704, if the sig_num variable is not equal to zero, then the function continues at step 705, else the function continues at step 708. In step 705, the function locates the handler for the returned signal number. In step 706, the function invokes the located handler. In step 707, the function invokes the tera_get_signal_number operating system call to retrieve the next signal number and loops to step 704. In step 708, the function restores the saved SSW and returns.
[0066] FIG. 8 is a flow diagram of the swap_restart_stream function. This function creates a stream for each of the threads that were executing when the stream was swapped out and restarts the thread executing in that stream. In step 801, the function retrieves and discards the first save_area data structure in the linked list. The first save_area data structure is the data structure for the team master stream, which uses the stream provided by the operating system upon return from the tera_team_swapsave_complete operating system call of the team master stream. In steps 802-806, the function loops creating a stream for each save_area data structure in the link list. In step 802, the function retrieves the next save_area data structure in the linked list. In step 803, if all the save_area data structures have already been retrieved, then the function returns, else the function continues at step 804. In step 804, the function creates a stream. The function loops to step 802 to retrieve the next save_area data structure. The newly created stream initializes the thread based on the retrieved save_area data structure and executes at the slave_return_from_swap address that was stored in the save_area data structure before the task was swapped out.
[0067] FIG. 9 is a flow diagram of the slave_return_from_swap routine. This routine is invoked when the slave stream is created when the task is swapped in. This routine returns to the primary trap handler at a point after the invocation of the domain_signal_handler routine. In step 901, the routine restores the remaining state that was stored during the saving before the swap out. In step 902, the routine invokes the post_swap_parallel_work_routine to perform any application-dependent work upon swap in. In step 903, the routine unlocks the thread and returns to the routine that called the domain_signal_handler routine. FIG. 10 is a block diagram of data structures used when swapping a task. Each thread has a thread control block 1001 that contains information describing the current state of the thread and points to a team control block 1002 of the team of which the thread is a member. The team control block contains information describing the team and points to a task control block 1005 of the task of which the team is a member. The task control block contains information describing the task. The team control block contains a pointer to a team swap header 1003 that contains information relating to the swapping of the team. The team swap header contains a pointer to a linked list of save_area data structures 1004 that are used to restart the threads when the team is swapped in. The task control block contains a pointer to a task swap header 1006. The task swap header contains information relating to the swapping of the task.
Operating System/Runtime Interface
[0068] The operating system implements operating system calls that are provided to the user programs. When an operating system call is invoked, it begins executing on the same stream on which the invoking thread was executing. Certain operating system calls may be of indefinite duration. For example, an operating system call to return user input will not return until the user eventually inputs data. While the operating system call is waiting for user input, the user program can continue executing its other threads on its other streams. However, the user program effectively has one less stream on which to execute threads, because one of the streams is blocked on the operating system call.
[0069] To prevent this “taking” of a stream from the user program during a blocking operating system call, the operating system and the user runtime implement an upcall protocol to return the stream to the user program while the operating system call is blocked. An “upcall” occurs when the operating system invokes a function of the user program. The user program, typically the user runtime of the application program, can register special purpose functions with the operating system, so that the operating system knows which functions to invoke when it makes an upcall to the user program. To support the returning of a stream that is blocked in an operating system call, the user runtime registers a “rt_return_vp” function and a “rt_return_thread” function with the operating system.
[0070] When an operating system call that will block is invoked, the operating system (executing on the stream that invoked the operating system call) invokes the rt_return_vp function of the user program. This invocation returns the stream to the user program. The virtual processor code of the user program can then_select another thread to execute on that stream while the operating system call is blocked. Eventually, the operating system call will become unblocked (e.g., the user has finally input data). When the operating system call becomes unblocked, the operating system (executing on one of its own streams) invokes the rt_return_thread function of the user program to notify the user program that the operating system call has now completed. The rt_return_thread function performs the necessary processing to restart (or at least schedule) the thread that was blocked on the operating system call. The rt_return_thread function then invokes the tera_return_stream operating system call to return the stream to the operating system. A malicious user program could decide not to return the stream to the operating system and instead start one of its threads executing on that stream. Thus, a user program could increase the number of streams allocated to it to an amount greater than the slim value set the operating system. The operating system can mitigate the effects of such a malicious user program by not returning any more streams or, alternatively, killing the task when it detects that the user program has failed to return a certain number of the operating system streams.
[0071] FIGS. 11-16 illustrate the returning of a stream to a user program when an operating system call blocks. In one embodiment, this processing is performed by the user runtime. FIG. 11 is a flow diagram of the user_entry_stub routine. This routine is a wrapper routine of an operating system call. This routine allocates a thread control block and then invokes the operating system call passing that thread control block. A new thread control block is needed because the rt_return_vp function and the rt_return_thread function may be executing at the same time on different streams. In particular, the rt_return_vp function may be executing in the stream returned by the operating system, and the rt_return_thread function may be executing in the operating system stream. Thus, the rt_return_vp function is bound to this newly allocated thread control block. When the operating system call returns, this routine waits until the operating system stream is returned to the operating system and then deallocates the thread control block and returns. In step 1101, the routine allocates a spare thread control block. In step 1102, the routine sets the spare_thread_control_block variable in the upcall transfer (“ut”) data structure to point to this spare_thread_control_block. The ut data structure, described below in detail, contains information and synchronization variables that support the return of a stream to the user programs. In step 1103, the routine sets the os_call variable of the thread control block that is not the spare thread control block to point to the address of the ut data structure. In step 1104, the routine enters the operating system passing the os_call variable to invoke the operating system call. In step 1105, upon return, if the operating system call was blocked, as indicated by the was_blocked variable of the ut data structure, then the routine continues at step 1106, else the routine continues at step 1107. In step 1106, the routine reads from the notify_done$ synchronization variable of the ut data structure. The full/empty bit of this synchronization variable is initially set to empty. The routine waits on this synchronization variable until the operating system call writes to it so that its full/empty bit is set to full, indicating that the operating system stream has been returned. In step 1107, the routine then deallocates the spare thread control block. In step 1108, the routine writes a 0 into the os_call variable of the thread control block and returns.
[0072] FIG. 12 is a flow diagram of the rt_return_vp function. This function is invoked by the operating system to return a stream to the user program that invoked a blocking operating system call. This function is passed the identification of the thread that invoked the blocking operating system call and its stream status word (SSW). In step 1201, the function receives the thread control block for this thread. In step 1202, the function increments the os_outstanding_threads variable of the team control block for this thread. This variable is used to keep track of the number of threads that are blocked in operating system calls. In step 1203, the function sets the ut pointer to the value in the os_call variable of the thread control block, which was set in the user entry_stub routine. In step 1204, the function writes the passed identification of the thread into the call_id$ synchronization variable of the ut data structure. This sets the full/empty bit of the synchronization variable to full possibly after blocking. The call_id$ synchronization variable is used by the thread executing on the stream. The thread will spin in step 1206, attempting to write to the call_id$ synchronization variable. This spinning will wait until the full/empty bit of the synchronization variable is set to empty. When the predefined number of retry writes have been tried to the call_id$ synchronization variable in step 1206, a data blocked exception is raised. The trap handler for that exception determines whether the stream is locked. When a stream is locked by a thread, no other thread can execute on the stream. If the stream is locked, the trap handler returns to retry writing to the call_id$ synchronization variable. Thus, if the stream is locked, this thread will spin, waiting until the full/empty bit of this synchronization variable is set to empty when the operating system call completes. If, however, the stream is not locked, the trap handler places this thread on a blocked list and invokes the virtual processor code to schedule another thread to execute on this stream. In step 1205, the function sets the was_blocked flag of the ut data structure so that the user_entry_stub routine will know whether to wait for the operating system stream to be returned to the operating system before the spare thread control block can be released. In step 1206, the routine writes a value of 0 into the call_id$ synchronization variable of the ut data structure. Since the full/empty bit of this synchronization variable was set to full in step 1204, step 1206 retries the write until the full/empty bit is empty or a data blocked exception is raised as described above. In step 1207, the function returns to the user_entry_stub at the return point from the operating system call.
[0073] FIG. 13 is a flow diagram of the rt_return_thread function. This function is invoked by the operating system to notify a user program that a thread that was blocked on an operating system call is now unblocked. This function is passed the thread control block of the blocked thread and a return value of the operating system call. In step 1301, the function sets the ut pointer to the value in the os_call variable of the thread control block. In step 1302, the function sets the return_value variable of the ut data structure to point to be passed return value. In step 1303, the function reads the call_id$ synchronization variable, which sets the full/empty bit of the synchronization variable to empty and allows the write in step 1206 to proceed. In step 1304, the function fetches and adds a −1 to the os_outstanding_threads variable of the team control block for the thread. This allows the team to keep track of the number of threads that are blocked on an operating system call. A team will not be swapped out while an operating system call from a stream on that team is blocked. In step 1305, the function invokes the tera_return_stream operating system call to return this stream to the operating system.
[0074] FIG. 14 is a flow diagram of the tera_return_stream operating system call. This routine is invoked to return the operating system stream that was used to notify the user program of the completion of an operating system call. This operating system call is passed a thread control block. In step 1401, the operating system call sets the ut pointer to the os_call variable in the thread control block. In step 1402, the operating system call disables trapping of the domain_signal exception. In step 1403, the operating system call writes a value of 0 to the notify_done$ synchronization variable of the ut data structure, which notifies the user_entry_stub routine that the operating system stream has been returned. In step 1404, the operating system invokes an operating system call to effect the returning of the stream to the operating system.
[0075] FIG. 15 is a flow diagram of a trap handler routine for handling data blocked exceptions that are raised when waiting for an operating system call to complete. The exception is raised by step 1206 of the rt_return_vp function. In step 1501, if the stream is locked, then the routine returns, else the routine continues at step 1502. In step 1502, the routine adds the thread to a list of blocked threads. In step 1503, the routine starts the virtual processor code for this stream so that another thread can start executing.
[0076] FIG. 16A is a diagram illustrating the synchronization of the user program and the operating system when the user program invokes an operating system call that blocks. The diagram illustrates the processing performed by the user stream 1601 and the processing performed by an operating system stream. 1602 The solid lines with arrows indicate flow of control from one routine within a stream to another routine within the same stream. The dashed lines indicate the interaction of the synchronization variables. The ellipses indicate omitted steps of the functions. The user program invokes an operating system call by invoking the user_entry_stub routine 1100. That routine in step 1104 invokes the operating system call. As indicated by the solid line between steps 1104 and 1603, the user stream starts executing the operating system call. The operating system call 1603 invokes the rt_return_vp function in step 1604. The rt_return_vp function 1200 stores a value the call_id$ synchronization variable in step 1204, which sets the full/empty bit of the synchronization variable to full. The rt_return_vp function then writes a value into the call_id$ synchronization variable in step 1206. Since the call_id$ synchronization variable just had a value stored in it, its full/empty bit is set to full. This write cannot succeed until the full/empty bit is set to empty. Thus, step 1206 will cause data blocked exception to be raised and the trap handler routine 1500 will be invoked. In step 1501, if the thread is locked, then the trap handler returns to the blocking synchronization write in step 1206. For a locked stream, the process of raising a data blocked exception and returning for a locked thread will continue until the full/empty bit of the call_id$ synchronization variable is set to empty when the operating system call completes. If, however, the thread is not locked, then the trap handler routine places the thread on the blocked pool and executes the virtual processor code to select another thread to execute on that stream. When the operating system call 1605 completes, the operating system in step 1606 invokes the rt_return_thread function 1300 of the user program. This invocation is within a stream allocated to the operating system. The rt_return_thread function 1300 reads the call_id$ synchronization variable in step 1303, which sets its full/empty bit to empty. As indicated by the dashed line, the writing of that synchronization variable in step 1206 then succeeds. The rt_return_vp function then completes the execution of step 1206 and continues to step 1207. In step 1207, the function returns to the location of the user_entry_stub routine immediately after the invocation of the operating system call. The user_entry_stub routine in step 1106 reads the notify_done$ synchronization variable. Since the full/empty bit of this synchronization variable is initially empty, this read blocks. The rt_return_thread routine in step 1305 invokes the tera_return_stream operating system call 1400 to return the stream to the operating system. In step 1403, the tera_return_stream operating system writes a value of 0 to the notify_done$ synchronization variable, which sets its full/empty bit to full. This releases the blocked read in step 1106 and the user entry_stub routine returns to the user code.
[0077] FIG. 16B illustrates the Upcall Transfer (ut) data structure 1650. The ut data structure 1650 is passed to the operating system when a blocking operating system call is invoked. The ut data structure 1650 contains information for synchronizing the return of the stream to the user program. The was_blocked flag 1655 is set to indicate whether the operating system call was blocked so that the user program can wait until the operating system stream is returned to the operating system and so that the function knows when return values need to be retrieved from the ut data structure 1650. The call_id$ synchronization variable 1660 is used to notify the thread that invoked the operating system call and that has locked the thread, that the operating system call is complete. The notify_done$ synchronization variable 1665 is used to notify the thread that the operating system stream has been returned. The spare_tcb pointer 1670 points to the spare thread control block that is used when the operating system notifies the user program that the operating system call is complete. The return_value variable 1675 contains the return value of the operating system call.
Inter-Thread Long Jumps
[0078] The Unix operating system supports the concepts of a “long jump.” A long jump transfers control from a certain point in a program to an arbitrary return point in the program that was previously identified. A program can identify the return point by invoking a setjmp routine. The setjmp routine sets the return point to the return address of the setjmp routine invocation. When the setjmp routine returns, it returns a certain value to indicate that the setjmp routine has just returned. When a long jump jumps to the return point, the return value has a different value. In this way, the code at the return point can determine whether the setjmp routine has just returned or whether a long jump has just occurred. The setjmp routine also returns information describing the return point. To effect a long jump, a program invokes a longjmp routine passing the information returned by the setjmp routine.
[0079] A long jump is useful for immediately jumping to a known location when the user inputs a certain command. For example, if a user has completely traversed a menu hierarchy and is viewing the lowest level menu items, a certain command (e.g., “control-c”) can be used to signify that the user wants to immediately return to the highest level menu without having to exit each of the intermediate level menus manually. To effect this immediate return to the highest level menu, the user program can invoke the setjmp routine at the point where the highest level menu is displayed and processed. Whenever the user program receives an indication that the command has been entered by the user (e.g., in an input data routine), the user program can invoke the longjmp routine to effect the immediate jump to the return point of the invocation of the setjmp routine.
[0080] The longjmp routine may be invoked by a function that is invoked by other functions to an arbitrary level of nesting. To effect the long jump, the longjmp routine uses well-known techniques to undo the stack frames resulting from the nested invocation and to release any memory that was allocated by the functions whose invocations are represented by the stack frames.
[0081] FIGS. 17-22 illustrate the processing of a long jump in a MTA computer. In an MTA computer, one thread of execution may want to effect a long jump to a set jump location (i.e., return point) that was set in another thread of execution (i.e., an inter-thread long jump). To effect such a long jump, in one embodiment of the present invention, the longjmp routine first locates the control block for the set jump thread. The longjmp routine then determines the current state of that set jump thread. Based on the current state, the longjmp routine causes the set jump thread to start executing at the set jump location. If the set jump thread is blocked on an operating system call, then the longjmp routine notifies the operating system to abort that operating system call. The longjmp routine then can set the program counter of the set jump thread to a function that performs a standard (i.e., intra-thread) long jump. When the set jump thread is eventually restarted, it will first invoke the intra-thread long jump to jump to the set jump location.
[0082] The longjmp routine may be invoked by a signal handler routine. For example, in a Unix environment, a program is notified of a “control-c” command by a Unix signal. Since, as described above, a new thread is created to handle Unix signals, each long jump in such a signal handler routine is an inter-thread long jump. When a Unix signal is received, the operating system notifies the user program whether any blocked operating system calls will automatically return or automatically be restarted. If the blocked operating system calls are restarted, then the longjmp routine directs the operating system to abort the operating system call on which the thread is blocked, if the thread is blocked on one.
[0083] FIG. 17 is a flow diagram of the basic longjmp routine. This routine is invoked whenever a long jump is to be performed. This routine determines whether the long jump is inter- or intra-thread and performs the appropriate behavior. This routine is passed a set jump buffer that was generated and returned by the setjmp routine. The set jump buffer contains the thread identifier of the thread that invoked the setjmp routine along with the set jump location information describing the state of the thread when the setjmp routine was invoked. In step 1701, if the currently executing thread is not the thread that invoked the setjmp routine, then the routine continues at step 1703, else the routine continues at step 1702. In step 1702, the routine unwinds at the stack frames, restores the state of the jump buffer and returns to the set jump location. In step 1703, the routine invokes the indirect_longjmp routine to effect an inter-thread long jump. The routine then returns.
[0084] FIG. 18 is a flow diagram of the indirect_longjmp routine. This routine implements inter-thread long jumps. The routine determines the state of the set jump thread and based on that state, modifies the state information (e.g., program counter) of the set jump thread to effect an inter_thread long jump. In step 1801, the routine retrieves the thread identifier from the set jump buffer. In step 1802, the routine locates the save_area data structure for the set jump thread. In step 1803, the routine retrieves the thread control block from the save_area data structure. In step 1804, the routine jumps to steps 1805, 1807, 1806, or 1807, depending on whether the state of the thread is “blocked,” “resumable,” “running,” or “transition,” respectively. A “blocked” thread is one that is blocked on any synchronization timeout. The processing for a blocked thread is shown in FIG. 19 . A “running” thread is one that is currently executing on a stream. The processing for a running thread is shown in FIG. 20 . A “resumable” thread is one that is ready and waiting to be allocated a stream. No special processing is performed for a resumable thread. A “transition” thread is one that is in the process of being allocated a stream. In step 1807, if the state of the thread is “running,” then the routine returns, else the routine continues at step 1808. In step 1808, the routine sets the program counter in the thread control block data structure to the address of the longjmp routine. In step 1809, the routine put the thread control block on a list of unblocked threads. In this way, when the thread starts running, it will invoke the longjmp routine.
[0085] FIG. 19 is a flow diagram of the processing performed when the state of the thread is “blocked.” In step 1901, the routine removes the thread from the blocked list. In step 1902, the routine sets the state of the thread to “resumable.” In step 1903, the routine invokes the check_blocked_on_os_call routine to abort the operating system call if it will be restarted. The routine then returns.
[0086] FIG. 20 is a flow diagram of the processing performed when the state of the thread is “running.” In step 2001, the routine invokes the check_blocked_on_os_call routine to abort the operating system call if it will be restarted. In step 2002, if the thread is handling a data blocked exception, then the routine continues at step 2003, else the routine continues at step 2004. In step 2003, the routine saves any additional state information that was not saved by the data blocked trap handler. The data block handler saves minimal state information in case the thread decides to immediately redo the operation that caused the exception. In step 2004, the routine creates and initializes a save_area data structure. In step 2005, the routine sets the program counter in the save_area data structure to the address of the longjmp routine and then returns.
[0087] FIG. 21 is a flow diagram of the check_on_blocked_os_call routine. In step 2101, the routine retrieves the ut data structure from the os_call variable of the thread control block. If the pointer to the ut data structure is null, the routine returns. In step 2102, if the blocked operating system call is being restarted, then routine continues at step 2103, else the routine continues at step 2104. In step 2103, the routine requests the operating system to abort the restarted operating system call. In step 2104, the routine reads the notify_done$ synchronization variable of the ut data structure. This read will cause the longjmp routine to wait until the abort is complete. In step 2105, the routine deallocates the spare thread control block that was used to notify the user program that the operating system call has completed, and returns.
[0088] 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. For example, the principles described herein may be practiced in other computer architectures that support no multiple streams or that support multiple streams either within a single processor or within multiple processors. 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.
We claim:
1. A method in a computer system for scheduling tasks, the method comprising:
notifying a task executing on a parallel processor architecture having multiple simultaneously executing protection domains that the task is being preempted from utilizing the processor;
in response to the notification, receiving an indication from the task that it is ready to be swapped out and an indication as to whether the task is blocked;
swapping the task out; and
after swapping the task out,
when it is determined that the task can be swapped back in,
when it is determined that the task indicated that it was blocked,
when it is determined that an event occurred that may cause the task to unblock,
selecting a protection domain in which to execute the task,
swapping the task in, and
executing the task in the selected protection domain, and
when it is determined that an event did not occur that may cause the task to unblock, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked, and
when it is determined that the task did not indicate that it was blocked,
selecting a protection domain in which to execute the task, swapping the task in, and
executing the task in the selected protection domain
wherein the selected protection domain is different from the protection domain in which the task was originally executing so that when the task is swapped back in, the task executes within a different protection domain than the one in which it was originally executing.
2. The method of claim 1 wherein the computer system is a multithreaded computer system.
3. The method of claim 1 wherein in response to the notification, the task saves its state.
4. The method of claim 1 wherein the event is an indication from an operating system.
5. The method of claim 1 wherein the indication of whether the task is blocked includes an identification of a thread of the task that is blocked.
6. The method of claim 1 including tracking a number of threads of the task that are blocked.
7. A multi-processor computer system for scheduling tasks, each processor of the multi-processor computer system having multiple simultaneously executing protection domains, the system comprising:
a component that notifies a task that the task is being preempted from utilizing the processor;
a component that, in response to the notification, receives an indication from the task that it is ready to be swapped out and an indication as to whether the task is blocked;
a component that swaps the task out;
a component that determines that the swapped out task can be swapped back in;
a component that, when it is determined that the swapped out task can be swapped back in and an indication that the swapped out task is not blocked was not received, defers the swapping in of the swapped out task until an event occurs that may cause the swapped out task to become unblocked; and
a component that, when it is determined that the swapped out task can be swapped back in and an indication that the swapped out task is not blocked was received,
selects a protection domain in which to execute the swapped out task when it is swapped in, wherein the selected protection domain is different from the protection domain in which the task was originally executing,
swaps the swapped out task in, and
executes the task in the selected protection domain
so that when the task is swapped back in. the task executes within a different protection domain than the one in which it was originally executing.
8. The system of claim 7 wherein the computer system is a multithreaded computer system.
9. The system of claim 7 wherein in response to the notification, the task saves its state.
10. The system of claim 7 wherein the event is an indication from an operating system.
11. The system of claim 7 wherein the indication of whether the task is blocked includes an identification of a thread of the task that is blocked.
12. The system of claim 7 including a component that tracks a number of threads of the task that are blocked.
13. A computer-readable storage medium encoded with instructions for signaling deferred swapping in of a task executing on a parallel processor architecture having multiple simultaneously executing protection domains, by a method comprising:
when it is determined that a thread of the task is blocked, sending an indication to an operating system that the task is ready to be swapped out and that the thread is blocked;
after swapping out the task,
when it is determined that the task is ready to be swapped in,
sending an indication to the operating system that the task is ready to be swapped in;
when it is determined that the thread is no longer blocked, selecting a protection domain in which to execute the task, swapping the task in, and
executing the task in the selected protection domain wherein the selected protection domain is different from the protection domain in which the task was originally executing so that when the task is swapped back in, the task executes within a different protection domain than the one in which it was originally executing, and
when it is determined that the thread is blocked, sending an indication to the operating system that the thread is blocked, so that the operating system can defer swapping in the task until an event occurs that may cause the thread to become unblocked.
14. The computer-readable medium of claim 13 including incrementing a variable relating to a number of blocked threads wherein a task is blocked when all its threads are blocked.
15. The computer-readable medium of claim 13 including receiving an indication from the operating system that a thread is no longer blocked.
16. The computer-readable medium of claim 15 including decrementing a variable relating to a number of blocked threads.
17. The computer-readable medium of claim 13 wherein the task does not know which of the multiple protection domains on which it is executing.
18. A method in a computer system for scheduling tasks, the method comprising:
notifying a task executing on a parallel processor architecture having multiple simultaneously executing protection domains that the task is being preempted from utilizing the processor;
in response to the notification, receiving an indication from the task that it is ready to be swapped out and an indication as to whether the task is blocked that includes an identification of a thread of the task that is blocked;
determining that the task can be swapped back in;
when an indication that the task is blocked is received, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked; and
when the task is swapped back in, executing the task within a different protection domain than the one on which it was originally executing.
19. The method of claim 18 wherein the processor has 16 simultaneously active protection domains.
20. A method in a computer system for scheduling tasks with multiple streams, the method comprising:
notifying a task that the task is being preempted from utilizing the processor;
in response to the notification, receiving an indication from the task that it is ready to be swapped out and an indication as to whether the task is blocked, the task being blocked as a result of all streams assigned to the task executing virtual processor code;
determining whether the task can be swapped back in; and
when it is determined that the task can be swapped in and an indication that the task is blocked was received, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked.
21. The method of claim 20 wherein the task is not considered blocked when the virtual processor code for a stream is in the process of starting a thread.
22. A method in a computer system with a parallel processor architecture having multiple simultaneously executing protection domains with multiple streams for scheduling tasks with multiple threads, the method comprising:
notifying a task executing on the computer system that the task is being preempted from execution;
in response to the notification, receiving an indication from the task that it is ready to be swapped out and an indication as to whether the task is blocked, the task being blocked when all streams executing threads of the task are blocked;
determining whether the task can be swapped back in;
when it is determined that the task can be swapped in and an indication that the task is blocked was not received,
selecting a protection domain to swap the task into, wherein the selected protection domain is different from the protection domain in which the task was originally executing, and
swapping the task into the selected protection domain
so that when the task is swapped back in, the task executes within a different protection domain than the one in which it was originally executing; and
when it is determined that the task can be swapped in and an indication that the task is blocked was received, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked.
23. A method in a computer system with a multi-processor architecture having multiple simultaneously executing protection domains with multiple streams for scheduling tasks with multiple threads, the method comprising:
receiving from a task executing on the computer system an indication that the task is blocked; and
in response to receiving the notification,
determining whether to swap the task out from use of the processors;
when it is determined that the task is to be swapped out from use of the processors,
notifying the task that it is to be swapped out;
in response to the notifying, receiving from the task an indication that the task is ready to be swapped out;
after receiving the indication that the task is ready to be swapped out, swapping out the task;
after the task is swapped out,
determining whether an event occurs that may cause the task to become unblocked;
determining whether the task can be swapped back in; and
when it is determined that the task can be swapped in and it is determined that an event occurred that may cause the task to become unblocked,
selecting a protection domain in which to execute the task wherein the selected protection domain is different from the protection domain in which the task was originally executing so that when the task is swapped back in, the task executes within a different protection domain than the one in which it was originally executing,
swapping the task in, and
executing the task in the selected protection domain, and
when it is determined that the task can be swapped in and it is determined that an event did not occur that may cause the task to become unblocked, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked.
24. The method of claim 23 wherein the task is blocked when all threads of the task are blocked.
25. A method in a computer system with a multi-processor architecture having multiple simultaneously executing protection domains with multiple streams for scheduling tasks with multiple threads, the method comprising;
receiving from a task executing on the computer system an indication that the task is blocked; and
in response to receiving the notification,
determining whether to swap the task out from use of the processors;
when it is determined that the task is to be swapped out from use of the processors,
notifying the task that it is to be swapped out;
in response to the notifying, receiving from the task an indication that the task is ready to be swapped out;
after receiving the indication that the task is ready to be swapped out, swapping out the task;
after the task is swapped out,
determining whether an event occurs that may cause the task to become unblocked;
determining whether the task can be swapped back in; and
when it is determined that the task can be swapped in and it is determined that an event occurred that may cause the task to become unblocked,
selecting a protection domain in which to execute the task,
swapping the task in, and
executing the task in the selected protection domain, and
when it is determined that the task can be swapped in and it is determined that an event did not occur that may cause the task to become unblocked, deferring the swapping in of the task until an event occurs that may cause the task to become unblocked
wherein the task is blocked when all streams assigned to the task are executing virtual processor code.
26. The method of claim 25 wherein the task is not blocked when a stream is executing virtual processor code to start a thread of the task.
Patent Citations (111)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4819234(A) | 1989-04-01 | Huber | Applicant |
| US4872167(A) | 1989-10-01 | Maezawa et al. | Applicant |
| US5168554(A) | 1992-12-01 | Luke | Applicant |
| US5168566(A) | 1992-12-01 | Kuki et al. | Examiner |
| US5179702(A) | 1993-01-01 | Spix et al. | Applicant |
| US5197138(A) | 1993-03-01 | Hobbs et al. | Applicant |
| US5210873(A) | 1993-05-01 | Gay et al. | Examiner |
| US5257358(A) | 1993-10-01 | Cohen | Applicant |
| US5301325(A) | 1994-04-01 | Benson | Applicant |
| US5333280(A) | 1994-07-01 | Ishikawa et al. | Applicant |
| US5450575(A) | 1995-09-01 | Sites | Applicant |
| US5485626(A) | 1996-01-01 | Lawlor et al. | Applicant |
| US5490272(A) | 1996-02-01 | Mathis et al. | Examiner |
| US5504932(A) | 1996-04-01 | Vassiliadis et al. | Applicant |
| US5524250(A) | 1996-06-01 | Chesson et al. | Applicant |
| US5526521(A) | 1996-06-01 | Fitch et al. | Applicant |
| US5533192(A) | 1996-07-01 | Hawley et al. | Applicant |
| US5557761(A) | 1996-09-01 | Chan | Applicant |
| US5564051(A) | 1996-10-01 | Halliwell et al. | Applicant |
| US5581764(A) | 1996-12-01 | Fitzgerald et al. | Applicant |
| US5594864(A) | 1997-01-01 | Trauben | Applicant |
| US5598560(A) | 1997-01-01 | Benson | Applicant |
| US5613114(A) | 1997-03-01 | Anderson et al. | Examiner |
| US5621886(A) | 1997-04-01 | Alpert et al. | Applicant |
| US5632032(A) | 1997-05-01 | Ault et al. | Applicant |
| US5652889(A) | 1997-07-01 | Sites | Applicant |
| US5668993(A) | 1997-09-01 | Peters et al. | Applicant |
| US5712996(A) | 1998-01-01 | Schepers | Applicant |
| US5740413(A) | 1998-04-01 | Alpert et al. | Applicant |
| US5742824(A) | 1998-04-01 | Kosaka | Examiner |
| US5754855(A) | 1998-05-01 | Miller et al. | Applicant |
| US5768352(A) | 1998-06-01 | Elliott et al. | Applicant |
| US5768591(A) | 1998-06-01 | Robinson | Applicant |
| US5768592(A) | 1998-06-01 | Chang | Applicant |
| US5774358(A) | 1998-06-01 | Shrote | Applicant |
| US5774721(A) | 1998-06-01 | Robinson | Applicant |
| US5778230(A) | 1998-07-01 | Wimble et al. | Applicant |
| US5787245(A) | 1998-07-01 | You et al. | Applicant |
| US5805892(A) | 1998-09-01 | Nakajima | Applicant |
| US5812811(A) | 1998-09-01 | Dubey et al. | Applicant |
| US5812844(A) | 1998-09-01 | Jones et al. | Examiner |
| US5826265(A) | 1998-10-01 | Van Huben et al. | Applicant |
| US5832283(A) | 1998-11-01 | Chou et al. | Applicant |
| US5867643(A) | 1999-02-01 | Sutton | Applicant |
| US5877766(A) | 1999-03-01 | Bates et al. | Applicant |
| US5887166(A) | 1999-03-01 | Mallick et al. | Applicant |
| US5901315(A) | 1999-05-01 | Edwards et al. | Applicant |
| US5902352(A) | 1999-05-01 | Chou et al. | Applicant |
| US5903730(A) | 1999-05-01 | Asai et al. | Applicant |
| US5913925(A) | 1999-06-01 | Kahle et al. | Applicant |
| US5937187(A) | 1999-08-01 | Kosche et al. | Examiner |
| US5953530(A) | 1999-09-01 | Rishi et al. | Applicant |
| US5960212(A) | 1999-09-01 | Mak | Examiner |
| US5961639(A) | 1999-10-01 | Mallick et al. | Applicant |
| US5966539(A) | 1999-10-01 | Srivastava | Applicant |
| US5978902(A) | 1999-11-01 | Mann | Applicant |
| US5987492(A) | 1999-11-01 | Yue | Examiner |
| US6002872(A) | 1999-12-01 | Alexander, III et al. | Applicant |
| US6002879(A) | 1999-12-01 | Radigan et al. | Applicant |
| US6003066(A) | 1999-12-01 | Ryan et al. | Applicant |
| US6009269(A) | 1999-12-01 | Burrows et al. | Applicant |
| US6016542(A) | 2000-01-01 | Gottlieb et al. | Applicant |
| US6018759(A) | 2000-01-01 | Doing et al. | Examiner |
| US6029005(A) | 2000-02-01 | Radigan | Applicant |
| US6031973(A) | 2000-02-01 | Gomi et al. | Examiner |
| US6049671(A) | 2000-04-01 | Slivka et al. | Applicant |
| US6055559(A) | 2000-04-01 | Shimizu et al. | Examiner |
| US6058493(A) | 2000-05-01 | Talley | Applicant |
| US6059840(A) | 2000-05-01 | Click, Jr. | Applicant |
| US6072952(A) | 2000-06-01 | Janakiraman | Applicant |
| US6088788(A) | 2000-07-01 | Borkenhagen et al. | Applicant |
| US6094716(A) | 2000-07-01 | Witt | Applicant |
| US6101524(A) | 2000-08-01 | Choi et al. | Applicant |
| US6105051(A) | 2000-08-01 | Borkenhagen et al. | Applicant |
| US6112293(A) | 2000-08-01 | Witt | Applicant |
| US6125447(A) | 2000-09-01 | Gong | Examiner |
| US6151701(A) | 2000-11-01 | Humphreys et al. | Applicant |
| US6151704(A) | 2000-11-01 | Radigan | Applicant |
| US6195676(B1) | 2001-02-01 | Spix et al. | Applicant |
| US6212544(B1) | 2001-04-01 | Borkenhagen et al. | Applicant |
| US6219690(B1) | 2001-04-01 | Slingwine et al. | Applicant |
| US6223202(B1) | 2001-04-01 | Bayeh | Applicant |
| US6233599(B1) | 2001-05-01 | Nation et al. | Applicant |
| US6272520(B1) | 2001-08-01 | Sharangpani et al. | Examiner |
| US6282638(B1) | 2001-08-01 | Dowling | Applicant |
| US6289446(B1) | 2001-09-01 | Nilsson | Applicant |
| US6298370(B1) | 2001-10-01 | Tang et al. | Applicant |
| US6430593(B1) | 2002-08-01 | Lindsley | Examiner |
| US6466898(B1) | 2002-10-01 | Chan | Applicant |
| US6470376(B1) | 2002-10-01 | Tanaka et al. | Applicant |
| US6487590(B1) | 2002-11-01 | Foley et al. | Applicant |
| US6505229(B1) | 2003-01-01 | Turner et al. | Examiner |
| US6529958(B1) | 2003-03-01 | Oba et al. | Applicant |
| US6560626(B1) | 2003-05-01 | Hogle et al. | Examiner |
| US6560628(B1) | 2003-05-01 | Murata | Applicant |
| US6567839(B1) | 2003-05-01 | Borkenhagen et al. | Examiner |
| US6584489(B1) | 2003-06-01 | Jones et al. | Applicant |
| US6594698(B1) | 2003-07-01 | Chow et al. | Applicant |
| US6622155(B1) | 2003-09-01 | Haddon et al. | Applicant |
| US6631425(B1) | 2003-10-01 | Helland et al. | Applicant |
| US6697935(B1) | 2004-02-01 | Borkenhagen et al. | Examiner |
| US6766515(B1) | 2004-07-01 | Bitar et al. | Applicant |
| US6785887(B2) | 2004-08-01 | Armstrong et al. | Applicant |
| US2002/0103847(A1) | 2002-08-01 | Potash | Applicant |
| DE19710252 | 1998-02-01 | Applicant | |
| 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 |
Non-Patent Literature (47)
- Small et al., “Scheduler Activations on BSD: Sharing Thread Management Between Kernel and Application”, Harvard University, 1995, pp. 1-12.Examiner
- Mueller, “A Library Implementation of POSIX Threads Under UNIX”, USENIX, San Diego, CA, 1993, pp. 29-42.Examiner
- Alverson et al., “Scheduling on the Tera MTA”, pp. 1-28, ACM, 1995.Examiner
- 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
- 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, 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 SystemsReview, 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., “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 Langauage Design and Implementation, White Plans, New York, Jun. 20-22, 1990.Applicant
- Callahan, David, “Recognizing and Parallelizing Bounded Recurrences,” Aug. 1991.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
- Galarowicz, Jim et al., “Analyzing Message Passing Programs on the Cray T3E with PAT and VAMPIR,” Research Report, “Online!”, May 1998.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
- Korry, Richard et al., “Memory Management in the Tera MTA System,” 1995.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, A. et al., “Parallel Garbage Collection Without Synchronization Overhead,” 12th Annual Symposium on Computer Architecture, Jun. 17, 1985.Applicant
- Smith, Burton, “Opportunities for Growth in High Performance Computing,” Nov. 1994.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
- Surajit, Chaudhuri et al., “An Overview of Data Warehousing and OLAP Technology,” Sigmod Record, Association for Computing, New York, vol. 26, No. 1, Mar. 1997.Applicant
- Tera MTA Principles of Operation, Nov. 18, 1997.Applicant
- Touzeau, Roy F., “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
- Silberschatz et al., “Operating System Concepts,” Fifth Edition, John Wiley & Sons, Inc., 1998, p. 103.Applicant
- “Method of Tracing Events in Multi-Threaded OS/2 Applications,” IBM Tech. Disclosure Bulletin, Sep. 1993, pp. 19-22.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., “Tera Hardware-Software Cooperation,” Proceedings of Supercomputing 1997, San Jose, California, Nov. 1997.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.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
- Chow, Fred C. et al., “Priority-Based Coloring Approach to Register Allocation,” ACM Transactions on Programming Languages and Systems, vol. 12, No. 4, Oct. 1990, pp. 501-536.Applicant
- Cook, Jonathan 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
- Kolte, Priyadarshan et al., “Load/Store Range Analysis for Global Register Allocation,” ACM-SIGPLAN, Jun. 1993.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
- Lal, George et al., “Iterated Register Coalescing,” ACM Transactions on Programming Languages and Systems, vol. 18, No. 3, May 1996, pp. 300-324.Applicant
- Lang, Tomas et al., “Reduced Register Saving/Restoring in Single-Window Register Files,” Computer Architecture News, vol. 14, No. 3, Jun. 1986.Applicant
- Minwen, Ji et al., “Performance Measurements for Multithreaded Programs,” SIGMETRICS '98, ACM, 1998, pp. 168-170.Applicant
- Shim, SangMin et al., Split-Path Enhanced Pipeline Scheduling for Loops with Control Flows, IEEE, Dec. 2, 1998.Applicant
- Tsai, Jenn-Yuan et al., “Performance Study of a Concurrent Multithreaded Processor,” IEEE, 1998, pp. 24-35.Applicant
- Schulzrinne, H., “Operating system issues for continuous media,” Multimedia Systems, 1996, 4: 269-280, Springer-Verlag.Applicant