Adam Back and Steve Turner. Time--stamp generation for optimistic parallel computing. In Proceedings of the 28th Annual Simulation Symposium, Pheonix, AZ. IEEE Press, April 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....some efficient way of generating such a virtual sequence, any of the conservative or optimistic algorithms for parallel simulation can be used to parallelize the sequential execution. Two different systems using Time Warp to implement these ideas have appeared in the literature. Back and Turner [1, 2, 13] have constructed a software based system for C and Cleary et al. [5] have designed a general purpose CPU which transparently executes sequential code. 2 As observed by Back and Turner [2] a major problem of using Time Warp with a virtual sequence is that it may be necessary to allocate an ....

....systems using Time Warp to implement these ideas have appeared in the literature. Back and Turner [1, 2, 13] have constructed a software based system for C and Cleary et al. [5] have designed a general purpose CPU which transparently executes sequential code. 2 As observed by Back and Turner [2] a major problem of using Time Warp with a virtual sequence is that it may be necessary to allocate an arbitrary number of new timestamps between any pair of existing timestamps. The solution in Back and Turner (infinite length timestamps similar to the length representation described below) works ....

Back, A. and Turner, S., (1995) "Time-Stamp Generation for Optimistic Parallel Computing," Proceedings of 28th Annual Simulation Symposium, pp. 144-153, April. 13

....to start D in parallel with A, constrained only by data dependencies. To do this it must be possible to insert an arbitrary number of timestamps between the start of the section of unknown size (A and B or C) and the convergent code (D) in order to assign a timestamp to each instruction [1]. In this paper we present a conceptual model for timestamps (see also [3] and consider a number of possible implementations of fixed length timestamp representations and their efficiency. Results are presented from a number of algorithms run on a simulator for the WarpEngine [4] an aggressively ....

Adam Back and Steve Turner. Time-stamp generation for optimistic parallel computing. In Proceedings of the 28th AnnualSimulationSymposium, pages 144--153, Phoenix, Arizona, April 1995.

No context found.

Adam Back and Steve Turner. Time--stamp generation for optimistic parallel computing. In Proceedings of the 28th Annual Simulation Symposium, Pheonix, AZ. IEEE Press, April 1995.

No context found.

A Back and S J Turner. Time-stamp generation for optimistic parallel computing. In Proceedings of the 28th Annual Simulation Symposium, Phoenix, AZ, pages 144--53. IEEE Press, April 1995.

....advance for sections of code. In general, the time stamp allocation scheme must allow an arbitrary number of new time stamps to be allocated between any pair of previously allocated time stamps. An allocation scheme for generating and manipulating timestamps efficiently is discussed in detail in [1]. 4 The Transformations There are three levels to the transformation system, as shown in figure 1: the heuristic level, the annotation level, and the underlying transformations. The annotation level provides an interface which will, in the future, allow the transformations to be directed by an ....

....range. Unbounded time stamp generators are required for cases where it is not known how many time stamps will be required for the range, for example, with loops with an exit condition which is determined at run time. To meet these requirements, a variable length time stamp scheme has been adopted [1]. Control Flow Objects For control constructs where the flow of control is determined by the result returned by a method of a server object, the control construct itself must be transformed to a replacement control flow object, which has the properties of a server object. For example, with the ....

A Back and S Turner. Time-stamp generation for optimistic parallel computing. In Proceedings of the 28th Annual Simulation Symposium, Phoenix, AZ, pages 144--53. IEEE Press, April 1995.

....is taken to be smaller. Only if both the fractional values and the length of time stamps are equal are the time stamps considered equal, that is, trailing zeros become significant in the ordering, so that 0:10 6= 0:1. A full discussion of the time stamp allocation mechanism can be found in [1]. 5 1 2 4 4 4 4 2 8 8 8 8 8 8 8 0 0 0 0 1 1 1 2 2 3 3 4 8 6 7 Figure 5: Tree Representation of Time stamps 6 Run Time System 6.1 Server Objects and Roll Back A server object is a remote procedure call (RPC) server for an object. It has a single main thread of control which accepts RPC ....

....(3, 4 2) request the value of i and request the value to be forwarded to func: arg1, if1: eval1 and for1: next1 respectively. Message (11) requests that i be incremented. If1: eval1 requests the value of v[i] in message (13) the value of i is chosen to be 1 in the diagram so the value of v[1] is asked for. The request for the value of v[1] specifies that the result be sent to if1:eval2, this allows the if1 server object to resume the logic of the if statement when the value of v[i] has been obtained. It may serve other RPC requests before receiving the value of v[i] If the condition ....

[Article contains additional citation context not shown here]

A. Back and S. Turner. Time-stamp generation for optimistic parallel computing. In Proceedings of the 28th Annual Simulation Symposium, Phoenix, Arizona, pages 144--153. IEEE Press, April 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC