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(log L)-competitive algorithm for general jobs on multi-device Balancing DSA problem without any assumption. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Wu, W., Tian, W., Li, M., Xue, C. J., & Chen, E. (2010). Single and multiple device DSA problem, complexities and online algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 218–229). https://doi.org/10.1007/978-3-642-17514-5_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
