John G. Cleary
ABSTRACT
The problem of executing sequential programs in parallel using the optimistic algorithm Time Warp is considered. This is done by first mapping the sequential execution to a control tree and then assigning timestamps to each node in the tree.For such timestamps to be effective in either hardware or software they must be finite, this implies that they must be periodically rescaled to allow old timestamps to be reused. A number of timestamp representations are described and compared on the basis of: their complexity; the frequency and cost of rescaling; and the cost of performing basic operations, including comparison and creation of new timestamps.
- 1.Back, A. and Turner, S., (1995) "Using Optimistic Execution Techniques as a Parallelisation Tool for General Purpose Computing," Proceedings of HPCN Europe, Milan, Italy, pp21-26, May. Google Scholar
Digital Library
- 2.Back, A. and Turner, S., (1995) "Time-Stamp Generation for Optimistic Parallel Computing," Proceedings of 28th Annual Simulation Symposium, Phoenix, AZ, USA, pp144-153, April. Google ScholarDigital Library
- 3.Bell, T.C., Cleary, J.G., and Witten, I.H. (1990) "Text compression," Prentice Hall, Englewood Cliffs, NJ. Google ScholarDigital Library
- 4.Choi, J.D., Miller, B.P. and Netzer, R.H.B., (1991) "Techniques for Debugging Parallel Programs with Flowback Analysis," A CM Transactions o n Programming Languages and Systems 13(4), pp491-530, October. Google ScholarDigital Library
- 5.Cleary, J.G., Pearson, M. and Kinawi, H., (1995) "The Architecture of an Optimistic CPU: The WarpEngine," Proceedings of HICSS, vol 1 pp163-172. Google ScholarDigital Library
- 6.Fujimoto, R.M., (1989) "Time Warp on a Shared Memory Multiprocessor," Transactions of the Society for Computer Simulation, 6(3), pp211-239, July. Google ScholarDigital Library
- 7.Fujimoto, R.M., (1990) "Parallel Discrete Event Simulation," Communications of the ACM, 33(10), pp30-53, October. Google ScholarDigital Library
- 8.Hennessy, J.L. and Patterson, D.A. (1996) "Computer Architecture: A Quantitative Approach," second edition, Morgan Kaufmann Publishers, San Francisco. Google ScholarDigital Library
- 9.Jefferson, D.R., (1985) "Virtual Time," ACM Transactions on Programming Languages and Systems, 7(3), pp404-425, July. Google ScholarDigital Library
- 10.Jefferson, D.R., (1990) "Virtual Time II: Storage Management in Distributed Simulation," Proceedings of the Ninth Annual A CM Symposium on Principles of Distributed Computing, pp75-89, August. Google ScholarDigital Library
- 11.Jefferson, D.R. and Motro, A., (1986) "The Time Warp Mechanism for Database Concurrency Control," Proceedings of lEEE International Conference on Data Engineering. Google ScholarDigital Library
- 12.Prakash, A. and Knister, M.J., (1992) "Undoing Actions in Collaborative Work," ACM Conference on Computer Supported Cooperative Work: Sharing' Perspectives, Toronto, pp273-280, November. Google ScholarDigital Library
- 13.Thimbleby, H., (1990) "User Interface Design," ACM Press, pp261-286. Google Scholar
- 14.Turner, S.J. and Back, A. (1994) "General Purpose Optimistic Parallel Computing", Proceedings of 7th PARSYS User Group Meeting, Oxford, April.Google Scholar
Index Terms
- Timestamp representations for virtual sequences
Recommendations
A TimeStamp Based Multi-version STM Algorithm
ICDCN 2014: Proceedings of the 15th International Conference on Distributed Computing and Networking - Volume 8314Software Transactional Memory Systems STM are a promising alternative for concurrency control in shared memory systems. Multiversion STM systems maintain multiple versions for each t-object. The advantage of storing multiple versions is that it ...
Timestamp reassignment: taming transaction abort for serializable snapshot isolation
Serializable snapshot isolation (SSI) is a promising technique to exploit parallelism for multi-core databases. However, SSI suffers from excessive transaction aborts. Existing remedies have three drawbacks: 1) tracking prohibitively transitive ...
Commit phase in timestamp-based stm
SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architecturesTimestamp-based Software Transactional Memory (STM)validation techniques use a global shared counter and timestamping of objects being written to reason about sequencing of transactions and their linearization points, while reducing the number of ...
Comments