Location of Repository

By 

Abstract

analgorithmtotakeadvantageoftheparallelismacrossaloopitera- computationtime.Sincesuchcommunicationcostsrelyontheamount oftransfereddata,thisoverheadbecomesuncertainaswell.Wepropose tionwhilehidingthecommunicationoverhead.Theresultingschedule ingacyclicdata-owgraphwhosenodecomputationtimescanberep resentedbyrandomvariables.Acommunicationcostissueisalsocon canproducedierentamountofdatadependingontheprobabilityofits sideredasanotheruncertainfactorinwhicheachnodefromthegraph Abstract.Thispaperpresentsanewmethodologyforstaticallyschedul

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.5258
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.huji.ac.il/%7Efe... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.