D. M. Eckstein, "Parallel processing using depth-first and breadth-first search," Ph.D. thesis, University of Iowa, July 1977. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Vectorized Garbage Collection - Andrew Appel (1990) (4 citations) (Correct)
....gather and scatter instructions, which can do random access fetches (and stores, respectively) in vector mode. It is these machines that have the ability to do garbage collection in vector mode. Processing the queue in a breadth first search algorithm is a natural application of parallel processing[3], and the gather and scatter instructions can be used for this purpose. A large batch of queue entries can be removed at once from the head of the queue, processed in parallel, and a new batch of entries can be appended to the tail. This is the principal idea behind our algorithm. Since ....
D. M. Eckstein, "Parallel processing using depth-first and breadth-first search," Ph.D. thesis, University of Iowa, July 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC