Reverse computation

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Reverse computation is a software application of the concept of reversible computing.

Because it offers a possible solution to the heat problem faced by chip manufacturers, reversible computing has been extensively studied in the area of computer architecture. The promise of reversible computing is that the amount of heat loss for reversible architectures would be minimal for significantly large numbers of transistors.[1][2] Rather than creating entropy (and thus heat) through destructive operations, a reversible architecture conserves the energy by performing other operations that preserve the system state.[3][4]

The concept of reverse computation is somewhat simpler than reversible computing in that reverse computation is only required to restore the equivalent state of a software application, rather than support the reversibility of the set of all possible instructions. Reversible computing concepts have been successfully applied as reverse computation in software application areas such as database design,[5] checkpointing and debugging,[6] and code differentiation.[7][8]

Reverse Computation for Parallel Discrete Event Simulation[edit]

List of operations that are reverse computable and their costs.

Based on the successful application of Reverse Computation concepts in other software domains, Chris Carothers, Kalyan Perumalla and Richard Fujimoto[9] suggest the application of reverse computation to reduce state saving overheads in parallel discrete event simulation (PDES). They define an approach based on reverse event codes (which can be automatically generated), and demonstrate performance advantages of this approach over traditional state saving for fine-grained applications (those with a small amount of computation per event). The key property that reverse computation exploits is that a majority of the operations that modify the state variables are “constructive” in nature. That is, the undo operation for such operations requires no history. Only the most current values of the variables are required to undo the operation. For example, operators such as ++, ––, +=, -=, *= and /= belong to this category. Note, that the *= and /= operators require special treatment in the case of multiply or divide by zero, and overflow / underflow conditions. More complex operations such as circular shift (swap being a special case), and certain classes of random number generation also belong here.

Operations of the form a = b, modulo and bit-wise computations that result in the loss of data, are termed to be destructive. Typically these operations can only be restored using conventional state-saving techniques. However, we observe that many of these destructive operations are a consequence of the arrival of data contained within the event being processed. For example, in the work of Yaun, Carothers, et al., with large-scale TCP simulation,[10] the last-sent time records the time stamp of the last packet forwarded on a router logical process. The swap operation makes this operation reversible.

History of Reverse Computation as applied to Parallel Discrete Event Simulation[edit]

Taxonomy of digital simulation.

In 1985 Jefferson introduced the optimistic synchronization protocol, which was utilized in parallel discrete event simulations, known as Time Warp.[11] To date, the technique known as Reverse Computation has only been applied in software for optimistically synchronized, parallel discrete event simulation.

In December 1999, Michael Frank graduated from the University of Florida. His doctoral thesis focused on reverse computation at the hardware level, but included descriptions of both an instruction set architecture and a high level programming language (R) for a processor based on reverse computation.[12] [notes 1]

In 1998 Carothers and Perumalla published a paper for the Principles of Advanced and Distributed Simulation workshop[13] as part of their graduate studies under Richard Fujimoto, introducing technique of Reverse Computation as an alternative rollback mechanism in optimistically synchronized parallel discrete event simulations (Time Warp). In 1998, Carothers became an associate professor at Rensselaer Polytechnic Institute. Working with graduate students David Bauer and Shawn Pearce, Carothers integrated the Georgia Tech Time Warp design into Rensselaer’s Optimistic Simulation System (ROSS), which supported only reverse computation as the rollback mechanism. Carothers also constructed RC models for BitTorrent at General Electric, as well as numerous network protocols with students (BGP4, TCP Tahoe, Multicast). Carothers created a course on Parallel and Distributed Simulation in which students were required to construct RC models in ROSS.

Around the same time, Perumalla graduated from Georgia Tech and went to work at the Oak Ridge National Laboratory (ORNL). There he built the uSik simulator, which was a combined optimistic / conservative protocol PDES. The system was capable of dynamically determining the best protocol for LPs and remapping them during execution in response to model dynamics. In 2007 Perumalla tested uSik on Blue Gene/L and found that, while scalability is limited to 8K processors for pure Time Warp implementation, the conservative implementation scales to 16K available processors. Note that benchmarking was performed using PHOLD with a constrained remote event rate of 10%, where the timestamp of events was determined by an exponential distribution with a mean of 1.0, and an additional lookahead of 1.0 added to each event. This was the first implementation of PDES on Blue Gene using reverse computation.

From 1998 to 2005 Bauer performed graduate work at RPI under Carothers, focusing solely on reverse computation. He developed the first PDES system solely based on reverse computation, called Rensselaer’s Optimistic Simulation System (ROSS).[14] for combined shared and distributed memory systems. From 2006 to 2009 Bauer worked under E.H. Page at Mitre Corporation, and in collaboration with Carothers and Pearce pushed the ROSS simulator to the 131,072 processor Blue Gene/P (Intrepid). This implementation was stable for remote event rates of 100% (every event sent over the network). During his time at RPI and MITRE, Bauer developed the network simulation system ROSS.Net[15] that supports semi-automated experiment design for black-box optimization of network protocol models executing in ROSS. A primary goal of the system was to optimize multiple network protocol models for execution in ROSS. For example, creating an LP layering structure to eliminate events being passed between network protocol LPs on the same simulated machine optimizes simulation of TCP/IP network nodes by eliminating zero-offset timestamps between TCP and IP protocols. Bauer also constructed RC agent-based models for social contact networks to study the effects of infectious diseases, in particular pandemic influenza, that scale to hundreds of millions of agents; as well as RC models for Mobile ad-hoc networks implementing functionality of mobility (proximity detection) and highly accurate physical layer electromagnetic wave propagation (Transmission Line Matrix model).[16]

