Linear-time algorithms in memory hierarchies

Kenneth W. Regan

Linear-time algorithms in memory hierarchies

Kenneth W. Regan

Department of Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	288-293
Number of pages	6
Journal	Unknown Journal
Issue number	A-51
State	Published - 1994
Event	Proceedings of the IFIP 13th World Computer Congress. Part 3 (of 3) - Hamburg, Ger Duration: Aug 28 1994 → Sep 2 1994

Cite this

@article{53ecda08208c4c14af5a276b3ca6c7e1,

title = "Linear-time algorithms in memory hierarchies",

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.",

author = "Regan, \{Kenneth W.\}",

year = "1994",

language = "English",

pages = "288--293",

journal = "Unknown Journal",

number = "A-51",

note = "Proceedings of the IFIP 13th World Computer Congress. Part 3 (of 3) ; Conference date: 28-08-1994 Through 02-09-1994",

}

TY - JOUR

T1 - Linear-time algorithms in memory hierarchies

AU - Regan, Kenneth W.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0028571998

M3 - Article

AN - SCOPUS:0028571998

SP - 288

EP - 293

JO - Unknown Journal

JF - Unknown Journal

IS - A-51

T2 - Proceedings of the IFIP 13th World Computer Congress. Part 3 (of 3)

Y2 - 28 August 1994 through 2 September 1994

ER -

Linear-time algorithms in memory hierarchies

Abstract

Other files and links

Fingerprint

Cite this