Supporting multi-dimensional space-time computing through object versioning

[0002] The application hereby claims priority under 35 U.S.C. § 119 to Provisional Patent Application No. 60/137,899 filed on Jun. 7, 1999.

[0003] This subject matter of this application is related to the subject matter in a pending U.S. patent application, entitled “Supporting Space-Time Dimensional Program Execution by Selectively Versioning Memory Updates,” by the same inventor(s) as the instant application, having Ser. No. 09/313,229 and a filing date of May 17, 1999, now U.S. Pat. No. 6,353,881.

[0004] 1. Field of the Invention

[0005] The present invention relates to techniques for improving computer system performance. More specifically, the present invention relates to a method and an apparatus that provides selective versioning of memory objects to support multi-dimensional space and time dimensional execution of a computer program.

[0006] 2. Related Art

[0007] As increasing semiconductor integration densities allow more transistors to be integrated onto a microprocessor chip, computer designers are investigating different methods of using these transistors to increase computer system performance. Some recent computer architectures exploit “instruction level parallelism,” in which a single central processing unit (CPU) issues multiple instructions in a single cycle. Given proper compiler support, instruction level parallelism has proven effective at increasing computational performance across a wide range of computational tasks. However, inter-instruction dependencies generally limit the performance gains realized from using instruction level parallelism to a factor of two or three.

[0008] Another method for increasing computational speed is “speculative execution” in which a processor executes multiple branch paths simultaneously, or predicts a branch, so that the processor can continue executing without waiting for the result of the branch operation. By reducing dependencies on branch conditions, speculative execution can increase the total number of instructions issued.

[0009] Unfortunately, conventional speculative execution typically provides a limited performance improvement because only a small number of instructions can be speculatively executed. One reason for this limitation is that conventional speculative execution is typically performed at the basic block level, and basic blocks tend to include only a small number of instructions. Another reason is that conventional hardware structures used to perform speculative execution can only accommodate a small number of speculative instructions. A further reason is that conventional speculative execution supports only a limited amount of parallelism in the speculative execution process.

[0010] What is needed is a method and apparatus that facilitates speculative execution of program instructions at a higher level of granularity so that many more instructions can be speculatively executed.

[0011] Additionally, what is needed is a method and an apparatus that supports parallelism in the speculative execution process.

[0012] One embodiment of the present invention provides a system that facilitates multi-dimensional space and time dimensional execution of computer programs. The system includes a head thread that executes program instructions and a series of speculative threads that execute program instructions in advance of the head thread, wherein each speculative thread executes program instructions in advance of preceding speculative threads in the series. The head thread accesses a primary version of the memory element and the series of speculative threads access space-time dimensioned versions of the memory element. The system starts by receiving a memory access to the memory element. If the memory access is a write operation by the head thread or a speculative thread, the system determines if a version of the memory element associated with the head thread or speculative thread exists. If not, the system creates a version of the memory element for the thread. Next, the system performs the write operation to the version of the memory element. After performing the write operation, the system checks status information associated with the memory element to determine if the memory element has been read by a following speculative thread in the series of speculative threads. If so, the system causes the following speculative thread and any successive speculative threads in the series to roll back so that the following speculative thread and any successive speculative threads in the series can read a result of the write operation. If not, the system performs the write operation to all successive space-time dimensioned versions of the memory element.

[0013] In one embodiment of the present invention, if the memory access is a read operation by a speculative thread, the system updates status information associated with the memory element to indicate the memory element has been read by the speculative thread and determines if a space-time dimensioned version of the memory element associated with the speculative thread exists. If the space-time dimensioned version of the memory element exists, the system reads it. If the space-time dimensioned version of the memory element does not exist, the system reads a space-time dimensioned version of the memory element associated with a preceding speculative thread or the head thread.

[0014] In one embodiment of the present invention, accesses to space-time dimensioned versions of the memory element are made indirectly through a pointer associated with the primary version of the memory element. In a variation on this embodiment, the pointer points to an array containing pointers to the space-time dimensioned versions of the memory element.

[0015] In one embodiment of the present invention, performing the write operation to all space-time dimensioned versions of the memory element includes checking status information associated with the memory element to determine which space-time dimensioned versions of the memory element have been written to by any speculative thread. Once this is determined, the system writes to space-time time dimensioned versions of the memory element that have not been written to by any speculative thread.

[0016] In one embodiment of the present invention, the system performs a join operation between the head thread and the series of speculative threads when the head thread reaches a point in the program where the series of speculative threads began executing. This join operation causes state associated with the series of speculative threads to be merged with state associated with the head thread. In a variation on this embodiment, performing the join operation includes merging the space-time dimensioned versions of the memory element into the primary version of the memory element and discarding the space-time dimensioned versions of the memory element.

[0017] In one embodiment of the present invention, causing the speculative thread and any successive speculative threads in the series to roll back includes using a recursive method to cause the speculative thread and any successive speculative threads in the series to roll back.

[0018] FIG. 1 illustrates a computer system including two central processing units sharing a common data cache in accordance with an embodiment of the present invention.

[0019] FIG. 2A illustrates sequential execution of methods by a single thread.

[0020] FIG. 2B illustrates space and time dimensional execution of a method in accordance with an embodiment of the present invention.

[0021] FIG. 3 illustrates the state of the system stack during space and time dimensional execution of a method in accordance with an embodiment of the present invention.

[0022] FIG. 4 illustrates how memory is partitioned between stack and heap in accordance with an embodiment of the present invention.

[0023] FIG. 5 illustrates the structure of a primary version and a space-time dimensioned version of an object in accordance with an embodiment of the present invention.

[0024] FIG. 6 illustrates the structure of a status word for an object in accordance with an embodiment of the present invention.

[0025] FIG. 7 is a flow chart illustrating operations involved in performing a write to a memory element by a head thread in accordance with an embodiment of the present invention.

[0026] FIG. 8 is a flow chart illustrating operations involved in performing a read to a memory element by a speculative thread in accordance with an embodiment of the present invention.

[0027] FIG. 9 is a flow chart illustrating operations involved in performing a write to a memory element by a speculative thread in accordance with an embodiment of the present invention.

[0028] FIG. 10 is a flow chart illustrating operations involved in performing a join between a head thread and a speculative thread in accordance with an embodiment of the present invention.

[0029] FIG. 11 is a flow chart illustrating operations involved in performing a join between a head thread and a speculative thread in accordance with an embodiment of the present invention.

[0030] FIG. 12A illustrates a first example piece of code.

[0031] FIG. 12B illustrates how the first example piece of code is executed using a single thread.

[0032] FIG. 12C illustrates how the first example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention.

[0033] FIG. 13A illustrates a second example piece of code.

[0034] FIG. 13B illustrates how the second example piece of code is executed using a single thread.

[0035] FIG. 13C illustrates how the second example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention.

[0036] FIG. 14A illustrates a third example piece of code.

[0037] FIG. 14B illustrates how the third example piece of code is executed using a single thread.

[0038] FIG. 14C illustrates how the third example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention.

[0039] FIG. 15 illustrates data structures involved in multi-dimensional speculative execution in accordance with an embodiment of the present invention.

[0040] FIG. 16 is a flow chart illustrating operations involved in performing a write to a memory element for the case of multiple speculative threads in accordance with an embodiment of the present invention.

[0041] FIG. 17 is a flow chart illustrating operations involved in performing a read to a memory element by a speculative thread for the case of multiple speculative threads in accordance with an embodiment of the present invention.

[0042] FIG. 18 illustrates a recursive function for rolling back a series of speculative threads in accordance with an embodiment of the present invention.

[0043] The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the

[0044] present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

[0045] The data structures and code described in this detailed description are typically stored on a computer readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. This includes, but is not limited to, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs) and DVDs (digital video discs), and computer instruction signals embodied in a carrier wave. For example, the carrier wave may carry information across a communications network, such as the Internet.

[0046] Computer System

[0047] FIG. 1 illustrates a computer system including two central processing units (CPUs) 102 and 104 sharing a common data cache 106 in accordance with an embodiment of the present invention. In this embodiment, CPUs 102 and 104 and data cache 106 reside on silicon die 100. Note that CPUs 102 and 104 may generally be any type of computational devices that allow multiple threads to execute concurrently. In the embodiment illustrated in FIG. 1, CPUs 102 and 104 are very long instruction word (VLIW) CPUs, which support concurrent execution of multiple instructions executing on multiple functional units. VLIW CPUs 102 and 104 include instruction caches 112 and 120, respectively, containing instructions to be executed by VLIW CPUs 102 and 104.

