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!
Simulation of Elevator and Shortest Seek Time First (SSTF) Disk Scheduling Algorithm
Requirements:
_ Must be implemented in C (not C++).
Description:
The project should implement two basic disk scheduling algorithms.
1. Shortest seek time algorithm
2. Elevator algorithm
Overview
A hard disk drive contains a collection of plates called platters. However for the sake of simplicity, we consider a single platter for the project. Each surface of a platter is divided into circular tracks. Each track is further divided into sectors. Reading and writing on the disk is done on sector by sector basis. A group of tracks that are aligned on top of each other forms a cylinder. There is a head connected to arm of each surface which handles all I/O operations. During an I/O operation, the disk head is moved over the destination track. This time is called seek time. Then the disk is rotated further to position the destination sector under the head. This time is called rotational latency. Then the I/O operation is performed.
Shortest Seek Time First Algorithm
After a request is served, the next request to be served is the one which is in the track closest to the current disk head irrespective of the direction in which disk head was moving. It might be easier to implement, but it can lead to starvation if requests are continuously made close to the current disk head. Also slow down in speed might occur if the direction has to be changed frequently.
Coding style is a very important part for those entering the technology field. Here are two model Java programs that do exactly the same thing according to the user.
Provide the design and justification for your mechanism that supports process dispatching and discuss the design advantage and disadvantage of each approach throughout the process lifecycle.
Create a program to display the initial values held through the structure on the screen.
Suppose further that a single processor system can solve the problem in 106 seconds (about 11.6 days). So, on average, the single processor system
A hard drive must be managed to be used most efficiently. This maintenance with deleting old files, defragmenting a drive so that it does not waste space, as well as, from time to time, discovering and attempting to correct disk failures.
Specify the order in which processes execute and determine the mean process turnaround time for each of the scheduling algorithms.
Some of the local hospital's administrators are questioning privacy of patients' data with wireless transmission. Discuss and determine the merits of their concerns.
Assume you have learned a great deal of important data about the Windows operating system so far. However, we have not even scratched the surface of the capabilities of Windows XP.
Seek time 1 ms for every 100 tracks traversed. Initial track position is 0. Compute average seek time & rotational latency.
With the help of graphics program, design many security awareness posters on the following themes, updating antivirus signatures, watching out for e-mail viruses.
Create a program to calculate numeric grades for a course. The course records are in a document that will serve as the input document.
It is determined that 3-out of 5-businesses that experience downtime of forty-eight hours or more will be out of business within three years.
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd