Transformations for Write-All-with-Collision Model
In this paper, we consider a new atomicity model, write all with collision (WAC), and compare it with existing models considered in the literature. This model captures the computations in sensor networks. We show that it is possible to transform a program from WAC model into a program in read/write model, and vice versa. Further, we show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing. In other words, if a deterministic program cannot read then it is important that it can tell time.
KeywordsModel conversions Preserving stabilization Atomicity refinement Write-all-with-collision model Read/Write model
Unable to display preview. Download preview PDF.
- 1.Gouda, M., Haddix, F.: The linear alternator. In: Proceedings of the Third Workshop on Self-stabilizing Systems, pp. 31–47 (1997)Google Scholar
- 2.Gouda, M., Haddix, F.: The alternator. In: Proceedings of the Fourth Workshop on Self-stabilizing Systems, pp. 48–53 (1999)Google Scholar
- 4.Antonoiu, G., Srimani, P.K.: Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 824–830. Springer, Heidelberg (1999)CrossRefGoogle Scholar
- 7.Chartrand, G., Oellermann, O.R.: Applied and Algorithmic Graph Theory. McGraw-Hill Inc., New York (1993)Google Scholar
- 10.Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11) (1974)Google Scholar
- 12.Kulkarni, S.S., Arumugam, M.: Transformations for write-all-with-collision model. Technical Report MSU-CSE-03-27, Department of Computer Science, Michigan State University (October 2003)Google Scholar
- 14.Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.: System architecture directions for network sensors. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (November 2000)Google Scholar
- 17.Couvreur, J., Francez, N., Gouda, M.: Asynchronous unison. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 486–493 (1992)Google Scholar