Abstract
We discuss the well known job scheduling problem with release times and deadlines, alongside an extended model - buffer management for packets with processing requirements. For job scheduling, an \(\Omega(\sqrt{\frac{\log{\kappa}}{\log{\log{\kappa}}}})\) lower bound for any randomized preemptive algorithm was shown by Irani and Canetti (1995), where κ is the the maximum job duration or the maximum job value (the minimum is assumed to be 1). The proof of this well-known result is fairly elaborate and involved. In contrast, we show a significantly improved lower bound of Ω(logκ) using a simple proof. Our result matches the easy upper bound and closes a gap which was supposedly open for 20 years.
We also discuss an interesting extension of job scheduling (for tight jobs). We discuss the problem of handling a FIFO buffer of a limited capacity, where packets arrive over time and may be preempted. Most of the work in buffer management considers the case where each packet has unit processing requirement. We consider a model where packets require some number of processing cycles before they can be transmitted. We aim to maximize the value of transmitted packets. We show an \(\Omega(\frac{\log{\kappa}}{\log{\log{\kappa}}})\) lower bound on the competitive ratio of randomized algorithms in this setting. We also present bounds for several special cases. For packets with unit values we also show a ϕ ≈ 1.618 lower bound on the competitive ratio of deterministic algorithms, and a 2-competitive algorithm for this problem. For the case of packets with constant densities we present a 4-competitive algorithm.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differential services. In: Proceedings of IEEE INFOCOM, pp. 431–440 (2000)
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing 35(2), 278–304 (2005)
Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 53–64. Springer, Heidelberg (2004)
Azar, Y., Richter, Y.: An improved algorithm for cioq switches. ACM Transactions on Algorithms 2(2), 282–295 (2006)
Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 606–615. ACM (1995)
Chuprikov, P., Nikolenko, S., Kogan, K.: Priority queueing with multiple packet characteristics (2015)
DasGupta, B., Palis, M.A.: Online real-time preemptive scheduling of jobs with deadlines. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 96–107. Springer, Heidelberg (2000)
Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in qoS switches. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 352–363. Springer, Heidelberg (2006)
Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in qos switches. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 209–218. Society for Industrial and Applied Mathematics (2007)
Garay, J.A., Naor, J., Yener, B., Zhao, P.: On-line admission control and packet scheduling with interleaving. In: Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 94–103. IEEE (2002)
Goldwasser, M.: A survey of buffer management policies for packet switches. ACM SIGACT News 41(1), 100–128 (2010)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)
Kesselman, A., Kogan, K., Segal, M.: Packet mode and qos algorithms for buffered crossbar switches with fifo queuing. Distributed Computing 23(3), 163–175 (2010)
Kesselman, A., Kogan, K., Segal, M.: Improved competitive performance bounds for cioq switches. Algorithmica 63(1-2), 411–424 (2012)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in qos switches. SIAM Journal on Computing 33(3), 563–583 (2004)
Kesselman, A., Patt-Shamir, B., Scalosub, G.: Competitive buffer management with packet dependencies. In: Proceedings of the IEEE International Symposium on Parallel & Distributed Processing, pp. 1–12. IEEE (2009)
Kogan, K., López-Ortiz, A., Nikolenko, S., Sirotkin, A.: Multi-queued network processors for packets with heterogeneous processing requirements. In: 5th International Conference on Communication Systems and Networks, pp. 1–10. IEEE (2013)
Kogan, K., López-Ortiz, A., Nikolenko, S., Sirotkin, A.V., et al.: A taxonomy of semi-fifo policies. In: IEEE 31st International Performance Computing and Communications Conference (IPCCC), pp. 295–304. IEEE (2012)
Kogan, K., Nikolenko, S.: Single and multiple buffer processing (2014)
Kogan, K., Nikolenko, S., López-Ortiz, A., Scalosub, G., Segal, M.: Balancing work and size with bounded buffers. In: COMSNETS, pp. 1–8 (2014)
Koren, G., Shasha, D.: D over; an optimal on-line scheduling algorithm for overloaded real-time systems. In: Real-Time Systems Symposium, pp. 290–299. IEEE (1992)
Mansour, Y., Patt-Shamir, B., Lapid, O.: Optimal smoothing schedules for real-time streams. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 21–29. ACM (2000)
Mansour, Y., Patt-Shamir, B., Rawitz, D.: Overflow management with multipart packets. Computer Networks 56(15), 3456–3467 (2012)
Pruhs, K.: Competitive online scheduling for server systems. ACM SIGMETRICS Performance Evaluation Review 34(4), 52–58 (2007)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 115–124 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Gilon, O. (2015). Buffer Management for Packets with Processing Times. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)