1. Single and multiple device DSA problems, complexities and online algorithms
- Author
-
Wu, Weiwei, Li, Minming, Tian, Wanyong, Xue, Jason Chun, and Chen, Enhong
- Subjects
- *
DYNAMIC storage allocation (Computer science) , *ONLINE algorithms , *COMPUTATIONAL complexity , *MAGNETIC memory (Computers) , *NP-complete problems , *COMPUTER algorithms - Abstract
Abstract: We study the single-device Dynamic Storage Allocation (DSA) problem and the 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 the DSA problem. Our results are as follows. [•] The NP-completeness for the 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 problems. A 4-competitive algorithm for jobs with agreeable deadlines on multi-device Balancing DSA problems. [•] Lower bounds for jobs with agreeable deadlines: any non-clairvoyant algorithm cannot be -competitive and any clairvoyant algorithm cannot be -competitive. [•] The first -competitive algorithm for general jobs on multi-device Balancing DSA problems without any assumption. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF