{"title":"General non-approximability results in presence of hierarchical communications","authors":"R. Giroudeau, J. König","doi":"10.1109/ISPDC.2004.27","DOIUrl":null,"url":null,"abstract":"We investigate the problem of minimizing the makespan (resp. the sum of the completion time) for the multiprocessor scheduling problem in presence of hierarchical communications. We consider a model with two levels of communication: interprocessor and intercluster. The processors are grouped in connected clusters. We propose general non-approximability results for the case where all the tasks of the precedence graph have unit execution times, where the multiprocessor is composed of an unrestricted number of machines with /spl lscr/ /spl ges/ 4 identical processors each.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"42 1","pages":"312-319"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"骈文研究","FirstCategoryId":"1092","ListUrlMain":"https://doi.org/10.1109/ISPDC.2004.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We investigate the problem of minimizing the makespan (resp. the sum of the completion time) for the multiprocessor scheduling problem in presence of hierarchical communications. We consider a model with two levels of communication: interprocessor and intercluster. The processors are grouped in connected clusters. We propose general non-approximability results for the case where all the tasks of the precedence graph have unit execution times, where the multiprocessor is composed of an unrestricted number of machines with /spl lscr/ /spl ges/ 4 identical processors each.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
