Application of clustering and factorisation tree techniques for parallel solution of sparse network equations

Białek, Janusz; Grey, David

doi:10.1049/ip-gtd:19941289

Cited by 5 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Only the nodes on the dynamic critical path need consider the 5 different cases. There are O(logN) [15] nodes on the critical path of DAG and O(logN) edges along the critical path. Each time assign these nodes to 4 special processors and compare 5 different cases, trying inserting or duplication strategies.…”

Section: Hdcpd Algorithmmentioning

confidence: 99%

Directed Acyclic Task Graph Scheduling for Heterogeneous Computing Systems by Dynamic Critical Path Duplication Algorithm

Yin

Jiang

et al. 2009

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

This paper addresses the static scheduling of a directed acyclic task graph (DAG) on a heterogeneous, bounded set of distributed processors to minimize the makespan. We first derive the lower and upper bounds on the makespan of assigning a given directed acyclic task graph on heterogeneous processors by deferent scheduling strategies. Based on the analysis, we present a new heuristic, known as Heterogeneous Dynamic Critical Path Duplication (HDCPD), for scheduling DAG on a set of heterogeneous processors. HDCPD assigns the tasks on the dynamic critical path to the suitable processors which minimize the earliest finish time for them, combining insertion-based scheduling and task duplication techniques.The comparison study by simulation on Simgrid, based on randomly generated DAG, shows that HDCPD surpasses previous approaches in terms of both quality and cost of schedules, which are mainly presented with schedule length, frequency of best result, and scheduling time metrics.

show abstract

Section: Hdcpd Algorithmmentioning

confidence: 99%

Directed Acyclic Task Graph Scheduling for Heterogeneous Computing Systems by Dynamic Critical Path Duplication Algorithm

Yin

Jiang

et al. 2009

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

show abstract

“…Over the past decade, a variety of algorithms have been applied toward a parallel solution for the decomposition of a power network [1][2][3][4][5][6][7][8][9][10][11][12][13][14], Sangiovani-Vincentelli et al [7] described an approach to obtain parallel solutions by partitioning a large network into several smaller subnetworks. A method is proposed to solve the cutset block in parallel by Kage et al [14].…”

Section: Introductionmentioning

confidence: 99%

A Novel Factorization-Tree Method to the Solution of Network Equations

Chen

2005

Electric Power Components and Systems

View full text Add to dashboard Cite

Because of advances in the development of parallel computer architecture, parallel processing systems have the potential to become useful for power system applications by simultaneously solving the independent functions of a given task. A power system is separated into as many subnetworks, referred to as a bordered block diagonal form (BBDF) matrix, as the processors of a parallel computer. Balance loading on all processors is essential to ensure the success of any parallel approach. In this study, a novel method involving the factorization tree approach on the basis of calculating the maximum number of fill-ins and the degree of every node as the cutset block nodes is proposed. Using the proposed approach, the number of nodes in each subnetwork is more uniform and computation time is saved. Simulation results of the IEEE test systems and the Taiwan Power Company 288-bus system are presented to verify the feasibility of the proposed approach and its capability to implement parallel computing for load flow analysis.

show abstract