The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2013 vol.62)
pp: 1044-1050
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
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
REFERENCES
[1] E. Pitoura and P. Chrysanthis, "Multiversion Data Broadcast," IEEE Trans. Computers, vol. 51, no. 10, pp. 1224-1230, Oct. 2002.
[2] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, "Broadcast Disks," ACM SIGMOD Record, vol. 24, no. 2, pp. 199-210, 1995.
[3] J. Gecsei, The Architecture of Videotex Systems. Prentice-Hall, 1983.
[4] C. Liaskos, S. Petridou, and G. Papadimitriou, "Towards Realizable, Low-Cost Broadcast Systems for Dynamic Environments," IEEE/ACM Trans. Networking, vol. 19, no. 2, pp. 383-392, Apr. 2011.
[5] P. Nicopolitidis, G. Papadimitriou, and A. Pomportsis, "Continuous Flow Wireless Broadcasting for High-Speed Environments," IEEE Trans. Broadcasting, vol. 55, no. 2, pp. 260-269, June 2009.
[6] G. Papadimitriou, M. Sklira, and A. Pomportsis, "A New Class of E-Optimal Learning Automata," IEEE Trans. Systems, Man, and Cybernetics, Part B, vol. 34, no. 1, pp. 246-254, Feb. 2004.
[7] N. Vaidya and S. Hameed, "Scheduling Data Broadcast in Asymmetric Communication Environments," Wireless Networks, vol. 5, no. 3, pp. 171-182, 1999.
[8] U. Balli, H. Wu, B. Ravindran, J. Anderson, and E. Jensen, "Utility Accrual Real-Time Scheduling under Variable Cost Functions," IEEE Trans. Computers, vol. 56, no. 3, pp. 385-401, Mar. 2007.
[9] H. Aydin, R. Melhem, D. Mosse, and P. Mejia-Alvarez, "Optimal Reward-Based Scheduling for Periodic Real-Time Tasks," IEEE Trans. Computers, vol. 50, no. 2, pp. 111-130, Feb. 2001.
[10] C.-J. Su, L. Tassiulas, and V. Tsotras, "Broadcast Scheduling for Information Distribution," Wireless Networks J., vol. 5, no. 2, pp. 137-147, 1999.
[11] J. Xu, D.-L. Lee, Q. Hu, and W.-C. Lee, "Data Broadcast," Wiley Series on Parallel and Distributed Computing, I. Stojmenović and A. Zomaya eds. John Wiley & Sons, Inc, pp. 243-265, 2002.
[12] C. Kenyon and N. Schabanel, "The Data Broadcast Problem with Non-Uniform Transmission Times," Algorithmica, vol. 35, no. 2, pp. 146-175, 2002.
[13] J. Xu, X. Tang, and W.-C. Lee, "Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 3-14, Jan. 2006.
[14] S. Salcedo-Sanz, C. Bousono-Calzon, and A. Figueiras-Vidal, "A Mixed Neural-Genetic Algorithm for the Broadcast Scheduling Problem," IEEE Trans. Wireless Comm., vol. 2, no. 2, pp. 277-283, Mar. 2003.
[15] C. Liaskos, S. Petridou, G. Papadimitriou, P. Nicopolitidis, M. Obaidat, and A. Pomportsis, "Clustering-Driven Wireless Data Broadcasting," IEEE Wireless Comm., vol. 16, no. 6, pp. 80-87, Dec. 2009.
[16] C. Liaskos, S. Petridou, and G. Papadimitriou, "Cost-Aware Wireless Data Broadcasting," IEEE Trans. Broadcasting, vol. 56, no. 1, pp. 66-76, Mar. 2010.
[17] N. Schabanel, "The Data Broadcast Problem with Preemption," Proc. 17th Ann. Symp. Theoretical Aspects of CS (STACS '00), H. Reichel and S. Tison, eds., pp. 181-192, 2000.
[18] B. Zheng, X. Wu, X. Jin, and D.-L. Lee, "TOSA: A Near-Optimal Scheduling Algorithm for Multi-Channel Data Broadcast," Proc. Sixth Int'l Conf. Mobile Data Management (MDM '05), pp. 29-37, May 2005.
[19] C.-L. Hu and M.-S. Chen, "Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 2, pp. 273-286, Feb. 2009.
[20] M.-S. Chen, K.-L. Wu, and P. Yu, "Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing," IEEE Trans. Knowledge and Data Eng., vol. 15, no. 1, pp. 161-173, Jan./Feb. 2003.
[21] L. Pietronero, E. Tosatti, V. Tosatti, and A. Vespignani, "Explaining the Uneven Distribution of Numbers in Nature: The Laws of Benford and Zipf," Physica A: Statistical Mechanics and Its Applications, vol. 293, nos. 1/2, pp. 297-304, 2001.
[22] L. Shi, Z.-M. Gu, Y.-C. Tao, L. Wei, and Y. Shi, "Modeling Web Objects' Popularity," Proc. Fourth Int'l Conf. Machine Learning and Cybernetics (ICMLC '05), pp. 2320-2324, 2005.
[23] C. Cunha, A. Bestavros, and M. Crovella, "Characteristics of WWW Client-Based Traces," Technical Report BU-CS-95-010, Boston University, MA, http://www.cs.bu.edu/fac/crovella/paper-archive/ TR-95-010paper. html, 1995.
[24] R. Baillie, D. Borwein, and J. Borwein, "Surprising Sinc Sums and Integrals," The Am. Math. Monthly, vol. 115, no. 10, pp. 888-901, 2008.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool