Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of India, 2007.Ģ. REFERENCES: CS8603 Notes Distributed Systemsġ. George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed Systems Concepts and Design‖, Fifth Edition, Pearson Education, 2012. Distributed computing: principles, algorithms, and systems. Kshemkalyani, Ajay D., and Mukesh Singhal. Describe the features of peer-to-peer and distributed shared memory systems TEXT BOOKS: CS8603 Notes Distributed Systemsġ. Understand the Mutual Exclusion and Deadlock detection algorithms in distributed systems Describe the agreement protocols and fault tolerance mechanisms in distributed systems. OUTCOMES: CS8603 Notes Distributed SystemsĪt the end of this course, the students will be able to: Elucidate the foundations and issues of distributed systems Understand the various synchronization issues and global state for distributed systems. To learn the characteristics of peer-to-peer and distributed shared memory systems. To understand the significance of agreement, fault tolerance and recovery protocols in Distributed Systems. To learn distributed mutual exclusion and deadlock detection algorithms. To learn issues related to clock Synchronization and the need for global state in distributed systems. To understand the foundations of distributed systems. OBJECTIVES: CS8603 Notes Distributed Systems Distributed Systems Notes CS8603 pdf free download. CS8603 Notes Distributed Systems Regulation 2017 Anna University free download.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |