Buffer Minimization using Max-Coloring

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 555-564

  Pemmaraju, Sriram V ^a   Raman, Rajiv ^a   Varadarajan, Kasturi ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAX-COLORING PROBLEM; MEMORY MANAGEMENT; OPTIMAL COLORING; SEGREGATED BUFFER POOL;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; DIGITAL SIGNAL PROCESSING; GRAPH THEORY; NETWORK PROTOCOLS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SET THEORY; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION;

COLORING;

EID: 1842592011     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A.L. Buchsbaum, H. Karloff, C. Kenyon, N. Reingold, and M. Thorup. OPT versus LOAD in dynamic storage allocation. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 556-564, 2003.
2. M. Chrobak and M. Ślusarek. On some packing problems related to dynamic storage allocation. Informatique théorique et Applications/Theoretical Informatics and Applications, 22(4):487-499, 1988.
3. D.G. Corneil, S. Olariu, and L. Stewart. The ultimate interval graph recognition algorithm? (extended abstract). In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 175-180, 1998.
4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
5. J. Gergov. Approximation algorithms for dynamic storage allocation. In Proceedings of the 4th European Symposium on Algorithms: Lecture Notes in Computer Science 1136, pages 52-61, 1996.
6. J. Gergov. Algorithms for compile-time memory optimization. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages S907-S908, 1999.
7. R. Govindarajan and S. Rengarajan. Buffer allocation in regular dataflow networks: An approach based on coloring circular-arc graphs. In Proceedings of the 2nd International Conference on High Performance Computing, 1996.
8. V. Guruswami. Inapproximability results for set splitting and satisfiability problems with no mixed clauses. In APPROX, pages 155-166, 2000.
9. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48:798-859, 2001.
10. S. Irani. Coloring inductive graphs on-line. Algorithmica, 11(1):53-72, 1994.
11. H.A. Kierstead. The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math, 1:526-530, 1988.
12. H.A. Kierstead. A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics, 88:231-237, 1991.
13. H.A. Kierstead and J. Qin. Coloring interval graphs with first-fit. Discrete Mathematics, 144:47-57, 1995.
14. H.A. Kierstead and W.T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33:143-153, 1981.
15. L. Lovász, M. Saks, and W.T. Trotter. An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math., 75:319-325, 1989.
16. T. Szkaliczki. Routing with minimum wire length in the dogleg-free manhattan model is np-complete. SIAM Journal of Computing, 29(1), 1999.