Optimal partitioning of randomly generated distributed programs
IEEE Transactions on Software Engineering
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Dynamic partitioning in a transputer environment
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Static Assignment of Stochastic Tasks Using Majorization
IEEE Transactions on Computers
SOS: synthesis of application-specific heterogeneous multiprocessor systems
Readings in hardware/software co-design
Utility Analysis of Parallel Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
| Hi-index | 0.01 |
B. Indurkhya et al. (1986) concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor or distributes the modules as evenly as possible among all processors. Their analysis rests heavily on the approximation that equates the expected maximum of a set of independent random variables with the set's maximum expectation. The author strengthens this result by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is found that additional rigor leads to a different characterization of the optimality points. The author also shows that under a rigorous analysis one is led to different conclusions in the general P-processor case than those reached using B. Indurkhya et al.'s approximation.