• 沒有找到結果。

A Performance-Based Parallel Loop Self-Scheduling on Grid Environments

N/A
N/A
Protected

Academic year: 2022

Share "A Performance-Based Parallel Loop Self-Scheduling on Grid Environments"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: A Performance-Based Parallel Loop Self-Scheduling on Grid Environments 作者: Wen-Chung Shih;Chao-Tung Yang;S. S. Tseng

貢獻者: Department of Information Science and Applications

(2)

關鍵詞: Parallel loop scheduling;Performance;Self-scheduling;Grid computing;Globus Toolkit

日期: 2005

上傳時間: 2009-11-30T08:03:24Z 出版者: Asia University

摘要: The effectiveness of loop self-scheduling schemes has been shown on traditional multiprocessors in the past and computing clusters in the recent years. However, parallel loop scheduling has not been widely applied to computing grids, which are characterized by heterogeneous resources and dynamic environments. In this paper, a performance- based approach, taking the two characteristics above into consideration, is proposed to schedule parallel loop iterations on grid environments.

Furthermore, we use a parameter, SWR, to estimate the proportion of the workload which can be scheduled statically, thus alleviating the effect of irregular workloads. Experimental results on a grid testbed show that the proposed approach can reduce the completion time for applications with regular or irregular workloads. Consequently, we claim that parallel loop scheduling can benefit applications on grid

environments.

參考文獻

相關文件

Parallel dual coordinate descent method for large-scale linear classification in multi-core environments. In Proceedings of the 22nd ACM SIGKDD International Conference on

• Parallel lines (not parallel to the projection plan) on the object converge at a single point in the projection (the vanishing point). • Drawing simple perspectives by hand uses

In this chapter, a dynamic voltage communication scheduling technique (DVC) is proposed to provide efficient schedules and better power consumption for GEN_BLOCK

In this project, we developed an irregular array redistribution scheduling algorithm, two-phase degree-reduction (TPDR) and a method to provide better cost when computing cost

(1988), “An Improved Branching Sheme for the Branch Bound Procedure of Scheduling n Jobs on m Parallel Machines to Minimize Total Weighted Flowtime,” International Journal of

This study conducted DBR to the production scheduling system, and utilized eM-Plant to simulate the scheduling process.. While comparing the original scheduling process

In this paper, a decision wandering behavior is first investigated secondly a TOC PM decision model based on capacity constrained resources group(CCRG) is proposed to improve

The GCA scheduling algorithm employs task prioritizing technique based on CA algorithm and introduces a new processor selection scheme by considering heterogeneous communication