a queuing network model for minimizing the total makespan of computational grids：排队网络模型计算网格的总完工时间最小化.pdfVIP

Computers and Electrical Engineering 38 (2012) 827–839 Contents lists available at SciVerse ScienceDirect Computers and Electrical Engineering journal homepage: /locate/compeleceng A queuing network model for minimizing the total makespan of computational grids q Saeed Parsa a, Reza Entezari-Maleki b,⇑ a Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran b Department of Computer Engineering, Sharif University of Technology, Tehran, Iran a r t i c l e i n f o a b s t r a c t Article history: This paper offers a mathematical solution based on queuing theory and a generalized sto- Received 25 August 2010 chastic Petri net model to minimize the total makespan of the grid computing environ- Received in revised form 19 March 2012 ments. A grid manager could minimize the total makespan through cautious distribution Accepted 19 March 2012 of subtasks to the grid resources. Subtask arrival rates depend on the arrival rate of the grid Available online 14 April 2012 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 lon-