[0048] VLIW CPUs 102 and 104 additionally include load buffers 114 and 122 as well as store buffers 116 and 124 for buffering communications with data cache 106. More specifically, VLIW CPU 102 includes load buffer 114 for buffering loads received from data cache 106, and store buffer 116 for buffering stores to data cache 106. Similarly, VLIW CPU 104 includes load buffer 122 for buffering loads received from data cache 106, and store buffer 124 for buffering stores to data cache 106.

[0049] VLIW CPUs 102 and 104 are additionally coupled together by direct communication link 128, which facilitates rapid communication between VLIW CPUs 102 and 104. Note that direct communication link 128 allows VLIW CPU 102 to write into communication buffer 126 within VLIW CPU 104. It also allows VLIW CPU 104 to write into communication buffer 118 within VLIW CPU 102.

[0050] In the embodiment illustrated in FIG. 1, data cache 106 is fully dual-ported allowing concurrent read and/or write- accesses from VLIW CPUs 102 and 104. This dual porting eliminates cache coherence delays associated with conventional shared memory architectures that rely on coherent caches.

[0051] In one embodiment of the present invention, data cache 106 is a 16 K byte 4-way set-associative data cache with 32 byte cache lines.

[0052] Data cache 106, instruction caches 112 and instruction cache 120 are coupled through switch 110 to memory controller 111. Memory controller 111 is coupled to dynamic random access memory (DRAM) 108, which is located off chip. Switch 110 may include any type of circuitry for switching signal lines. In one embodiment of the present invention, switch 110 is a cross bar switch.

[0053] The present invention generally applies to any computer system that supports concurrent execution by multiple threads and is not limited to the illustrated computing system. However, note that data cache 106 supports fast accesses to shared data items. These fast accesses facilitate efficient sharing of status information between VLIW CPUs 102 and 104 to keep track of accesses to versions of memory objects.

[0054] Space-Time Dimensional Execution of Methods

[0055] FIG. 2A illustrates sequential execution of methods in a conventional computer system by a single head thread 202. In executing a program, head thread 202 executes a number of methods in sequence, including method A 204, method B 206 and method C 208.

[0056] In contrast, FIG. 2B illustrates space and time dimensional execution of a method in accordance with an embodiment of the present invention. In FIG. 2B, head thread 202 first executes method A 204 and then executes method B 206. (For this example, assume that method B 206 returns a void or some other value that is not used by method C 208. Alternatively, if method C 208 uses a value returned by method B 206, assume that method C 208 uses a predicted return value from method B 206.)

[0057] As head thread 202 executes method B 206, speculative thread 203 executes method C 208 in a separate space-time dimension of the heap. If head thread 202 successfully executes method B 206, speculative thread 203 is joined with head thread 202. This join operation involves causing state associated with the speculative thread 203 to be merged with state associated with the head thread 202 and the collapsing of the space-time dimensions of the heap.

[0058] If speculative thread 203 for some reason encounters problems in executing method C 208, speculative thread 203 performs a rollback operation. This rollback operation allows speculative thread 203 to reattempt to execute method C 208. Alternatively, head thread 202 can execute method C 208 non-speculatively and speculative thread 203 can execute a subsequent method.

[0059] There are a number of reasons why speculative thread 203 may encounter problems in executing method C 208. One problem occurs when head thread 202 executing method B 206 writes a value to a memory element (object) after speculative thread 203 has read the same memory element. The same memory element can be read when the two space-time dimensions of the heap are collapsed at this memory element at the time of the read by speculative thread 203. In this case, speculative thread 203 should have read the value written by head thread 202, but instead has read a previous value. In this case, the system causes speculative thread 203 to roll back so that speculative thread 203 can read the value written by head thread 202.

[0060] Note that the term “memory element” generally refers to any unit of memory that can be accessed by a computer program. For example, the term “memory element” may refer to a bit, a byte or a word memory, as well as a data structure or an object defined within an object-oriented programming system.

[0061] FIG. 3 illustrates the state of the system stack during space and time dimensional execution of a method in accordance with an embodiment of the present invention. Note that since programming languages such as the Java programming language do not allow a method to modify the stack frame of another method, the system stack will generally be the same before method B 206 is executed as it is before method C 208 is executed. (This is not quite true if method B 206 returns a parameter through the system stack. However, return parameters are can be explicitly dealt with as is described below.) Referring the FIG. 3, stack 300 contains method A frame 302 while method A 204 is executing. When method A 204 returns, method B 206 commences and method A frame 302 is replaced by method B frame 304. Finally, when method B 206 returns, method C 208 commences and method B frame 304 is replaced by method C frame 306. Note that since stack 300 is the same immediately before method B 206 executed as it is immediately before method C 208 is executed, it is possible to execute method C 208 using a copy of stack 300 without first executing method B 206.

