Tool integration for flexible simulation of distributed algorithms

Over the last two decades, considerable research has been done in distribut ed operating systems, which can be attributed to faster processors and bett er communication technologies. A distributed operating system requires dist ributed algorithms to provide basic operating system functionality like mut ual exclusion, deadlock detection, etc. A number of such algorithms have be en proposed in the literature. Traditionally, these distributed algorithms have been presented,in a theoretical way, with limited attempts to simulate actual working models. This paper discusses our experience in simulating d istributed algorithms with the aid of some existing tools, including OPNET and Xplot. We discuss our efforts to define a basic model-based framework f or rapid simulation and visualization and illustrate how we used this frame work to evaluate some classic algorithms. We have also shown how the perfor mance of different algorithms can be compared based on some collected stati stics. To keep the focus of this paper on the approach itself, and our expe rience with tool integration, we only discuss some relatively simple models . Yet, the approach can be applied to more complex algorithm specifications . Copyright (C) 2001 John Wiley & Sons, Ltd.