|
Teaching Scheme |
Exam Scheme |
|||||
|
Th. |
Pract. |
Total |
Th. |
Pract. |
TW/Viva |
Total |
|
04 Marks |
02 Marks |
06 Marks |
100 Marks |
25 Marks |
25 Marks |
150 Marks |
|
Hrs./Week |
Hrs./Week |
Hrs./Week |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
Introduction to distributed computing. Distribution of data control :
Clock synchronization, distributed termination problem, load distribution, distributed elections, agreement problem. dead-locks in distributed systems, introduction to fault-tolerant computing.
High level language supports for distributed computing :
Massage passing primitives, atomic actions, remote procedure call mechanisms. implementation of these features. case study of some languages like occam Ii, Linda.
Formal development and verification of distributed algorithms.
Text/references :
Distributed systems : Concepts and design, -By G. F. Colouris, J. Dollimore and T. Kindberg, Addison Wesley, 2nd ed. 1994.
Introduction to distributed algorithms, -By G. Tel, Cambridge university press, 1994.
Programme verification, -By K. R. Apte, 1991.
Distributed system, -By S. Mullender (Ed), Addison Wesley, 1989.
Distributed computing : concept and implementations, -By P. L. Mcentre, Et.A1, Ieee press, 1984.
Distributed computer systems, -By Y. Parker (Ed), academic press, 1983.
Distributed systems : Architecture and applications : and advance course, -By B. W. Lampson (Ed), springer-verlag. 1981.
Fault-tolerant distributed computing, -By B. Simon and A Spector (Eds), springer, 1990.
Research paper from some current journals.
