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

Timers could be utilized to compute the current time, Q. Timers could be ut...

Q. Timers could be utilized to compute the current time. Provide a little description of how this could be accomplished. Answer: A program could utilize the following ap

How can deadlocks be represented?, How can deadlocks be represented? D...

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

Explain doscreatethread functions used in the os/2, Explain DosCreateThread...

Explain DosCreateThread Functions Used in the OS/2  DosCreateThread(&threadID,MyThreadFunction,arg,flags,stackSize) DosCreateThread creates a thread within the context of th

Linux os, Introduction of linux

Introduction of linux

necessary conditions for a deadlock , Q) a. Given that the first three nec...

Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given  unique priorities.

What are the major differences between operating systems, Q. What are the m...

Q. What are the major differences between operating systems for mainframe computers and personal computers? Answer: In general operating systems for batch systems have simpler

List two types of system directories, List two types of system directories ...

List two types of system directories A) Device directory:- Describing physical properties of files. B) File directory :- Giving logical properties of the files.

Model, list trhe various classification of model and types?

list trhe various classification of model and types?

Determine the requiring variables on the scope of a thread, Determine the R...

Determine the Requiring Variables on the Scope of a Thread It is very common in server application programs to require variables on the scope of a thread. To provide such a sco

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