Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

FOCS
1990
IEEE

favoriteEmaildiscussreport

79views Theoretical Computer Science» more FOCS 1990»

Uniform Memory Hierarchies

13 years 8 months ago

Uniform Memory Hierarchies

Download www.ittc.ku.edu

We present several e cient 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.

Bowen Alpern, Larry Carter, Ephraim Feig

Real-time Traffic

Algorithms | FOCS 1990 | Optimal Sorting Algorithms | Theoretical Computer Science | Uniform Memory Hierarchy |

claim paper

Related Content

» WEA a Distributed Object Manager Based on a Workspace Hierarchy

» NonUniform Waveband Hierarchy in Hybrid Optical Networks

» Defining Uniform and Hybrid Memory Consistency Models on a Unified Framework

» Virtually Pipelined Network Memory

» Using PRAM Algorithms on a UniformMemoryAccess SharedMemory Architecture

» PowerEfficient Implementations of Multimedia Applications on Reconfigurable Platforms

» Initial Experiences with Dreamy Memory and the RAMpage Memory Hierarchy

» EnergyPerformance Design of Memory Hierarchies for ProcessorinMemory Chips

» Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	FOCS
Authors	Bowen Alpern, Larry Carter, Ephraim Feig

Comments (0)