Sciweavers

16128 search results - page 22 / 3226
» Distributed network scheduling
Sort
View
DSN
2003
IEEE
15 years 2 months ago
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, ...
ICDCS
1992
IEEE
15 years 1 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
TIT
2008
119views more  TIT 2008»
14 years 9 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
CCGRID
2003
IEEE
15 years 2 months ago
Scheduling Distributed Applications: the SimGrid Simulation Framework
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
Arnaud Legrand, Loris Marchal, Henri Casanova
TON
2010
136views more  TON 2010»
14 years 4 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...