Sciweavers

1019 search results - page 26 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
DCOSS
2006
Springer
14 years 9 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
MSWIM
2006
ACM
14 years 2 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
IPPS
1999
IEEE
14 years 27 days ago
A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
Jan Jonsson
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...
ECRTS
1999
IEEE
14 years 28 days ago
Performance of algorithms for scheduling real-time systems with overrun and overload
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing th...
Mark K. Gardner, Jane W.-S. Liu