Abstract

This paper studies linear-time algorithms on a hierarchical memory model called Block Move (BM), which extends the Block Transfer (BT) model of Aggarwal, Chandra, and Snir, and which is more stringent than a pipelining model studied recently by Luccio and Pagli. Upper and lower bounds are shown for various data-processing primitives, and some interesting open problems are given. 1 Introduction Recent years have seen marked dissatisfaction with the computational realism of the classic machine models, such as Turing machines or the standard integer RAM (see [13, 12]). Many algorithms that theoretically run in linear time on the RAM scale non-linearly when it comes time to implement them. Cook [5, 6] proposed replacing the usual unit-cost RAM measure by the log-cost criterion, by which an operation that reads an integer i stored at address a is charged log i+log a time units. Aggarwal, Alpern, Chandra, and Snir [1] went further by introducing a parameter ¯ : N ! N called a memory access...

Citations