VIII Semester B.E. (CSE/ISE) Degree Examination, June/July 2015 (Y2K11 Scheme) CI 82 : DISTRIBUTED OPERATING SYSTEM Time : 3 Hours
Max. Marks : 100
Instruction : Answer any five full questions selecting at least two from each part. PART A 1. a) Describe the design approaches of an operating system in detail. b) Explain RPC with its semantics. 2. a) Explain briefly how the messages are causally ordered in Birman-SchipperStephenson protocol.
10 10 10
b) Describe the Huangs termination detection algorithm with the proof of correctness.
10
3. a) Discuss how Mackawas algorithm differs from other algorithms and what problem it poses.
10
b) Explain Suzuki-Kasamis broadcast algorithm for distributed mutual exclusion. 10 4. a) Explain Chandy-Misra-Haas edge chasing algorithm with an example. b) Explain the Dolev et al. algorithm for reaching Byzantine Agreement.
10 10
PART B 5. a) Discuss symmetrically initiated algorithms with its merits and demerits. b) Explain the load sharing policies in V-system and sprite. 6. a) Briefly explain the static voting (Gifford) Protocol with an example. b) Explain briefly the majority based dynamic voting protocol with an example. 7. a) What is a data base operating system ? Explain the requirements of a database operating system in detail.
10 10 10 10 10
b) Discuss the access matrix model and its implementation. How do you ensure safety in access matrix model ? 10 8. a) Explain conservative Time stamp ordering algorithm in detail.
10
b) Discuss the Kung-Robinson algorithm for concurrency control for optimization. 10 _______________________
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. DISTRIBUTED ...
IJRIT International Journal of Research in Information Technology, Volume 1, ... control unifies the different computers into a single integrated compute and ... resources, connections between these processes, and mappings of events ... of excellent
Examples are given to illustrate these methods for avoiding file .... of files, such communications are never required to handle processes using only local files.
In computer science, deadlock refers to a specific condition two or more processes ... Keywords: deadlocks, distributed operating systems, deadlock handling ...
and by the INRIA project GANG. Also supported by a France-Israel cooperation grant (âMutli-Computingâ project) from the France Ministry of Science and Israel ...
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Distributed ...
Advances in communications technology, development of powerful desktop workstations, and increased user demands for sophisticated applications are rapidly changing computing from a traditional centralized model to a distributed one. The tools and ser
the roles of creator and audience that underpins the. model of distributed creativity that we propose. Specifically, we believe that free association of ideas as.
Random walks play a central role in computer science, spanning a wide range of areas in ..... u uniformly at random and forwards C to u after incrementing the counter on the coupon to i. ...... IEEE Computer Society, Washington, DC, 218â223.
Nov 16, 2012 - tum circuit to a distributed quantum computer in which each ... Additionally, we prove that this is the best you can do; a 1D nearest neighbour machine .... Of course there is a price to pay: the overhead depends on the topology ...
To lookup to the definition of view and translate the definition into an equivalent request against the source table of view and then perform that request is known as view resolution. â¢View materialization. Stores the view as a temporary table in a
Nov 16, 2012 - 3Dept. of Computer Science & Engineering, University of Washington, .... fixed low-degree graph (see Tab. 2 ... With degree O(log N) the over-.
Jan 21, 2016 - prosperous system by reading this soft file of the Operating System: Operating System For Beginners ... What do you think of our concept here?
examines a generic contract host, able to host this contract and others. Together .... In the browser, every frame of a web page has its own event loop, which is used both ..... To explain how it works, it is best to start with how it is used. ... In
Jul 1, 2017 - (I) Routine maintenance, repair, or replacement; ...... The Administrator of EPA determines, for certain classes or ...... Transmission of Information to the Administrator. (i) ...... Automatic oiling operations (e.g., oiler on chains).
Jul 1, 2017 - Division, 1200-03, and the Board approved control strategy. (d) Construction ..... to undertake a program of actual construction of the source to be completed within ... smaller than the area of impact of any major stationary source or
d) What are system calls ? List any four system calls. 4. 2. a) What is a process ? Explain the life cycle of a process. 6. b) Define critical section problem. 4.
Mar 5, 2001 - business to science â customers who did a lot of mathematical calculations as well as those who did .... Some of these ideas included ... Control Protocol/Internet Protocol) started to become widely used especially in military.
Page 2 of 4. SARDAR AZEEM PICT(2 | P a g e ) 03135879331. Pre pared by: Sardar Azeem(MBA(B&F) Computer HW And Network Engineer: Pict. Computer Center Link Road Abbottabad. Email: [email protected]/Website:www.pictcomputeratd.com. What is an Ope
Maximum claim table Current allocation table. 10) a) Explain the process management of LINUX operating system. 6. b) Explain I/O in LINUX. 6. 11) Discuss in ...
Mar 5, 2001 - Throughout the history of computers, the operating system has continually ... charged for all of the resources whether or not the job used these resources. ... application, including the highly detailed machine level input/output .... m
![[O973.Ebook] Ebook Operating System: Operating ...](https://p.pdfkul.com/img/300x300/o973ebook-ebook-operating-system-operating-_5a1b4ec91723ddf2f43ac1a9.jpg)
