US 6,438,677 B1Grant
Dynamic handling of object versions to support space and time dimensional program execution
Issue Date:2002-08-20
•24 Claims
•7 Drawing Sheets
Abstract
One embodiment of the present invention provides a system that supports space and time dimensional program execution by facilitating accesses to different versions of a memory element. The system supports a head thread that executes program instructions and a speculative thread that executes program instructions in advance of the head thread. The head thread accesses a primary version of the memory element, and the speculative thread accesses a space-time dimensioned version of the memory element. During a reference to the memory element by the head thread, the system accesses the primary version of the memory element. During a reference to the memory element by the speculative thread, the speculative thread accesses a pointer associated with the primary version of the memory element, and accesses a version of the memory element through the pointer. Note that the pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists. In one embodiment of the present invention, the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Shailender Chaudhry
- Marc Tremblay
Application Information
Application Number:US 09/422,028
Filing Date:1999-10-20
Priority Date:1999-05-17
Art Unit:7
Classifications
IPC:
G06F 952G06F 954G06F 940G06F 1208
Field of Search:
712 23712 26712 24712 41712 25712 42712 27712225712201712227712202712228712219712245712217712242712223712243709315709102709316709332709317709106709108717108717118717116717165717143
Patent Drawings (7 sheets)
Description
Related Application
[0002] This application is a continuation-in-part of a pending U.S. patent application, entitled “Supporting Space-Time Dimensional Program Execution by Selectively Versioning Memory Updates,” by inventors Shailender Chaudhry and Marc Tremblay, having Ser. No. 09/313,229 and a filing date of May 17, 1999, now U.S. Pat. No. 6,353,881. This application hereby claims priority under 35 U.S.C. § 120 to the above-listed patent application.
Background
[0003] 1. Field of the Invention
[0004] The present invention relates to techniques for improving computer system performance. More specifically, the present invention relates to a method and apparatus that provides dynamic handling of object versions to support space and time dimensional execution of a computer program.
[0005] 2. Related Art
[0006] 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.
[0007] 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.
[0008] 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.
[0009] 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.
[0010] One challenge in designing a system that supports speculative execution is to efficiently keep track the different versions of memory elements that are created during speculative execution. If a speculatively executed instruction performs a write operation to a memory element, the write operation creates a speculative version of the memory element that remains separate from a non-speculative version of the memory element until the speculative version is merged into the non-speculative version at some time in the future. This merging operation can only take place when it is certain that the speculatively executed instruction completed successfully.
[0011] What is needed is a method and an apparatus that efficiently keeps track different versions of memory elements that are created during speculative execution.
Summary
[0012] One embodiment of the present invention provides a system that supports space and time dimensional program execution by facilitating accesses to different versions of a memory element. The system supports a head thread that executes program instructions and a speculative thread that executes program instructions in advance of the head thread. The head thread accesses a primary version of the memory element, and the speculative thread accesses a space-time dimensioned version of the memory element. During a reference to the memory element by the head thread, the system accesses the primary version of the memory element. During a reference to the memory element by the speculative thread, the speculative thread accesses a pointer associated with the primary version of the memory element, and accesses a version of the memory element through the pointer. Note that the pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
[0013] In one embodiment of the present invention, the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
[0014] In one embodiment of the present invention, the pointer points to a data structure that points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
[0015] In one embodiment of the present invention, the memory element is part of an object defined within an object-oriented programming system.
[0016] In one embodiment of the present invention, if the reference is a write operation by the speculative thread and the space-time dimensioned version of the memory element does not exist, the system creates the space-time dimensioned version of the memory element and sets the pointer to point to the space-time dimensioned version of the memory element.
[0017] In one embodiment of the present invention, if the reference is a read operation by the speculative thread, the read operation is directed to the space-time dimensioned version of the memory element if it exists, and otherwise is directed to the primary version of the memory element.
[0018] In one embodiment of the present invention, during a reference to the memory element by the speculative thread, the method further comprises updating status information associated with the memory element to indicate that the reference to the memory element by the speculative thread took place.
[0019] Another embodiment of the present invention provides a system that produces code to access different versions of a memory element in order to support space and time dimensional execution. The system operates by receiving a byte code version of a program, and translating the byte code version of the program into a head thread version of the program that accesses the primary version of the memory element. The system also translates the byte code version of the program into a speculative thread version of the program that accesses a version of the memory element through a pointer associated with the primary version of the memory element. Note that this pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists, and otherwise points to the primary version of the memory element.
Brief Description of the Figures
[0020] 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.
[0021] FIG. 2A illustrates sequential execution of methods by a single thread.
[0022] FIG. 2B illustrates space and time dimensional execution of a method in accordance with an embodiment of the present invention.
[0023] 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.
[0024] FIG. 4 illustrates how memory is partitioned between stack and heap in accordance with an embodiment of the present invention.
[0025] 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.
[0026] FIG. 6 illustrates the structure of a status word for an object in accordance with an embodiment of the present invention.
[0027] 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.
[0028] 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.
[0029] 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.
[0030] 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.
[0031] FIG. 11 is a flow chart illustrating operations involved in performing a join between a head thread and a speculative thread in accordance with another embodiment of the present invention.
[0032] FIG. 12 illustrates how a program in byte code form is translated into a head thread version and a speculative thread version in accordance with an embodiment of the present invention.
[0033] FIG. 13A is a flow chart illustrating how the head thread version of a program accesses a memory element in accordance with an embodiment of the present invention.
[0034] FIG. 13B is a flow chart illustrating how the speculative thread version of the program accesses the memory element in accordance with an embodiment of the present invention.
[0035] FIG. 14 is a flow chart illustrating how the head thread version of the program and the speculative thread version of the program are created in accordance with an embodiment of the present invention.
Detailed Description
[0036] 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 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.
[0037] 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.
[0038] Computer System
[0039] 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.
[0040] 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.
[0041] 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.
[0042] 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.
[0043] In one embodiment of the present invention, data cache 106 is a 16K byte 4-way set-associative data cache with 32 byte cache lines.
[0044] 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.
[0045] 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.
[0046] Space-Time Dimensional Execution of Methods
[0047] 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.
[0048] 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 B206, assume that method C 208 uses a predicted return value from method B 206.)
[0049] 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.
[0050] 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.
[0051] 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.
[0052] 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.
[0053] 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.
[0054] 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.
[0055] 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.
[0056] 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.
[0057] 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.
[0058] 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 byte code into machine code for the specific computing platform. Alternatively, a Java byte code can be executed directly on a Java byte code engine running on the specific computing platform.
[0059] Fortunately, a Java byte code contains more syntactic information than conventional machine code. In particular, the Java byte codes 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.
[0060] Data Structures to Support Space-Time Dimensional Execution
[0061] 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.
[0062] 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.
[0063] 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.
[0064] 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.
[0065] 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.
[0066] 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.
[0067] Space-Time Dimensional Update Process
[0068] 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.
[0069] 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.
[0070] 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.
[0071] 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.
[0072] 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.
[0073] 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.
[0074] 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.
[0075] 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.
[0076] 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.
[0077] Head Thread Version and Speculative Thread Version of a Program
[0078] FIG. 12 illustrates how a program in byte code form is translated into a head thread version and a speculative thread version in accordance with an embodiment of the present invention. The system starts with a program in byte code form. This program includes a number of memory references including a “getfield” command to read a memory element, and a “putfield” command to write a memory element.
[0079] Note that in one embodiment of the present invention, the program in byte code form includes Java byte codes that run on a Java virtual machine. Java byte codes are often interpreted or just-in-time (JIT) compiled by a Java virtual machine immediately prior to execution. In some instances, frequently used library methods are pre-compiled from Java byte codes into machine code. The discussion below applies to this pre-compilation process and the just-in-time compilation process. Also note that in another embodiment of the present invention, the program in byte code form is a source code version of a program.
[0080] Note that the program in byte code form is precompiled into a program in machine code form 1204 for head thread 202 and a program in machine code form 1206 for speculative thread 203.
[0081] In producing the machine code for head thread 202, the getfield command is compiled into machine code instructions. These machine code instructions load a reference into a register (if the reference is not already in the register). In one embodiment of the present invention, the reference is a pointer to the start of a block of fields for an object defined within an object-oriented programming system. Once this reference is loaded, the system uses the reference and a field offset to load the field.
[0082] In producing the machine code for head thread 202, the putfield command is precompiled into a number of machine code instructions that store a value to a field. During the putfield command, the reference is first loaded into a register if it is not already there. Next, the reference and a field offset are used to store a value to the field. Also, the marking bits are checked for a possible rollback. If a marking bit is set, a rollback is issued.
[0083] In producing the machine code version of the program for speculative thread 203, the getfield command is compiled into a number of machine code instructions. These machine code instructions perform an “indirection load” through a pointer (such as space-time dimensioned version pointer 502) to retrieve a reference to a version of the memory element into a register. Note that the pointer points to the space-time dimensioned version of the memory element 510 if the space-time dimensioned version of the memory element 510 exists. Otherwise, the pointer points to the primary version of the memory element 500. After the indirection load is complete, the machine code sets marking bits associated with the memory element to indicate that the memory element has been read by speculative thread 203. Finally, the machine code loads a value from the specified field using a field offset.
[0084] In producing the machine code version of the program for speculative thread 203, the putfield command is compiled into machine code. This machine code first checks to see if the a space time dimensioned version of the memory element 510 exists. If the not, the machine code creates a version. The machine code also performs an “indirection load” through a pointer (such as space-time dimensioned version pointer 502 from FIG. 5) to retrieve a reference to a version of the memory element into a register. After the indirection load is complete, the machine code sets marking bits associated with the memory element to indicate that the memory element has been written to by speculative thread 203. Finally, the machine code stores a value to the specified field using a field offset.
[0085] Note that the above described machine code instructions to perform the getfield and putfield commands can be precompiled into templates that can be substituted for the getfield and putfield commands during the compilation process in order to speed up the compilation process.
[0086] FIG. 13A is a flow chart illustrating how the head thread version of a program accesses a memory element in accordance with an embodiment of the present invention. The head thread version of the program simply accesses the primary version of the memory element (step 1302). As mentioned previously, in some embodiments of the present invention, head thread 202 may perform a broadcast write to both the primary and space time dimensioned versions of the memory element.
[0087] FIG. 13B is a flow chart illustrating how the speculative thread version of the program accesses the memory element in accordance with an embodiment of the present invention. The speculative thread version of the program first de-references a pointer (such as space-time dimensioned version pointer 502 from FIG. 5) (step 1304). The speculative thread version of the program also sets marking bits associated with the memory element to indicate that speculative thread 203 has accessed the memory element (step 1306). Finally, the speculative thread version of the program accesses the memory element through the de-referenced pointer. This access may take the form of a load operation or a store operation (step 1308).
[0088] FIG. 14 is a flow chart illustrating how the head thread version of the program and the speculative thread version of the program are created in accordance with an embodiment of the present invention. The system starts by receiving a byte code version of a program (step 1402). As mentioned previously, in one embodiment of the present invention the byte code version of the program can include Java byte codes. Next, the system translates the byte code version of the program into a head thread version of the program that accesses the primary version of the memory element (step 1404). The system also translates the byte code version of the program into a speculative thread version of the program (step 1406). This speculative thread version of the program accesses the memory element indirectly through a pointer associated with the primary version of the memory element. As mentioned above, the pointer points to the space-time dimensioned version of the memory element 510 if the space-time dimensioned version of the memory element 510 exists. Otherwise, the pointer points to the primary version of the memory element 500.
[0089] 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.
Claims
What is claimed is:
1. A method for accessing versions of a memory element in a system that supports space and time dimensional execution, the system having a head thread that executes program instructions and a speculative thread that executes program instructions in advance of the head thread, the head thread accessing a primary version of the memory element and the speculative thread accessing a space-time dimensioned version of the memory element, the method comprising:
wherein the pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
accessing the primary version of the memory element during a reference to the memory element by the head thread; and
during a reference to the memory element by the speculative thread,
accessing a pointer associated with the primary version of the memory element, and
accessing a version of the memory element through the pointer;
2. The method of claim 1, wherein the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
3. The method of claim 1, wherein if the reference is a write operation by the speculative thread and the space-time dimensioned version of the memory element does not exist, the system creates the space-time dimensioned version of the memory element and sets the pointer to point to the space-time dimensioned version of the memory element.
4. The method of claim 1, wherein if the reference is a read operation by the speculative thread, the read operation is directed to the space-time dimensioned version of the memory element if it exists, and otherwise is directed to the primary version of the memory element.
5. The method of claim 1, wherein during a reference to the memory element by the speculative thread, the method further comprises updating status information associated with the memory element to indicate that the reference to the memory element by the speculative thread took place.
6. The method of claim 1, wherein the memory element is part of an object defined within an object-oriented programming system.
7. The method of claim 1, wherein the pointer points to a data structure that points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
8. The method of claim 1, wherein if the reference is a write operation by the head thread, the method further comprises:
checking status information associated with the memory element to determine if the space-time dimensioned version of the memory element has been written by the speculative thread; and
writing to the space-time dimensioned version of the memory element only if the speculative thread has not written to the space-time dimensioned version of the memory element.
9. The method of claim 1, wherein if the reference is a write operation by the head thread and the space-time dimensioned version of the memory element exists, the method further comprises:
performing the write operation to the space-time dimensioned version of the memory element;
checking status information associated with the memory element to determine if the space-time dimensioned version of the memory element has been written by the speculative thread; and
if the space-time dimensioned version of the memory element has been written by the speculative thread, causing the speculative thread to roll back so that the speculative thread can perform the write operation again in order to undo the write operation to the space-time dimensioned version of the memory element by the head thread.
10. A apparatus for facilitating accesses to versions of a memory element in a system that supports space and time dimensional execution, comprising:
a thread execution mechanism supporting a head thread that executes program instructions, and a speculative thread that executes program instructions in advance of the head thread;
wherein the head thread accesses a primary version of the memory element and the speculative thread accesses a space-time dimensioned version of the memory element;
a head thread memory reference mechanism that accesses the primary version of the memory element during a reference to the memory element by the head thread; and
a speculative thread memory reference mechanism that accesses a version of the memory element through a pointer associated with the primary version of the memory element during a reference to the memory element by the speculative thread;
wherein the pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
11. The apparatus of claim 10, wherein the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
12. The apparatus of claim 10, wherein if the reference is a write operation by the speculative thread and the space-time dimensioned version of the memory element does not exist, the speculative thread memory reference mechanism is configured to,
create the space-time dimensioned version of the memory element; and to
set the pointer to point to the space-time dimensioned version of the memory element.
13. The apparatus of claim 10, wherein if the reference is a read operation by the speculative thread, the speculative thread memory reference mechanism is configured to, direct the read operation to the space-time dimensioned version of the memory element if it exists, and otherwise to direct the read operation to the primary version of the memory element.
14. The apparatus of claim 10, wherein the speculative thread memory reference mechanism is configured to update status information associated with the memory element to indicate that the reference to the memory element by the speculative thread took place.
15. The apparatus of claim 10, wherein the memory element is part of an object defined within an object-oriented programming system.
16. The apparatus of claim 10, wherein the pointer points to a data structure that points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
17. A computer readable storage medium storing instructions that when executed by a computer cause the computer to facilitate accesses to versions of a memory element in a system that supports space and time dimensional execution, the computer readable storage medium including:
a head thread version of a program for execution by a head thread that accesses a primary version of the memory element; and
a speculative thread version of the program for execution by a speculative thread that accesses a version of the memory element through a pointer associated with the primary version of the memory element;
wherein the pointer points to a space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
18. The computer readable storage medium of claim 17, wherein the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
19. The computer readable storage medium of claim 17, wherein the head thread version of the program and the speculative thread version of the program are translated into executable code from the same source code program.
20. The computer readable storage medium of claim 17, wherein the memory element is part of an object defined within an object-oriented programming system.
21. A method for producing code to access versions of a memory element in a system that supports space and time dimensional execution, the system having a head thread that executes program instructions and a speculative thread that executes program instructions in advance of the head thread, the head thread accessing a primary version of the memory element and the speculative thread accessing a space-time dimensioned version of the memory element, the method comprising:
receiving a byte code version of a program;
translating the byte code version of the program into a head thread version of the program that accesses the primary version of the memory element; and
translating the byte code version of the program into a speculative thread version of the program that accesses a version of the memory element through a pointer associated with the primary version of the memory element;
wherein the pointer points to the space-time dimensioned version of the memory element if the space-time dimensioned version of the memory element exists.
22. The method of claim 21, wherein the pointer points to the primary version of the memory element if the space-time dimensioned version of the memory element does not exist.
23. The method of claim 21, wherein the memory element is part of an object defined within an object-oriented programming system.
24. The method of claim 21, wherein the byte code version of the program includes Java byte codes.
Patent Citations (8)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5887166(A) | 1999-03-01 | Mallick et al. | Examiner |
| US5923863(A) | 1999-07-01 | Adler et al. | Applicant |
| US6079014(A) | 2000-06-01 | Papworth et al. | Applicant |
| US6182210(B1) | 2001-01-01 | Akkary et al. | Applicant |
| EP266505 | 1987-08-01 | Applicant | |
| EP425415 | 1990-09-01 | Applicant | |
| EP518479 | 1992-05-01 | Applicant | |
| GB2321544 | 1997-11-01 | Applicant |