Make your simulation run faster, Computer Engineering

Assignment Help:

Ameliorating the mechanical delays of seeks and rottion are usually regardeed as major aspects of device drivers for disks. The simplest way for a disk device driver to service disk IO requests is First Come First Served. However, most disk driver software instead uses the "elevator algorithm". If there is no IO request pending, the first request is serviced. If, however, there is at least one request pending, then the disk arm has a direction of movement: inward or outward from the ddisk spindle. Two ordered listsof pending IO requests are maintained: those that can sstill be serviced while the disk arm continues its current direction, and those that must be seerviced after the disk arm changes direction and sweeps back across the disk. IL requests are serviced in order of cylindr number, when there are no further pending IO requestts in the direction the disk arm has been moving, the disk arm reverses direction and starts servicing IO requests that had been behind it. IO requests may arrive while the arm is sweeping, and such requests are sorted into one of the two lists as appropriate.
A) To quantify the benefit of using the elevator algorithm, simulate the disk driver handling IO requests and compute the average and median service time if the requests were handled FCFS and the average and median time if the requests were handled by the elevator algorithm. Comment on the ratio between the FCFS and elevator algorithm results. 

Assume a typical modern disk has about 16000 cylkinders, that the time for the arm to seek the full width of the disk is 5 milliseconds, and that the disk rotates at 7200 rpm. but because of rotational position sensing, after seeking to the appropriate cylinder an IO request only needs to wait for otational delay from the end of where the previous IO request was serviced to the start of where the next IO request is to be serviced. Assume tht the seek time is proportional to the number of
cylinders that must be crossed from the cylinder where the previous IO request was serviced to the cylindeer where the next IO request is to be serviced. (Measurement on any real disk shows this model is incorrect, but close enough for our purpose.)
Assume that the load of IO requests arrive at exponentially distributed distributed time intervals with mean 1 millisecond, that the cylinder distribution is 25% from the swap space (and, for Unix File System, the inode space) that occupies a few cylinders in the middle of the disk but that otherwise the cylinder distribution of IO requests is uniform, and that the length of the dta transfer of an IO request is lognormal, with median 1k bytes and scale parameter 1. Simulate enough IO requests that your averages have less than 1% error.

B) One way to make your simulation run faster, expecially now that almost all personal computers have at least dual cores, would be to wrrite your program as multi-threadd. Regardless of whether you actually have access to a multi-thread environment, indicate where in your program you would have to insert concurrency control (say semaphores) in order to avoid critical races.


Related Discussions:- Make your simulation run faster

Explain about wildcard character in dos, Q. Explain about wildcard characte...

Q. Explain about wildcard character in DOS? Sometimes you may like to list files having similar names. Let as suppose that these files are present in a root directory of drive

Explain difference between scanning and parsing, Explain difference between...

Explain difference between Scanning and parsing. Scanning and parsing: Scanning process is the process of recognizing the lexical components in a source string whereas parsin

Determine the factor consider when selecting digital encoder, 1. What facto...

1. What factors should be considered when selecting a digital encoder (line codes)? Briefly mention five of those factors. Use sketches and additional text to describe the followin

Different types of layers in tcp/ip protocol stack, What are the different ...

What are the different types of layers in TCP/IP protocol stack? Layers into the TCP/IP protocol architecture are as given below: • Application Layer, • Host-to-Host Tra

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

Overflow or underflow for floating point numbers, In floating point numbers...

In floating point numbers when so you say that an overflow or underflow has occurred? Ans: A) In single precision numbers when an exponent is less than +127 then we say that

Constructor, what is meant by private copy constructor

what is meant by private copy constructor

Objectives of parallel computing, Objectives of Parallel Computing Aft...

Objectives of Parallel Computing After reading this topic, you would be able to: Tell historical details of parallel computing; Explain the fundamental ideas of dis

How address symbol table is generated, Address symbol table is generated by...

Address symbol table is generated by the  (A) memory management software.  (B) assembler.  (C) match logic of associative memory.   (D) generated by operating system

What is linq, It sets for Language Integrated Query. LINQ is collection of ...

It sets for Language Integrated Query. LINQ is collection of standard query operators that gives the query facilities into .NET framework language like C# , VB.NET.

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