| Constantine D. Polychronopoulos. On Program Restructuring, Scheduling, and Communications for Parallel Processor Systems. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, August 1986. |
....the process runs out of space. In the buddy system, space for activation frames is allocated from a heap and deallocated as soon as the frame is no longer needed. 3. 5 Implementing DOALL Tasks The current implementation of autoscheduling uses self scheduling (SS) or guided self scheduling (GSS) [30]) as selected by the user, to distribute the iterations of a DOALL loop to P processors. The DOALL task: doall I = START,FINISH,INC B end doall where B is the body of the loop can be normalized to: LIMIT = floor( FINISH START) INC) 1 doall I = 1, LIMIT , 1 I = I 1) INC START B end ....
Constantine D. Polychronopoulos. On Program Restructuring, Scheduling, and Communications for Parallel Processor Systems. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, August 1986.
....long interruptions of execution. 4. 7 Implementing DOALL Tasks Consider a DOALL task, normalized from doall I = START, FINISH, INC: LIMIT = floor( FINISH START) INC) 1 doall I = 1, LIMIT , 1 I = I 1) INC START B end doall We use self scheduling (SS) or guided self scheduling (GSS) [20]) to distribute the iterations of this loop in P processors. The loop is implemented with three tasks: task S performs initialization of the iteration counter, and enqueues P instances of task L, and the corresponding activation frames, for execution. These instances of task L perform the loop ....
Constantine D. Polychronopoulos. On Program Restructuring, Scheduling, and Communications for Parallel Processor Systems. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, August 1986.
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