On Chromatic Sums and Distributed Resource Allocation

Information and Computation

Volumn 140, Issue 2, 1998, Pages 183-202

  Bar Noy, Amotz ^a   Bellare, Mihir ^b   Halldórsson, Magnús M ^c   Shachnai, Hadas ^d   Tamir, Tami ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF ICELAND   (Iceland)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed resource allocation; Graph coloring; Maximum independent sets; Response time

Indexed keywords

EID: 0000236642     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2677     Document Type: Article

References (36)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in "Proceedings of the Thirty Third Annual IEEE Symposium on Foundations of Computer Science," pp. 14-23.
2. Awerbuch, B., and Saks, M. (1990), A dining philosophers algorithm with polynomial response time, in "Proceedings of the Thirty First IEEE Symp. on Foundation of Computer Science," pp. 65-74.
3. Awerbuch, B., Cowen, and Smith (1994), Efficient asynchronous distributed symmetry breaking, in "Proceedings of the Twenty Sixth on the Theory of Computing," pp. 214-223.
4. Attiya, H., Shachnai, H., and Tamir, T. (1994), Local labeling and resource allocation using preprocessing, in "Proceedings of the 8th International Workshop on Distributed Algorithms," pp. 194-208.
5. Bar-Ilan, J., and Peleg, D. (1992), Distributed resource allocation algorithms, in "Proceedings of the Sixth International Workshop on Distributed Algorithms," pp. 276-291.
6. Bar-Noy, A., Mayer, A., Schieber, B., and Sudan, M. (1995), Guaranteeing fair service to persistent dependent tasks, in "Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 243-252.
7. Bar-Noy, A., Shachnai, H., and Tamir, T. (1996), On chromatic sums and distributed resource allocation, in "Proceedings of the Fourth Israel Symposium on Theory and Computing Systems."
8. 0.2143) coloring for 3-colorable graphs, Inform. Process. Lett., to appear.
9. Boppana, R. B. (1989), Optimal separations between concurrent-write parallel machines, in "Proceedings of the 21st Annual ACM Symposium on Theory of Computing," pp. 320-326.
10. Boppana, R. B., and Halldórsson, M. M. (1992), Approximating maximum independent sets by excluding subgraphs, BIT 32, 180-196.
11. Chandy, K., and Misra, J. (1984), The drinking philosophers problem, ACM Trans. Program. Lang. Systems 6, 632-646.
12. Choy, M., and Singh, K. (1992), Efficient fault tolerant algorithms in distributed systems, in "Proceedings of the Twenty Forth Annual Symposium on the Theory of Computing," pp. 593-602.
13. Cheng, S. C., Stankovic, J. A., and Ramamritham, K. (1987), "Hard Real-Time Systems," Los Alamitos, CA, IEEE Comput. Soc., pp. 150-173.
14. Feige, U., and Kilian, J. (1996), Zero-knowledge and the chromatic number, in "Proceedings of the IEEE Conference on Structure in Complexity Theory."
15. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York.
16. Garey, M. R., and Graham, R. (1975), Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput. 4, 187-200.
17. Goldberg, M., and Spencer, T. H. (1990), An efficient parallel algorithm that finds independent sets of guaranteed size, in "Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 219-225.
18. Halldórsson, M. M., and Radhakrishnan, J. (1993), "Approximating the Chromatic Sum," Japan Advanced Institute of Science and Technology (JAIST), Research Report, IS-RR-93-0002F.
19. Harary, F. (1969), "Graph Theory," Addison-Wesley, Reading, MA.
20. Irani, S., and Leung, V. (1996), Scheduling with conflicts, and applications to traffic signal control, in "Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms," pp. 85-94.
21. Jájá, J. (1992), "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA.
22. Jansen, K. (1997), The optimum cost chromatic partition problem, in "Proc. of the Third Italian Conference on Algorithms and Complexity (CIAC '97)", Lecture Notes in Computer Science, Vol. 1203, Springer-Verlag, Berlin/New York.
23. Kubicka, E. (1989), "The Chromatic Sum of a Graph," Ph.D. Thesis, Western Michigan University.
24. Kubicka, E., Kubicki, G., and Kountanis, D. (1989), Approximation algorithms for the chromatic sum, in "Proceedings of the First Great Lakes Computer Science Conf.," Lecture Notes in Computer Science, Vol. 507, pp. 15-21, Springer-Verlag, Berlin/New York.
25. Kubicka, E., and Schwenk, A. J. (1989), An introduction to chromatic sums, in "Proceedings of the ACM Computer Science Conf.," pp. 39-45.
26. Lund, C., and Yannakakis, M. (1993), On the hardness of approximating minimization problems, in "Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing," pp. 286-293.
27. Lynch, N. (1981), Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci. 23, 254-278.
28. Naor, M., and Stockmeyer, L. (1993), What can be computed locally?, in "Proceedings of the Twenty Fifth Annual Symposium on the Theory of Computing," pp. 184-193.
29. Nicoloso, S., Sarrafzadeh, M., and Song, X. (1994), On the wire-length minimization problem, manuscript.
30. Nicoloso, S., Sarrafzadeh, M., and Song, X. (1994), "On the Sum Coloring Problem on Interval Graphs," Istituto di Analisi dei Sistemi ed Informatica (IASI-CNR), R. 390.
31. Panconesi, A., and Srinivasan, A. (1992), Improved distributed algorithms for coloring and network decomposition problems, in "Proceedings of the Twenty Fourth Annual Symposium on the Theory of Computing," pp. 581-592.
32. Rhee, I. (1994), "Efficiency of Partial Synchrony, and Resource Allocation in Distributed Systems," Ph.D. thesis, University of North Carolina at Chapel Hill.
33. Srivastav, A., and Stangier, P. (1994), Tight approximations for resource constrained scheduling problems, in "Proceedings of the Second European Symposium on Algorithms," pp. 307-318.
34. Steyer, E., and Peterson, G. (1988), Improved algorithms for distributed resource allocation, in "Proceedings of the Seventh Annual Symposium on Principles of Distributed Computing," pp. 105-116.
35. Vishwanathan, S. (1995), Private communication.
36. Wang, Q., and Cheng, K. H. (1992), A heuristic of scheduling parallel tasks and its analysis, SIAM J. Comput. 21, 281-294.