Sciweavers

366 search results - page 23 / 74
» Communication Complexity with Synchronized Clocks
Sort
View
INFOCOM
1994
IEEE
15 years 3 months ago
A Self-Clocked Fair Queueing Scheme for Broadband Applications
A n eficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. We define fairness in a selfcontained manner, elimina...
S. Jamaloddin Golestani
DCOSS
2011
Springer
13 years 11 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
DATE
2010
IEEE
141views Hardware» more  DATE 2010»
15 years 4 months ago
Loosely Time-Triggered Architectures for Cyber-Physical Systems
Abstract—Cyber-Physical Systems require distributed architectures to support safety critical real-time control. Kopetz’ Time-Triggered Architectures (TTA) have been proposed as...
Albert Benveniste
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
15 years 8 months ago
Flip-flop insertion with shifted-phase clocks for FPGA power reduction
— Although the LUT (look-up table) size of FPGAs has been optimized for general applications, complicated designs may contain a large number of cascaded LUTs between flip-flops...
Hyeonmin Lim, Kyungsoo Lee, Youngjin Cho, Naehyuck...
ICPPW
2008
IEEE
15 years 6 months ago
Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications
Event traces are helpful in understanding the performance behavior of message-passing applications since they allow in-depth analyses of communication and synchronization patterns...
Daniel Becker, John C. Linford, Rolf Rabenseifner,...