Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Finite element mesh partitioning using neural networks
Advances in Engineering Software
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
ACM Computing Surveys (CSUR)
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
A parallel implementation of ant colony optimization
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Parallelization Strategies for Ant Colony Optimization
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
Ant Colony Optimization
Solving the mesh-partitioning problem with an ant-colony algorithm
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Optimal domain decomposition via p-median methodology using ACO and hybrid ACGA
Finite Elements in Analysis and Design
Multilevel heuristic algorithm for graph partitioning
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Some computer organizations and their effectiveness
IEEE Transactions on Computers
Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The graph-partitioning problem arises as a fundamental problem in many important scientific and engineering applications. A variety of optimisation methods are used for solving this problem and among them the meta-heuristics outstand for its efficiency and robustness. Here, we address the performance of the distributed multilevel ant-colony algorithm (DMACA), a meta-heuristic approach for solving the multi-way graph partitioning problem, which is based on the ant-colony optimisation paradigm and is integrated with a multilevel procedure. The basic idea of the DMACA consists of parallel, independent runs enhanced with cooperation in the form of a solution exchange among the concurrent searches. The objective of the DMACA is to reduce the overall computation time, while preserving the quality of the solutions obtained by the sequential version. The experimental evaluation on a two-way and four-way partitioning with 1% and 5% imbalance confirms that with respect to the sequential version, the DMACA obtains statistically, equally good solutions at a 99% confidence level within a reduced overall computation time.