G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz
{"title":"资源消耗估算和规划","authors":"G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz","doi":"10.1109/CONIELECOMP.2007.78","DOIUrl":null,"url":null,"abstract":"An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.","PeriodicalId":288478,"journal":{"name":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GRID Resource Consumption Estimates and Planning\",\"authors\":\"G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz\",\"doi\":\"10.1109/CONIELECOMP.2007.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.\",\"PeriodicalId\":288478,\"journal\":{\"name\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2007.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2007.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.