Abstract
This paper is concerned with a new version of on-line storage allocation in which the durations of all processes are known at their arrival time. This version of the problem is motivated by applications in communication networks and has not been studied previously. We provide an on-line algorithm for the problem with a competitive ratio of O(minlog Δ,log r), where Δ is the ratio between the longest and shortest duration of a process, and r is the maximum number of concurrent active processes that have different durations. For the special case where all durations are powers of two, the competitive ratio achieved is O(log log Δ).
This research is supported by the consortium for broadband communication administered by the chief scientist of the Israeli Ministry of Industry and Commerce.
Supported by Technion V.P.R. Fund 120-911 - Promotion of Sponsored Research.
Supported by Technion V.P.R. Fund 050-862 - Promotion of Sponsored Research.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive of on-line routing. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 32–40, October 1993.
Y. Azar, B. Kalyanasundaram, S. Plotkin, K. R. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. In Proc. Workshop on Algorithms and Data Structures, August 1993.
A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. In Proc. 27th ACM Symp. on Theory of Computing, 1995.
E. G. Coffman. An introduction to combinatorial models of dynamic storage allocation. SIAM Review, 25:311–325, 1983.
J. Gergov. Approximation algorithms for dynamic storage allocation. In Proc. of the 4th Annual European Symposium on Algorithms, pages 52–61, 1996.
M. R. Garey and D. S. Johnson. Computers and intractability-a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
H. A. Kierstead. The linearity of first-fit coloring of interval graphs. SIAM Journal on Discrete Math, 1:526–530, 1988.
H. A. Kierstead. A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics, 88:231–237, 1991.
D. E. Knuth. Fundamental algorithms, volume 1. Addison-Wesley, Reading, MA, second edition, 1973.
M. G. Luby, J. Naor, and A. Orda. Tight bounds for dynamic storage allocation. SIAM Journal on Discrete Math, 9(1):155–166, 1996.
C. Partridge. Gigabit Networking. Addison-Wesley, 1994.
F. S. Roberts. Indifference graphs. In F. Harary, editor, Proof Techniques in Graph Theory, pages 139–146. Academic Press, N.Y., 1969.
J. M. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the ACM, 18:416–423, 1971.
J. M. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 12:491–499, 1974.
J. M. Robson. Worst case fragmentation of first fit and best fit storage allocation strategies. Computer Journal, 20:242–244, 1977.
O. Sharon and A. Segal. Schemes for slot reuse in CRMA. IEEE/ACM Transactions on Networking, 2(3):269–278, 1994.
T. A. Standish. Data structures, algorithms and software principles in C. Addison-Wesley, Reading, MA, second edition, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naor, J.(., Orda, A., Petruschka, Y. (1997). Dynamic storage allocation with known durations. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-63397-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63397-6
Online ISBN: 978-3-540-69536-3
eBook Packages: Springer Book Archive