Sciweavers

86 search results - page 4 / 18
» Avoiding Shared Clocks in Networks of Timed Automata
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Almost Peer-to-Peer Clock Synchronization
In this paper, an almost peer-to-peer (AP2P) clock synchronization protocol is proposed. AP2P is almost peer-topeer in the sense that it provides the desirable features of a purel...
Ahmed Sobeih, Michel Hack, Zhen Liu, Li Zhang
ECRTS
2007
IEEE
14 years 1 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher
CEE
2008
91views more  CEE 2008»
13 years 7 months ago
Self-adapting algorithm to fair time sharing in wireless access networks
To adapt the data rate in accordance with the quality of the link, the IEEE 802.11 standard proposes the variable rate shifting functionality. This intrinsic functionality of the ...
Anelise Munaretto, Mauro Fonseca
DSN
2007
IEEE
14 years 1 months ago
Superscalar Processor Performance Enhancement through Reliable Dynamic Clock Frequency Tuning
Synchronous circuits are typically clocked considering worst case timing paths so that timing errors are avoided under all circumstances. In the case of a pipelined processor, thi...
Viswanathan Subramanian, Mikel Bezdek, Naga Durga ...
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
13 years 11 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...