Abstract
AbstractWe 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. KeywordsCompetitive RatioOnline AlgorithmCompetitive AlgorithmRegister AllocationOccupied SpaceThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
