Abstract
Describes the problem of sorting files that are too large to be resident in the main memory of a system with random-access devices. Drum sorting is analyzed first. The complication in analysis due to significant seek times is explained. A simplified situation where transfer and compute times are small is solved for optimal merging patterns.
Additional Information
| Product Type | Technical Note |
|---|---|
| Reference No. | QM0122TEC |
| Title | Disk Sorting |
| Pages | 4 |
| Published on | Jan 1, 1977 |
| Authors | Patel, Nitin R; |
| Area | Quantitative Methods (QM) |
| Discipline | IT and Systems |
| Sector | Manufacturing |
My Cart
You have no items
in your shopping cart.