Write a short note on disk structure, Operating System

Assignment Help:

Write a short note on disk structure

Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer. The size of the logical block is typically 512 bytes and the one dimensional array of logical block is mapped onto the sectors of disk sequentially. Sector 0 is the initially first sector of the track on the outermost cylinder the mapping proceeds in order through that track after that through the rest of the tracks in that cylinder and then through rest of the cylinder from outermost to innermost. The faster a track is from the centre of disk that the greater its length so the more sectors it can hold. While we move from outer zone to inner zone the number of sectors per track decreases. Tracks in the outermost zone usually hold 40 percent more sectors than do tracks in the innermost zone. The drive enhance its rotation speed as the head moves from the outer to the inner track to keep the same rate of data moving under the head.

 

 


Related Discussions:- Write a short note on disk structure

Define deadlock prevention, Define deadlock prevention. Deadlock preve...

Define deadlock prevention. Deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pr

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Write xeyes on command line, Ask question #Minimum 100 words accepteWrite a...

Ask question #Minimum 100 words accepteWrite an xeyes command to display a window that is: ? SIZE: ¦ 400 pixels wide ¦ 300 pixels tall ? LOCATION: ¦ 100 pixels from the right edge

Student, Explain how the os implements virtual memory phenomenon.

Explain how the os implements virtual memory phenomenon.

Build a vigorous distributed system, Q.  To build a vigorous distributed sy...

Q.  To build a vigorous distributed system you must know what kinds of failures can occur. a. List three possible kinds of failure in a distributed system. b. State which of

Explain the concept of reentrancy, Concept of Reentrancy   It is a ...

Concept of Reentrancy   It is a useful, memory-saving method for multiprogrammed timesharing machines. A Reentrant method is one in which multiple clients can share a singl

Introduction to microprocessors, Let us consider the pining details of the ...

Let us consider the pining details of the 68HC11 as shown below.     Each pin has a defined function, some easy, some complex. A microprocessor designer should understan

What is dispatcher? explain, Questiion 1 What is RTOS? What are its requir...

Questiion 1 What is RTOS? What are its requirements? Questiion 2 Explain the structural elements of a real time system mode Questiion 3 What is kernel? Explain abo

Explain first fit allocation algorithm, Describe the following allocation a...

Describe the following allocation algorithms: a. First fit b. Best fit c. Worst fit   a. First-fit: search the list of available memory and all

Unix, UNIX Shell and History feature. 1.Creating a child process. 2.Creatin...

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

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