Task dispatching approach to reduce the number of waiting tasks in grid environments
In this paper, a mathematical solution for reducing the mean number of the tasks waiting to be processed in a grid environment is proposed. The approach uses queuing theory and models the grid environment in the form of an open queuing network (QN). Applying the steady state analysis to the proposed QN and minimizing the mean number of waiting tasks within the grid environment, an equality and inequality system is obtained. Solving the equality and inequality system, subtasks arrival rates at each of the resources within the grid environment can be estimated. Applying the obtained subtasks arrival rates at each of the grid resources, the mean number of the waiting tasks in the grid environment could be minimized.
To evaluate the results obtained from the proposed QN and provide a graphical representation of the grid environment a formal description of the environment in terms of generalized stochastic Petri nets (GSPNs) is presented. Steady state analyzing of the GSPN model and finding the subtask dispatching weights at each of the grid resources, subtask arrival rates can be estimated. Comparing the results obtained from two proposed approaches shows that the subtasks arrival rates achieved from QNs and GSPNs are the same.
KeywordsGrid environment Waiting tasks Queuing networks Generalize stochastic Petri nets
Unable to display preview. Download preview PDF.
- 1.Foster I, Kesselman C (2003) The grid 2: blueprint for a new computing infrastructure. Morgan-Kauffman, San Mateo Google Scholar
- 5.Dai YS, Levitin G (2006) Reliability and performance of tree-structured grid services. IEEE Trans Reliab 55(2) Google Scholar
- 6.Levitin G, Dai YS, Ben-Haim H (2006) Reliability and performance of star topology grid service with precedence constraints on subtask execution. IEEE Trans Reliab 55(3) Google Scholar
- 8.Magoules F, Nguyen TMH, Yu L (2009) Grid resource management: towards virtual and services compliant grid computing. CRC Press/Taylor & Francis, Boca Raton Google Scholar
- 12.Iosup A, Epema DHJ, Franke C, Papaspyrou A, Schley L, Song B, Yahyapour R (2006) On grid performance evaluation using synthetic workloads. In: 12th international workshop on job scheduling strategies for parallel processing, France, 26 June 2006, pp. 232–255 Google Scholar
- 13.Lai Zh, Yang J, Shan H (2003) A resource allocation method in the neural computation platform. In: Second international workshop on grid and cooperative computing, China, December 7–10, 2003, pp. 166–169 Google Scholar
- 16.Van der Aalst WMP (2005) Petri net based scheduling. J OR Spectr 18(4):219–229 Google Scholar
- 19.Cooper RB (1981) Introduction to queueing theory, 2nd edn. Elsevier/North-Holland, Amsterdam Google Scholar
- 20.Ajmone Marsan M, Balbo G, Conte G, Donatelli S, Franceschinis G (1995) Modeling with generalized stochastic Petri nets. Wiley, New York Google Scholar
- 24.Li L, FangChun Y (2006) Modeling and performance analysis of a priority-based scheduling scheme in service grid. In: Proceedings of the fifth international conference on grid and cooperative computing, China, October 21–23, 2006, pp. 327–330 Google Scholar
- 25.Han Y, Jiang Ch, Luo X (2005) Resource scheduling model for grid computing based on sharing synthesis of Petri net. In: The 9th international conference on computer supported cooperative work in design proceedings, UK, May 24–26, 2005, pp. 367–372 Google Scholar
- 26.Han Y, Luo X (2006) Modeling and performance analysis of grid task scheduling based on composition and reduction of Petri nets. In: Proceedings of the fifth international conference on grid and cooperative computing, IEEE, China, October 21–23, 2006, pp. 331–334 Google Scholar
- 29.Horst R, Pardalos PM, Thoai NV (2002) Introduction to global optimization (nonconvex optimization and its applications). Springer, Berlin Google Scholar
- 30.http://www.lindo.com/ – Lingo section