[0062] In order to undo the results of speculatively executed operations, updates to memory need to be versioned. The overhead involved in versioning all updates to memory can be prohibitively expensive due to increased memory requirements, decreased cache performance and additional hardware required to perform the versioning.

[0063] Fortunately, not all updates to memory need to be versioned. For example, updates to local variables—such as a loop counter—on a system stack are typically only relevant to the thread that is updating the local variables. Hence, even for speculative threads versioning updates to these local variables is not necessary.

[0064] When executing programs written in conventional programming languages, such as C, it is typically not possible to determine which updates are related to the heap, and which updates are related to the system stack. These programs are typically compiled from a high-level language representation into executable code for a specific machine architecture. This compilation process typically removes distinctions between updates to heap and system stack.

[0065] The same is not true for new platform-independent computer languages, such as the JAVA™ programming language distributed by SUN Microsystems, Inc. of Palo Alto, Calif. (Sun, the Sun logo, Sun Microsystems, and Java are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.) A program written in the Java programming language is typically compiled into a class file containing Java byte codes. This class file can be transmitted over a computer network to a distant computer system to be executed on the distant computer system. Java byte codes are said to be “platform-independent,” because they can be executed across a wide range of computing platforms, so long as the computing platforms provide a Java virtual machine.

[0066] A Java byte code can be executed on a specific computing platform by using an interpreter or a just in time (JIT) compiler to translate the Java bytecode into machine code for the specific computing platform. Alternatively, a Java byte code can be executed directly on a Java bytecode engine running on the specific computing platform.

[0067] Fortunately, a Java bytecode contains more syntactic information than conventional machine code. In particular, the Java bytecodes differentiate between accesses to local variables in the system stack and accesses to the system heap. Furthermore, programs written in the Java programming language do not allow conversion between primitive and reference types. Such conversion can make it hard to differentiate accesses to the system stack from accesses to the system heap at compile time.

[0068] Data Structures to Support Space-Time Dimensional Execution

[0069] FIG. 4 illustrates how memory is partitioned between stack and heap in accordance with an embodiment of the present invention. In FIG. 4, memory 400 is divided into a number of regions including heap 402, stacks for threads 404 and speculative heap 406. Heap 402 comprises a region of memory from which objects are allocated. Heap 402 is further divided into younger generation region 408 and older generation region 410 for garbage collection purposes. For performance reasons, garbage collectors typically treat younger generation objects differently from older generation objects. Stack for threads 404 comprises a region of memory from which stacks for various threads are allocated. Speculative heap 406 contains the space-time dimensioned values of all memory elements where the two space-time dimensions of the heap are not collapsed. This includes space-time dimensional versions of objects, for example, version 510 of object 500 as shown in FIG. 5, and objects created by speculative thread 203. For garbage collection purposes, these objects created by speculative thread 203 can be treated as belonging to a generation that is younger than objects within younger generation region 408.

[0070] FIG. 5 illustrates the structure of a primary version of object 500 and a space-time dimensioned version of object 510 in accordance with an embodiment of the present invention.

[0071] Primary version of object 500 is referenced by object reference pointer 501. Like any object defined within an object-oriented programming system, primary version of object 500 includes data region 508,which includes one or more fields containing data associated with primary version of object 500. Primary version of object 500 also includes method vector table pointer 506. Method vector table pointer 506 points to a table containing vectors that point to the methods that can be invoked on primary version of object 500.

[0072] Primary version of object 500 also includes space-time dimensioned version pointer 502, which points to space-time dimensioned version of object 510, if the two space-time dimensions are not collapsed at this object. Note that in the illustrated embodiment of the present invention, space-time dimensioned version 510 is always referenced indirectly through space-time dimensioned version pointer 502. Primary version of object 500 additionally includes status word 504, which contains status information specifying which fields from data region 508 have been written to or read by speculative thread 203. Space-time dimensioned version of object 510 includes only data region 518.

