Local labeling and resource allocation using preprocessing

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1397-1413

  Attiya, Hagit ^a   Shachnai, Hadas ^a   Tamir, Tami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; PROGRAM PROCESSORS; RESOURCE ALLOCATION; TOPOLOGY;

DISTRIBUTED LABELLING ALGORITHM; LABELING PROBLEMS; PREPROCESSING; RESPONSE TIME;

DATA PROCESSING;

EID: 0032657666     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539795285643     Document Type: Article

References (19)

1. B. AWERBUCH, Complexity of network synchronization, J. ACM. 32 (1985), pp. 804-823.
2. B. AWERBUCH AND D. PELEG, Sparse partitions, in Proc. IEEE Symposium on Foundation of Computer Science, St. Louis, MO, 1990, pp. 503-513.
3. B. AWERBUCH AND M. SAKS, A dining philosophers algorithm with polynomial response time, in Proc. IEEE Symposium on Foundation of Computer Science, St. Louis, MO, 1990, pp. 65-74.
4. V. C. BARBOSA AND E. GAFNI, Concurrency in heavily loaded neighborhood-constrained systems, ACM Trans. Programming Languages and Systems, 11 (1989), pp. 562-584.
5. J. BAR-ILAN AND D. PELEG, Distributed resource allocation algorithms, in Proc. International Workshop on Distributed Algorithms, Haifa, Israel, 1992, pp. 276-291.
6. A. BAR-NOY, M. BELLARE, M. HALLDÓRSSON, H. SHACHNAI, AND T. TAMIR, On chromatic sums and distributed resource allocation, Inform. and Comput., 140 (1998), pp. 183-202.
7. K. CHANDY AND J. MISRA, The drinking philosophers problem, ACM Trans. Programming Languages and Systems, 6 (1984), pp. 632-646.
8. M. CHOY AND A. K. SINGH, Efficient fault tolerant algorithms in aistributed systems, in Proc. 24th ACM Symposium on Theory of Computing, Victoria, BC, Canada, 1992, pp. 593-602.
9. R. COLE AND U. VISHKIN, Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms, in Proc. 18th ACM Symposium on Theory of Computing, Berkeley, CA, 1986, pp. 206-219.
10. P. ERDÖS, Graph theory and probability, Canad. J. Math., 11 (1959), pp. 34-38.
11. A. GOLDBERG, S. PLOTKIN, AND G. SHANNON, Parallel symmetry-breaking in sparse graphs, in Proc. 19th ACM Symposium on Theory of Computing, New York, NY, 1987, pp. 315-324.
12. N. LINIAL, Distributive algorithms - Global solutions from local data, in Proc. IEEE Symposium on Foundation of Computer Science, Los Angeles, CA, 1987, pp. 331-335.
13. N. LINIAL, Local-Global Phenomena in Graphs, Technical Report 9, Dept. Computer Science, Hebrew University, Jerusalem, Israel, 1993.
14. N. LINIAL AND M. SAKS, Decomposing graphs into regions of small diameter, in Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, SIAM, Philadelphia, 1991, pp. 320-330.
15. A. MAYER, M. NAOR, AND L. STOCKMEYER, Local computations on static and dynamic graphs, in Proc. 3rd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, 1995, pp. 268-278.
16. M. NAOR AND L. STOCKMEYER, What can be computed locally?, in Proc. 25th ACM Symposium on Theory of Computing, San Diego, CA. 1993, pp. 184-193.
17. A. PANCONESI AND A. SRINIVASAN, Improved distributed algorithms for coloring and network decomposition problems, in Proc. 24th ACM Symposium on Theory of Computing, Victoria, BC, Canada, 1992, pp. 581-592.
18. M. SZEGENDY AND S. VISHWANATHAN, Locality based graph coloring, in Proc. 25th ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 201-207.
19. I. RHEE, Efficiency of Partial Synchrony, and Resource Allocation in Distributed Systems, Ph.D. thesis, University of North Carolina at Chapel Hill, Chapel Hill, NC, 1994.