{"title":"分布式系统中用于负载均衡的任务迁移算法","authors":"Jea-Cheoul Ryou, Johnny S. K. Wong","doi":"10.1109/HICSS.1989.48117","DOIUrl":null,"url":null,"abstract":"Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A task migration algorithm for load balancing in a distributed system\",\"authors\":\"Jea-Cheoul Ryou, Johnny S. K. Wong\",\"doi\":\"10.1109/HICSS.1989.48117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<<ETX>>\",\"PeriodicalId\":325958,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.48117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.48117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A task migration algorithm for load balancing in a distributed system
Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<>