C. D. Polychronopoulos. On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems. PhD thesis, University of Illinois, August 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Exploiting Parallelism In Setl Programs - Jozwiak (1993) (Correct)
....that the extensions necessary to accommodate multiple processors, concurrently executing separate Parallel ISETL expressions, at the point of garbage collection invocation are trivial. For more information of the ramifications of the scheduling disciplines used or not used in the code above, see [8, 10, 9, 11, 12, 13]. To see that these parallelization efforts in the garbage collector were indeed fruitful, the chapter on performance evaluation includes myriad timings. Comparisons are made between the execution times of various ISETL codes under sequential and concurrent runtime garbage collection systems. ....
C. D. Polychronopoulos. On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems. PhD thesis, University of Illinois, August 1986.
Interprocedural Transformations for Parallel Code Generation - Hall, Kennedy, McKinley (1991) (18 citations) (Correct)
....of a code segment, a simple machine model is used. This model includes the cost of arithmetic and conditional statements as well as operations such as parallel loops, sequential loops, and procedure call overhead. Both Polychronopoulos and Sarkar have used similar machine models in their research [33, 34]. 5.1 Machine Model and Performance Estimation A cost model is needed to compare the costs of various execution options. First, a method for estimating the cost of executing a sequential loop is presented. Consider the following perfect loop nest, where ub 1 , ubn are constants and B is ....
....return h ; T i from interprocedural transformation, the transformations are performed and no further optimization of that call sequence is attempted. Additional candidates for optimization may be created by using judicious code motion and loop coalescing (combining nested loops into a single loop)[33]. BestCost Algorithm BestCost considers L = fl 1 ; l ng a perfect loop nest with body S = fs 1 ; s p g, where l n is the innermost loop and L may be the empty set ; S consists of at least one call and may also contain other statements such as loops, control flow, and ....
C. Polychronopoulos. On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems. PhD thesis, Dept. 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