VALLIAMMAI ENGINEERING COLLEGE

SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF

COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

VI SEMESTER

CS 6601- DISTRIBUTED SYSTEMS

Regulation – 2013

Academic Year 2018 – 19

(Even Semester)

Prepared by

Dr. B.Muthusenthil, Associate Professor/CSE

Mr. G.Kumaresan, Assistant Professor(SG)/CSE

Ms. S.Suma, Assistant Professor(SG)/CSE

 VALLIAMMAI ENGINEERING COLLEGE
SRM Nagar, Kattankulathur – 603 203.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

SUBJECT :CS 6601DistributedSystems

SEM / YEAR: VI / III

UNIT I - INTRODUCTION TO DISTRIBUTED SYSTEMS

SYLLABUS- Introduction – Examples of Distributed Systems–Trends in Distributed Systems – Focus on
resource sharing – Challenges. Case study: World Wide Web.
PART – A
Q. No Questions BT Level Competence

1. Write down the principles of distributed systems. BTL 1 Remember

2. What are the services and examples of Middleware? BTL 1 Remember
3. Measure the consequences faced by the designers in developing
BTL 5 Evaluate
distributed systems.
4. What are the limitations of Distributed System? BTL 1 Remember
5 Show where Distributed System is applied. BTL 3 Apply
6 Estimate how distributed system benefits resource sharing. BTL 2 Understand
7 Describe the main idea of Distributed Systems. BTL 2 Understand
8 Compare Centralized and Distributed System. BTL 4 Analyze
9 Discuss the design issues in Intranet. BTL 2 Understand
10 Summarize the objectives of resource sharing model. BTL 2 Understand
11 Generalize on Heterogeneity. BTL 6 Create
12 List any two resources of hardware and software which can be
BTL 1 Remember
shared in distributed systems with example.
13 Analyze briefly on Ubiquitous computing. BTL 4 Analyze
14 Show how distributed System helps cloud computing. BTL 3 Apply
15 Illustrate five reasons why to build distributed System. BTL 3 Apply
16 Define transparency. What are its types? BTL 1 Remember
Develop the scenario how might the clocks in two computers that
17 are linked by a local network be synchronized without reference to BTL 6 Create
an external time source.
18 Rank the advantages and disadvantages of HTML, URLs and HTTP
BTL5 Evaluate
as core technologies for information browsing?
19 Classify the security challenges faced by the distributed systems. BTL 4 Analyze
20 What is the need of openness in distributed system? BTL 1 Remember
PART – B
Design in detail any two application domain where distributed
1. system is applied. (13)
BTL 6 Create

i) Explain the challenges in developing a Distributed system. (7)

2. ii) How distributed system overcomes it.(6)
BTL 4 Analyze
 i)Elucidiate the trends in distributed system. (7)
3. ii) What factors affect the responsiveness of an application that BTL 5 Evaluate
accesses shared data managed by a server? (6)
Write a brief note on which of the challenges of distributed systems
4. (13)
BTL 1 Remember

i) Describe how will you compare and contrast cloud computing

with more traditional client-server computing? (7)
5. ii) What do you mean by novel about cloud computing as
BTL 2 Understand
aconcept?(6)
Consider a distributed system environment of the prevailing WWW
6. and illustrate the challenges meeting out sharing of resources.(13)
BTL 3 Apply

i)List the three main software components that may fail when a
client process invokes a method in a server object, Describe by Remember
7. giving an example of a failure in each case. (7) BTL 1
ii) Suggest how the components can be made to tolerate one
another’s failures.(6)
i)Summarize in detail about resource sharing and the challenges
involved in it. (7)
8. ii)Discuss the types of local resource that are vulnerable to an attack BTL 2 Understand
by an untrusted program that is downloaded from a remote site and
run in a local computer. (6)
i) Label an example of a HTTP URL. List the main components of
an HTTP URL, describing how their boundaries are denoted and
9. illustrating each one from your example. (7)
BTL 1 Remember
ii) To what extent is an HTTP URL location-transparent? (6)
i) Examine distributed system and discover the characteristics of BTL 3 Apply
10. Distributed system. (7)
ii) Demonstrate how distributed computing is used as an utility.(6)
i) Explain the fundamental models considered in design of DS.(7)
11. ii) Identify how resource sharing is done in distributed System.(6) BTL 1 Remember
i) Point out in detail the recent trends in distributed Systems. (6) BTL 4
12. ii) What are the design issues to be considered in designing Analyze
distributed system? Explain in detail about each of them. (7)
i) Summarize World Wide Web as an example to illustrate the
13. concept of resource sharing client and server (7) BTL 2 Understand
ii) Describe the examples of Distributed Systems. (6)
Discuss the need of Distributed systems its characteristics with
14. example.(7) BTL 4 Analyze
Describe interprocess communication in details (6)
PART – C (15 MARKS)
A user arrives at a railway station that she has never visited before,
carrying a PDA that is capable of wireless networking. Suggest how
1 the user could be provided with information about the local services BTL 4 Analyze
and amenities at that station, without entering the station’s name or
attributes. What technical challenges must be overcome? Discuss in
detail
 Develop the different distributed processes that take place in the
following order:
2 a) A client sends a request for required HTML page to web server. BTL 6 Create
b) The server analyses the request and sends back an
acknowledgement to client along with HTML process required to
handle the page.
Design your own intranet setup, which is connected with 50 nodes to
handle a minimum 50 users. Focus on local security policies and the
3 BTL 6 Create
required resource configurations to be added to enable it work on
different applications like sending e-mail or taking a printout from a
remote network
A server program written in one language(for example C++) provides
the implementation of a BLOB object that is intended to be accessed
by clients that may be written in a different language(for example
4 Java). The client and server computers may have different hardware BTL 5 Evaluate
but all of them are attached to an internet. Explain the problems due
to each of the five aspects of heterogeneity that need to be solved to
make it possible for a client object to invoke a method on the server
object.

UNIT II - COMMUNICATION IN DISTRIBUTED SYSTEM

SYLLABUS- System Model – Inter process Communication – the API for internet protocols – External data
representation and Multicast communication. Network virtualization: Overlay networks. Case study: MPI
Remote Method Invocation And Objects: Remote Invocation – Introduction – Request-reply protocols –
Remote procedure call – Remote method invocation. Case study: Java RMI – Group communication –
Publish-subscribe systems – Message queues – Shared memory approaches -Distributed objects – Case study:
Enterprise Java Beans -from objects to components
PART –A
Q.No Questions BT Level Competence
1. Define Inter process Communication. BTL 1 Remember
2. Classify thegenerations of distributed system. BTL 4 Analyze
3. Classify the issues in the design of RPC. BTL 4 Analyze
4. Explain shared memory Approach. BTL 5 Evaluate
5. Define network virtualization. BTL 1 Remember
6. Discuss the design issues of RMI. BTL 2 Understand
7. Design the roles and responsibilities of distributed systems. BTL 6 Create
8. What are the characteristics of multicast communication? BTL 1 Remember
9. Differentiate marshalling and unmarshalling. BTL 2 Understand
10. Illustratethe two significant factors affecting interacting process in a
BTL 3 Apply
distributed system.
11. Where remote object reference is applied? BTL 3 Apply
12. Evaluate on overlay networks. BTL 5 Evaluate
13. Formulate why there is no explicit data typing in CORBA. CDR? BTL 6 Create
14. Classify the main arguments for adopting a super node approach in
BTL 4 Analyze
Skype.
15. Give the advantages of overlay networks. BTL 2 Understand
16. What is the role of proxy servers and mobile code? BTL 1 Remember
17. Distinguish persistent and non-persistent connections. BTL 2 Understand
18. What are the request reply protocols? BTL 1 Remember
19. List the three types of Communication paradigms. BTL 1 Remember
20. Show how you will make use of message queues. BTL 3 Apply
PART - B
i)Designa communication system between Distributed Objects?(7)
1. ii)Explain with the case study Enterprise Java Beans. (6) BTL 6 Create

i)What is RMI? How it is implemented? Write notes on JAVARMI.

(6)
2. BTL 1 Remember
ii) What is meant by Publish-subscribe systems? Write short notes on
it.(7)
i)DescribeWith a neat sketch explain remote procedure call. (7) BTL 2
3. ii) Describe explain about group communication. (6). Understand
4. Illustrate various types ofsystem models in distributed systems.(13) BTL 3 Apply
i)What is the purpose of external data representation andmarshalling?
5. (7) BTL 1 Remember
ii) Examine about Multicast communication.(6)
Explain in detail about Middleware layers and Inter process BTL 4
6. Analyze
Communication.(13)
Measure the need of the following in detail
7. i) UDP datagram communication.(7) BTL 5 Evaluate
ii) TCP stream communication.(6)
Summarize on the steps in RPC architecture with the functionality of BTL 2
8. Understand
its components.(13)

i)Defineand explain the parts of a distributed object model.(7). BTL 1

