• DocumentCode
    2791523
  • Title

    Adaptive algorithms vs. Time Warp: an analytical comparison

  • Author

    Srinivasan, Sudhir ; Reynolds, Paul E., Jr.

  • Author_Institution
    Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA
  • fYear
    1995
  • fDate
    3-6 Dec 1995
  • Firstpage
    666
  • Lastpage
    673
  • Abstract
    Adaptive synchronization algorithms have been proposed to improve upon conservative and optimistic algorithms. We present the first known analytical comparison of adaptive, optimistic algorithms and Time Warp. We define a class of adaptive protocols, the asynchronous adaptive waiting protocols (AAWPs) and identify several practical protocols that belong to this class. We show that Time Warp can outperform an AAWP arbitrarily. We describe the Elastic Time Algorithm (ETA), a particular AAWP and show that ETA can outperform Time Warp arbitrarily
  • Keywords
    discrete event simulation; parallel algorithms; protocols; synchronisation; time warp simulation; Elastic Time Algorithm; Time Warp; adaptive synchronization algorithms; asynchronous adaptive waiting protocols; conservative algorithms; optimistic algorithms; Adaptive algorithm; Algorithm design and analysis; Computer science; Discrete event simulation; Event detection; Performance analysis; Protocols; Safety; Time of arrival estimation; Veins;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Simulation Conference Proceedings, 1995. Winter
  • Conference_Location
    Arlington, VA
  • Print_ISBN
    0-78033018-8
  • Type

    conf

  • DOI
    10.1109/WSC.1995.478842
  • Filename
    478842