Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Acyclic Graph directory structure
We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to
Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU
what is file?explain the file access methods?
What is process control block? Every process is represented in the OS by a process control block. It has many pieces of information associated with an exact process.
Explain the ThreadSwitchWithDelay Function used in Netware ThreadSwitchWithDelay( ) This command is used when threads are waiting for an event or resource but don't want t
What are the two principles in Hungarian method?
What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti
MEMORY MANAGEMENT USING LINK LISTS The first one is for showing it is process or hole, second is for starting address and third is for length of the process and last is a point
Write a short note about context switch. Switching the CPU to another process needs saving the state of the old process and loading the saved state for the new process. This ta
What are the requirements for solution of critical section problems? Mutual exclusion : If process p is implementing in its critical section then no other processes can be exe
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd