A parallelism extended approach for the enumeration of orthogonal arrays

Hien Phan; Ben Soh; Man Nguyen

doi:10.1007/978-3-642-24650-0_42

A parallelism extended approach for the enumeration of orthogonal arrays

Hien Phan
, Ben Soh
, Man Nguyen

La Trobe University
University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings
Pages	481-493
Number of pages	13
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-24650-0_42
Publication status	Published - 2011
Externally published	Yes
Event	11th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2011 - Melbourne, VIC, Australia Duration: 24 Oct 2011 → 26 Oct 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	7016 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2011
Country/Territory	Australia
City	Melbourne, VIC
Period	24/10/11 → 26/10/11

Access to Document

10.1007/978-3-642-24650-0_42

Cite this

Phan, H., Soh, B., & Nguyen, M. (2011). A parallelism extended approach for the enumeration of orthogonal arrays. In Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings (PART 1 ed., pp. 481-493). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7016 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-24650-0_42

Phan, Hien ; Soh, Ben ; Nguyen, Man. / A parallelism extended approach for the enumeration of orthogonal arrays. Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings. PART 1. ed. 2011. pp. 481-493 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{7b0b762d6ab04b5b8a63e2162d437792,

title = "A parallelism extended approach for the enumeration of orthogonal arrays",

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.",

author = "Hien Phan and Ben Soh and Man Nguyen",

year = "2011",

doi = "10.1007/978-3-642-24650-0\_42",

language = "English",

isbn = "9783642246494",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "481--493",

booktitle = "Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings",

edition = "PART 1",

note = "11th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2011 ; Conference date: 24-10-2011 Through 26-10-2011",

}

Phan, H, Soh, B & Nguyen, M 2011, A parallelism extended approach for the enumeration of orthogonal arrays. in Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7016 LNCS, pp. 481-493, 11th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2011, Melbourne, VIC, Australia, 24/10/11. https://doi.org/10.1007/978-3-642-24650-0_42

A parallelism extended approach for the enumeration of orthogonal arrays. / Phan, Hien; Soh, Ben; Nguyen, Man.
Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings. PART 1. ed. 2011. p. 481-493 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7016 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A parallelism extended approach for the enumeration of orthogonal arrays

AU - Phan, Hien

AU - Soh, Ben

AU - Nguyen, Man

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/80455140349

U2 - 10.1007/978-3-642-24650-0_42

DO - 10.1007/978-3-642-24650-0_42

M3 - Conference contribution

AN - SCOPUS:80455140349

SN - 9783642246494

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 481

EP - 493

BT - Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings

T2 - 11th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2011

Y2 - 24 October 2011 through 26 October 2011

ER -

Phan H, Soh B, Nguyen M. A parallelism extended approach for the enumeration of orthogonal arrays. In Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP 2011, Proceedings. PART 1 ed. 2011. p. 481-493. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-24650-0_42

A parallelism extended approach for the enumeration of orthogonal arrays

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this