• 沒有找到結果。

A hybrid parallel loop scheduling scheme on grid environments

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "A hybrid parallel loop scheduling scheme on grid environments"

Copied!
1
0
0

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

立即下載 ( 1 頁 )

全文

(1)

題名: A hybrid parallel loop scheduling scheme on grid environments 作者: W. C. Shih;C. T. Tung;S.S. Tseng

貢獻者: Department of Information Science and Applications

關鍵詞: Loop scheduling;self-scheduling;grid computing;Globus;NWS 日期: 2005

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

摘要: Effective loop-scheduling can significantly reduce the total execution time of a program on grid environments, especially for loop-intensive applications. This paper describes a two-phased method, named HPLS (Hybrid Parallel Loop Scheduling), to dynamically schedule loop

iterations of a program on grid environments. In the first phase, most of the workload is dispatched to each node for execution according to its performance. Then, some well-known self-scheduling scheme is utilized to schedule the remaining workload. Experimental results showed that in most cases our approach could produce more efficient scheduling than previous schemes on our testbed grid. In addition, the results suggest that our approach is suitable for loop scheduling on grid environments.

參考文獻

立即下載 ( DOC - 1 頁 - 39.50 KB )

相關文件

Illustrative Example 1

Take a time step on current grid to update cell averages of volume fractions at next time step (b) Interface reconstruction. Find new interface location based on volume

Falling Liquid Drop Problem

Take a time step on current grid to update cell averages of volume fractions at next time step (b) Interface reconstruction.. Find new interface location based on volume

LOCALIZATION AND VORTICES Kazutoshi Ohta Meijigakuin University

The localization plays important role in supersymmetric (exact solvable) field theory. A special Wilson loop is also solvable by

Chapter 30

In section29-8,we saw that if we put a closed conducting loop in a B and then send current through the loop, forces due to the magnetic field create a torque to turn the loopÆ

Optimization and Machine Learning

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

On the uniform edge-partition of a tree

The min-max and the max-min k-split problem are defined similarly except that the objectives are to minimize the maximum subgraph, and to maximize the minimum subgraph respectively..

Michael Tsai2017/3/28 SORTING

When an algorithm contains a recursive call to itself, we can often describe its running time by a recurrenceequation or recurrence, which describes the overall running time on

中 華 大 學

In this chapter, we have presented two task rescheduling techniques, which are based on QoS guided Min-Min algorithm, aim to reduce the makespan of grid applications in batch