Sciweavers

1243 search results - page 18 / 249
» EDZL Scheduling Analysis
Sort
View
SIGMETRICS
2002
ACM
106views Hardware» more  SIGMETRICS 2002»
13 years 10 months ago
Analysis of methods for scheduling low priority disk drive tasks
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
Eitan Bachmat, Jiri Schindler
MST
2002
152views more  MST 2002»
13 years 10 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
EOR
2006
107views more  EOR 2006»
13 years 11 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
HYBRID
2009
Springer
14 years 2 months ago
Specification and Analysis of Network Resource Requirements of Control Systems
We focus on control systems in which sensors send data to actuators via a bus shared with other applications. An approach is proposed for specifying and implementing dynamic schedu...
Gera Weiss, Sebastian Fischmeister, Madhukar Anand...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta