Issue No.03 - March (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2169
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
storage management; virtual tree machines; parallel algorithms; divide-and-conquer algorithms; breadth-first expansion; distributed system; parallel algorithms; storage management; trees (mathematics); virtual storage.
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