Dynamic reordering of high latency transactions in time-warp simulation using a modified micropipeline

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Program Advanced Research Projects Agency
Creator Gopalakrishnan, Ganesh
Other Author Liebchen, Armin
Title Dynamic reordering of high latency transactions in time-warp simulation using a modified micropipeline
Date 1992
Description Time warp based simulation of discrete-event systems is an efficient way to overcome the synchronization overhead during distributed simulation. As computations may proceed beyond synchronization barriers in time warp, multiple checkpoints of state need to be maintained to be able to rollback invalidated branches of the lookahead execution. An efficient mechanism to implement state rollback has been proposed in [IEEE Transactions on Computers, January 1992]. In this environment, a dedicated Roll-back Chip (RBC) maintains multiple versions of state by responding to a set of control instructions interspersed with the regular stream of data-access instructions. As these control instructions have latencies that are orders of magnitude more than the latencies of data-access instructions, a strict ordering of the instructions may lead to large inefficiencies. This paper describes a dynamic instruction reordering scheme that optimizes multiple pending instructions to achieve higher throughput. A modified asynchronous micropipeline, called the Asynchronous Reorder Pipeline (ARP) has been chosen to implement this scheme. ARP can be easily adapted for supporting dynamic instruction reordering in other situations also. After outlining the design of the ARP, we present its high level protocol, and a correctness argument. We then present two new primitive asynchronous components that are used in the ARP: a lockable C-element LockC, and an exchange pipeline stage ExLatch. Circuit level simulation results are presented to justify that LockC - a critical component of our design - functions correctly. The newly proposed primitives, as well as the ARP itself, are useful in other contexts as well.
Type Text
Publisher University of Utah
First Page 1
Last Page 16
Subject Asynchronous design; Micropipelines; Dynamic instruction reordering; Time warp simulations
Language eng
Bibliographic Citation Liebchen, A., & Gopalakrishnan, G. (1992). Dynamic reordering of high latency transactions in time-warp simulation using a modified micropipeline. 1-16. UUCS-92-005.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,141,409 bytes
Identifier ir-main,16383
ARK ark:/87278/s6f486f8
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-23
ID 704147
Reference URL https://collections.lib.utah.edu/ark:/87278/s6f486f8
Back to Search Results