MPEFT:一种针对异构计算系统中工作流的最大完成时间最小化启发式调度算法

{"title":"MPEFT:一种针对异构计算系统中工作流的最大完成时间最小化启发式调度算法","authors":"D. Sirisha, S. Prasad","doi":"10.1007/s42514-022-00116-w","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":29895,"journal":{"name":"CCF Transactions on High Performance Computing","volume":"1 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"MPEFT: a makespan minimizing heuristic scheduling algorithm for workflows in heterogeneous computing systems\",\"authors\":\"D. Sirisha, S. Prasad\",\"doi\":\"10.1007/s42514-022-00116-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":29895,\"journal\":{\"name\":\"CCF Transactions on High Performance Computing\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2022-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CCF Transactions on High Performance Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s42514-022-00116-w\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CCF Transactions on High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s42514-022-00116-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}