A Decision-Process Analysis of Implicit Coscheduling

Simple item page
dc.contributor.advisorBaras, John S.en_US
dc.contributor.authorPoovendran, R.en_US
dc.contributor.authorKeleher, P.en_US
dc.contributor.authorBaras, John S.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:10:04Z
dc.date.available2007-05-23T10:10:04Z
dc.date.issued2000en_US
dc.description.abstractThis paper presents a theoretical framework based on Bayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilistic modeling, 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.<p><i>International Conference on Parallel and Distributed Computing</i>en_US
dc.format.extent60416 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6169
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2000-34en_US
dc.relation.ispartofseriesCSHCN; TR 2000-12en_US
dc.subjectdistributed computingen_US
dc.subjectco-schedulingen_US
dc.subjectdecision analysisen_US
dc.subjectGlobal Communication Systemsen_US
dc.titleA Decision-Process Analysis of Implicit Coschedulingen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2000-34.pdf
Size:
59 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports