Discuss distributed file system caching, Operating System

Assignment Help:

Problem:

(a) Discuss Distributed File System Caching.

(Your discussion should include the goal and architecture of distributed file system caching and the various possible caching locations together with their corresponding advantages and disadvantages).

(b) (i) In relation to Lamport's logical clock discuss:

? Happened Before Relation.
? Concurrent event.

(ii) Discuss how the Happen Before Relation is implemented using timestamps.

(c) (i) Briefly describe Christian's and Berkeley's physical clock synchronisation algorithms.

(ii) Are externally synchronised clocks also internally synchronised? What about the converse? Explain your answers


Related Discussions:- Discuss distributed file system caching

Micro operation, Ask question maxmum words accepted#

Ask question maxmum words accepted#

System call, how the system call is work?

how the system call is work?

What is a multiprocessing system, What is a multiprocessing system? Mul...

What is a multiprocessing system? Multiprocessor systems are those systems that use additional than a single processor for program execution. It is done for raising the executi

Is data in a file access sequentially or randomly, Q. Give an instance of ...

Q. Give an instance of an application in which data in a file should be accessed in the following order: a. Sequentially b. Randomly Answer: a. Print the content of

Pstree, Construct a process tree similar to Figure 1. Look up the Linux com...

Construct a process tree similar to Figure 1. Look up the Linux command pstree -p and describe what it does. Then type in the command the capture the output.

Describe the three levels of data abstraction, There are three kinds of D...

There are three kinds of Data Abstraction: Physical level: The minimum level of abstraction defines how data are saved. Logical level: The next bigger level of a

Define virtual memory, Define Virtual memory Virtual memory is employe...

Define Virtual memory Virtual memory is employed in all major commercial operating systems

Dynamic memory management, Usually memory is allocated from a large pool of...

Usually memory is allocated from a large pool of unused memory area called the heap. In C++, dynamic allocation/deallocation must be manually performed using commands like malloc,

Paging, Paging full question

Paging full question

Explain wait for graph, Explain Wait for Graph a. Use a resource alloca...

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd