during DMA operation isMemory cycle time is 40 nsec. The maximumword is ready it is sent to memory; similarly,word from the memory in each DMA cycle.J000 pim. The disk is operated in cyclestealing mode whereby whenever one 4 byte512 sectors/track, 1 KBscctor, rotation speedpercentage of time the CPU gets blockedfor writing. the disk interface reads a 4 bytedisk drive with the followingspecifications:surfaces,Consider512tracks/surface,The disk is operated in cyclerpem

stealing mode whereby whenever one 4 byte for writing, the disk interface reads a 4 byte SO00 pem. The disk is operated in cycle 512 sectors/track, 1 KB sector, rotation speed percentage of time the CPU gets blocked Memory cycle time is 40 nsec. The maximum word is ready it is sent to memory; similarly, word from the memory in each DMA cycle. disk drive with the following during DMA operation is spcifications: surfaces, Consider 512 tracks/surface, 16 The disk is operated in cycle s000 pn of time the CPU gets blocked percentage

stealing mode whereby whenever one 4 byte for writing, the disk interface reads a 4 byte SO00 pem. The disk is operated in cycle 512 sectors/track, 1 KB sector, rotation speed percentage of time the CPU gets blocked Memory cycle time is 40 nsec. The maximum word is ready it is sent to memory; similarly, word from the memory in each DMA cycle. disk drive with the following during DMA operation is spcifications: surfaces, Consider 512 tracks/surface, 16 The disk is operated in cycle s000 pn of time the CPU gets blocked percentage

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 22VE

See similar textbooks

Similar questions

A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Consider a disk drive specifications. with the following 16 surfaces, 512 tracks/surface, 512 sectors/ track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation?
A Magnetic surface has 64 tracks (To to T63), One track has 256 sectors (So to S255). One sector data storage capacity is 0.5 KB and motor is operated with 6000 RPM. The seek time for moving the head from the Current track to it's next successive track is 2m.s. The Current position of the Head is T6 and ending of S23. The amount of time needed to Read the 20 KB file which is available at the T6 and starting of S29 is m.s.
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
An octa-core processor has 83 attached tape drives. There is a large number of jobs submitted to thesystem that each of them requires a maximum of 5 tape drives to complete execution. Assume each jobstarts running with only 4 tape drives for a long period before requiring the 5th tape drive for a short periodtowards the end of its operation. When a job is started, 5 drives are assigned immediately and are notreleased until the job finishes. Assume that the scheduler in the OS will not start a job unless there are 5tape drives available. Also assume an endless supply of such jobs.a)What is the maximum number of jobs that can be in progress at once? (1 point)b)Compute the maximum and minimum number of tape drives that may be left idle as a result of this policy
Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?
Serial access memories are useful in applications whereA. Data consists of numbersB. Short access time is requiredC. Each stored word is processed differentlyD. Data naturally needs to flow in and out in the serial form.
Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is.
An application loads 100 libraries at start-up. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10 ms. Rotational speed of disk is 6000 rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected.)
We have three processes that work coordinately to serve the photo printing request(pictured below). When there is a request to print a photo, Process A reads the photo data from thedisk to Buffer 1, Process B copies the data from Buffer 1 to Buffer 2, finally Process C takes the datafrom Buffer 2 and print it.Process A ------------- Process B ------------ Process C------------------------------>| Buffer 1 |-------------------------->| Buffer 2 |----------------------------->Read from File ------------- copy ------------- print Assume each process operates on one photo at a time, both buffers' capacity can store two photos.Write a program (Pseudo code) to coordinate the three processes using semaphores. (Define thesemaphores to use and initialize their values)
Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics: Parameter Value Rotational rate 15,000 RPMTavg seek 4 msAverage number of sectors/track 1,000Surfaces 8Sector size 512 bytes For each case below, suppose that a program reads the logical blocksof the file sequentially, one after the other, and that the time to positionthe head over the first block is Tavg seek + Tavg rotation .A. Best case: Estimate the optimal time (in ms) required to readthe file over all possible mappings of logical blocks to disksectors. B. Random case: Estimate the time (in ms) required to read thefile if blocks are mapped randomly to disk sectors.
Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 12 direct disk blocks, as well as 1 single and 1 double indirect disk blocks. What is the maximum size of a file that can be stored in this file system in GBs (round to the nearest integer)?