Issue No. 05 - May (2013 vol. 62)

ISSN: 0018-9340

pp: 1044-1050

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.30

Christos K. Liaskos , Aristotle University of Thessaloniki, Thessaloniki

Georgios I. Papadimitriou , Aristotle University of Thessaloniki, Thessaloniki

ABSTRACT

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

G. I. Papadimitriou and C. K. Liaskos, "Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments," in

*IEEE Transactions on Computers*, vol. 62, no. , pp. 1044-1050, 2013.

doi:10.1109/TC.2012.30

CITATIONS