Scribd
Upload
236 views

Distributed Computing 1

The document outlines the modules covered in the Distributed Computing elective course. Module 1 introduces distributed systems concepts. Module 2 covers distributed file systems including NFS, AFS, and CODA architectures. Module 3 discusses client-server and group communication, RPC, and distributed shared memory. Module 4 addresses resource and process management such as load balancing, scheduling, and process migration. Module 5 focuses on consistency maintenance through transactions, fault tolerance, and deadlock prevention.

Uploaded by

Athulya P Nair
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
236 views

Distributed Computing 1

The document outlines the modules covered in the Distributed Computing elective course. Module 1 introduces distributed systems concepts. Module 2 covers distributed file systems including NFS, AFS, and CODA architectures. Module 3 discusses client-server and group communication, RPC, and distributed shared memory. Module 4 addresses resource and process management such as load balancing, scheduling, and process migration. Module 5 focuses on consistency maintenance through transactions, fault tolerance, and deadlock prevention.

Uploaded by

Athulya P Nair
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

DISTRIBUTED COMPUTING (ELECTIVE - II) RT805-5 3+1+0 Module I Introduction Introduction to Distributed Systems, evolution, characteristics, design issues,

user requirements, Network technologies and protocols overview, MACH, AMOBEA- overview. Module 2 Distributed file system File service components, design issues, interfaces, implementation techniques, Sun Network File System architecture and implementation, other distributed file systems AFS, CODA. Name services SNS name service model. Module 3 Communication in distributed systems Client server communication, Group communication, Message passing features, synchronizations, RPC model, implementation, stub generation, messages, marshalling, Server management. Distributed shared memory Architecture, design issues, structure of shared memory space, replacement strategy, thrashing. Synchronization clock synchronization, event ordering, mutual exclusion Module 4 Resource and Process management Features of scheduling algorithms, Task assignment approach, load balancing, load sharing, Process migration mechanisms, Threads scheduling. Module 5 Consistency maintenance Transaction recovery methods- intention lists, Fault tolerance failures, Byzantine failures. Deadlocks in distributed systems detection and prevention, centralized and distributed approaches. References 1. Distributed Systems Concepts and designing - George Coulouris, Jean Dellimore, Tim Kindberg - Pearson Education Asia 2. Distributed Operating Systems - Andrew S. Tenenbaum Pearson Education Asia 3. Distributed Operating Systems - Concepts and design - Pradeep. K, Sinha, PHI

Questions

1)Explain cristian algorithm & Berkely algorithm for synchronizing physical clocks. 2)Explain coda and Andrew file system. 3)Explain about group communication and multicast communication in dc 4)Explain rpc mechanism 5)Explain distributed shared memory. 6)Explain distributed file system & implementation 7)Explain need of anme service and sns 8)Explain need of election algorithms and different algorithms. 9)Distributed mutual exclusion and algorithms to ensure this 10)Lamborts clock mechanism and vector logical clock Assignment===SUBMIT ON OR BEFORE 9TH April 2010 1-10 21-30 31=40 Sun NFS CODA DNS centralized and distributed approaches. 51-55 Transaction recovery methods- intention lists, Fault tolerance failures, Byzantine failures. 56-60 61-65 66-67 Process migration mechanisms, Threads scheduling. Task assignment approach, load balancing, load sharing Features of scheduling algorithms 11-20 AFS

41-50--- Deadlocks in distributed systems detection and prevention,

You might also like