Explain acyclic graph directories and its implementation, Operating System

Assignment Help:

Acyclic Graph Directories

In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excludes the sharing of files or directories. An acyclic graph namely a graph with no cycles allows directories to share subdirectories and files. The acyclic graph is a usual generalization of the tree structured directory scheme. It is more flexible in comparison of a simple tree, but it is as well more complex.

A directory or shared file isn't the same as two copies of the same file or directory. With two copies if one copy is changed subsequently the changes will not be reflected in the other copy. With a shared file, the alterations made by one person are immediately visible to the other. Sharing is a significant concept for subdirectories. A fresh file created by one person will automatically come into view in all the shared subdirectories.

Implementation:       

Directories and Shared files can be executed by creating a new directory entry called link which points to another subdirectory or file. When a reference to a file is made then the directory is searched. If the directory entry is marked like a link after that the name of the real file is included in the link information. The link is resolve by using the path name to locate the real file.

Another method is to copy (duplicate) all information about shared files in both the sharing directories.

 

2270_Acyclic Graph Directories.png

 

                                                                                  Acyclic Graph directory structure


Related Discussions:- Explain acyclic graph directories and its implementation

What is process migration, Question: (a) Describe blocking and non-bloc...

Question: (a) Describe blocking and non-blocking types of inter-process communication. What is easier to implement and why? Discuss their relative advantages and disadvantage

Which algorithm makes the most efficient use of memory, Question : (a) ...

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

When page fault frequency in an operating system is reduced, When the Page ...

When the Page fault frequency in an operating system is reduced Locality of reference is appropriate to the process

What is the kernel, What is the kernel? A more common explanation is th...

What is the kernel? A more common explanation is that the OS is the one program running at all times on the computer  usually known as the kernel, with all else being applicati

Locks - mutexes, Locks (also known as mutexes, short for mutual exclusion l...

Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi

Explain the advantage of assembly language, Explain the Advantage of Assemb...

Explain the Advantage of Assembly Language The advantages of assembly language program is: a)    Reduced errors  b)    Faster translation times  c)    Changes could be ma

Explain load balancing client server components, Explain Load Balancing Cli...

Explain Load Balancing Client Server Components When migration functionality from the client - only model to the client - server model, care must be taken not over-or underutil

What is a relocatable program, What is a Relocatable program? The Reloc...

What is a Relocatable program? The Relocatable programs can be loaded almost anywhere in memory.

Define server processing with queues, Define Server Processing with Queues ...

Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced

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