{"id":18790,"date":"2019-12-10T05:42:00","date_gmt":"2019-12-10T05:42:00","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/distributed-systems-cse-6th-sem-syllabus-for-be-2017-regulation-anna-univ\/"},"modified":"2019-12-10T05:42:00","modified_gmt":"2019-12-10T05:42:00","slug":"distributed-systems-cse-6th-sem-syllabus-for-be-2017-regulation-anna-univ","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/distributed-systems-cse-6th-sem-syllabus-for-be-2017-regulation-anna-univ\/","title":{"rendered":"Distributed Systems Cse 6th Sem Syllabus for BE 2017 Regulation Anna Univ"},"content":{"rendered":"<p>Distributed Systems detail syllabus for Computer Science &amp; Engineering (Cse), 2017 regulation is taken from <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna University<\/a> official website and presented for students of Anna University. The details of the course are: course code (CS8603), Category (PC), Contact Periods\/week (3), Teaching hours\/week (3), Practical Hours\/week (0). The total course credits are given in combined syllabus.<\/p>\n<p>For all other cse 6th sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/cse-6th-sem-syllabus-for-be-2017-regulation-anna-univ\">Cse 6th Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. The detail syllabus for distributed systems is as follows.&#8221;<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To understand the foundations of distributed systems.<\/li>\n<li>To learn issues related to clock Synchronization and the need for global state in distributed systems.<\/li>\n<li>To learn distributed mutual exclusion and deadlock detection algorithms.<\/li>\n<li>To understand the significance of agreement, fault tolerance and recovery protocols in Distributed Systems.<\/li>\n<li>To learn the characteristics of peer-to-peer and distributed shared memory systems.<\/li>\n<\/ul>\n<p><h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit II<\/h4>\n<p><strong>Message Ordering and Snapshots<\/strong><br \/>\nMessage ordering and group communication: Message ordering paradigms -Asynchronous execution with synchronous communication -Synchronous program order on an asynchronous system -Group communication &#8211; Causal order (CO) &#8211; Total order. Global state and snapshot recording algorithms: Introduction -System model and definitions -Snapshot algorithms for FIFO channels\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong>Distributed Mutex and Deadlock<\/strong><br \/>\nDistributed mutual exclusion algorithms: Introduction &#8211; Preliminaries &#8211; Lamports algorithm -Ricart-Agrawala algorithm &#8211; Maekawas algorithm &#8211; Suzuki-Kasamis broadcast algorithm. Deadlock detection in distributed systems: Introduction &#8211; System model &#8211; Preliminaries -Models of deadlocks &#8211; Knapps classification &#8211; Algorithms for the single resource model, the AND model and the OR model.\n<\/p>\n<p><h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit V<\/h4>\n<p><strong>Peer To Peer and Distributed Shared Memory<\/strong><br \/>\nPeer-to-peer computing and overlay graphs: Introduction &#8211; Data indexing and overlays &#8211; Chord &#8211; Content addressable networks &#8211; Tapestry. Distributed shared memory: Abstraction and advantages &#8211; Memory consistency models -Shared memory Mutual Exclusion.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>At the end of this course, the students will be able to:<\/p>\n<ul>\n<li>Elucidate the foundations and issues of distributed systems<\/li>\n<li>Understand the various synchronization issues and global state for distributed systems.<\/li>\n<li>Understand the Mutual Exclusion and Deadlock detection algorithms in distributed systems<\/li>\n<li>Describe the agreement protocols and fault tolerance mechanisms in distributed systems.<\/li>\n<li>Describe the features of peer-to-peer and distributed shared memory systems<\/li>\n<\/ul>\n<p><h4>Text Books:<\/h4>\n<ol>\n<li>Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles, algorithms, and systems. Cambridge University Press, 2011.<\/li>\n<li>George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts and Design, Fifth Edition, Pearson Education, 2012.<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>Pradeep K Sinha, &#8220;Distributed Operating Systems: Concepts and Design&#8221;, Prentice Hall of India, 2007.<\/li>\n<li>Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating systems. McGraw-Hill, Inc., 1994.<\/li>\n<li>Tanenbaum A.S., Van Steen M., Distributed Systems: Principles and Paradigms, Pearson Education, 2007.<\/li>\n<li>Liu M.L., Distributed Computing, Principles and Applications, Pearson Education, 2004.<\/li>\n<li>Nancy A Lynch, Distributed Algorithms, Morgan Kaufman Publishers, USA, 2003.<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit <a href=\"..\/category\/cse+6th-sem\">Cse 6th Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Distributed Systems detail syllabus for Computer Science &amp; Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the [&hellip;]<\/p>\n","protected":false},"author":2297,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[49,69],"tags":[],"class_list":["post-18790","post","type-post","status-publish","format-standard","hentry","category-6th-sem","category-cse"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/18790","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=18790"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/18790\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=18790"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=18790"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=18790"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}