On Restructuring Distributed Algorithms for Mobile Computing
In this paper we propose a formalization of a subclass of distributed algorithms that can be suitable for execution on mobile environment. In particular, our investigation puts stress on evolving techniques to include the design abstractions of the resources and synchronization typical to a mobile environment with the conventional design of distributed algorithm, so that a greater amount of concurrency can be derived within the available level of resources. To that effect we propose a method to evaluate a concurrency load for any abstraction and use it to come up with answer as to which of the abstractions would be better when host mobility is allowed.
Unable to display preview. Download preview PDF.
- 2.Badrinath, B. R., Acharya, A., and Imielinski, T. Structuring distributed algorithms for mobile hosts. In Proceedings of ICDCS (1994), pp. 21–28.Google Scholar
- 4.Ghosh, R. K., Chakraborty, A., and Kumar, R. Restructuring distributed algorithms for mobile computing environment. Tech. rep., Department of CSE, IIT-Kanpur, April 2002.Google Scholar
- 5.Grant, W. C. Wireless coyote: A computer supported field trip. CACM 36 (1993), pp. 57–59.Google Scholar