Abstract
This paper investigates the orientation problem on anonymous n×n torus networks. In the orientation problem, the goal is to reach an agreement, among all processors, on a consistent channel labelling. This paper shows that, if processors can label their channels arbitrarily, then there is no distributed orientation algorithm. Therefore the orientation problem is studied in various orientation models ℳ that restrict local channel labellings. For many ℳ, there are network labellings that, to the processors, are indistinguishable from orientations. These pseudo-orientations give rise to two problems related to orientation. In the verification problem, processors in an n×n torus distributively verify whether a network labelling in ℳ is an orientation. The verification problem is shown to be equivalent to a problem of tiling the torus with Wang tiles. In the pseudo-orientation problem, the goal is to distributively find a pseudo-orientation. The pseudo-orientation problem is shown to be equivalent to a problem in graph theory.
Preview
Unable to display preview. Download preview PDF.
References
Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM, Vol. 35, No. 4 (1988), 845–875.
Beame, P.W., Bodlaender, H.L.: Computing on Transitive Networks: The Torus. In B. Monien and R. Cori, editors, Sixth Annual Symposium on Theoretical Aspects of Computer Science (1989), 294–303.
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier Science Pub. Co., 1976.
Budden, F.J.: The Fascination of Groups. Cambridge University Press, 1972.
Grünbaum, B., Shephard, G.C.: Tilings and Patterns. W. H. Freeman, 1987.
Harary, F., Wilcox, G.W.: Boolean Operations on Graphs. Math. Scand. 20 (1967), 41–51.
Kranakis, E., Krizanc, D.: Distributed Computing on Anonymous Hypercube Networks. Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing (1991), 722–729.
Norris, N.: Universal Covers of Edge-Labelled Digraphs: Isomorphism to Depth n-1 Implies Isomorphism to all Depths. Technical Report UCSC-CRL-90-49, University of California at Santa Cruz, 1990.
Syrotiuk, V.R.: Wang Tilings and Distributed Orientation on Anonymous Torus Networks. Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1992.
Tel, G.: Network Orientation. Technical Report RUU-CS-91-8, Utrecht University, March 1991.
Wang, H.: Notes on a Class of Tiling Problems. Fundamenta Mathematicae 82 (1975), 295–305.
Yamashita, M., Kameda, T.: Computing on an Anonymous Network. Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (1988), 117–130.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Syrotiuk, V.R., Colbourn, C.J., Pachl, J. (1993). Wang tilings and distributed orientation on anonymous torus networks (extended abstract). In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive