Jump to content

Talk:Elevator algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 129.22.117.61 (talk) at 19:45, 17 November 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I added the merging tags, because these two pages refer to the same thing. Is anyone opposed to making Elevator sort a redirect? --Jamuraa 18:31, 4 March 2006 (UTC)[reply]

Making elevator sort a redirect to this page sounds good to me, they're talking about exactly the same thing. GeorgeBills 12:47, 14 March 2006 (UTC)[reply]

Use of algorithm

Are disk scheduling algorithms actually in use? On which layer are they implemented? Operating system or hard disk? Thanks, --Abdull 19:04, 24 April 2006 (UTC)[reply]

Average Seek Time

When calculating the average seek time for the C-SCAN algorithm, the seek for returning to the begininng of the disk is included, so that the total number of seeks is 6. But the total number of actual disk I/Os is still 5, so should the average be:

185/5 = 37?