740 search results - page 112 / 148 » Analysis of Scheduling Algorithms with Reservations |
180
click to vote
HIPC
2007
Springer
15 years 9 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
129
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
Acquisition of science in space applications is shifting from teleoperated gathering to an automated on-board analysis with improvements in the use of on-board memory, CPU, bandwi...
136
click to vote
ASPLOS
2010
ACM
16 years 4 days ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
152
click to vote
DIALM
2008
ACM
15 years 7 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
150
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...