A chronological history-based execution time estimation model for embarrassingly parallel applications on grids

  • Authors:
  • Chao-Tung Yang;Po-Chi Shih;Cheng-Fang Lin;Ching-Hsien Hsu;Kuan-Ching Li

  • Affiliations:
  • High Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, ROC;High Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, ROC;High Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, ROC;Parallel and Distributed Processing Center, Department of Computer Science and Information Management, Providence University, Taichung, Taiwan, ROC

  • Venue:
  • ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to identify and schedule jobs that are suitable for determined resources, an execution time estimation model is required. In this paper, it is described a Chronological history-based execution time estimation model to predict current execution time, according to the previous execution results. We built a heterogeneous computational Grid environment using Globus Toolkit, and our research is focused in Grid computing environments and to execute parallel jobs on multiple resources by measuring its accuracy. The experimental results shown that our model can accurately predict the execution time of embarrassingly parallel applications.