82 search results - page 11 / 17 » Tight bounds for clock synchronization |
TC
2008
13 years 7 months ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2 Q) and Self-Clocked Fair Queueing (SCFQ) have been propo...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...