{"title":"大型多计算机系统的动态分区","authors":"Hans-Ulrich Heiß","doi":"10.1109/MPCS.1994.367051","DOIUrl":null,"url":null,"abstract":"We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"50 1","pages":"413-417"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Dynamic partitioning of large multicomputer systems\",\"authors\":\"Hans-Ulrich Heiß\",\"doi\":\"10.1109/MPCS.1994.367051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.<<ETX>>\",\"PeriodicalId\":64175,\"journal\":{\"name\":\"专用汽车\",\"volume\":\"50 1\",\"pages\":\"413-417\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"专用汽车\",\"FirstCategoryId\":\"1087\",\"ListUrlMain\":\"https://doi.org/10.1109/MPCS.1994.367051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"专用汽车","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.1109/MPCS.1994.367051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic partitioning of large multicomputer systems
We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
