Virtual memory computers are capable of executing large-scale particle simulations even when the memory requirements exceed the computer core size. The required address space is automatically mapped onto slow disc memory by the operating system. When the simulation size is very large, frequent rando
Large-Scale Sorting in Uniform Memory Hierarchies
โ Scribed by J.S. Vitter; M.H. Nodine
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 603 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
We present several efficient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all bandwidths for other versions of UMH and P-UMH, including natural restrictions we introduce called RUMH and P-RUMH, which more closely correspond to current programming languages. 1993 Academic Press. Inc.
๐ SIMILAR VOLUMES
The orientation abilities exhibited by many species are based on spatial memorization. The location of a place to which an animal intends to return may be memorized either independently of the animal's position (location and orientation) by an exocentric coding which consists of processing the locat