# Local labeling and resource allocation using preprocessing

## Abstract

This paper studies the power of non-restricted preprocessing on a communication graph *G*, in a synchronous, reliable system. In our scenario, arbitrary preprocessing can be performed on *G*, and afterwards a sequence of labeling problems have to be solved on different subgraphs of *G*. We suggest a preprocessing that produces an orientation of G. The goal is to exploit this preprocessing to minimize the radius of the neighborhood around each vertex from which data has to be collected in order to determine a label. We define a set of labeling problems for which this can be done. The time complexity of labeling a subgraph depends on the topology of the graph *G* and is always less than min{*χ(G), O*((log *n*)^{2})}. On the other hand, we show the existence of a graph where even unbounded preprocessing does not allow a fast solution of a simple labeling problem. Specifically, it is shown that a processor needs to know its *Ω*(log *n*/log log *n*)-neighborhood in order to pick a legal label. Finally, we derive some results on the resource allocation problem. In particular, we show that *Ω*(log *n*log log *n)* communication rounds are needed in order to provide short response time, and we give an efficient distributed algorithm that employs the same preprocessing as the labeling algorithm.

## Key words

locality preprocessing orientation labeling resource allocation response time## Preview

Unable to display preview. Download preview PDF.

## References

- 1.H. Attiya, M. Bellare, H. Shachnai and T. Tamir. The minimum color sum problem and distributed resource allocation, manuscript, 1994.Google Scholar
- 2.B. Awerbuch and D. Peleg. Sparse partition.
*IEEE Symp. on Foundation of Computer Science*, 1990, pp. 503–513.Google Scholar - 3.B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time.
*IEEE Syrnp. on Foundation of Computer Science*, 1990, pp. 65–74.Google Scholar - 4.V.C. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood constrained systems.
*ACM Trans. Programming Languages and Systems*, Vol. 11, 1989, pp. 562–584.CrossRefGoogle Scholar - 5.J. Bar-Ilan and D. Peleg. Distributed resource allocation algorithms.
*International Workshop on Distributed Algorithms*, 1992, pp. 276–291.Google Scholar - 6.K. Chandy and J. Misra. The drinking philosophers problem.
*ACM Trans. Programming Languages and Systems*, Vol. 6, 1984, pp. 632–646.CrossRefGoogle Scholar - 7.M. Choy and A. K. Singh. Efficient fault tolerant algorithms in distributed systems.
*Proc. 24th ACM Symposium on Theory of Computing*, 1992, pp. 593–602.Google Scholar - 8.P. Erdös,
*Graph theory and probability*. Canad. J.Math., 11, pp. 34–38, 1959.Google Scholar - 9.A. Goldberg, S. Plotkin and G. Shannon. Parallel symmetry-breaking in sparse graphs.
*Proc. 19th ACM Symposium on Theory of Computing*, 1987, pp. 315–324.Google Scholar - 10.N. Linial. Distributive algorithms — Global solutions from local data.
*IEEE Symp. on Foundation of Computer Science*, 1987. pp. 331–335.Google Scholar - 11.N. Linial. Local-Global phenomena in graphs.
*Technical Report No. 9*,*1993*Hebrew University, Jerusalem, Israel.Google Scholar - 12.N. Linial and M. Saks. Decomposing graphs into regions of small diameter.
*SIAM-ACM Symposium on Discrete Algorithms*, 1991, pp. 320–330.Google Scholar - 13.M. Naor and L. Stockmayer. What can be computed locally?
*25th ACM Symposium on Theory of Computing*, 1993, pp. 184–193.Google Scholar - 14.A. Panconesi and A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems.
*24th ACM Symposium on Theory of Computing*, 1992, pp. 581–592.Google Scholar - 15.M. Szegendy and S. Vishwanathan. Locality based graph coloring.
*25th ACM Symposium on Theory of Computing*, 1993, pp. 201–207.Google Scholar - 16.I. Rhee. Efficiency of partial synchrony, and resource allocation in distributed systems,
*Ph.D Thesis*, University of North Carolina at Chapel Hill, June 1994.Google Scholar