Supporting the OpenMP programming interface on teamster-g

  • Authors:

  • Tyng-Yeu Liang;Shih-Hsien Wang;Jyh-Biau Chang;Ce-Kuen Shieh

  • Affiliations:

  • Department of Electrical Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan, R.O.C;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C;Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C

  • Venue:
  • GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

An easy programming interface is a key factor to affect user's desire to exploit distributed resources for resolving their problems. Recently, much effort has been put into enabling MPI, RPC, and RMI for grid computing. However, these programming interfaces are not as easy as shared memory. To simplify the programming on the grid environment, we recently have developed a grid-enabled software DSM system called Teamster-G. However, users still must be familiar with the multithreaded programming toolkit and aware of the adopted consistency protocol. To further minimize user's programming load, we are devoted to supporting the OpenMP programming interface on Teamster-G in this study. Furthermore, we propose a novel loop scheduling algorithm calledProfiled Multiprocessor Scheduling (PMS) for addressing the problem of load balance. We will describe the design and implementation of the OpenMP interface on Teamster-G, and discuss the preliminary performance of the OpenMP programs in this paper.