This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments
May 2013 (vol. 62 no. 5)
pp. 1044-1050
Christos K. Liaskos, Aristotle University of Thessaloniki, Thessaloniki
Georgios I. Papadimitriou, Aristotle University of Thessaloniki, Thessaloniki
The present paper proposes a generalization of the square root rule for optimal periodic scheduling. The rule defines a ratio of item occurrences in a schedule, which minimizes the mean serving time. However, the actual number of each item's occurrences must be an integer. Therefore, the square root rule assumes large schedules, in order for the ratio to hold with acceptable precision. The present paper introduces an analysis-derived formula which connects the mean serving time and the size of the schedule. The relation shows that small schedules can also achieve near-optimal serving times. The analysis is validated through comparison with simulation and brute force-derived results. Finally, it is shown that minimizing the size of the schedule is also an efficient way of optimizing the aggregate scheduling cost.
Index Terms:
Schedules,Equations,Positron emission tomography,Optimal scheduling,Fading,Mathematical model,Minimization,schedule size minimization,Schedules,Equations,Positron emission tomography,Optimal scheduling,Fading,Mathematical model,Minimization,analysis,Periodic scheduling
Citation:
Christos K. Liaskos, Georgios I. Papadimitriou, "Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments," IEEE Transactions on Computers, vol. 62, no. 5, pp. 1044-1050, May 2013, doi:10.1109/TC.2012.30
Usage of this product signifies your acceptance of the Terms of Use.