| S. Goldstein. Lazy Threads: Compiler and Runtime Structures for Fine-Grained Parallel Programming. PhD thesis, University of California, Berkeley, 1997. |
....are arranged into fixed size stacklets which are chained together to form a logical stack. Stacklets and cactus stacks have been previously used in parallel fine grained thread scheduling to facilitate cheap parallel function calls and space management suitable for many threaded applications [33]. Normally, a function allocates an activation record from the bottom of a stacklet in the same way it does from a stack. Likewise, deallocating an activation record simply requires incrementing the stack pointer. However, since the stacklet is of limited size, some modifications are necessary. ....
Seth Goldstein. Lazy Threads: Compiler and Runtime Structures for Fine-Grained Parallel Programming. PhD thesis, University of California at Berkeley, Fall 1997.
....for applications that generate many threads or threads whose stack requirements vary greatly. Stacklets are useful in this context as well since they bound the wasted space per stack to the size of one stacklet. In addition, the programmer is not required to compute or guess a safe stack size [16]. 4.2 Granularity The original algorithm was designed for ease of proving correctness, time, and space properties. Unfortunately, asymptotic bounds fail to capture overheads a direct implementation may incur. In fact, the original algorithm invokes the collector whenever the collector allocates ....
Seth Goldstein. Lazy Threads: Compiler and Runtime Structures for Fine-GrainedParallel Programming. PhD thesis, University of California at Berkeley,Fall 1997.
No context found.
S. Goldstein. Lazy Threads: Compiler and Runtime Structures for Fine-Grained Parallel Programming. PhD thesis, University of California, Berkeley, 1997.
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