• 沒有找到結果。

Dynamic partitioning of loop iterations on heterogeneous PC clusters

N/A
N/A
Protected

Academic year: 2022

Share "Dynamic partitioning of loop iterations on heterogeneous PC clusters"

Copied!
2
0
0

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

全文

(1)

Author(s): Yang, CT (Yang, Chao-Tung); Shih, WC (Shih, Wen-Chung); Tseng, SS (Tseng, Shian-Shyong)

Title: Dynamic partitioning of loop iterations on heterogeneous PC clusters Source: JOURNAL OF SUPERCOMPUTING, 44 (1): 1-23 APR 2008 Language: English

Document Type: Article

Author Keywords: parallel loops; self-scheduling; cluster computing; MPI programming;

heterogeneous; PC clusters

KeyWords Plus: PRACTICAL SCHEDULING SCHEME; PARALLEL; ENVIRONMENTS Abstract: Loop partitioning on parallel and distributed systems has been a critical problem.

Furthermore, it becomes more difficult to deal with on the emerging heterogeneous PC cluster environments. In the past, some loop self-scheduling schemes have been proposed to be applicable to heterogeneous cluster environments. In this paper, we propose a performance- based approach, which partitions loop iterations according to the performance ratio of cluster nodes. To verify the proposed approach, a heterogeneous cluster is built, and three types of application programs are implemented to be executed in this testbed. Experimental results show that the proposed approach performs better than traditional schemes.

Addresses: [Yang, Chao-Tung] Tunghai Univ, Dept Comp Sci & Informat Engn, High

Performance Comp Lab, Taichung 40704, Taiwan; [Shih, Wen-Chung; Tseng, Shian-Shyong]

Natl Chiao Tung Univ, Dept Comp & Informat Sci, Hsinchu 30010, Taiwan; [Tseng, Shian- Shyong] Asia Univ, Dept Informat Sci & Applicat, Taichung 41354, Taiwan

Reprint Address: Yang, CT, Tunghai Univ, Dept Comp Sci & Informat Engn, High Performance Comp Lab, Taichung 40704, Taiwan.

E-mail Address: [email protected]; [email protected]; [email protected] Cited References: BAKER M, 1999, SOFTWARE PRACT EXPER, V29, P551.

BEAUMONT O, 2005, IEEE T PARALL DISTR, V16, P207.

BENNETT BH, 2000, P IEEE AER C, V4, P389.

BOHN CA, 2002, FUTURE GENER COMP SY, V18, P389.

CHENG KW, 2004, P 2004 IEEE INT S PA, P409.

CHRONOPOULOS AT, 2001, P 3 IEEE INT C CLUST, P282.

HUMMEL SF, 1992, COMMUN ACM, V35, P90.

LI H, 1993, P 1993 INT C PAR PRO, V2, P140.

POLYCHRONOPOULO.CD, 1987, IEEE T COMPUT, V36, P1425.

POST E, 2001, P 5 INT C EXH HIGH P.

SHIH WC, 2007, J SUPERCOMPUT, V41, P247, DOI 10.1007/s11227-007-0115-7.

STERLING T, 2002, BEOWULF CLUSTER COMP.

TANG P, 1986, P 1986 INT C PAR PRO, P528.

(2)

TZEN TH, 1993, IEEE T PARALL DISTR, V4, P87.

YANG CT, 2004, J INF SCI ENG, V20, P263.

YANG CT, 2005, J SUPERCOMPUT, V34, P315.

YANG CT, 2007, PARALLEL COMPUT, V33, P467, DOI 10.1016/j.parco.2007.01.003.

Cited Reference Count: 17 Times Cited: 5

Publisher: SPRINGER

Publisher Address: VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS

ISSN: 0920-8542

DOI: 10.1007/s11227-007-0146-0

29-char Source Abbrev.: J SUPERCOMPUT ISO Source Abbrev.: J. Supercomput.

Source Item Page Count: 23

Subject Category: Computer Science, Hardware & Architecture; Computer Science, Theory

& Methods; Engineering, Electrical & Electronic ISI Document Delivery No.: 267QE

參考文獻

相關文件

Based on “The Performance Indicators for Hong Kong Schools – Evidence of Performance” published in 2002, a suggested list of expected evidence of performance is drawn up for

Then, a visualization is proposed to explain how the convergent behaviors are influenced by two descent directions in merit function approach.. Based on the geometric properties

In this paper, we have studied a neural network approach for solving general nonlinear convex programs with second-order cone constraints.. The proposed neural network is based on

In summary, the main contribution of this paper is to propose a new family of smoothing functions and correct a flaw in an algorithm studied in [13], which is used to guarantee

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Æ

• To consider the purpose of the task-based approach and the inductive approach in the learning and teaching of grammar at the secondary level.. • To take part in demonstrations

Since all nodes in a cluster need to send data to the cluster head, we use the idea of minimum spanning tree (MST for short) to shorten the total transmission distance to reduce

The main objective of this article is to investigate market concentration ratio and performance influencing factors analysis of Taiwan international tourism hotel industry.. We use