The Community for Technology Leaders
2013 42nd International Conference on Parallel Processing (2007)
Xi'an, China
Sept. 10, 2007 to Sept. 14, 2007
ISSN: 0190-3918
ISBN: 0-7695-2933-X
pp: 42
G. Sabin , Ohio State University, USA
P. Sadayappan , Ohio State University, USA
P. Balaji , Argonne National Laboratory, USA
M. Islam , Ohio State University, USA
Quality of service (QoS) mechanisms allowing users to request for turn-around time guarantees for their jobs have recently generated much interest. In our previous work we had designed a framework, QoPS, to allow for such QoS. This framework provides an admission control mechanism that only accepts jobs whose requested deadlines can be met and, once accepted, guarantees these deadlines. However, the framework is completely blind to the revenue these jobs can fetch for the supercomputer center. By accepting a job, the super-computer center might relinquish its capability to accept some future arriving (and potentially more expensive) jobs. In other words, while each job pays an explicit price to the system for running it, the system may also be viewed as paying an implicit opportunity cost by accepting the job. Thus, accepting a job is profitable only when the job?s price is higher than its opportunity cost. In this paper we analyze the impact such opportunity cost can have on the overall revenue of the supercomputer center and attempt to minimize it through predictive techniques. Specifically, we propose two extensions to QoPS, Value-aware QoPS (VQoPS) and Dynamic Value-aware QoPS (DVQoPS), to provide such capabilities. We present detailed analysis of these schemes and demonstrate using simulation that they not only achieve several factors improvement in system revenue, but also good service differentiation as a much desired side-effect.
G. Sabin, P. Sadayappan, P. Balaji, M. Islam, "Analyzing and Minimizing the Impact of Opportunity Cost in QoS-aware Job Scheduling", 2013 42nd International Conference on Parallel Processing, vol. 00, no. , pp. 42, 2007, doi:10.1109/ICPP.2007.16
99 ms
(Ver 3.3 (11022016))