CS6601.docx

May 14, 2018 | Author: சுதாகர் பொ. | Category: Distributed Computing, Peer To Peer, Concurrent Computing, Areas Of Computer Science, Operating System Technology


Comments



Description

FT/GN/68/00/21.04.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering LP: CS6601 Rev.No.: 01 B.E/B.Tech/M.E/M.Tech : B.E(CSE)/B.Tech(IT) Regulation: 2013 Date: 28/12/2016 PG Specialisation : - Sub. Code / Sub. Name : CS6601 / Distributed Systems Unit :I Unit Syllabus: INTRODUCTION Examples of Distributed Systems–Trends in Distributed Systems – Focus on resource sharing – Challenges. Case study: World Wide Web. Objective: To have an understanding of foundations of Distributed Systems. Session Teaching Topics to be covered Ref No * Aids Distributed systems- 1-Ch.1;Pg 1-7 Introduction, Definition, Issues. 3-Ch.1;Pg 17-24 1 BB Examples of Distributed http://www.cis.upenn.edu/~lee/07cis505/Lec/lec-ch1- Systems DistSys-v4.pdf Trends in Distributed Systems - 2 pervasive networking http://citeseerx.ist.psu.edu/ http://www.cis.upenn.edu/ LCD technology, ubiquitous computing. Trends in Distributed Systems - demand for multimedia services, 3 http://citeseerx.ist.psu.edu/ http://www.cis.upenn.edu/ LCD view of distributed systems as a utility 1-Ch.1;Pg 7- 14 4 Focus on resource sharing 3-Ch.1;Pg 3-16 LCD 4-Ch.1;Pg 28-32 1-Ch.1;Pg 14- 23 http://www.cis.upenn.edu/~lee/07cis505/Lec/lec-ch1- Main Challenges of distributed DistSys-v4.pdf 5 LCD systems and Approaches https://www.cs.helsinki.fi/u/jakangas/Teaching/DistSys/ DistSys-08f-1.pdf 1-Ch.1;Pg 14- 23 http://www.cis.upenn.edu/~lee/07cis505/Lec/lec-ch1- Main Challenges of distributed DistSys-v4.pdf 6 LCD systems and Approaches https://www.cs.helsinki.fi/u/jakangas/Teaching/DistSys/ DistSys-08f-1.pdf 1-Ch.1;Pg 8- 14 Case study: World Wide Web. https://en.wikipedia.org/wiki/WorldWideWeb 7 LCD www.webopedia.com Content beyond syllabus covered (if any): - Real time applications for distributed systems. * Session duration: 50 mins nuagenetworks.10.Ch. Network virtualization: Overlay networks.Pg.Pg.Shared 3.pdf 12 Introduction . 230-238 16 Message queues .Ch. Objective: To understand in detail network virtualization and remote invocations required for distributed system.212 14 Remote method invocation http://www-itec.Pg.Ch-1.tecnico.pdf 1.212 15 Case study: Java RMI .Group communication .5.Ch.10 13 Remote procedure call http://www-itec.Ch.uni-klu. 36 – 52 9 The API for internet protocols – 1.edu/~pkc/classes/dc/slides/ch4.Pg. 183 – 193 2.Case study: Enterprise Java Beans -from objects to components.2. Ch.Group 1.Ch. Multicast communication. 5 – 12 3.ac.Ch.4. Case study: Java RMI . Session Teaching Topics to be covered Ref No * Aids 8 System Model – Inter process 1. 67 – 76.pdf LCD Overlay networks.com/ejb/ LCD Beans -from objects to 2.Ch.techtarget.at/~laszlo/courses/DistSys_BP/RemoteObjects.com/definition/Enterprise-JavaBeans components. 193 – 200 LCD communication .9 .Pg.Pg.4. http://cs.SOAP * Session duration: 50 mins . http://searchsdn.Pg.Remote procedure call - Remote method invocation.Ch.Request-reply 1.Ch.fit. LCD Remote met klu.Pg. 183 – 193 2.Java RMI.5.446-448 • Content beyond syllabus covered (if any): . LCD/ klu.net/network-virtualization-overlay-and- underlay-design/ 11 Case study: MPI Remote 1.the API for internet protocols – External data representation and Multicast communication. 167 .ac.techtarget.Case study: Remote procedure call – specific systems – DCE RPC . Name: CS6601 / Distributed Systems Unit : II Unit Syllabus : COMMUNICATION IN DISTRIBUTED SYSTEM System Model – Inter process Communication .pdf 17 Case study: Enterprise Java 1.Ch.uni.at/~laszlo/courses/DistSys_BP/RemoteObjects.ac. 153 – 157 subscribe systems 2.Pg.tutorialspoint.2.pt/downloadFile/845043405434906/padi- 1415-05-message-queues-shared-memory-tuples.at/~laszlo /courses/DistSys_BP/RemoteObjects.3.Pg. 165 – 183 LCD Method Invocation And 4-Ch.2.Pg. 140 – 152 LCD memory approaches .Pg.5.Pg.Publish-subscribe systems - Message queues . 3.Pg.virginia.1.Ch.Request-reply protocols . 4.com/tip/Virtual-overlay-networks http://www.uni. 167 .Pg.5.5. Code / Sub. 27 – 57 LCD Communication 2.http://searchsoa. 97 – 103 Distributed objects https://fenix. 1.pdf Demo 1. Ch.Ch.227 – 229 Objects: Remote Invocation http://www-itec.cs.edu/~cs757/slidespdf/757-09-overlay.Publish.3. Case study: MPI Remote Method Invocation And Objects: Remote Invocation – Introduction .ulisboa.THEORY Page 2 of 6 Sub.http://www.7.1.04.4.Ch.Pg. 146 – 153 LCD protocols 3-Ch.4. 37 – 39 2.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN .Shared memory approaches -Distributed objects .Pg.Ch.4.Pg.pdf 10 Network virtualization: http://www. FT/GN/68/00/21.Pg.7.Ch.Pg. 123 – 157 LCD External data representation and 4. pdf LCD 3.uni- potsdam.8.10.306-310.tw/~wuch/course/csf661/c sf661-10.218-222 LCD  Content beyond syllabus covered (if any): Stream-oriented communications * Session duration: 50 mins .https://classes.iastate.cse.Distributed File Systems –Introduction .com/file/view/Peer-to- eer_100228.9.edu/~bina/cse486/spring2011/P 2PNetworkApr13.9. FT/GN/68/00/21. Session Teaching Topics to be covered Ref No * Aids 18 Peer-to-peer Systems – 1.9.10.Pg.pdf 23 File System: Features-File model 2-Ch.2.10. Name: CS6601 / Distributed Systems Unit : III Unit Syllabus : PEER TO PEER SERVICES AND FILE SYSTEM Peer-to-peer Systems – Introduction .Pg.3.Pg.pdf 20 Peer-to-peer – Middleware .pdf LCD www.Pg.5. Addresses.uio. 2.http://www.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN .9.322-330 Andrew File system.Pg.1-Ch.Pg.Ch.cs.Introduction 2PNetworkApr13.pdf 22 File service architecture .430-433 LCD 25 Naming: Identifiers.8.102 19 Napster and its legacy 1-Ch.pdf LCD 26 Name Space Implementation – 1-Ch.Pg.364 – 365 3-Ch.nuk.9.csie.no/studier/emner/matnat/ifi/INF504 0/h08/lectures/2008_10_28_p2p.5.tw/~wuch/course/csd511 /csd511-08.File service architecture – Andrew File system. Name Resolution – Name Space Implementation – Name Caches – LDAP.edu/~bina/cse486/spring2011/P Systems.179 .Pg. 1-Ch. Objective: To introduce the idea of peer to peer services and file system.Routing overlays.buffalo.Ch. Code / Sub.nuk.Pg.Peer-to-peer – Middleware .47 49 LCD 4-Ch.298 – 304 Tapestry.367 –372 Introduction 3-Ch.Napster and its legacy .soe.THEORY Page 3 of 6 Sub.Distributed File www. 1.csie.edu/cmps128/Winter06/Sl ides/cmps128-distfilesys.ucsc.372 –374 cs865team4.buffalo. Tapestry.de/teaching/mds/mds10_p2p.File sharing semantics Naming: Identifiers. Addresses.541-544 LCD 3-Ch. File System: Features-File model -File accessing models .350 – 356 Name Caches 2-Ch.hpi.Pg.edu.ppt 21 Overlay case studies: Pastry.Pg. Overlay case studies: Pastry.10.04.209 27 LDAP.98 .Pg.10.edu.Pg.Pg.Pg.cse.wikispaces.Pg. 1-Ch.374 –379 Routing overlays https://www.dcl.ppt LCD http://www.423-430 LCD -File accessing models 24 File sharing semantics 2-Ch.340-349 Name Resolution http://web.ppt LCD http://www. 1-Ch.379–387.edu/~cs554/NOTES/Ch5-1. 1-Ch. Pg.12.260 31 Elections –Transactions .7.520 – 531 2-Ch.Clocks.403 – 421 logical clocks.355 – 363 35 Distributed deadlocks 1-Ch.Pg.Pg.12.04.Global states – Coordination and Agreement – Introduction .501 – 511 2-Ch.6.Introduction.Logical time and 1-Ch.6.Timestamp ordering – Atomic Commit protocols -Distributed deadlocks – Replication – Case study – Coda.9.Pg.13.Pg.13.Synchronizing physical clocks.232 .244 29 Synchronizing physical clocks.9.468 – 469 LCD 36 Replication .442-446. events and process states .297 – 305 LCD 3 –Ch.Concurrency Control 1-Ch.Pg.14.Case study – Coda.Pg.Pg.13.244 .471 – 473 LCD 3 – Ch.Pg.Pg. Global states 2-Ch.292-297 LCD 3-Ch.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN .292-297 LCD 3-Ch.14.465 – 469 LCD 33 Optimistic concurrency control.Pg.252 .Pg. LCD Ch.555 – 572.6.400-403 2-Ch.11.Pg.Pg.487. Ch.332 – 336.469 . 1-Ch.432 – 442 Distributed mutual exclusion 2 – Ch. events and process states 1-Ch. Session Teaching Topics to be covered Ref No * Aids 28 Introduction .9.6.440 – 447 LCD 3-Ch.Pg. 583 – 589 2-Ch.296 .283 – 289.Clocks.Pg.Pg.Pg.Pg.534 – 540 2-Ch.453 – 473 32 Transactions -Nested transactions – Locks 3-Ch.Pg.274 – 276.283 – 289. 1-Ch.11.6.–270 501 2-Ch.Pg.9.Pg. NameCS6601 / Distributed Systems Unit : IV Unit Syllabus : SYNCHRONIZATION AND REPLICATION Introduction . transactions and concurrency control mechanisms.9.Logical time and logical clocks .Distributed mutual exclusion – Elections – Transactions and Concurrency Control– Transactions -Nested transactions – Locks – Optimistic concurrency control .Pg.8.THEORY Page 4 of 6 Sub.Timestamp 1-Ch.252 30 Coordination and Agreement.305 Content beyond syllabus covered (if any): OpenMP (Parallel Programming in C) Hadoop Installation * Session duration: 50 mins . Objective: To understand clock synchronization techniques.9.6.6.263 1-Ch.Pg.470 LCD ordering 34 Atomic Commit protocols 1-Ch.6. FT/GN/68/00/21.473-474.Pg.15. Code / Sub.474 – 487 2-Ch.Pg. vu..ppt http://www.Pg.355 – 367 mazsola.edu/~cscskp/DistSystems/ch03.Pg./res_man.THEORY Page 5 of 6 Sub.347 – 351 Introduction.ppt http://www.pdf http://www.398 – 407 http://www./res_man.in/sde_book/distrib_computing.ac.club/ LCD chapter..b-u..b-u.in/sde_book/distrib_computing..8.Process.iit.edu/~cs550/lectures/12_distrib_sys_proc_mg Session mt_migration. FT/GN/68/00/21.Issues 2-Ch. Issues 2-Ch./res_man. 2-Ch.b-u.ac.Pg..Features of mazsola.hu/DATA/ research/tempus/disco.Features of Scheduling Algorithms –Task Assignment Approach – Load Balancing Approach – Load Sharing Approach.iit.cs.. 2-Ch.ppt http://www.381 – 398 Migration: Features.in/sde_book/distrib_computing. Code / Sub.ac.ppt http://www.pdf 41 Task Assignment Approach 2-Ch.iit./res_man.407 – 410 LCD/ cs.pdf 42 Load Balancing Approach .8.cs.b-u. Session Teaching No * Topics to be covered Ref Aids 37 Process Management: Process 2-Ch.351 – 355 mazsola.pdf 43 Load Balancing Approach .Pg.7.uni-miskolc.hu/DATA/ LCD research/tempus/disco/res_man.gsu.367 – 371 mazsola.Pg.ppt LCD http://www.ppt LCD http://www.html 39 Threads Implementation 2-Ch. Resource Management: Introduction.Pg.in/sde_book /distrib_computing.355 – 367 Algorithms mazsola.in/sde_book/distrib_computing.uni-miskolc.. Name: CS6601 / Distributed Systems Unit : V Unit Syllabus : PROCESS & RESOURCE MANAGEMENT Process Management: Process Migration: Features.ac.b-u.iit.7.hu/DATA Scheduling Algorithms /research/tempus/discom/.e-reading.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN ./res_man.pdf 45 Load Sharing Approach .7.. Implementation.iit.hu/DATA/ LCD research/tempus/disco.ac..04.iit.pdf Content beyond syllabus covered (if any): Fault-Tolerant Replication Management in Large-Scale Distributed Storage Systems * Session duration: 50 mins . Issues.Pg.edu/~xc10/ad-os/4.pdf 40 Resource Management: 2-Ch.ppt Demo http://grid.txstate. Mechanism www.php/143358/125/Tanenbaum_- _Distributed_operating_systems.uni-miskolc.edu/~mikhail/classes/aos.ac.ppt LCD No * http://vega..in/sde_book/distrib_computing.nl//~ast/books/mos2/sample-2.pdf 44 Load Sharing Approach.Threads: Models.367 – 371 mazsola.hu/DATA/ LCD research/tempus/disco.hu/DATA/ LCD research/tempus/disco.7.pdf 38 Threads: Models.Pg.kent.7.cs.Issues 2-Ch. Objective: To understand the issues involved in studying process and resource management.iit.8.cs. Mechanism .7.Pg.b-u.uni-miskolc.uni-miskolc.uni-miskolc.f03/l15migration . Nancy A Lynch. Course Outcome 4: Know more about the synchronization of distributed systems. 4. George Coulouris. FT/GN/68/00/21. Morgan Kaufman Publishers. Pradeep K Sinha..2016 28. Pearson Education. Pearson Education.THEORY Page 6 of 6 Sub Code / Sub Name: CS6601 / Distributed Systems Course Outcome 1: Challenges and Approaches in Distributed Systems. Course Outcome 3: Design of distributed file systems. Jean Dollimore and Tim Kindberg. Pearson Education.. Course Outcome 2: Apply network virtualization. “Distributed Algorithms”. 2007. 5. “Distributed Computing. REFERENCES: 2. USA. 2004. Van Steen M.2016 Remarks *: * If the same lesson plan is followed in the subsequent semester/year it should be mentioned and signed by the Faculty and the HOD .12. Understand the naming convention in distributed systems. Prentice Hall of India.S. Liu M.Gayathri Dr. B – Moderate. Tanenbaum A. Principles and Applications”.weak TEXT BOOK: 1.15 SRI VENKATESWARA COLLEGE OF ENGINEERING COURSE DELIVERY PLAN . "Distributed Operating Systems: Concepts and Design". Jayalumar Designation Assistant Professor/CS HoD/CS Date 28. Course Outcome 5: Knowledge about process migration and resource management systems. Apply remote method invocation and objects.L. “Distributed Systems: Principles and Paradigms”. 2007. Fifth Edition. “Distributed Systems Concepts and Design”.04. C.. C . Mapping CO – PO: PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 A A B C C B B CO2 B A A A A C C CO3 A A B A CO4 A A C C B CO5 A C A A – Strong . 3. Apply locks and concurrency control in distributed systems.12. 2012. 2003 Prepared by Approved by Signature Name R.
Copyright © 2024 DOKUMEN.SITE Inc.