Explain logical file system architecture, Operating System

Assignment Help:

 Logical File System

Responsible for providing the before discussed interface to the user including:

  • File access.
  • Directory operations.
  • Security and protection.

At the initial level device drivers communicate directly with the peripherals or their controllers or channels. A device driver is accountable for starting I/O operations on a device and processing the completion of an I/O request. For file operations the usual devices controlled are disk and tape drives. Device drivers are generally considered to be part of the operating system.

The next to initial level is referred to as the basic file system or the physical I/O level. This is the foremost interface with the environment outside of the computer system. The-basic I/O administrator is responsible for all file I/O initiation and termination. At this level control structures are sustain that deal with device I/O scheduling, and file status. The basic I/O administrator is apprehension with the selection of the device on which file I/O is to be performed on the basis of which file has been selected. It is as well concerned with scheduling disk and tape accesses to optimize performance.

Logical I/O makes possible users and applications to access records. Therefore whereas the basic file system deals with blocks of data the logical I/O module deals with file records. Logical I/O supplies a general-purpose record I/O capability and maintains basic data about files.

The level of the file system contiguous to the user is often termed the access method it provides a standard interface between applications and the file systems and devices that hold the data. Different access methods replicate different file structures and different ways of accessing and processing the data.


Related Discussions:- Explain logical file system architecture

CPU sheduling, categorize the CPU scheduling algorithms and among them expl...

categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..

How is a process chosen for being swapped either in or out?, How is a proce...

How is a process chosen for being swapped either in or out? Swap out: a.         If the process is idle. b.         If process has been in main memory for a long time.

Explain about threading issues, Explain about threading issues? The for...

Explain about threading issues? The fork and exec system calls In a multithreaded program of few UNIX systems have chosen to have two versions of fork, one that duplicates e

Define dynamic linking, Define dynamic linking. Dynamic linking is same...

Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use

Evaluate the physical address, Compare between the one and two-dimensional ...

Compare between the one and two-dimensional memory organizations in terms of the  memory structure,  advantages, and disadvantages.  Which approach would better support the needs o

Explain indexed allocation, Indexed allocation Indexed allocation bring...

Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block

Explain the architecting for threads, Explain the Architecting For Threads ...

Explain the Architecting For Threads When available, threads are an integral part of any multitasking server application program. It is important that the operating system prov

Assignment, You must use fork and pipe to complete this project. This proj...

You must use fork and pipe to complete this project. This project creates processes to add all numbers in a file. The user will enter a number (1, 2, or 4) of parallel processes

Read - write cycles of microprocessors, Examining the write/cycles as shown...

Examining the write/cycles as shown below We can see that the bus is designed for asynchronous read/write cycles. The operation of the write cycle is simple in that the add

Explain fixed partitioning, Explain fixed partitioning. Partitioning ar...

Explain fixed partitioning. Partitioning are the simpler techniques that don't involve virtual memory. Partitioning has been used in numerous variations in operating systems.

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