9. Remember
ii) What are the types of overlay networks? Explain in detail. (13)
i) Examine about the use of request reply protocol. (6) BTL 3
10. ii) Show how message queues are useful? Explain in brief. (7) Apply

i)Explain shared memory and its approaches with example.(7)

11. Analyze
ii) Point out the details on from objects to components.(6) BTL 4
i)Analyze in detail about Message Passing Interface (MPI).(7) BTL 4
12. Analyze
ii) Give a note on characteristics of group communication.(6)
i) Discuss in detail the physical & architectural model with
necessary diagrams.(7) BTL 2
13. ii) Describe on the fundamental models with example and diagrams. Understand
(6)
14. Describe any two indirect communication techniques in detail.(13) BTL 1 Remember
PART-C
Design a distributed UNIX OS network consisting of ‘n’ nodes and
connected to ‘m’ different oracle databases. Mention the possible
1 BTL 6 Create
challenges to be met when multiple users try to access ‘m’ databases
within a specified time interval ‘t’
User ‘A’ in Delhi wishes to send a file for printing to user ‘B’ in
Florida, whose system is connected to a printer; while user ‘C’ from
2 Tokyo wants to save a video file in the hard disk of user ‘D’ in BTL 4 Analyze
London. Analyze and discuss the required peer-to-peer network
architecture.
 Consider two communication services for use in asynchronous
distributed systems. In service A, messages may be lost, duplicated or
delayed and checksums apply only to headers. In service B, messages
may be lost, delayed or delivered too fast for the recipient to handle
3 them, but those that are delivered arrive with the correct contents. BTL 5 Evaluate
Explain the classes of failure exhibited by each service. Classify their
failures according to their effect on the properties of validity and
integrity. Can service B be described as a reliable communication
service?
Consider a pair of processes X and Y that use the communication
service B (messages may be lost, delayed or delivered too fast for the
recipient to handle them, but those that are delivered arrive with the
correct contents) to communicate with one another. Suppose that X is
4 BTL 5 Evaluate
a Client and Y a server and that an invocation consists of a request
message from X to Y, followed by Y carrying out the request,
followed by a reply message from Y to X. Explain the classes of
failure that may be exhibited by an invocation.

UNIT III - PEER TO PEER SERVICES AND FILE SYSTEM

SYLLABUS- Peer-to-peer Systems – Introduction – Napster and its legacy – Peer-to-peer – Middleware –
Routing overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systems –Introduction – File
service architecture – Andrew File system. File System: Features-File model -File accessing models – File
sharing semantics Naming: Identifiers, Addresses, Name Resolution – Name Space Implementation – Name
Caches – LDAP.
PART - A
Q.No Questions BT Level Competence
1. What are the main tasks of routing overlay? BTL 1 Remember
2 Classify the characteristics of peer to peer system. BTL 4 Analyze
3 Discuss how IP and overlay routing for peer-to-peer applications BTL 2 Understand
differ from each other.
Classify the functional and non-functional requirements of peer
4 BTL 4 Analyze
to peer middle ware systems.
5 Illustrate what is the use of routing overlay? BTL 3 Apply
6 Define pastry. BTL 1 Remember
7 Differentiate structured and unstructured peer-to-peer systems. BTL 2 Understand
8 Classify the file accessing models. BTL 4 Analyze
9 Express in diagram the file attributes record structure. BTL 2 Understand
10 What are the advantages in using name caches in file systems? BTL 1 Remember
11 Explain the working of Andrew file system. BTL 5 Evaluate
12 What do you mean by cache consistency? BTL 1 Remember
13 Give the different forms of transparency in file services. BTL 2 Understand
What data must the NFS client module hold on behalf of each
14 BTL 1 Remember
user-level process?
Develop How does AFS deal with the risk that callback
15 BTL 6 Create
messages may be lost?
16 Definenaming and locality facility. BTL 1 Remember
17 Apply how will you make use of name space and DNS? BTL 3 Apply
18 Formulate how caching helps a name service’s availability? BTL 6 Create
19 Explain on LDAP. BTL 5 Evaluate
20 Demonstrate the use of name cache. BTL 3 Apply
 PART – B
i) Give the functional and non-functional requirements of peer-to
1. –peer middleware. (7) BTL 1 Remember
ii) What is meant by Napster legacy? Explain. (6)
i). Explain about file system access model and its sharing
2 semantics. (7) BTL 5 Evaluate
ii) Explain on Peer to Peer middleware systems. (6)
Illustrate with a case study explain about the application of
3 distributed algorithm routing overlays.(Tapestry).(13) BTL 3 Apply
Analyze in detail about distributed file system, its characteristics
4 BTL 4 Analyze
and requirements. (13)
i) Describe the working of File service architecture. (7)
5 ii) Summarize the purpose of Andrew File system.(6) BTL 2 Understand

i) Examine about the function of file Service Architecture with

neat diagram.(7)
6 ii) Discuss the mounting issues of remote file system on NFS BTL 1 Remember
Client.(6)
i) Summarize in detail about naming in file systems.(7)
7 BTL 4 Analyze
ii) Discuss about the Pastry Routing algorithms in detail.(6)
Formulate the design and implementation of name services and
8 Domain Name services. (13) BTL 6 Create

Describe the architecture and server operation of NFS in detail.

9 BTL 2 Apply
(13)
i)Conclude in brief about LDAP. (7)
10 BTL 4 Analyze
ii) Summarize the name space implementation in brief.(6)
i) Briefly describe about the file accessing models in distributed
environment (7)
11 ii) List the different approaches to implement the Name Caches BTL 1 Remember
and explain them briefly. (6)
Define and explain the following:
i) Clocks(3)
12 ii) clock skew(3) BTL 1 Remember
iii) Co-ordinate universal time(3)
iv) Distributed mutual exclusion.(4)
(i) Express with neat sketch and explain Routing Overlays in
detail.(7)
13 BTL 2 Understand
ii) Explain in detail routing overlay employed in Ocean store
storage system.(6)
i) Discuss on file sharing semantics with necessary examples.(7)
14 ii) Discuss the benefits of overlays routing over traditional BTL 3 Understand
multitoning and intelligent routing.(6)
PART-C
Summarize the “fault tolerant” issues for a “routing overlay”
1 system, when a node cannot access an object during routing BTL 5 Evaluate
requests.
 Generalize how using the secure hash of an object to identify
and route messages to it ensures that it is tamper-proof. What
2 properties are required of the hash function? How can integrity BTL 6 Create
be maintained, even if a substantial proportion of peer nodes are
subverted?
Analyse where and when a situation arises in which the name
space resolution fails?
3 BTL 4 Analyze
Give possible suggestions to avoid name space resolution
failure?
Explain the different DNS navigation schemes and
4 comparatively analyze which method is advantageous in real- BTL 5 Evaluate
time distributed networking scenario.

UNIT IV - SYNCHRONIZATION AND REPLICATION

SYLLABUS- Introduction – Clocks, events and process states – Synchronizing physical clocks- Logical time
and logical clocks – Global states – Coordination and Agreement – Introduction – Distributed mutual
exclusion – Elections – Transactions and Concurrency Control– Transactions -Nested transactions – Locks –
Optimistic concurrency control – Timestamp ordering – Atomic Commit protocols -Distributed deadlocks –
Replication – Case study – Coda.
PART – A
Q.No Questions BT Level Competence
1. Definethe terms: clock screw and clock drift rate. BTL 1 Remember
2 Describe How will you synchronize physical clock? BTL 2 Understand
3 What is meant by “Happened Before relationship”? BTL 1 Remember
Point out thereasonwhycomputer clock synchronization is
4 BTL 4 Analyze
necessary.
5 Define distributed mutual exclusion. BTL 1 Remember
6 Differentiate physical clock and logical clock. BTL 2 Understand
7 Howwillyou assess a consensus problem ? BTL 5 Evaluate
8 Give the use of nested transaction. BTL 2 Understand
9 Formulate the ACID properties. BTL 6 Create
10 Illustrate what is concurrency control? Give its use. BTL 3 Apply
Showhow will you make use of nested transaction? Point out its
11 BTL 4 Analyze
rules?
12 Mention some motivation for replication. BTL 1 Remember
Discuss what are the advantages and drawbacks of multi version
13 timestamp ordering in comparison with ordinary timestamp BTL 2 Understand
ordering?
What data must the NFS client module hold on behalf of each
14 BTL 1 Remember
user-level process?
Explain how does AFS deal with the risk that call back messages
15 BTL 4 Analyze
may be lost?
16 Define consistent cut. BTL 1 Remember
17 Explain the rules to abort the nested transaction. BTL 3 Apply
18 Formulate the techniques used to synchronize clock? BTL 6 Create
19 Explain the types of messages in Bully algorithm. BTL 5 Evaluate
20 Illustrate Physical clock and Logical clock. BTL 3 Apply
PART - B
i) Describe in detail about cristian’s and Berkley algorithm for
1. synchronizing clocks.(7) BTL 1 Remember
ii) Examine Briefly about global states. (6)
Distinguish and examine the process of active and passive
2 BTL 4 Analyze
replication model.(13)
Summarize on
3 i) Rickart and Agarwala’s Algorithm(7) BTL 2 Understand
ii) Maekawa’s Voting Algorithm(6)

