Elevator algorithm
Disk-scheduling algorithm
The elevator algorithm, or SCAN, is a disk-scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests. This algorithm is named after the behavior of a building elevator, where the elevator continues to travel in its current direction (up or down) until empty, stopping only to let individuals off or to pick up new individuals heading in the same direction.
Nº Q988829 ★
Common · Knowledge
Elevator algorithm
Disk-scheduling algorithm
The elevator algorithm, or SCAN, is a disk-scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests. This algorithm is named after the behavior of a building elevator, where the elevator continues to travel in its current direction (up or down) until empty, stopping only to let individuals off or to pick up new individuals heading in the same direction.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
The elevator algorithm, or SCAN, is a disk-scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests. This algorithm is named after the behavior of a building elevator, where the elevator continues to travel in its current direction (up or down) until empty, stopping only to let individuals off or to pick up new individuals heading in the same direction. From an implementation perspective, the drive maintains a buffer of pending read/write requests, along with the associated cylinder number of the request, in which lower cylinder numbers generally indicate that the cylinder is closer to the spindle, and higher numbers indicate the cylinder is farther away. The algorithm is largely obsolete for data storage. With the current generation of magnetic disks it is not possible to know the location of specific data on the disk and solid state memory devices have a constant seek time independent of location.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
B
Broyden–Fletcher–Goldfarb–Shanno algorithm
Optimization method
Nº Q2877013 ★
Not listed
-
Hill climbing
Optimization algorithm
Nº Q820272 ★
Not listed
-
Pipeline (computing)
Data processing chain, implemented in hardware or software
Nº Q1192422 ★
Not listed
-
Dichotomic search
Type of search algorithm
Nº Q5272532 ★★★
Not listed
-
3D scanning
Analyzing a real-world object or environment to collect data on its shape and possibly its appearance (e.g. colour)
Nº Q94701573 ★
Not listed
-
Euclidean algorithm
Algorithm for computing greatest common divisors
Nº Q230848 ★★★
Not listed
-
CHKDSK
System tool in DOS, OS/2 and Windows
Nº Q422202 ★★
Not listed
-
L
Loop unrolling
Loop transformation technique
Nº Q1869750 ★
Not listed
-
C
Counting sort
Sorting algorithm
Nº Q1124964 ★
Not listed
-
Knapsack problem
Problem in combinatorial optimization
Nº Q864457 ★★★
Not listed
-
Halting problem
Problem of determining whether a given program will finish running or continue forever
Nº Q622849 ★★★
Not listed
-
C
Cox–Zucker machine
Algorithm in algebraic geometry
Nº Q228693 ★★
Not listed
-
Nyquist–Shannon sampling theorem
Theorem in signal processing describing discrete samples of a continuous signal
Nº Q679800 ★★★
Not listed
-
G
Greedy algorithm
Algorithm that makes locally optimal choices in a sequence of steps with the goal of reaching a global optimum
Nº Q504353 ★★★
Not listed
-
B
Blahut–Arimoto algorithm
Class of algorithms in information theory
Nº Q4923900 ★★★
Not listed
-
Brute-force search
Computer problem-solving technique
Nº Q850362 ★★★
Not listed
-
L
Limited-memory BFGS
Optimization algorithm
Nº Q6549489 ★★
Not listed
-
C
Cycle detection
Algorithmic problem
Nº Q60614789 ★
Not listed