Abstract
We study the single-device Dynamic Storage Allocation (DSA) problem and multi-device Balancing DSA problem in this paper. The goal is to dynamically allocate the job into memory to minimize the usage of space without concurrency. The SRF problem is just a variant of DSA problem. Our results are as follows,
-
The NP-completeness for 2-SRF problem, 3-DSA problem, and DSA problem for jobs with agreeable deadlines.
-
An improved 3-competitive algorithm for jobs with agreeable deadlines on single-device DSA problem. A 4-competitive algorithm for jobs with agreeable deadlines on multi-device Balancing DSA problem.
-
Lower bounds for jobs with agreeable deadlines: any non-clairvoyant algorithm cannot be (2 − ε)-competitive and any clairvoyant algorithm cannot be (1.54 − ε)-competitive.
-
The first O(logL)-competitive algorithm for general jobs on multi-device Balancing DSA problem without any assumption.
This work was supported in part by grants from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 117408 and 123609], National Natural Science Foundation of China (grant no. 60775037), and Research Fund for the Doctoral Program of Higher Education of China (20093402110017).
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.
Similar content being viewed by others
References
Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems 16(3), 428–455 (1994)
Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. In: Proceedioings of the 35th Annual ACM Symposium on Therory of Computing (STOC), pp. 556–564 (2003)
Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S.: Restricted strip covering and the sensor cover problem. The Conference version appears in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1056–1063 (2007), The full version is at http://arxiv.org/PS_cache/cs/pdf/0605/0605102v1.pdf
Chaitin, G.J.: Register allocation & spilling via graph coloring. In: Proceedings of the SIGPLAN Symposium on Compiler Construction, pp. 98–105. ACM Press, New York (1982)
Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems 12(4), 501–536 (1990)
George, L., Appel, A.W.: Iterated register coalescing. ACM Transactions on Programming Languages and Systems 18(3), 300–324 (1996)
Gergov, J.: Approximation algorithms for dynamic storage allocation. In: DÃaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 52–61. Springer, Heidelberg (1996)
Gergov, J.: Algorithms for compile-time memory optimization. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. S907–S908 (1999)
Kalyanasundaram, B., Pruhs, K.R.: Dynamic Spectrum Allocation: The Impotency of Duration Notification. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 421–428. Springer, Heidelberg (2000)
Kierstead, H.A.: The linearity of first-fit colorings of interval graphs. SIAM Journal on Discrete Mathematics 1(4), 526–530 (1988)
Kierstead, H.A.: A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics 88, 231–237 (1991)
Knuth, D.E.: Foundamental algorithms, 2nd edn., vol. 1. Addison-Wesley, Reading (1973)
Li, S.C., Leong, H.W., Quek, S.K.: New approximation algorithms for some dynamic storage allocation problems. In: Proceedings of the 10th Annual International Computing and Combinatorics Conference, pp. 339–348 (2004)
Luby, M.G., Naor, J., Orda, A.: Tight bounds for dynamic storage allocation. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 724–732 (1994)
Naor, J., Orda, A., Petruschka, Y.: Dynamic storage allocation with known durations. In: Proceedings of the 5th Annual European Symposium on Algorithms (ESA), pp. 378–387 (1997); The journal version appreas in Discrete Applied Mathematics 100(3), 203–213 (2000)
Narayanaswamy, N.S.: Dynamic storage allocation and on-line colouring interval graphs. In: Proceedings of the 10th Annual International Computing and Combinatorics Conference, pp. 329–338 (2004)
Robson, J.M.: Worst case fragmentation of first-fit and best fit storage allocation strategies. Computer Journal 20, 242–244 (1977)
Yang, X., Wang, L., Xue, J., Deng, Y., Zhang, Y.: Comparability graph coloring for optimizing utilization of stream register files in stream processors. In: Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 111–120 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, W., Tian, W., Li, M., Xue, C.J., Chen, E. (2010). Single and Multiple Device DSA Problem, Complexities and Online Algorithms. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17514-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-17514-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17513-8
Online ISBN: 978-3-642-17514-5
eBook Packages: Computer ScienceComputer Science (R0)