On the Execution of Programs by Many Processors
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Static Assignment of Stochastic Tasks Using Majorization
IEEE Transactions on Computers
An approximation of the processing time for a random graph model of parallel computation
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Integrated Performance Models for SPMD Applications and MIMD Architectures
IEEE Transactions on Parallel and Distributed Systems
Integrated Performance Models for SPMD Applications and MIMD Architectures
IEEE Transactions on Parallel and Distributed Systems
Predicting the execution time of grid workflow applications through local learning
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Two experiments with application-level quality of service on the EGEE grid
Proceedings of the 2nd workshop on Grids meets autonomic computing
Future Generation Computer Systems
| Hi-index | 0.00 |
We define and evaluate two policies (NA-policy, A-policy) for parallel execution of program tree structures. Via a probabilistic model we analytically determine, for each policy, the Laplace-Stieltjes transform for the tree processing time distribution. The acceleration of the program execution time achieved when adding processors to a single processor environment, is computed and plotted for each policy.