Gargi Dasgupta, K. Dasgupta, A. Purohit, B. Viswanathan
{"title":"QoS- graf:一种基于QoS的网格资源分配框架","authors":"Gargi Dasgupta, K. Dasgupta, A. Purohit, B. Viswanathan","doi":"10.1109/IWQOS.2006.250482","DOIUrl":null,"url":null,"abstract":"In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"QoS-GRAF: A Framework for QoS based Grid Resource Allocation with Failure provisioning\",\"authors\":\"Gargi Dasgupta, K. Dasgupta, A. Purohit, B. Viswanathan\",\"doi\":\"10.1109/IWQOS.2006.250482\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines\",\"PeriodicalId\":248938,\"journal\":{\"name\":\"200614th IEEE International Workshop on Quality of Service\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"200614th IEEE International Workshop on Quality of Service\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQOS.2006.250482\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"200614th IEEE International Workshop on Quality of Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2006.250482","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
QoS-GRAF: A Framework for QoS based Grid Resource Allocation with Failure provisioning
In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines