A Decision-Process Analysis of Implicit Coscheduling

ThispaperpresentsatheoreticalframeworkbasedonBayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilisticmodeling, we show that the approach presented can be applied for processes with arbitrary communication mixes. We also note that our approach can be used for deciding the additional spin times in the case of spin-yield. Finally, we present arguments for the use of a different notion of fairness than assumed by prior work.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Radha Poovendran, Peter J. Keleher, John S. Baras
• Keywords: Additional Spin Times, Arbitrary Communication Mixes, Distributed And Parallel Computing, IPPS 2000, ThispaperpresentsatheoreticalframeworkbasedonBayesian Decision Theory