Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
1K views

CS8603 Distributed System Model Question

This document is an exam for the course Distributed Systems. It covers key concepts related to distributed systems including requirements, challenges, interconnection networks, synchronization issues, global states, and clock algorithms. The exam is divided into three parts: Part A contains 25 short answer questions worth 2 marks each, Part B contains 6 long answer questions worth 13 marks each, and Part C contains 1 long question worth 15 marks involving analyzing a butterfly network diagram. The exam evaluates students on their ability to remember, understand, apply and analyze distributed systems concepts.

Uploaded by

Prasanna
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1K views

CS8603 Distributed System Model Question

This document is an exam for the course Distributed Systems. It covers key concepts related to distributed systems including requirements, challenges, interconnection networks, synchronization issues, global states, and clock algorithms. The exam is divided into three parts: Part A contains 25 short answer questions worth 2 marks each, Part B contains 6 long answer questions worth 13 marks each, and Part C contains 1 long question worth 15 marks involving analyzing a butterfly network diagram. The exam evaluates students on their ability to remember, understand, apply and analyze distributed systems concepts.

Uploaded by

Prasanna
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

MAILAM ENGINEERING COLLEGE

MAILAM – 604304.
(Approved by AICTE, New Delhi, Affiliated to Anna University Chennai &
Accredited by NBA & Tata Consultancy Services, Chennai)

Department of Computer Science & Engineering


ANNA UNIVERSITY INTERNAL ASSESSMENT-1
Sub/Code: CS8603/ DISTRIBUTED SYSTEMS Date :
Sem /Year: V / III Time : 3 HOURS
Class: III CSE A&B Marks: 100

CO1- To Elucidate the foundations and issues of distributed systems


CO2- To Understand the various synchronization issues and global state for
distributed systems.
CO3- To Understand the Mutual Exclusion and Deadlock detection algorithms in
distributed systems
CO4- To Describe the agreement protocols and fault tolerance mechanisms in
distributed systems.
CO5- To Describe the features of peer-to-peer and distributed shared memory
systems

K1 – Remember K2 – Understand K3 – Apply K4 – Analyze K5 – Evaluate.

PART–A (10 x 2 = 20)

1. What is meant distributed system? (CO1,K1)


2. List the distributed systems challenges? (CO1,K2)
3. List some of the requirements of distributed system? (CO1,K1)
4. What are the two popular interconnection networks? (CO2,K2)
5. Define Omega interconnection function? (CO1,K1)
6. Define Omega routing function? (CO2,K2)
7. Define Butterfly interconnection function? (CO1,K1)
8. What are Array processors of parallel computers? (CO1,K1)
9. Define Flynn’s taxonomy? (CO2,K2)
10. Examine this classification to understand the range of options used for configuring
systems? (CO2,K2)
11. What is the Concurrency of a program in distributed system? (CO1,K1)
12. What are the two ways of sending data when the Send primitive is invoked? (CO2,K2)
13. Definitions of Synchronous primitives & Asynchronous primitives? (CO2,K2)
14. What are the Distributed systems challenges from a system perspective? (CO1,K1)
15. What is A model of distributed executions? (CO1,K1)
16. What is the Causal precedence relation? (CO1,K1)
17. What are the Models of communication networks? (CO2,K2)
18. What is Global state of a distributes system? (CO2,K2)
19. Define consistent global states? (CO2,K2)
20. What is PAST and FUTURE in Cuts of a distributed computation? (CO2,K2)
21. Definition of Scalar time(CO2,K2)
22. What are the two rules R1 and R2 in Scalar time? (CO2,K2)
23. Definition of Vector time with notation? (CO2,K2)
24. What are the two rules R1 and R2 in Vector time? (CO2,K2)
25. Definitions and terminology for Time, Frequency, Offset, Skew and Drift (rate)?
(CO2,K2)
PART- B (5*13 = 65)
1. (a) Explain a typical and requirements of a distributed system? (CO1,K1) (13)
(OR)
(b) Explain the Characteristics of parallel systems with two popular interconnection
networks detail? (CO1,K1) (13)

2. (a) Explain in detail the multicomputer parallel systems? (CO1,K1) (13)


(OR)
(b) Explain in detail Flynn’s taxonomy processing modes? (CO2,K2) (13)

3. (a) Explain in detail Coupling, parallelism, concurrency, and granularity Coupling?


(CO2,K2) (13)
(OR)
(b) Explain four versions of the Send primitive in Blocking/non-blocking,
synchronous/asynchronous primitives for distributed communication? (CO2,K2) (13)

4. (a) Explain in detail Blocking/non-blocking, synchronous/asynchronous primitives for


distributed communication? (CO2,K2) (13)
(OR)
(b) Explain in details the Design issues, Algorithmic and Applications of distributed
computing and newer challenges Distributed computing systems ? (CO1,K1)(13)

5. (a) Explain in detail distributed program and model of distributed executions?


(CO1,K1)(13)
(OR)
(b) (i)Explain in detail the global state of a distributed system? (CO2,K2)(6)
(ii)Explain in detail the Cuts of a distributed computation? (CO2,K2)(7)

6. (a) (i) Explain the framework and Implementing of logical clocks system? (CO2,K2)(6)
(ii) Explain in detail the in Scalar time representation in distributed system?
(CO2,K2)(7)
(OR)
(b) (i) Explain in detail the vector clocks in distributed system? (CO2,K2)(6)
(ii) Write a brief notes on Physical clock synchronization: NTP (Network Time
Protocol)? (CO2,K2)(7)
PART – C ( 1* 15 =15)

1. Consider the Butterfly network in Figure below , n = 8 and M = 4. There are three
stages, s = 0_ 1_ 2, and the interconnection pattern is defined between s = 0 and s =
1 and between s = 1 and s = 2. The switch number x varies from 0 to 3 in each
stage, i.e., x is a 2-bit string. ? (CO2,K4)(15)

PREPARED BY
(S.PRASANNA,Asso/Professor)
*********ALL THE BEST*********

You might also like