Abstract
In this paper, we study the design and analysis of online batching systems. In particular, we analyze the tradeoff relationship between the start-up delay and the efficient usage of resources in an online batching system, and analyze how the delay affects the performance of such system. We derive almost optimal upper and lower bounds on the competitive ratio of any deterministic scheduling algorithm for online batching systems. Our results cover in a general way many different batching systems and give interesting insights into the effect of start-up delay.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Wolf, J.L., Yu, P.S.: On optimal batching policies for video-ondemand storage servers. In: Proceedings of the IEEE International Conference on Multimedia Computing Multimedia Computing and Systems, pp. 200–209 (1996)
Azizoglu, M., Webster, S.: Scheduling a batch processing machine with incompatible job families. Computer and Industrial Engineering 39, 325–335 (2001)
Baptiste, P.: Batching identical jobs. Mathematical Methods of Operations Research 53, 355–367 (2000)
Bar-Noy, A., Garay, J.A., Herzberg, A.: Sharing video on demand. Discrete Applied Mathematics 129, 3–30 (2003)
Bar-Noy, A., Goshi, J., Ladner, R.: Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 164–173 (2003)
Bar-Noy, A., Guha, S., Katz, Y., Naor, J., Schieber, B., Shachnai, H.: Throughput maximization of real-time scheduling with batching. In: Proceedings of the 13th Symposium on Discrete Algorithms, pp. 742–751 (2002)
Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-ondemand. In: Proceeding of the Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 791–800 (2003)
Bouras, C., Kapoulas, V., Pantziou, G., Spirakis, P.: Competitive video on demand schedulers for popular movies. Discrete Applied Mathematics 129, 49–61 (2002)
Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C., Tauthenhahn, T., Van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling 1, 31–54 (1998)
Dan, A., Sitaram, D., Shahabuddin, P.: Dynamic batching policies for an ondemand video server. ACM Multimedia Systems Journal 4(3), 112–121 (1996)
Edmonds, J., Pruhs, K.: Multicast pull scheduling: when fairness is fine. Algorithmica (2003)
Engebretsen, L., Sudan, M.: Harmonic broadcasting is optimal. In: Proceeding of the Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 431–432 (2002)
Evans, W., Kirkpatrick, D.: Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth differ. In: Proceeding of the Annua ACM/SIAM Symposium on Discrete Algorithms, may 2004, pp. 1041–1049 (2004)
Goldwasser, M.: Patience is a virtue: The effect of slack on competitiveness for admission control. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms, pp. 396–405 (1999)
Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 313–324. Springer, Heidelberg (2003)
Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 415–424. Springer, Heidelberg (2003)
Mehta, S.V., Uzsoy, R.: Minimizing total tardiness on a batch processing machine with incompatible jobs types. IIE Transactions 32, 165–175 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hung, R.Y.S., Ting, HF. (2006). Design and Analysis of Online Batching Systems. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_56
Download citation
DOI: https://doi.org/10.1007/11682462_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)