
	Where results make sense

Topic: Shortest seek first

Related Topics

Elevator algorithm

In the News (Tue 22 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	SHORTEST SEEK FIRST : Encyclopedia Entry
		Shortest seek first is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
		The shortest seek first algorithm determines which request is closest to the current position of the head, and then services that request next.
		The shortest seek first algorithm has the direct benefit of simplicity and is clearly advantageous in comparison to the FIFO method, in that overall arm movement is reduced, resulting in lower average response time.
	www.bibleocean.com /OmniDefinition/Shortest_seek_first (194 words)

	Shortest seek first - Wikipedia, the free encyclopedia
		Shortest seek first is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
		The shortest seek first algorithm determines which request is closest to the current position of the head, and then services that request next.
		The shortest seek first algorithm has the direct benefit of simplicity and is clearly advantageous in comparison to the FIFO method, in that overall arm movement is reduced, resulting in lower response time.
	en.wikipedia.org /wiki/Shortest_seek_first (248 words)

	Freeblock Scheduling Outside of Disk Firmware
		Since the listed seek times are averages of seeks of a given distance, a specific seek time may differ by tens of µs depending on the distance and the conditions of the drive.
		Determining the latter involves computing the extra seek time involved in going to each candidate's location and determining whether all of the necessary blocks could be fetched in time to seek to the location of the foreground request without causing a rotational miss.
		First, it prevents the scheduler from using free bandwidth on the source track, since the previous foreground request is always previously sent to the disk and cannot subsequently be modified.
	www.usenix.org /events/fast02/full_papers/lumb/lumb_html/index.html (7989 words)

	Patent 5729718 (Site not responding. Last check: 2007-10-17)
		Henceforth in this discussion, "seek time" is generalized to mean the greater of the time required to switch heads and the time required to move the head from the source track to the destination track, and is shown as the second term on the right side of Equation (1).
		Seek time is dependent on the drive hardware and varies non-linearly according to the number of cylinders traversed and whether a head switch is involved.
		Seek time must be measured and a "seek.sub.-- profile" of the measured seek times is then compiled as a function as shown in Equation (2).
	www.freepatentsonline.com /5729718.html (5607 words)

	pseudo code for Shortest Seek Time First
		The seemingly simple fetching of the next request in the (sorted) device queue was made less so by addressing starvation.
		The access routine nextRequest chooses a candidate from the current device queue, and this is checked to make sure it supplies the shortest seek time.
		It was supposed that, in the process of serving requests according to the SSTF principle, there might be an interrruption of a pattern that would occur when a starved request was discovered.
	www.users.qwest.net /~knuffer/ken/school/3453/project/doc/pseudoCode/sstf.pseudo.html (354 words)

	3.4 Input/Output (Site not responding. Last check: 2007-10-17)
		This algorithm is called Shortest Seek First SSF, which cuts the total arm motion almost in half compared to the FCFS algorithm.
		To perform a seek, it issues a series of pulses to the arm motor, one pulse per cylinder to move the arm to the destination cylinder.
		One possible way to realize the first timing function is to maintain the time of day in seconds rather than in ticks, using a subsidiary 32-bit counter to count ticks until a whole second has been accumulated.
	www.netnam.vn /unescocourse/os/34.htm (9207 words)

	Lecture 23 of CS537 (Site not responding. Last check: 2007-10-17)
		Main components of disk read/write latency: seek latency (moving the arms so that the heads are on the right track), rotational latency (waiting until the right sector is under the read/write head), and transfer latency (reading or writing the data to and from the disk).
		In other words, seek and rotational latencies will continue to be the main portion of the disk access latency.
		Shortest Distance First (Greedy algorithm): the disk always service the next request that will take the disk heads the least amount of time (seek and rotational time together) to reach.
	www.cs.wisc.edu /~cao/cs537/lecture23.html (616 words)

	Budo Seek (Site not responding. Last check: 2007-10-17)
		Shortest seek first 1: '''Shortest seek first''' is a disk scheduling algorithm to de 6: The shortest seek first algorithm determines which request is close 9: The shortest seek first algorithm has the direct benefit of simplic
		They seek to destroy the producers despite the fact that th 83: as a weapon against those who produce value.
		They seek to destroy the producers despite the fact that th 120: d, reason is a superstition, that it is futile to seek meaning in life, and that the duty of a philosoph
	www.swingdancemusic.com /send/24167-budo%20seek.html (363 words)

	Disk Arm Scheduling Simulations Introduction (Site not responding. Last check: 2007-10-17)
		First Come First Serve is the fairess algorithm of all.
		Calculating the exact seek time between two tracks is difficult, but this time is approximately proportional to the relative distance between two tracks.
		While the SSF algorithm does return the lowest number of cyclinders traversed for all request combinations, it is however not a fair algorithm.
	renoir.vill.edu /~achang/diskintro.html (951 words)

	Citations: Analysis of Scanning Policies for Reducing Disk Seek Times - Coffman, Klimko, Ryan (ResearchIndex) (Site not responding. Last check: 2007-10-17)
		Geist and Daniel have described a continuum of algorithms from SSF to SCAN and showed that they di ered mainly in the amount of emphasis on maintaining the current scanning direction [7] Seltzer et al.
		First, the early disk scheduling research examined very short queue lengths (averaging less than 50 requests) This limitation is due, in large part, to the absence of large main memories and the slower CPUs.
		Geist and Daniel have described a continuum of algorithms from SSF to SCAN di ering only in the importance of maintaining current scanning direction [6] As CPU power and memory capacity of computer systems increases dramatically, rotational delay is reduced slower than seeking overhead,....
	citeseer.lcs.mit.edu /context/378577/0 (2987 words)

	Performance tuning HBA drivers (Site not responding. Last check: 2007-10-17)
		Drivers that do not sort the jobs to reduce seek (and possibly latency) time risk sluggish performance, particularly as the work load grows.
		There are many disk scheduling policies; a simple shortest-seek first algorithm works well for many drivers and disks.
		For example, for a structure that is frequently locked, it may pay to add a second lock to synchronize some of the fields while the first lock synchronizes other fields.
	docsrv.sco.com /HDK_sdi/sdi_style_perf.html (487 words)

	esm_deitel_os_3\|Disk Performance Optimization\|Chapter Summary
		This strategy eliminates unnecessary seek operations experienced by other variations of the SCAN strategy by preventing the read/write head from moving to the innermost or outermost cylinders unless it is servicing a request to those locations.
		Allowing the seek to a hot spot to be interrupted to adjust to requests provides the greatest performance boost.
		This can reduce seeks, latency times and transmission times, but may require substantial processor time to compress the data for storage on the disk, and to decompress the data to make it available to applications.
	wps.prenhall.com /esm_deitel_os_3/0,8727,1127097-,00.html (3559 words)

	Disk Scheduling Exercise
		Seek time: The time it takes for the disk arm to move the head to the cylinder containing the desired sector.
		For the sake of simplicity, the following exercises address only the seek time or total head movement as measured by the number of cylinders.
		First seek was at 98 resulting in a movement of 45 cylinders.
	www.engr.iupui.edu /~starks/cpt286/disk.htm (170 words)

	Introduction to System Software, Chapter 11
		The first generation of 8 inch floppy disks, from about the same era, had one recording surface with 76 recording tracks; each track was divided into 26 sectors of 128 bytes each.
		If the current disk operation was seek, the ready bit will also be set, but if the current disk operation was read or write, the ready bit will not be set until the data transfer to the selected sector is completed, so long as that sector is legal.
		In the event of an attempt to seek a non-existant cylinder, or in the event of an attempt to read or write a non-existant surface or sector, the ready bit will be set with the error code field of the status register indicating the error.
	www.cs.uiowa.edu /~jones/syssoft/fall00/notes/11disk.html (8042 words)

	Date: 01st Feb 2004 (Site not responding. Last check: 2007-10-17)
		Seek time: The time taken for the read/write head to position itself on the right track.
		The seek time can be minimized using multiple read/write heads.
		Latency time: The time taken for the disk to rotate, so that the sector from which the information has to be retrieved, is brought under the read/write head is called the rotational delay or the disk latency time.
	homepages.wmich.edu /~v2navane/feb02.html (98 words)

	[No title]
		The array is stored by rows (so the elements of the first row of A are stored first, followed by the elements of the second row, and so on).
		In the case of busy shortest seek first, cylinder requests of : 1, 45, 46, 44, 100, 46, 50, 40, 48, 1, 42, 51, 44, 48, 47,.
		The only problem is that where most processes go back to their work after the granting of their request, some of them never get satisfied, no matter how much you grant their requests.
	www.cis.syr.edu /courses/CIS657/final.ans (2642 words)

	Performance tuning HBA drivers
		Drivers that do not sort the jobs to reduce seek (and possibly latency) time risk sluggish performance, particularly as the work load grows.
		There are many disk scheduling policies; a simple shortest-seek first algorithm works well for many drivers and disks.
		For example, for a structure that is frequently locked, it may pay to add a second lock to synchronize some of the fields while the first lock synchronizes other fields.
	ou800doc.sco.com /en/HDK_sdi/sdi_style_perf.html (486 words)

	Shortest path problem
		In graph theory, the single-source shortest path problem is the problem of finding a path between two vertices such that the sum of the weights of its constituent edges is minimized.
		The all-pairs shortest path problem is a similar problem, in which we have to find such paths for every two vertices v to v'.
		A related problem is the traveling salesman problem, which is the problem of finding the shortest path that goes through every node exactly once, and returns to the start.
	www.kiwipedia.com /shortest-path-problem.html (361 words)

	COMP 346: Practice Questions (Site not responding. Last check: 2007-10-17)
		Suppose that a new technological revolution results in disks, for which the seek time (and rotational latency) is negligible as compared to data transfer time.
		A two level paging scheme, with the first 2 bits as index into the first level page table, and the next 4 bits as index into the second level page table.
		A three level paging scheme, with the first 2 bits as index into the first level paging table, the next 2 bits as index into the second level page table, and the last 2 bits as index into the third level page table.
	www.cs.concordia.ca /~comp346/problems.html (4463 words)

	Fertility Awareness at www.Birth-Control-Comparison.info from Cedar River Clinics
		To be effective as birth control, it requires her to abstain from intercourse or to use a barrier method of birth control during the fertile time, approximately one-third of the month.
		Using the above chart for another example, if a woman's menstrual record shows her shortest cycle was 25 days and her longest was 30 days, her unsafe fertile days are Day 7 up to and including Day 19, counting from Day 1 as the first day of her period.
		Typically, during and in the first few days after menstruation, the cervix is fairly low and firm like the tip of your nose.
	www.fwhc.org /birth-control/fam.htm (2394 words)

	[No title]
		The seek time (time to move the arm to the proper cylinder or track).
		Seek time is the dominant factor, so improvements to that factor are useful.
		Idle drives should be issued seeks to move arms to where next will be needed.
	cis.csuohio.edu /~jackie/cis345a/notes/cis34516.txt (1334 words)

	8 Related work
		Seek reduction is often crucial for extracting even acceptable throughput for disk intensive applications.
		The low water mark here is to buffer write requests and increase opportunities for seek optimization; this can be viewed as a logical counterpart of NWCS for write requests.
		There is, however, the equivalent of seek optimization by scheduling requests from the same process.
	www.cs.rice.edu /~ssiyer/research/di/thesis/node10.html (1609 words)

	Seek Ye First the Kingdom of God Pt 1 (Site not responding. Last check: 2007-10-17)
		Most of all, it is a message of hope, because it addresses a people who have become apathetic, indifferent, apostate even, and transforms them into a God fearing people who restore public worship by rebuilding the temple.
		One of the first things they do is set up an alter, v1-3.
		6 From the first day of the seventh month they began to offer burnt offerings to the LORD, but the foundation of the temple of the LORD had not been laid.
	www.affordablehomeschools.com /Church/BibleStudy/Robert/Haggai/Seek%20Ye%20First%20the%20Kingdom%20of%20God%20Part%201.htm (3270 words)

	Disk Scheduling (Site not responding. Last check: 2007-10-17)
		Unlike a file where it is most likely that the next read/write will occur in the next sector of the file, the next read/write request can occur anywhere on the disk.
		In the SSF Algorithm, the next track that is closest to the current position is the next one sought.
		Seek error (head sent to track 7 and went to six instead) Every now and again, recalibrate the head by moving from one extreme to another.
	www.cs.ntu.edu.au /sit/resources/ith406r/a141ds.html (636 words)

	List of all algorithms, classified by purpose
		Computes shortest paths in a weighted graph (where some of the edge weights may be negative).
		It is a general-purpose algorithm that is simpler than the number field sieve and the fastest for integers under 100 decimal digits.
		The first published algorithm to be simultaneously polynomial, deterministic, and unconditional.
	www.scriptol.org /list-of-algorithms.html (2687 words)

	Disk Arm Scheduling Simulations Introduction (Site not responding. Last check: 2007-10-17)
		To improved upon efficiency, the SSF algorithm can be used.
		Seek Time is the time takes the head to travel from one track to the next.
		Out of these three parameters, Seek Time is the most dominate one.
	www.csc.vill.edu /~achang/diskintro.html (951 words)

	Disk Scheduling Algorithms (Site not responding. Last check: 2007-10-17)
		Assume the queue is initially full with the first 20 requests from the data file.
		Each algorithm will be tested on very small set of 9 numbers (vss.dat), a small data set of 84 numbers (example.dat) and a large data set of 1024 numbers (dsched.dat).
		The seek time is the time for the disk arm to move the heads to the cylinder containing the desired sector.
	carbon.cudenver.edu /~esbrowde/csc3453/semester_proj/Algorithms.html (370 words)

	CS 111
		For uniformly random files, the read/write head seeks 1/2 of the disk on average for each request.
		We could obtain better throughput if we processed groups of requests for areas of the disk that are adjacent or closer to each other: if proximity on disk influenced locality of reference.
		Seek across disk in one direction and serve all jobs in that path.
	www.cs.ucla.edu /~kohler/class/05s-osp/notes/notes14.html (1925 words)

	纽约大学操作系统笔记（5）_计算机_精华区（旧版）_考研论坛_kaoyan.com (Site not responding. Last check: 2007-10-17)
		process the first entry on the list and any others following immediately after with a time of zero (which means they are to be simultaneous with this alarm.
		For each node in the graph do a depth first traversal (hoping the graph is a DAG (directed acyclic graph), building a list as you go down the DAG.
		Seek a process P whose max additional requests is less than what remains (for each resource).
	bbs2.kaoyan.com /archive/8/420737.htm (3716 words)

	DEVICE MANAGEMENT
		Seek time (the slowest of the three) is the time it takes to position the head over the desired location on the disk Search time, or rotational delay is the time it takes to rotate the disk until the desired track is under the head.
		A seek strategy for the I/O device handler is the predetermined policy that the device handler uses to allocate access to a device.
		SSTF is advantageous in that it minimizes overall seek time; however, its disadvantageous in that it favors easy-to-reach jobs, and postpones traveling to those that are out of the way.
	members.tripod.com /jdgrose115/academic/device.html (6018 words)

Try your search on: Qwika (all wikis)