Sciweavers

4565 search results - page 536 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
PRDC
2009
IEEE
15 years 10 months ago
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
Antonio Fernández Anta, Miguel A. Mosteiro,...
INFOCOM
2008
IEEE
15 years 10 months ago
Proportional Fairness in Multi-Rate Wireless LANs
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
Erran L. Li, Martin Pal, Yang Richard Yang
INFOCOM
2008
IEEE
15 years 10 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
RTSS
2003
IEEE
15 years 9 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem
120
Voted
JACM
2006
98views more  JACM 2006»
15 years 3 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson