A step-by-step extending parallelism approach for enumeration of combinatorial objects

Authors:
Hien Phan;Ben Soh;Man Nguyen
Affiliations:
Department of Computer Science and Computer Engineering, LaTrobe University, Australia;Department of Computer Science and Computer Engineering, LaTrobe University, Australia;Faculty of Computer Science and Engineering, University of Technology, Ho Chi Minh City, Vietnam
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 9
Cited 1

Scalable load balancing techniques for parallel computers

Journal of Parallel and Distributed Computing
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Isomorph-free exhaustive generation

Journal of Algorithms
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Natural Work-Stealing Algorithm is Stable

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An optimization algorithm using orthogonal arrays in discrete design space for structures

Finite Elements in Analysis and Design
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Orthogonal array application for optimal combination of software defect detection techniques choices

WSEAS Transactions on Computers
Scalable work stealing

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis

A parallelism extended approach for the enumeration of orthogonal arrays

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general step-by-step extending approach to parallel execution of enumeration of combinatorial objects (ECO) The methodology extends a famous enumeration algorithm, OrderlyGeneration, which allows concurrently generating all objects of size n+1 from all objects of size n To the best of our knowledge, this is the first time there is an attempt to plug parallel computing into OrderlyGeneration algorithm for ECO problem The potential impact of this general approach could be applied for many different servants of ECO problem on scientific computing areas in the future Our work has applied this strategy to enumerate Orthogonal Array (OA) of strength t, a typical kind of combinatorial objects by using a implementation with MPI paradigm Several initial results in relation to speedup time of the implementation have been analyzed and given significant efficiency of the proposed approach.