K.M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engeneering, 5(5).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....out of order) Both LAPSE [17, 18] and Parallel Proteus use some form of program analysis to increase the simulation window beyond a fixed quantum. MPI Sim uses parallel discrete event simulation with the conservative protocol [25, 28] Supported protocols include the Null Message Protocol (NMP) [11], the Conditional Event Protocol (CEP) 12] and a new protocol, which is a combination of the two [23] As discussed in the next section, MPI Sim exploits the determinism present in the communication pattern of the application to reduce, and in many cases, completely eliminate synchronization ....

K. M. Chandy and J. Misra. Distributed simulation: a case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5:440--452, 1979.

.... and a simulation sample path is considered consistent if each event t that happens before some other event s in the real system, is generated into the simulation s sample path before s [2] Presumably more than 1500 research papers have appeared (since the pioneering works by Chandy and Misra [3] and Je erson [4] which have signi cantly contributed in the scienti c sense, but nevertheless failed to bring the eld also to an industrial and or commercial success. Due to the focused nature and involved content of distributed simulation publications, the eld has often been criticized as ....

K. M. Chandy, J. Misra, Distributed simulation: A case study in design and veri cation of distributed programs, IEEE Transactions on Software Engineering SE-5 (5) (1979) 440-452.

....order, it is sufficient, though not always necessary, that each logical process finds and executes the earliest future event. The advent of PDES was marked by the invention of conservative protocols, the first of which was the null message protocol, or so called Chandy Misra Bryant protocol [16, 12], developed back in 1979. In most cases, conservative protocols require each logical process to broadcast to its neighbors, in the form of null mes sages, a lower bound on the timestamp of events that it will send to other logical processes. This bound is often called Earliest Output Time (EOT) ....

....events in non decreasing timestamp order. Therefore, to preserve the causality order, it is sufficient, though not always necessary, that each component finds and executes the future event with the smallest timestamp. Research on PDES has been largely dominated by the studies of conserva tive [12, 16] and optimistic protocols [35] and of their performance. Unfortunately, both types of protocols have their strengths and weaknesses. Efficiency of con servative protocols in parallel execution is limited by the amount of lookahead in individual components, which is equal to the difference ....

K. M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, TSE 5(5):440-452, 1979.

....new concepts, such as lookback, impact time, which may bring new insights into the PDES research. CONSERVATIVE AND OPTIMISTIC The advent of PDES was marked by the invention of conservative protocols, the first of which was the null message protocol, also known as the Chandy Misra Bryant protocol [2,3], developed in 1979. Conservative protocols require each logical process to broadcast to its neighbors, in the form of null messages, a lower bound on the timestamp of events it will send to other logical processes, or Earliest Output Time (EOT) By listening to the null messages from all ....

Chandy, K.M. and J. Misra, Distributed Simulation: A Case Study in Design and Verification of Distributed Programs. IEEE Transactions on Software Engineering, 1979. SE-5: p. 440--452.

....to a sequential simulation. Although conservative and optimistic simulations can exploit more parallelism, they have much more overhead than synchronous simulation, which can make the overall performance worse than synchronous simulation. Soule and Gupta evaluated the Chandy Misra algorithm [3] for digital logic simulation. They found that overhead of ChandyMisra algorithm overwhelm its advantage and the performance is about three times slower than traditional parallel event driven algorithm [17] In this paper we propose a model to predict the performance of synchronous simulation. ....

K. M. Chandy and J. Misra, 1979. Distributed Simulation: A Case Study in Design and Verification of Distributed Programs. IEEE Transaction on Software Engineering.

....because it is possible that the incoming event will change the state of the LP in such a way that the state of the LP at the current lvt will no longer be correct. The following protocols have been developed to deal with causality errors. The conservative protocol proposed by Chandy and Misra [9] prevents causality errors from occurring by allowing the LPs to process events only when it is absolutely certain that there is no event in the system with a timestamp smaller than the timestamp of the event about to be processed. The conservative approach derives its performance from lookahead, ....

K. M. Chandy and J. Misra. Distributed Simulation: A Case Study in Design and Verification of Distributed Programs. IEEE Transactions on Software Engineering, 5:440-452, 1979.

....cor respond to the physical processes that are being modeled. Because the LPs interact with each other by sending event messages, it is costly to maintain the causality between events. Two basic protocols have been developed to ensure that causality constraints are satisfied [9] conservative [5] and optimistic. In Time Warp (TW) 11] the best known optimistic protocol, causality errors are allowed to occur, but when such an error is detected, the erroneous computation is rolled back. The research described in this paper utilizes the optimistic protocol and focuses on optimizing rollback ....

