Sciweavers

3563 search results - page 182 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 8 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
139
Voted
NOSSDAV
1995
Springer
15 years 7 months ago
Determining End-to-End Delay Bounds in Heterogeneous Networks
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket Generalized Processor Sharing and Self Clocked Fair Queuing....
Pawan Goyal, Simon S. Lam, Harrick M. Vin
INFOCOM
2008
IEEE
15 years 10 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
CLUSTER
2007
IEEE
15 years 10 months ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger
INFOCOM
2007
IEEE
15 years 10 months ago
How Optimal are Wireless Scheduling Protocols?
— In wireless networks mutual interference impairs the quality of received signals and might even prevent the correct reception of messages. It is therefore of paramount importan...
Thomas Moscibroda, Yvonne Anne Oswald, Roger Watte...