Single and multiple device DSA problems, complexities and online algorithms

Authors:
Weiwei Wu;Minming Li;Wanyong Tian;Jason Chun Xue;Enhong Chen
Affiliations:
School of Computer Science, University of Science and Technology of China, China and Department of Computer Science, City University of Hong Kong, Hong Kong and USTC-CityU Joint Research Institute ...;Department of Computer Science, City University of Hong Kong, Hong Kong;School of Computer Science, University of Science and Technology of China, China and Department of Computer Science, City University of Hong Kong, Hong Kong and USTC-CityU Joint Research Institute ...;Department of Computer Science, City University of Hong Kong, Hong Kong;School of Computer Science, University of Science and Technology of China, China
Venue:
Theoretical Computer Science
Year:
2012

Citing 14
Cited 0

The linearity of first-fit coloring of interval graphs

SIAM Journal on Discrete Mathematics
The priority-based coloring approach to register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
A polynomial time approximation algorithm for Dynamic Storage Allocation

Discrete Mathematics
Improvements to graph coloring register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Iterated register coalescing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight bounds for dynamic storage allocation

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for compile-time memory optimization

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Spectrum Allocation: The Impotency of Duration Notification

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for Dynamic Storage Allocations

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Dynamic Storage Allocation with Known Durations

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
OPT versus LOAD in dynamic storage allocation

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Restricted strip covering and the sensor cover problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Comparability graph coloring for optimizing utilization of stream register files in stream processors

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	5.23

Visualization

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 (2-@e)-competitive and any clairvoyant algorithm cannot be (1.54-@e)-competitive. *The first O(logL)-competitive algorithm for general jobs on multi-device Balancing DSA problems without any assumption.