Learn More
This paper presents a new Global Virtual Time (GVT) algorithm, called TQ-GVT that is at the heart of a new high performance Time Warp simulator designed for large-scale clusters. Starting with a survey of numerous existing GVT algorithms, the paper discusses how other GVT solutions, especially Mattern's GVT algorithm, influenced the design of TQ-GVT, as(More)
—This paper presents self-selective routing, a self-maintained and fault-tolerant routing protocol for wireless ad hoc networks. The protocol combines broadcast radio transmissions with the novel autonomous programming technique, called self-selection, to support routing without the overhead of traditional ad hoc route maintenance. Moreover, the protocol(More)
There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation(More)
ESCORT aims at decreasing the energy cost of communication in dense sensor networks. We employ radio frequency (RF) signal quality assessment in forming communities of redundant nodes. These communities avoid spanning regions of environmental interference to preserve the routing fidelity of the network. ESCORT is routing protocol-independent and conserves(More)
This paper presents the design, implementation and performance of a Time Warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the Time Quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters(More)
We have identified a fundamental operator in wireless networks that we named the local leader election problem in which the goal is to select a leader node in a spatially close neighborhood. We present a simple and elegant solution to the local leader election problem by making use of both: (i) implicit synchronization points, commonly observable by all(More)
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in parallel for the closest value to the given parameter. It shares some features with the idea of computing with action potentials proposed by Hopfield, which originated in the field of(More)
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabling new synchronization protocols for the parallel discrete event simulation. Two of such protocols, LB-GVT (LookBack-Global Virtual Time) and(More)
We present a classification that groups lookback into fourtypes: direct strong lookback, universal strong lookback, directweak lookback, and universal weak lookback. They aredefined in terms of absolute and dynamic impact times. Wediscuss relationships between lookback types by consideringwhen rollbacks and/or anti-messages are avoided. Fromdifferent types(More)
The complexity of today's VLSI chip designs makes verification a necessary step before fabrication. As a result, gate-level logic simulation has became an integral component of the VLSI circuit design process which verifies the design and analyzes its behavior. Since the designs constantly grow in size and complexity, there is a need for ever more efficient(More)