There has also been a recent push by the PDES community into the realm of continuous simulation. For example, Fujimoto and Perumalla, working with Tang et al.[17] have implemented an RC model of particle-in-cell and demonstrated excellent speedup over continuous simulation for models of light as a particle. Bauer and Page demonstrated excellent speedup for an RC Transmission Line Matrix model (P.B. Johns, 1971), modeling light as a wave at microwave frequencies. Bauer also created an RC variant of SEIR that generates enormous improvement over continuous models in the area of infectious disease spread. In addition, the RC SEIR model is capable of modeling multiple diseases efficiently, whereas the continuous model explodes exponentially with respect to the number of combinations of diseases possible throughout the population.



  1. ^ Dr. Frank maintains two websites of his publications on reverse computation to 2004 and later.


  1. ^ Landauer, Rolf (July 1961). "Irreversibility and heat generation in the computing process". IBM Journal of Research and Development. 5 (3): 183–191. CiteSeerX accessible. doi:10.1147/rd.53.0183. 
  2. ^ Von Neumann, John (1966). Theory of Self-Reproducing Automata. University of Illinois Press. p. 388. Retrieved 2009-04-06. 
  3. ^ Bennett, Charles H. (1982). "The thermodynamics of computation—a review" (PDF). International Journal of Theoretical Physics. Springer. 21 (12): 905–940. Bibcode:1982IJTP...21..905B. doi:10.1007/BF02084158. Retrieved 2009-04-06. 
  4. ^ Frank, Michael P. (June 1999). Reversibility for efficient computing, Ph.D. Thesis (PDF). Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science. Retrieved 2009-04-06. 
  5. ^ Leeman Jr., George B. (1986). "A formal approach to undo operations in programming languages". Transactions on Programming Language and Systems. Association for Computing Machinery. 8 (1): 50–87. doi:10.1145/5001.5005. 
  6. ^ Biswas, Bitan; Mall, R. (1999). "Reverse execution of programs". ACM SIGPLAN Notices. Association for Computing Machinery. 34 (4): 61–69. doi:10.1145/312009.312079. Retrieved 2009-04-06. 
  7. ^ Griewank, Andreas; Juedes, David; Utke, Jean (1996). "Algorithm 755: Adolc: a package for the automatic differentiation of algorithms written in c/c++". ACM Transactions on Mathematical Software. Association for Computing Machinery. 22 (2): 131–167. doi:10.1145/229473.229474. Retrieved 2009-04-06. 
  8. ^ Grimm, J; Pottier, L.; Rostaing-Schmidt, N. (1996). "Optimal time and minimum space-time product for reversing a certain class of programs" (PDF). Technical Report. Institute National de Recherche en Informatique et en Automatique (INRIA). 
  9. ^ Carothers, Christopher D.; Perumalla, Kalyan S.; Fujimoto, Richard M. (1999). "Efficient optimistic parallel simulations using reverse computation" (PDF). ACM Transactions on Modeling and Computer Simulation. Association for Computing Machinery. 9 (3): 224–253. doi:10.1145/347823.347828. Archived from the original (PDF) on 2011-07-17. Retrieved 2009-04-06. 
  10. ^ Yaun, Garrett; Carothers, Christopher D.; Kalyanaraman, Shivkumar (2003). "Large-scale tcp models using optimistic parallel simulation". Proceedings of the seventeenth workshop on Parallel and distributed simulation. IEEE Computer Society Washington, DC, USA: 153. CiteSeerX accessible. 
  11. ^ Jefferson, David R. (1985). "Virtual Time" (PDF). ACM Transactions on Programming Languages and Systems. Association for Computing Machinery. 7 (3): 404–425. doi:10.1145/3916.3988. Retrieved 2009-04-06. 
  12. ^ Vieri, C.; Ammer, M.J.; Frank, M.; Margolus, N.; Knight, T. (June 1998). "A fully reversible asymptotically zero energy microprocessor" (PDF). Power Driven Microarchitecture Workshop: 138–142. 
  13. ^ PADS
  14. ^ Carothers, Christopher D.; Bauer, D. W.; Pearce, Shawn O. (2002). "ROSS: A high-performance, low-memory, modular Time Warp system". Journal of parallel and distributed computing. Elsevier. 62 (11): 1648–1669. CiteSeerX accessible. doi:10.1016/S0743-7315(02)00004-7. 
  15. ^ Bauer, David W.; Yaun, Garrett; Carothers, Christopher D.; Yuksel, Murat; Kalyanaraman, Shivkumar (2003). "ROSS.Net: optimistic parallel simulation framework for large-scale Internet models". Proceedings of the 2003 Winter Simulation Conference. 1. 
  16. ^ Bauer Jr., David W.; Page, Ernest H. (2007). "Optimistic parallel discrete event simulation of the event-based transmission line matrix method". Proceedings of the 39th conference on Winter simulation: 40 years! the best is yet to come. IEEE Press Piscataway, NJ, USA: 676–684. CiteSeerX accessible. 
  17. ^ Tang, Y.; Perumalla, K. S.; Fujimoto, R. M.; Karimabadi, H.; Driscoll, J.; Omelchenko, Y. (2005). "Optimistic parallel discrete event simulations of physical systems using reverse computation" (PDF). Principles of Advanced and Distributed Simulation. IEEE Computer Society Press: 26–35. Retrieved 2009-04-06.