K. M. Chandy and J. Misra. Distributed Simu- lation: A Case Study in Design and Verification of Distributed Programs. IEEE Transactions on Software Engineering, 5:440-452, 1979.

....proposed for the implementation of DDES: conservative that enforces time stamp order processing by restricting the parallelism among LPs and optimistic that instead allows out of timestamp order to occur and then correct the situation by undoing part of the simulation. Both, the conservative [2] and the optimistic strategy [3] have led to implementations of general purpose discrete event simulators on parallel and distributed computing facilities (for a survey see [4] The main potential contribution of the use of Petri net model descriptions for DDES is to define causality relations ....

K.M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, 5(11):440--452, September 1979.

.... and a simulation sample path is considered consistent if each event t that happens before some other event s in the real system, is generated into the simulation s sample path before s [2] Presumably more than 1500 research papers have appeared (since the pioneering works by Chandy and Misra [3] and Jefferson [4] which have significantly contributed in the scientific sense, but nevertheless failed to bring the field to an industrial and or commercial success. Due to the focused nature and involved content of DS publications, the field has often been criticized as an academic playground, ....

K.M. Chandy, J. Misra, Distributed simulation: a case study in design and verification of distributed programs, IEEE. Trans. Software Eng. 5 (5) (1979) 440--452.

....a smaller communication computation speed ratio. We shall look at the two possibilities for implementing communication interfaces in more detail. 4. 4 Chandy Misra Bryant Communication Interfaces LP simulations following a conservative strategy date back to original works by Chandy and Misra [15] and Bryant [13] and are often referred to as the Chandy Misra Bryant (CMB) protocols. As described by [52] in CMB causality of events across LPs is preserved by sending timestamped (external) event messages of type hee ti, where ee denotes the event and t is a copy of LVT of the sending LP at ....

K. M. Chandy and J. Misra. Distributed Simulation: A Case Study in Design and Verification of Distributed Programs. IEEE Transactions on Software Engineering, SE-5(5):440--452, September 1979.

No context found.

K.M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engeneering, 5(5).

No context found.

Chandy, K. M. and Misra, J. (1979). Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440--452.

No context found.

K. Chandy and J. Misra, "Distributed simulation: A case study in design and verification of distributed programs," IEEE Transactions on Software Engineering, pp. 440--452, Sept. 1979.

No context found.

K.M. Chandy, and J. Misra, "Distributed Simulation: a Case Study in Design and Verification of Distributed Programs", IEEE Trans. on Software Engineering, 5, 5, September 1979, pp. 440-452.

No context found.

K. Chandy and J. Misra. Distributed simulation: A case study in design and veri cation of distributed programs. IEEE Trans. on Soft. Eng., 5(5), 1979.

No context found.

K.M. Chandy and J. Misra, "Distributed Simulation: A Case Study in the Design and Verification of Distributed Programs", IEEE Transactions on Software Engineering, vol.SE-5, no.5, pp.440-452, 1979.

No context found.

Chandy, K. and Misra, J., "Distributed simulation: a case study in design and verification of distributed programs". IEEE Transactions on Software Engineering, 5(5):440-452, September 1979.

No context found.

Chandy, K.M., Misra, J.: Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering SE-5 (1979) 440--452

No context found.

Chandy K.M., Misra J.: Distributed Simulation: A Case Study in Design and Veri cation of Distributed Programs. IEEE Trans. on Soft. Engi. SE 5-5 (1979), pp. 440-452.

No context found.

Chandy K.M., Misra J. (1979). Distributed Simulation: A case study in Design and Verification of Distributed Programs, IEEE Transactions of Software Engineering, SE-5(5), 440-452.

No context found.

K. M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440--452, September 1979.

No context found.

K.M. Chandy and J. Misra. "Distributed simulation: A case study in design and verification of distributed programs". IEEE Trans. on Softw. Eng. SE-5, 5:440--452, Sept. 1979.

No context found.

K. Mani Chandy and Jayadev Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440--452, September 1979.

No context found.

K M Chandy and J Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Trans. Software Engineering, SE5(5):440--452, 1979.

No context found.

K M Chandy and J Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Trans. Software Engineering, S.E.5(5):440--452, 1979.

First 50 documents  Next 50

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