A parallelism extended approach for the enumeration of orthogonal arrays

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'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Year:
2011

Citing 2
Cited 0

DIB—a distributed implementation of backtracking

ACM Transactions on Programming Languages and Systems (TOPLAS)
A step-by-step extending parallelism approach for enumeration of combinatorial objects

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Orthogonal Array plays an important role in Design of Experiment and software testing. The most challenging aspect of Orthogonal array is the enumeration problem, that is for given parameter sets, we want to count exactly how many isomorphism classes exist. Enumeration of orthogonal array usually requires huge effort needed to complete its computation. There are several algorithms that have been proposed for enumeration of orthogonal array, however, there exists ineffective parallelism approach for handling this problem. In this paper, we present a step-by-step parallelism extending approach for enumeration of orthogonal array. The experiments show that this proposed approach could get an relative speedup efficiency of up to 128 processes and a great dynamic load balancing between computing processes.