{"title":"SLA上下文中网格计算的基于网络的资源分配","authors":"D. Quan, D. Hsu","doi":"10.1109/GCC.2006.67","DOIUrl":null,"url":null,"abstract":"Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Network-based resource allocation for Grid Computing within an SLA context\",\"authors\":\"D. Quan, D. Hsu\",\"doi\":\"10.1109/GCC.2006.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method\",\"PeriodicalId\":280249,\"journal\":{\"name\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCC.2006.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Network-based resource allocation for Grid Computing within an SLA context
Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method