Jose Alberto Aparicio, Héctor Benítez-Pérez, Luis Agustin Alvarez-Icaza Longoria, Luis Mendoza Rodríguez
{"title":"异构处理器的资源管理器","authors":"Jose Alberto Aparicio, Héctor Benítez-Pérez, Luis Agustin Alvarez-Icaza Longoria, Luis Mendoza Rodríguez","doi":"10.15837/ijccc.2024.4.6606","DOIUrl":null,"url":null,"abstract":"A resource administrator (RM) can distribute tasks processing time between heterogeneous processors is presented. Its design is based on analyzing of the possible forms of attention to pending tasks and in the previous knowledge about them. A model is proposed based on difference equations that quantify the resource allocation of each task and choose the best processor where the task can be executed. The scheme adapts to dynamic changes in the requirements or the number of tasks.","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"341 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource manager for heterogeneous processors\",\"authors\":\"Jose Alberto Aparicio, Héctor Benítez-Pérez, Luis Agustin Alvarez-Icaza Longoria, Luis Mendoza Rodríguez\",\"doi\":\"10.15837/ijccc.2024.4.6606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A resource administrator (RM) can distribute tasks processing time between heterogeneous processors is presented. Its design is based on analyzing of the possible forms of attention to pending tasks and in the previous knowledge about them. A model is proposed based on difference equations that quantify the resource allocation of each task and choose the best processor where the task can be executed. The scheme adapts to dynamic changes in the requirements or the number of tasks.\",\"PeriodicalId\":179619,\"journal\":{\"name\":\"Int. J. Comput. Commun. Control\",\"volume\":\"341 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Comput. Commun. Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15837/ijccc.2024.4.6606\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Commun. Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15837/ijccc.2024.4.6606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A resource administrator (RM) can distribute tasks processing time between heterogeneous processors is presented. Its design is based on analyzing of the possible forms of attention to pending tasks and in the previous knowledge about them. A model is proposed based on difference equations that quantify the resource allocation of each task and choose the best processor where the task can be executed. The scheme adapts to dynamic changes in the requirements or the number of tasks.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
