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

Define thread cancellation and target thread, Define thread cancellation & ...

Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer

Producer-consumer using condition variables, Now let us present an implemen...

Now let us present an implementation of a producer-consumer system using condition variables. This implementation works. dequeue() lock(A) while (queue empty) { wait(A, C)

Define the properties of batch operating systems, Define the properties ope...

Define the properties operating systems: Batch :- Jobs with similar needs are batched together and  run through the computer as a group by an operator or automatic job sequenc

Explain fixed partitioning techniques, FIXED PARTITIONING In a fixed p...

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit

What is a latency time, What is a Latency Time Latency Time is the time...

What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.

Find the parent process and the child process, Q. When a process creates a...

Q. When a process creates a fresh process using the fork() operation which of the following state is shared among the parent process and the child process? 1 Stack 2 Heap

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