Methods of resource management in problem-oriented computing environment
- 56 Downloads
One of the important classes of computational problems is problem-oriented workflow applications executed in distributed computing environment. A problem-oriented workflow application can be represented by a directed graph whose vertices are tasks and arcs are data flows. For a problem-oriented workflow application, we can get a priori estimates of the task execution time and the amount of data to be transferred between the tasks. A distributed computing environment designed for the execution of such tasks in a certain subject domain is called problem-oriented environment. To efficiently use resources of the distributed computing environment, special scheduling algorithms are applied. Nowadays, a great number of such algorithms have been proposed. Some of them (like the DSC algorithm) take into account specific features of problem-oriented workflow applications. Others (like Min–Min algorithm) take into account many-core structure of nodes of the computational network. However, none of them takes into account both factors. In this paper, a mathematical model of problem-oriented computing environment is constructed, and a new problem-oriented scheduling (POS) algorithm is proposed. The POS algorithm takes into account both specifics of the problem-oriented jobs and multi-core structure of the computing system nodes. Results of computational experiments comparing the POS algorithm with other known scheduling algorithms are presented.
Unable to display preview. Download preview PDF.
- 2.Foster, I. and Kesselman, C., The Grid. Blueprint for a New Computing Infrastructure, San Francisco: Morgan Kaufman, 1999.Google Scholar
- 3.Foster, I., Roy, A., and Sander, V., A quality of service architecture that combines resource reservation and application adaptation, Proc. of the 8th Int. Workshop on Quality of Service, Pittsburgh, 2000, pp. 181–188.Google Scholar
- 5.Jennings, R., Cloud Computing with the Windows Azure Platform, Indianapolis: Wiley, 2009.Google Scholar
- 6.Marshall, P., Keahey, K., and Freeman, T., Improving utilization of infrastructure clouds, Proc. of the IEEE/ACM Int. Symp. on Cluster, Cloud and Grid Computing (CCGrid 2011), Newport Beach, CA, 2011, pp. 205–214.Google Scholar
- 7.Berman, F., Wolski, R., et al., Application-level scheduling on distributed heterogeneous networks, Proc. of the ACM/IEEE Conf. on Supercomputing, Pittsburgh, 1996, paper no. 39.Google Scholar
- 11.Zhu, Y. and Ni, L.M., A Survey on grid scheduling systems, Technical Report no. SJTU_CS_TR_200309001, Dept. of Computer Science and Engineering, Shanghai Jiao Tong Univ., 2013.Google Scholar
- 12.Belhajjame, K., Vargas-Solar, G., and Collet, C., A flexible workflow model for process-oriented applications, Proc. of the Second Int. Conf. on Web Informa-tion Systems Engineering (WISE'01), Kyoto, 2001, vol. 1, no. 1, pp. 72–80.Google Scholar
- 13.Dong, F. and Akl, S.G., Scheduling algorithms for grid computing: State of the art and open problems, Technical Report no. 2006-504, Queen’s University, Canada, 2006.Google Scholar
- 14.Kim, S.J., A general approach to multiprocessor scheduling, Report TR-88-04, Dept. of Computer Science, University of Texas at Austin, 1988.Google Scholar
- 16.Yu, J., Buyya, R., and Ramamohanarao, K., Workflow scheduling algorithms for grid computing, in Metaheuristics for Scheduling in Distributed Computing Environments, ser. Studies in Computational Intelligence, Xhafa, F. and Abraham, A., Eds., Berlin: Springer, 2008, vol. 146, pp. 173–214.Google Scholar
- 18.Sarkar, V., Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, Cambridge, MA: MIT Press, 1989.Google Scholar
- 19.Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computations), St.-Petersburg: BKhV-Peterburg, 2002.Google Scholar