Show simple item record  

dc.contributor.authorCleary, John G.
dc.contributor.authorMcWha, David J.A.
dc.contributor.authorMurray, Pearson
dc.coverage.spatialConference held at Lockenhaus, Austria, 1997en_NZ
dc.date.accessioned2008-10-29T03:01:16Z
dc.date.available2008-10-29T03:01:16Z
dc.date.issued1996-11
dc.identifier.citationCleary, J. G., McWha, J. A. D. & Pearson, M. (1996). Timestamp representations for virtual sequences. (Working paper 96/27). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1188
dc.description.abstractThe problem of executing sequential programs optimistically using the Time Warp algorithm is considered. It is shown how to do this, 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 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.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherIEEE Computer Society Pressen_NZ
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.titleTimestamp representations for virtual sequencesen_US
dc.typeWorking Paperen_US
uow.relation.series96/27
dc.relation.isPartOf11th Workshop on Parallel and Distributingen_NZ
pubs.begin-page98en_NZ
pubs.elements-id23802
pubs.end-page105en_NZ
pubs.place-of-publicationLos Alamitos, Californiaen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record