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!
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.
Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time
SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv
LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for
1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of the
Differentiate between sequential access and direct access method?
1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory
Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre
Determine a scheduling policy that is most suitable for a time-shared operating system Round-Robin is a scheduling policy that is most suitable for a time-shared operating s
What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form
Explain the Thread Local Storage (TLS) Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope
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