[0073] FIG. 6 illustrates the structure of status word 504 in accordance with an embodiment of the present invention. In this embodiment, status word 504 includes checkpoint number 602 and speculative bits 603. Speculative bits 603 includes read bits 604 and write bits 606. When status word 504 needs to be updated due to a read or a write by speculative thread 203, checkpoint number 602 is updated with the current time of the system. The current time in the time dimension of the system is advanced discretely at a join or a rollback. This allows checkpoint number 602 to be used as a qualifier for speculative bits 603. If checkpoint number 602 is less than the current time, speculative bits 603 can be interpreted as reset.

[0074] Read bits 604 keep track of which fields within data region 508 have been read since the last join or rollback. Correspondingly, write bits 606 keep track of which fields within data region 508 have been written since the last join or rollback. In one embodiment of the present invention, read bits 604 includes one bit for each field within data region 508. In another embodiment, read bits includes fewer bits than the number of fields within data region 508. In this embodiment, each bit within read bits 604 corresponds to more than one field in data region 508. For example, if there are eight read bits, each bit corresponds to every eighth field. Write bits 606 similarly can correspond to one or multiple fields within data region 508.

[0075] Space-Time Dimensional Update Process

[0076] Space-time dimensioning occurs during selected memory updates. For local variable and operand accesses to the system stack, no space-time dimensioned versions exist and nothing special happens. During read operations by head thread 202 to objects in the heap 402, again nothing special happens.

[0077] Special operations are involved in write operations by head thread 202 as well as read and write operations by speculative thread 203. These special operations are described in more detail with reference to FIGS.7, 8 and 9 below.

[0078] FIG. 7 is a flow chart illustrating operations involved in a write operation to an object by a head thread 202 in accordance with an embodiment of the present invention. The system writes to the primary version of object 500 and the space-time dimensioned version of object 510 if the two space-time dimensions are not collapsed at this point (step 702). Next, the system checks status word 504 within primary version of object 500 to determine whether a rollback is required (step 704). A rollback is required if speculative thread 203 previously read the data element. The same memory element can be read when the two space-time dimensions of the heap are collapsed at this memory element at the time of the read by speculative thread 203. A rollback is also required if speculative thread 203 previously wrote to the object and thus ensured that the two dimensions of the object are not collapsed at this element, and if the current write operation updates both primary version of object 500 and space-time dimensioned version of object 510.

[0079] If a rollback is required, the system causes speculative thread 203 to perform a rollback operation (step 706). This rollback operation allows speculative thread 203 to read from (or write to) the object after head thread 202 writes to the object.

[0080] Note that in the embodiment of the present invention illustrated in FIG. 7 the system performs writes to both primary version 500 and space-time dimensioned version 510. In an alternative embodiment, the system first checks to determine if speculative thread 203 previously wrote to space-time dimensioned version 510. If not, the system writes to both primary version 500 and space-time dimensioned version 510. If so, the system only writes to primary version 500.

[0081] FIG. 8 is a flow chart illustrating operations involved in a read operation to an object by speculative thread 203 in accordance with an embodiment of the present invention. During this read operation, the system sets a status bit in status word 504 within primary version of object 500 to indicate that primary version 500 has been read (step 802). Speculative thread 203 then reads space-time dimensioned version 510, if it exists. Otherwise, speculative thread 203 reads primary version 500.

[0082] FIG. 9 is a flow chart illustrating operations involved in a write operation to a memory element by speculative thread 203 in accordance with an embodiment of the present invention. If a space-time dimensioned version 510 does not exist, the system creates a space-time dimensioned version 510 in speculative heap 406 (step 902). The system also updates status word 504 to indicate that speculative thread 203 has written to the object if such updating is necessary (step 903). The system next writes to space-time dimensioned version 510 (step 904). Such updating is necessary if head thread 202 must subsequently choose between writing to both primary version 500 and space-time dimensioned version 510, or writing only to primary version 500 as is described above with reference to FIG. 7.

[0083] FIG. 10 is a flow chart illustrating operations involved in a join operation between head thread 202 and a speculative thread 203 in accordance with an embodiment of the present invention. A join operation occurs for example when head thread 202 reaches a point in the program where speculative thread 203 began executing. The join operation causes state associated with the speculative thread 203 to be merged with state associated with the head thread 202. This involves copying and/or merging the stack of speculative thread 203 into the stack of head thread 202 (step 1002). It also involves merging space-time dimension and primary versions of objects (step 1004) as well as possibly garbage collecting speculative heap 406 (step 1006). In one embodiment of the present invention, one of threads 202 or 203 performs steps 1002 and 1006, while the other thread performs step 1004.

[0084] FIG. 11 is a flow chart illustrating operations involved in a join operation between head thread 202 and a speculative thread 203 in accordance with another embodiment of the present invention. In this embodiment, speculative thread 203 carries on as a pseudo-head thread. As a pseudo-head thread, speculative thread 203 uses indirection to reference space-time dimensioned versions of objects, but does not mark objects or create versions. While speculative thread 203 is acting as a pseudo-head thread, head thread 202 updates primary versions of objects.

[0085] Extension to Multiple Speculative Threads

[0086] Although the present invention has been described for the case of a single speculative thread, the present invention can be extended to support a series of speculative threads operating on multiple space-time dimensioned versions of a data object in parallel. Several examples of multi-threaded speculative execution are presented below.

[0087] FIG. 12A illustrates a first example piece of code including a main program that invokes methods A, B, C and D before returning a result.

[0088] FIG. 12B illustrates how the first example piece of code is executed using a single thread. (Note that FIG. 12 B illustrates execution of the single program thread with time running from top to bottom.) The single thread proceeds linearly through methods A-D completing each method in sequence.

[0089] FIG. 12C illustrates how the first example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention. The head thread first begins executing the main program and shortly thereafter begins executing method A. While the head thread is executing method A, a first speculative thread begins executing method B. While the first speculative thread begins executing method B, a second speculative thread begins executing method C. While the second speculative thread begins executing method C, a third speculative thread begins executing method D. If all of the speculative threads complete successfully, the speculative threads are eventually joined with the head thread. Otherwise, one or more speculative threads will perform a rollback operation. Note that if a given speculative thread performs a rollback operation, all following speculative threads rollback.

[0090] FIG. 13A illustrates a second example piece of code including a main program that invokes a number of nested methods. More particularly, the main program invokes methods A and B. Method B invokes methods C and D. Finally, method D invokes methods E and F.

[0091] FIG. 13B illustrates how the second example piece of code is executed using a single thread. The single thread proceeds linearly through methods A and B completing each method in sequence. Within method B the single thread completes methods C and D. Within method D the single thread completes methods E and F. Finally, after method F is complete, the single thread returns through methods D and B to the main program.

[0092] FIG. 13C illustrates how the second example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention. The head thread first begins executing the main program and shortly thereafter begins executing method A. While the head thread is executing method A, a first speculative thread begins executing method B. Method B immediately invokes method C. While the first speculative thread begins executing method C, a second speculative thread begins executing method D. Method D immediately invokes method E. While the second speculative thread begins executing method E, a third speculative thread begins executing method F. If all of the speculative threads complete successfully, the speculative threads are eventually joined with the head thread.

[0093] FIG. 14A illustrates a third example piece of code including a method A that repeatedly invokes a method B with a different input parameters during successive iterations of a loop.

[0094] FIG. 14B illustrates how the third example piece of code is executed using a single thread. The single thread proceeds linearly through the loop completing each invocation of method B in sequence. Between each invocation of method B, the single thread briefly returns to method B to complete a new loop iteration.

[0095] FIG. 14C illustrates how the third example piece of code is executed using a head thread and a series of speculative threads in accordance with an embodiment of the present invention. The head thread first begins executing method A and shortly thereafter begins executing a first invocation of method B. While the head thread is executing the first invocation of method B, a first speculative thread begins executing method A at the point where the first invocation to method B will eventually complete. The first speculative thread shortly thereafter begins executing a second invocation of method B. While the first speculative thread is executing a first invocation of method B, a second speculative thread begins executing method A at the point where the second invocation to method B will eventually complete. The second speculative thread shortly thereafter begins executing a third invocation of method B. While the second speculative thread is executing a first invocation of method B, a third speculative thread begins executing method A at the point where the third invocation to method B will eventually complete. The third speculative thread shortly thereafter begins executing a fourth invocation of method B. If all of the speculative threads complete successfully, the speculative threads are eventually joined with the head thread.

[0096] Data Structures to Support Multi-Dimensional Speculative Execution

[0097] FIG. 15 illustrates data structures involved in multi-dimensional speculative execution in accordance with an embodiment of the present invention. Similarly to the data structure illustrated in FIG. 5, an object reference pointer 1501 points to a primary version of an object 1500. Primary version of object 1500 includes a space-time dimension version pointer 1502 as well as a method vector table pointer 1506 and a data region 1508.

[0098] Instead of pointing directly at a speculative version of the object, space-time dimension version pointer 1502 points to array 1510. Array 1510 includes a single entry for each speculative thread, wherein each entry includes an individual status word, an ORed status word and a space-time dimension version pointer. More specifically, entry 1542 is associated with a first speculative thread and includes individual status word 1512, ORed status word 1522 and space-time dimension version pointer 1,532. Entry 1543 is associated with a second speculative thread and includes individual status word 1513, ORed status word 1523 and space-time dimension version pointer 1533. Entry 1544 is associated with a third speculative thread and includes individual status word 1514, ORed status word 1524 and space-time dimension version pointer 1534. Entry 1545 is associated with a fourth speculative thread and includes individual status word 1515, ORed status word 1525 and space-time dimension version pointer 1535. Note that the individual status words 1512-15 are analogous to status word 504 in FIG. 5.

[0099] ORed status words 1522-25 contain additional status information that is used to improve performance. Each ORed status word in the array contains the contents of all following status words in the array ORed together. This allows a given speculative thread to detect a rollback condition by examining its own ORed status word to determine if any higher dimension speculative threads have accessed a particular data item. Alternatively, the speculative thread could scan through all of the following individual status words in the array to determine the same information. Note that one version of the code can be used for speculative threads of all dimensions.

[0100] Space-time dimension version pointers 1532-1535 are analogous to space-time dimensioned version pointer 502 from FIG. 5. Each space-time dimensioned version pointer 1532-35 points to a data region associated with the corresponding speculative thread. If the corresponding speculative thread has not written to the data object, the speculative thread will not have created a copy of the data region. In this case, the corresponding space-time dimension version pointer points to a data region for a preceding speculative thread that has written to the data object, or to a data region 1508 for the head thread. In FIG. 15, space-time dimension version pointers 1532-1533 point to data region 1540 and space-time dimension version pointers 1534-35 point to data region 1541.

[0101] Note that instead of using an array 1510 that contains pointers to space-time dimensioned versions of data objects, another embodiment of the present invention links versions of data objects together through a chain of pointers, and contains additional information specifying a speculative depth level.

[0102] Multi-Dimensional Update Process

[0103] FIG. 16 is a flow chart illustrating operations involved in performing a write to a memory element for the case of multiple speculative threads in accordance with an embodiment of the present invention. First, if the thread performing the write operation is a speculative thread and if the speculative thread has not created its own version of the memory element, the system creates a version of the memory element for the speculative thread (step 1601). The system also updates the status bits to indicate that a write operation has taken place (step 1602). Once the version exists, the system writes to the version of the memory element, and to all space-time dimension versions of the memory element belonging to successive speculative threads (step 1603). Next, the system checks status information to determine if the memory element has been read by a following speculative thread (step 1604). This can be determined by examining the ORed status word associated with the thread. If the memory element has been read by a following speculative thread, the system causes the following speculative thread and any successive speculative threads to roll back (step 1606).

[0104] FIG. 17 is a flow chart illustrating operations involved in performing a read to a memory element by a speculative thread for the case of multiple speculative threads in accordance with an embodiment of the present invention. During this read operation, the system changes status information within array 1510 to indicate that a speculative version of the memory element has been read (step 1702). This involves updating an individual status word belonging to the speculative thread as well as updating the ORed status words for all preceding speculative threads in array 1510. The speculative thread then reads a corresponding space-time dimensioned version of the memory element belonging to the speculative thread, if it exists. Otherwise, the speculative thread reads a version of the memory element belonging to the closest preceding thread that has a version, or if none exists, the speculative thread reads the primary version of the memory element belonging to the head thread.

[0105] Rollback Function

[0106] FIG. 19 illustrates a recursive method for rolling back a series of speculative threads in accordance with an embodiment of the present invention. Before a write operation by a current speculative thread or the head thread, the thread checks the individual status to determine if a rollback is required. If a rollback is required the thread unconditionally rolls back all higher space-time dimensions unconditionally, and then rolls back the current thread. If no rollback is required, the method recursively calls itself on speculative threads belonging to higher space-time dimensions.

[0107] The foregoing descriptions of embodiments of the invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the invention. The scope of the invention is defined by the appended claims.