Abstract
In this work, we address the problem of slot selection and co-allocation for parallel jobs in distributed computing with non-dedicated resources. A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires a co-allocation of a specified number of slots starting synchronously. The challenge is that slots associated with different CPU nodes of distributed computational environments may have arbitrary start and finish points that do not match. Some existing algorithms assigns a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. In this paper, algorithms for effective slot selection of linear complexity are studied and compared with known decisions. The proposed algorithms allow overall increase in the quality of service (QoS) for each of the considered rates: job start time, finish time, runtime, CPU usage time and total cost of job execution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lee, Y.C., Wang, C., Zomaya, A.Y., Zhou, B.B.: Profit-driven scheduling for cloud services with data access awareness. J. of Parallel Distributed Computing 72(4), 591–602 (2012)
Garg, S.K., Yeo, C.S., Anandasivam, A., Buyya, R.: Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers. J. of Parallel and Distributed Computing 71(6), 732–749 (2011)
Garg, S.K., Buyya, R., Siegel, H.J.: Scheduling parallel applications on utility Grids: time and cost trade-off management. In: 32nd Australasian Computer Science Conference, pp. 151–159 (2009)
Ernemann, C., Hamscher, V., Yahyapour, R.: Economic scheduling in Grid computing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 128–152. Springer, Heidelberg (2002)
Kurowski, K., Nabrzyski, J., Oleksiak, A., et al.: Multicriteria aspects of Grid resource management. In: Nabrzyski, J., Schopf, J.M., Weglarz, J. (eds.) Grid Resource Management. State of the Art and Future Trends, pp. 271–293. Kluwer Acad. Publ. (2003)
Toporkov, V., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Composite scheduling strategies in distributed computing with non-dedicated resources. Procedia Computer Science 9, 176–185 (2012)
Toporkov, V., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Dependable strategies for job-flows dispatching and scheduling in virtual organizations of distributed computing environments. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Complex Systems and Dependability. AISC, vol. 170, pp. 289–304. Springer, Heidelberg (2012)
Cecchi, M., Capannini, F., Dorigo, A., et al.: The gLite workload management system. Journal of Physics: Conference Series 219(6), 062039 (2010)
Yu, J., Buyya, R., Ramamohanarao, K.: Workflow scheduling algorithms for Grid computing. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Distributed Computing Environments. SCI, vol. 146, pp. 173–214. Springer, Heidelberg (2008)
Aida, K., Casanova, H.: Scheduling mixed-parallel applications with advance reservations. In: Proc. of the 17th IEEE Intern. Symposium on High-Performance Distributed Computing, pp. 65–74. IEEE CS Press, New York (2008)
Elmroth, E., Tordsson, J.: A standards-based Grid resource brokering service supporting advance reservations, coallocation and cross-Grid interoperability. J. of Concurrency and Computation: Practice and Experience 25(18), 2298–2335 (2009)
Takefusa, A., Nakada, H., Kudoh, T., Tanaka, Y.: An advance reservation-based co-allocation algorithm for distributed computers and network bandwidth on qoS-guaranteed grids. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2010. LNCS, vol. 6253, pp. 16–34. Springer, Heidelberg (2010)
Moab Adaptive Computing Suite, http://www.adaptivecomputing.com/products/moab-adaptive-computing-suite.php
Toporkov, V., Toporkova, A., Bobchenkov, A., Yemelyanov, D.: Resource selection algorithms for economic scheduling in distributed systems. Procedia Computer Science 4, 2267–2276 (2011)
Toporkov, V., Yemelyanov, D., Toporkova, A., Bobchenkov, A.: Resource co-allocation algorithms for job batch scheduling in dependable distributed computing. In: Zamojski, W., Kacprzyk, J., Mazurkiewicz, J., Sugier, J., Walkowiak, T. (eds.) Dependable Computer Systems. AISC, vol. 97, pp. 243–256. Springer, Heidelberg (2011)
Toporkov, V., Bobchenkov, A., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot Selection and Co-allocation for Economic Scheduling in Distributed Computing. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 368–383. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D. (2013). Slot Selection Algorithms for Economic Scheduling in Distributed Computing with High QoS Rates. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) New Results in Dependability and Computer Systems. Advances in Intelligent Systems and Computing, vol 224. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00945-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-00945-2_42
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00944-5
Online ISBN: 978-3-319-00945-2
eBook Packages: Chemistry and Materials ScienceChemistry and Material Science (R0)