Utilizing unreliable public resources for higher profit and better SLA compliance in computing utilities

被引:6
作者
Asaduzzaman, Shah [1 ]
Maheswaran, Muthucumaru [1 ]
机构
[1] McGill Univ, Sch Comp Sci, Montreal, PQ H3A 2A7, Canada
关键词
resource management; scheduling; service level agreement; public computing utility;
D O I
10.1016/j.jpdc.2006.01.005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Computing utilities are emerging as an important part of the infrastructure for outsourcing computer services. Fundamental to outsourcing is the notion of quality of service, which is defined by service level agreements (SLAs) between the computing utilities and clients. One of the major objectives of computing utilities is to maximize their net profit. while maintaining customer loyalty. To achieve this objective, the computing utilities should meet or exceed their SLA constraints most of the time. Defining the SLAs conservatively might be one way of easily achieving these goals. However, by tuning the SLA parameters conservatively the computing utility might under utilize its resources with a resultant loss of revenue. Therefore, we can see two main issues with SLA management: designing SLAs competitively so that expected revenue for the computing utility is maximized and maintaining the operating conditions such that SLAs are satisfied with very high probability. In this paper, we show that inducting unreliable public resources into a computing utility enables more competitive SLAs while maintaining higher levels of run time compliances as well as maximizing profit. Our scheduling algorithms assume that idle cycles from public resources are available in plenty, therefore, the performance gains do not incur any additional financial cost. However, there is communication overhead when public resources from a wide area network is included. This overhead is kept to the minimum by enabling the scheduler work without any monitoring on the public resources. (C) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:796 / 806
页数:11
相关论文
共 27 条
[1]   SETI@home - An experiment in public-resource computing [J].
Anderson, DP ;
Cobb, J ;
Korpela, E ;
Lebofsky, M ;
Werthimer, D .
COMMUNICATIONS OF THE ACM, 2002, 45 (11) :56-61
[2]  
ANDRANDE N, 2004, 13 IEEE INT S HIGH P
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]  
APPLEBY K, 2001, P 7 IFIP IEEE INT S
[5]  
ARON M, 2000, P ACM SIGMETRICS
[6]  
BOOTH D, 2003, WEB SERVICES ARCHITE
[7]   SCHEDULING WITH EARLIEST START AND DUE DATE CONSTRAINT [J].
BRATLEY, P ;
ROBILLAR.P ;
FLORIAN, M .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04) :511-&
[8]  
BRAYANRD R, 2002, 15 INT C OP ARCH NET
[9]  
Chase J., 2001, 18 ACM S OP SYST PRI
[10]  
Czajkowski K, 2002, LECT NOTES COMPUT SC, V2537, P153