A distributed system is a collection of computers that are spatially separated and do not share a common memory. The processes executing on these computers communicate with one another by exchanging messages over communication channels. The messages are delivered after an arbitrary delay. We give theoretical foundations of distributed systems.

Download PDF

References

1. Kalaiselvi S, Rajaraman V 2000 Task graph based checkpointing in parallel/distributed systems. J. Parallel Distributed Comput. (submitted)
2. Leong H V, Agrawal D 1994 Using message semantics to reduce rollback in optimistic message logging recovery schemes. Proc. IEEE 14th Conf. on Distributed Computing Syst. Pp 227-234
3. James Kistler and M. Satyanarayanan. Disconnected operation in the coda file system. ACM Trans. On Computer Systems, 10(1), Feb. 1992. 12
4. G. Le Lann. Distributed systems, towards a formal approach. IFIP Congress, Toronto, pages 155–160, 1977.
5. M. Maekawa. algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2), May 1985.
6. Brian Marsh, Fred Douglis, and Ramon Caceres. Systems issues in mobile computing. Technical Report MITL-TR-50–93, MITL, 1993.
7. Carl D. Tait and Dan Duchamp. Service interface and replica management algorithm for mobile file system clients. In Proc. First Intl. Conf. on Parallel and Distributed Information Systems, 1991. [28] Fumio
8. eraoka, Yasuhiko Yokote, and Mario Tokoro. A network architecture providing host migration transparency. Proc. of ACM SIGCOMM’91, September, 1991.
9. David Vaskevitch. Database in crisis and transition: A technical agenda for the year 2001. In Proc. Of the 1994 ACM SIGMOD Intl. Conf. on Management of Data.

Back