Sciweavers

301 search results - page 13 / 61
» On bounding the delay of a critical path
Sort
View
GLOBECOM
2008
IEEE
16 years 15 days ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
TIT
2010
146views Education» more  TIT 2010»
15 years 23 days ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
16 years 2 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
ICCAD
2003
IEEE
195views Hardware» more  ICCAD 2003»
15 years 11 months ago
Vectorless Analysis of Supply Noise Induced Delay Variation
The impact of power supply integrity on a design has become a critical issue, not only for functional verification, but also for performance verification. Traditional analysis has...
Sanjay Pant, David Blaauw, Vladimir Zolotov, Savit...
ICALP
2010
Springer
15 years 8 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran