Opimising the time wrap using the semantics of abstract data types

Simple item page
dc.contributor.authorWest, Darrineng
dc.contributor.authorLomow, Gregeng
dc.contributor.authorUnger, Brian Weng
dc.date.accessioned2008-02-27T22:20:29Z
dc.date.available2008-02-27T22:20:29Z
dc.date.computerscience1999-05-27eng
dc.date.issued1986-10-01eng
dc.description.abstractThe Time Warp mechanism for synchronising the execution of simulation components offers significant potential for achieving concurrency within distributed simulations. This mechanism takes advantage of the independence of most events in a simulation, enforcing only a partial ordering of events which allows many events to occur in an arbitrary order. There are many situations, however, where the partial order imposed by Time Warp is too restrictive, i.e., events are unnecessarily forced to occur in a specific order. This paper presents several example situations where Time Warp semantics can be relaxed, describes an approach based on abstract data types that can substantially improve performance, and outlines an implementation of this approach.eng
dc.identifier.department1986-245-19eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31091
dc.identifier.urihttp://hdl.handle.net/1880/46072
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleOpimising the time wrap using the semantics of abstract data typeseng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1986-245-19.pdf
Size:
1.01 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications