A Parallelism Extended Approach for the Enumeration of Orthogonal Arrays

  • Hien Phan
  • Ben Soh
  • Man Nguyen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7016)


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.


Execution Time Orthogonal Array Relative Speedup Column Size Chunk Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [DOS+07]
    Dinan, J., Olivier, S., Sabin, G., Prins, J., Sadayappan, P., Tseng, C.-W.: Dynamic load balancing of unbalanced computations using message passing. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, pp. 1–8 (March 2007)Google Scholar
  2. [FM87]
    Finkel, R., Manber, U.: Diba distributed implementation of backtracking. ACM Trans. Program. Lang. Syst. 9, 235–256 (1987)CrossRefGoogle Scholar
  3. [Mes97]
    Message-Passing Interface Forum. MPI-2.0: Extensions to the Message-Passing Interface, ch 9. MPI Forum (June 1997)Google Scholar
  4. [Ngu05]
    Nguyen, M.: Computer-algebraic methods for the construction of designs of experiments. Ph.D. Thesis, Technische Universiteit Eindhoven (2005)Google Scholar
  5. [Ngu08]
    Nguyen, M.V.M.: Some new constructions of strength 3 mixed orthogonal arrays. Journal of Statistical Planning and Inference 138(1), 220–233 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [PSN10]
    Phan, H., Soh, B., Nguyen, M.: A step-by-step extending parallelism approach for enumeration of combinatorial objects. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol. 6081, pp. 463–475. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. [SEN10]
    Schoen, E.D., Eendebak, P.T., Nguyen, M.V.M.: Complete enumeration of pure-level and mixed-level orthogonal array. Journal of Combinatorial Designs 18(2), 123–140 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. [TGM00]
    Tsai, P.-W., Gilmour, S.G., Mead, R.: Projective three-level main effects designs robust to model uncertainty. Biometrika 87(2), 467–475 (2000)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hien Phan
    • 1
  • Ben Soh
    • 1
  • Man Nguyen
    • 2
  1. 1.Department of Computer Science and Computer EngineeringLaTrobe UniversityAustralia
  2. 2.Faculty of Computer Science and EngineeringUniversity of TechnologyHo Chi Minh CityVietnam

Personalised recommendations