TY - GEN
T1 - HIERARCHICAL MEMORY WITH BLOCK TRANSFER.
AU - Aggarwal, Alok
AU - Chandra, Ashok K.
AU - Snir, Marc
PY - 1987
Y1 - 1987
N2 - A model for hierarchical memory with block transfer (BT) is presented. It is like a random access machine, except that access to location x takes time f(x), and a block of consecutive locations can be copied from memory to memory, taking one unit of time per element after the initial access time. The model is studied for f(x) equals x** alpha , O less than alpha less than 1; for f(x) equals x; and for f(x) equals log x. Tight bounds and optimal bounds are obtained for various problems.
AB - A model for hierarchical memory with block transfer (BT) is presented. It is like a random access machine, except that access to location x takes time f(x), and a block of consecutive locations can be copied from memory to memory, taking one unit of time per element after the initial access time. The model is studied for f(x) equals x** alpha , O less than alpha less than 1; for f(x) equals x; and for f(x) equals log x. Tight bounds and optimal bounds are obtained for various problems.
UR - http://www.scopus.com/inward/record.url?scp=0023560429&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023560429&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1987.31
DO - 10.1109/sfcs.1987.31
M3 - Conference contribution
AN - SCOPUS:0023560429
SN - 0818608072
SN - 9780818608070
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 204
EP - 216
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -