K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....information transparent, performance tuning is extremely difficult. P 3 T at compile time computes a set of performance parameters each of which reflects a different performance aspect. In the following all P 3 T performance parameters are described. 4. 1 Work Distribution It is well known [8, 6, 44, 42, 30, 40, 13, 41, 34, 25] that the work distribution has a strong influence on the cost performance ratio of a parallel system. An uneven work distribution may lead to a significant reduction in a program s performance. Therefore, providing both programmer and parallelizing compiler with a work distribution parameter for ....

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

....The key functionality of P 3 T is devoted to compute a set of performance parameters at compile time: ffl Work Distribution The work distribution parameter describes how well the computations of a program are distributed over the set of available processors. As shown by numerous researchers [15, 13, 80, 68, 49, 62, 22, 67, 53, 34], work distribution has a strong influence on the cost performance ratio of a multiprocessor system. An uneven work distribution CHAPTER 3. P 3 T 25 may lead to a significant reduction in a program s performance. Therefore, providing both programmer and compiler with a work distribution ....

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

....information transparent, performance tuning is extremely difficult. P 3 T at compile time computes a set of performance parameters each of which reflects a different performance aspect. In the following all P 3 T performance parameters are described. 4. 1 Work Distribution It is well known [7, 5, 37, 35, 27, 33, 11, 34, 30, 23] that the work distribution has a strong influence on the cost performance ratio of a parallel system. An uneven work distribution may lead to a significant reduction in a program s performance. Therefore, providing both programmer and parallelizing compiler with a work distribution parameter for ....

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

....instantiations for which they own the corresponding sub domain. This naturally specifies the amount of work to be done by each processor and consequently the overall work distribution of a parallel program. Therefore domain decomposition inherently implies a work distribution. It is well known ([8, 5, 3, 28, 26, 18, 22, 6, 25, 19, 13]) that the work distribution has a strong influence on the cost performance ratio of a parallel system. An uneven work distribution may lead to a significant reduction in a program s performance. Therefore providing both programmer and parallelizing compiler with a work distribution parameter ....

....assigns all 2016 iterations to the first processor. Therefore the work distribution of this example is far from being perfect. Optimal work distribution is attained if each processor would assign a new value to W (I) for 252 ( 2016 8) distinct instantiations of S. Much of previous research ([3, 22, 6, 25, 19]) concentrates on monitoring or estimating work distribution and close derivatives such as processor utilization, execution profile and average parallelism at the machine level. Traditional work distribution analysis distorts results in the following cases: ffl Array replication ( 32] is a ....

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

....instantiations for which they own the corresponding sub domain. This naturally specifies the amount of work to be done by each processor and consequently the overall work distribution of a parallel program. Therefore domain decomposition inherently implies a work distribution. It is well known ([8, 5, 3, 28, 26, 17, 21, 6, 25, 18, 12]) that the work distribution has a strong influence on the cost performance ratio of a parallel system. An uneven work distribution may lead to a significant reduction in a program s performance. Therefore providing both programmer and parallelizing compiler with a work distribution parameter for ....

....assigns all 2016 iterations to the first processor. Therefore the work distribution of this example is far from being perfect. Optimal work distribution is attained if each processor would assign a new value to W (I) for 252 ( 2016 8) distinct instantiations of S. Much of previous research ([3, 21, 6, 25, 18]) concentrates on monitoring or estimating work distribution and close derivatives such as processor utilization, execution profile and average parallelism at the machine level. Traditional work distribution analysis distorts results in the following cases: ffl Array replication ( 32] is a ....

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

No context found.

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

No context found.

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

No context found.

K.-H. Park. Dynamic Processor Partitioning for Multiprogrammed Multiprocessor Systems. PhD thesis, Vanderbilt University, Nashville, TN, Aug 1990.

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