Efficient algorithm for graph-partitioning problem using a problem transformation method

Lee, C.-H.; Park, C.-I.; Kim, Moonkoo

doi:10.1016/0010-4485(89)90159-0

Cited by 19 publications

(15 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A variation of the LPK algorithm [12] is then used to swap FUs between clusters, so as to minimize their communication. The communication cost between two clusters, for a given FU distribution, is the total number of data dependencies that cross the clusters border.…”

Section: Cluster Partitioningmentioning

confidence: 99%

Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures

Buss

Azevedo

Centoducatte

et al. 2001

Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems - CASES '01

View full text Add to dashboard Cite

In this paper we describe a design exploration methodology for clustered VLIW architectures. The central idea of this work is a set of three techniques aimed at reducing the cost of expensive inter-cluster copy operations. Instruction scheduling is performed using a list-scheduling algorithm that stores operand chains into the same register file. Functional units are assigned to clusters based on the application inter-cluster communication pattern. Finally, a careful insertion of pipeline bypasses is used to increase the number of data-dependencies that can be satisfied by pipeline register operands. Experimental results, using the SPEC95 benchmark and the IMPACT compiler, reveal a substantial reduction in the number of copies between clusters.

show abstract

Section: Cluster Partitioningmentioning

confidence: 99%

Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures

Buss

Azevedo

Centoducatte

et al. 2001

Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems - CASES '01

View full text Add to dashboard Cite

show abstract

“…Examples of such perturbations, for the graph partitioning problem, appear in the literature (see [19,43,44] 2 ). Two feasible solutions t and t are called neighbors iff t is the result of a finite number of consecutive perturbations on t. The set of all neighbors of t is called a neighborhood structure.…”

Section: Geometry Graph Partitioning Algorithmmentioning

confidence: 99%

A comparison of optimization heuristics for the data mapping problem

Chrisochoides

Mansour

Fox

1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

In this paper we compare the performance of six heuristics with suboptimal solutions for the data distribution of two dimensional meshes that are used for the numerical solution of Partial Di erential Equations PDEs on multicomputers. The data mapping heuristics are evaluated with respect to seven criteria covering load balancing, interprocessor communication, exibility and ease of use for a class of single-phase iterative PDE solvers. Our evaluation suggests that the simple and fast block distribution heuristic can beas e ective as the other ve complex and computational expensive algorithms.

show abstract

“…This process is repeated for decreasing distances with the goal of exiting local minima. The deterministic algorithm is an extension of the Lee, Park and Kim (LPK) [13], and the Fiduccia and Mattheyses…”

Section: Algorithm Implementationmentioning

confidence: 99%

Partitioned register files for VLIWs

Capitanio

Dutt²,

Nicolau³

1992

SIGMICRO Newsl.

View full text Add to dashboard Cite

An ideal VLIW architecture requires a large multiport register file that is currently not realizable in practice. We analyze a Limited Connectivity VLIW architecture as a realizable alternative that limits the number of ports. We present a fine-grain code partitioning method for this model. The partitioning scheme was applied to a number of standard benchmarks by varying the number ports on a RF, the number of partitions and the communication bandwidth between partitions. We present these results, along with a preliminary analysis of architectural tradeoffs in the actual implementation of these Limited Connectivity VLIWs.

show abstract

Efficient algorithm for graph-partitioning problem using a problem transformation method

Cited by 19 publications

References 6 publications

Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures

Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures

A comparison of optimization heuristics for the data mapping problem

Partitioned register files for VLIWs

Contact Info

Product

Resources

About