4 Design Flat transaction and nested transaction with example.(13) BTL 6 Create

i)Explain detail about two phase commit protocol.(7) BTL 4

5 Analyze
ii) Examine on atomic commit protocol. (6)

i) What is the goal of an election algorithm? Explain it detail.(7)

6 ii) Examine how mutual exclusion is handled in distributed BTL 1 Remember
system. (6)

i) Summarize the internal and external synchronization of

Physical clocks.(7)
7 BTL 2 Understand
ii) Give the Chandy and Lamports snapshot algorithm for
determining the global states of distributed systems. (6)
i) Why do we go for optimistic concurrency control?
Demonstrate in detail.(7)
8 BTL 3 Apply
ii) Illustrate the importance of nested transaction with an
example.(6)
i) Discuss in detail about one phase and two phase atomic
9 commit protocol (flat and hierarchical).(7) BTL 1 Remember
ii) Examine replication in detail.(6)
i) Discuss the use of NTP in detail.(6)
ii) Discuss that Byzantine agreement can be reached for three
10 BTL 2 Understand
generals, with one of them faulty, if the generals digitally sign
their messages.(7)
i) Examine a solution to reliable, totally ordered multicast in a
synchronous system, using a reliable multicast and a solution to
the consensus problem.(7)
11 BTL 3 Apply
ii)Illustrate an example execution of the ring-based algorithm to
show that processes are not necessarily granted entry to the
critical section in happened-before order.(6)
i) Summarize in detail about CODA(6).
12 ii Describe the distributed mutual exclusion algorithms that uses BTL 5 Evaluate
multicast and logical clocks.(7)
i)Describe with case study, explain the concept of distributed
13 dead locks. (7) BTL 1 Remember
ii) Examine Briefly about optimistic concurrency control. (6)
 i)Explain distributed mutual exclusion with suitable
14 algorithm.(7) BTL 4 Analyze
ii) Analyze on any three election algorithms. Use appropriate
diagrams for these algorithms.(6)
PART-C
A client attempts to synchronize with a time server. It records the
round-trip times and timestamps returned by the server in the
table below
Round-trip(ms) Time (hr:min:sec)
22 10:54:23:674
25 10:54:25:450
1 BTL 5 Evaluate
20 10:54:28:342
Which of these times should it use to set its clock? To what time
should it set it? Evaluate the accuracy of the setting with respect
to the server’s clock. If it is known that the time between sending
and receiving a message in the system concerned is at least 8ms,
do your answers change?
Jones is running a collection of processes p1,p2,…,pN. Each
process pi contains a variable vi . She wishes to determine
whether all the variables v1,v2,…., vN were vN equal in the
course of the execution.
i) Jones’s processes run in a synchronous system. She uses
a monitor process to determine whether the variables were
2 BTL 5 Evaluate
ever equal. When should the application processes
communicate with monitor process, and what should their
messages contain?
ii) Explain the statement possibly (v1=v2=….=vN). How
can Jones determine whether this statement is true of her
execution?
Explain how the time-stamp approach helps in overcoming the
3 lost-update problem. Prepare a modified algorithm and explain BTL 6 Create
how the inconsistencies are removed

Explain an optimal scenario which can help in avoiding the

deadlock situation. Illustrate your answer with respect to a
scenario where the following transaction T, U, V are defined for
objects a1,a2,….., ai, ….. , an. The server provides there
operations for its clients such that
Read (i) returns the value of ai
Write(i) writes the value of ai
Commit commits the operation
4 Tabulate the wait-for-graph for adding and removing edges for BTL 4 Analyze
transactions T, U, V such that T and V both are waiting to obtain
read locks when U releases its read lock on ai. Similarly V waits
for obtaining write lock only when U releases its write lock on ai.
Illustrate your answer for the following actions:
T: x= read(i) and write(i, 45);
U: x=read(j,66) and write (i,45)
V: x= read(j,45) and write(i, 66)
In which initial values of ai and aj are 10 and 20
 UNIT V - PROCESS & RESOURCE MANAGEMENT
SYLLABUS- Process Management: Process Migration: Features, Mechanism – Threads: Models, Issues,
Implementation. Resource Management: Introduction- Features of Scheduling Algorithms –Task
Assignment Approach – Load Balancing Approach – Load Sharing Approach.
PART – A
Q.No Questions BT Level Competence
1. Define Process Migration. BTL 1 Remember
2 Classify the desirable features of good process migration BTL 3 Apply
mechanism.
3 What are the advantages of process migration? BTL 1 Remember
4 Define thread and its model. BTL 1 Remember
5 Listthe uses of threads. BTL 1 Remember
6 What are the sub activities involved in process migration? BTL 1 Remember
Design how process migration be done in heterogeneous
7 BTL 6 Create
system?
8 List the desirable features of global scheduling algorithm. BTL 1 Remember
9 Analyzethe goals to achieve on optimal assignment. BTL 4 Analyze
10 Explain how thread scheduling is classified? BTL 4 Analyze
11 Distinguish static versus dynamic load balancing algorithm. BTL 2 Understand
12 Measure the issues in designing the load balancing algorithm. BTL 5 Evaluate
13 Assess thread operations are the most significant in cost. BTL 5 Evaluate
Give the techniques and methodologies for scheduling process
14 BTL 2 Understand
of a distributed system.
15 Show the use of task assignment approach. BTL 3 Apply
16 Discuss the goals achieved by task assignment approach. BTL 2 Understand
17 Point out the priority assignment policies. BTL 4 Analyze
18 Show how load estimation policies are utilized? BTL 3 Apply
19 Discuss the migration limiting policies. BTL 2 Understand
20 Generalize star information exchange policies. BTL 6 Create
PART - B
1. Describethe implementation of process migration with an
BTL 1 Remember
example. (13)
2 i)Explain all multithreading models and thread issues.(7)
BTL 5 Evaluate
ii) Evaluate on the mechanism used in process migration. (6)
3 Tabulate the comparison of various load balancing approaches
BTL 4 Analyze
used in distributed environment. (13)
i) Illustrate in detail about threads and its process. (6)
4 ii) Illustrate the issues related to thread programming, thread BTL 3 Apply
life time and thread synchronization.(7)
5 i) Discuss on Task Assignment, Load Balancing and Sharing
approach in detail.(7) Create
ii) Formulate the issues involved in designing a thread BTL 6
package.(6)
6 Describe briefly introduce the Resource management
BTL 2 Understand
techniques and mechanism. (13)
 i) Point out what are the desirable features of scheduling
7 algorithm? (6) BTL 4
Analyze
ii) Infer how will you find an optimal assignment? Explain
with example.(7)
8 Discuss the purpose of task assignment approach. (13) BTL 2 Understand
i) Describe about the Load Balancing approach in detail. (6)
9 ii) Give the techniques and methodologies for scheduling BTL 1 Remember
process of a distributed system.(7)
10 Summarize in detail how the load is being shared among the
BTL 2 Understand
resources. (13)
11 Illustrate the features and mechanisms of Process Migration
BTL 3 Apply
with suitable example.(13)
12 Examine the load balancing approach of resource management
in detail.(13) BTL 1 Remember
i) Analyze the thread models and the issues in thread
13 implementation with diagrams.(7) BTL 4 Analyze
ii) Point out the features of Process migration.(6)
i) Write short notes on load sharing (6)
14 ii)Describe any one algorithm of load sharing to manage BTL 1 Remember
resources. (7)
PART C
A file server uses caching and achieves a hit rate of 80%. File
operation in the server over 5ms of CPU time when the server
finds the requested block in the cache, and take an additional
15ms of disk I/O time otherwise. Point out any assumptions
1 BTL 4 Analyze
you make, estimate the server’s throughput capacity (average
requests/sec) if it is:
i) Single threaded
ii) Two-threaded, running on a single processor
iii) Two-threaded, running on a two-processor computer
2 Compare the worker pool multi-threading architecture with the BTL 5 Evaluate
thread-per-request architecture
Suppose you have to design a scheduling algorithm based on
the task assignment approach for scheduling the tasks of
3 processes to be processed in a distributed system. What types of BTL 6 Create
cost information would you like to have for the tasks of a
process? Explain methods that may be used to make a rough
estimate of these costs.
Explain the practical applicability of the load –balancing
approach as a scheduling scheme for the following types of
distributed systems:
4 a) A LAN-based distributed system BTL 5 Evaluate
b) A WAN-based distributed system
c) A distributed system based on the processor-pool model
d) A distributed system based on the workstation-server
model