Sciweavers

35 search results - page 6 / 7
» The associative-skew clock routing problem
Sort
View
ICPP
1990
IEEE
13 years 9 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin
EWSN
2006
Springer
14 years 5 months ago
On the Scalability of Routing Integrated Time Synchronization
Time synchronization is a crucial component of a large class of sensor network applications, traditionally implemented as a standalone middleware service that provides a virtual gl...
János Sallai, Branislav Kusy, Ákos L...
ACSD
2005
IEEE
66views Hardware» more  ACSD 2005»
13 years 11 months ago
Gaining Predictability and Noise Immunity in Global Interconnects
We present a bundled data communication scheme that is robust to crosstalk effects, and to manufacturing and environmental variations. Unlike a data bus, where each receiver alway...
Yinghua Li, Alex Kondratyev, Robert K. Brayton
BWCCA
2010
13 years 23 days ago
Advanced Design Issues for OASIS Network-on-Chip Architecture
Network-on-Chip (NoC) architectures provide a good way of realizing efficient interconnections and largely alleviate the limitations of bus-based solutions. NoC has emerged as a so...
Kenichi Mori, Adam Esch, Abderazek Ben Abdallah, K...
INFOCOM
2007
IEEE
14 years 1 days ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...