Loading...

A queuing network model for minimizing the total makespan of computational grids

Parsa, S ; Sharif University of Technology | 2012

1022 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.compeleceng.2012.03.011
  3. Publisher: 2012
  4. Abstract:
  5. This paper offers a mathematical solution based on queuing theory and a generalized stochastic Petri net model to minimize the total makespan of the grid computing environments. A grid manager could minimize the total makespan through cautious distribution of subtasks to the grid resources. Subtask arrival rates depend on the arrival rate of the grid tasks submitted to the grid manager, local tasks directly submitted to the grid resources and the processing speed of the resources. Modeling the grid environment using queuing network, the steady state analysis of the network will result in the mean response time of the resources. Therefore, the total makespan could be minimized by minimizing the longest mean response time of the resources. The accuracy of the values obtained for the subtasks arrival rates at each of the grid resources from solving the corresponding queuing network could be further evaluated by steady state analysis of the generalized stochastic Petri net modeling the same grid environment
  6. Keywords:
  7. Arrival rates ; Computational grids ; Generalized stochastic petri net models ; Generalized Stochastic Petri nets ; Grid computing environment ; Grid environments ; Grid resource ; Makespan ; Mathematical solutions ; Mean response time ; Processing speed ; Queuing network ; Queuing network model ; Queuing theory ; Steady-state analysis ; Subtasks ; Computer systems ; Management ; Managers ; Queueing networks ; Queueing theory ; Scheduling algorithms ; Grid computing
  8. Source: Computers and Electrical Engineering ; Volume 38, Issue 4 , 2012 , Pages 827-839 ; 00457906 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0045790612000511