This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Storage Management in Virtual Tree Machines
March 1988 (vol. 37 no. 3)
pp. 321-328
ASCII Text
x 
 
F.W. Burton, "Storage Management in Virtual Tree Machines," IEEE Transactions on Computers, vol. 37, no. 3, pp. 321-328, March, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.2169,
author = {F.W. Burton},
title = {Storage Management in Virtual Tree Machines},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {3},
issn = {0018-9340},
year = {1988},
pages = {321-328},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.2169},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Storage Management in Virtual Tree Machines
IS - 3
SN - 0018-9340
SP321
EP328
EPD - 321-328
A1 - F.W. Burton,
PY - 1988
KW - storage management; virtual tree machines; parallel algorithms; divide-and-conquer algorithms; breadth-first expansion; distributed system; parallel algorithms; storage management; trees (mathematics); virtual storage.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
Many parallel algorithms, particularly divide-and-conquer algorithms, may be structured as dynamic trees of tasks. In general, as parallelism increases, storage requirements also increase. A sequential program keeps storage requirements small by finishing one task (or procedure invocation) before going on to another, so that the entire task tree is never in existence at any one time. This corre

[1] P. Brinch Hansen,Operating System Principles, Englewood Cliffs, NJ: Prentice-Hall, 1973.
[2] S. A. Brown, "A tree machine,"Lambda 1, 2, pp. 31-36, 1980.
[3] F. W. Burton and M. R. Sleep, "Executing functional programs on a virtual tree of processors," inProc. ACM Conf. Functional Programming Lang. Comput. Arch.1981, pp. 187-194.
[4] F. W. Burton and M. M. Huntbach, "Virtual tree machines,"IEEE Trans. Comput., vol. C-33, pp. 278-280, Mar. 1984.
[5] F. W. Burton, "Speculative computation, parallelism, and functional programming,"IEEE Trans. Comput., vol. C-34, pp. 1190-1193, Dec. 1985.
[6] D. Eager, E. Lazowska, and J. Zahorjan, "Adaptive load sharing in homogeneous distributed systems,"IEEE Trans. Software Eng., vol. SE-12, no. 5, pp. 662-675, May 1986.
[7] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[8] R. M. Keller and F. C. H. Lin, "Simulated performance of a reduction-based multiprocessor,"Computer, vol. 17, pp. 70-82, July 1984.
[9] T.H. Lai and S. Sahni, "Anomalies in Parallel Branch-and-Bound Algorithms,"Comm. ACM, June 1984, pp. 594-602.
[10] F. J. Peters, "Tree machines and divide-and-conquer algorithms," inProc. Conf. Analysing Problem-Classes and Programming Parallel Comput., Nurnburg, F. R. Germany, June 1981, pp. 25-36.
[11] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.

Index Terms:
storage management; virtual tree machines; parallel algorithms; divide-and-conquer algorithms; breadth-first expansion; distributed system; parallel algorithms; storage management; trees (mathematics); virtual storage.
Citation:
F.W. Burton, "Storage Management in Virtual Tree Machines," IEEE Transactions on Computers, vol. 37, no. 3, pp. 321-328, March 1988, doi:10.1109/12.2169
Usage of this product signifies your acceptance of the Terms of Use.