(Enter summary)
Abstract: In this paper we discuss new synchronization algorithms for Parallel and Distributed Discrete
Event Simulations (PDES) which exploit the capabilities and behavior of the underlying
communications network. Previous work in this area has assumed the network to be a Black
Box which provides a one-to-one, reliable and in-order message passing paradigm. In this work,
we utilize the Broadcast capability of the ubiquitous Ethernet for synchronization computations,
and both unreliable and reliable ... (Update)
Context of citations to this paper: More
...message, all peers must wait until all expected messages have been received before replying. An outline of a correctness proof is given in [8], but omitted here for brevity. 4.3 The BCTCP Algorithm More formally, the BCTCP algorithm works the same as BCUDP excepting the handling...
Cited by: More
Distributed Network Simulations using the Dynamic.. - Riley, Ammar.. (2001)
(Correct)
Network Aware Time Management and Event Distribution - George Riley Richard (2000)
(Correct)
Active bibliography (related documents): More All
0.3: Exploiting Temporal Uncertainty in Parallel and Distributed.. - Fujimoto (1999)
(Correct)
0.2: RTI Performance on Shared Memory and Message Passing.. - Steve Ferenci
(Correct)
0.2: Multicast Grouping For Dynamic Data Distribution Management - Katherine Morse (1999)
(Correct)
Similar documents based on text: More All
0.2: Simulating Large Networks - How Big is Big Enough? - Riley, Ammar
(Correct)
0.2: Enabling Large-Scale Multicast Simulation by Reducing.. - Xu, Riley, Ammar.. (2003)
(Correct)
0.2: Exploiting the Predictability of TCP's Steady-state.. - He, Ammar, Riley..
(Correct)
Related documents from co-citation: More All
2: Asynchronous distributed simulation via a sequence of parallel computations (context) - Chandy, Misra - 1981
2: Efficient algorithms for distributed snapshots and global virtual time approxima..
- Mattern - 1993
2: The cost of conservative synchronization in parallel discrete event simulations (context) - Nicol - 1993
BibTeX entry: (Update)
G. F. Riley, R. M. Fujimoto, and M. A. Ammar, "Network aware time management and event distribution," Feb 2000. Technical Report GIT-CC-00-11. http://citeseer.ist.psu.edu/article/riley99network.html More
@inproceedings{ riley00network,
author = "George F. Riley and Richard Fujimoto and Mostafa H. Ammar",
title = "Network aware time management and event distribution",
booktitle = "Workshop on Parallel and Distributed Simulation",
pages = "119-126",
year = "2000",
url = "citeseer.ist.psu.edu/article/riley99network.html" }
Citations (may not include all citations):
141
Asynchronous distributed simulation via a sequence of parall.. (context) - Chandy, Misra - 1981
51
The conditional event approach to distributed simulation (context) - Chandy, Sherman - 1989
49
Efficient algorithms for distributed snapshots and global vi..
- Mattern - 1993
48
The cost of conservative synchronization in parallel discret.. (context) - Nicol - 1993
11
ACM Transactions on Modeling and Computer Simulation (context) - Nicol, Heidelberger et al. - 1996
5
Hla rti performance in high speed lan environments
- Fujimoto, Hoare - 1998
Documents on the same site (http://www.cc.gatech.edu/people/home/riley/): More
Receiver-Based Multicast Scoping: A new cost-conscious.. - George Riley Mostafa (1998)
(Correct)
Stateless Routing in Network Simulations - Riley, Ammar, Fujimoto (2000)
(Correct)
Efficient Routing using NIx-Vectors - Riley, Ammar, Zegura (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC