how elevator algorithm works in modern hard disks?
- From: forrest <forrest.yu@xxxxxxxxx>
- Date: Tue, 22 Jan 2008 02:44:54 -0800 (PST)
Hi Everyone,
It's said that physical geometry is invisible to the cpu and is
unimportant. However, if the geometry is entirely different with the
logical one, which the cpu can see, how does elevator algorithm work?
As we know, elevator algorithm always find the nearest block in some
direction, which depends on the actual geometry of a disk.
Elevator algorithm is used in linux kernel, so there must be some
details that I don't know. Could anyone tell me?
Thanks in advance.
Best Regards,
Forrest
.
- Follow-Ups:
- Re: how elevator algorithm works in modern hard disks?
- From: Josef Moellers
- Re: how elevator algorithm works in modern hard disks?
- Prev by Date: Re: findfirst, findnext and finddata_t
- Next by Date: Re: how elevator algorithm works in modern hard disks?
- Previous by thread: how to know a user application quit
- Next by thread: Re: how elevator algorithm works in modern hard disks?
- Index(es):
Relevant Pages
|