Skip to main content
SpringerLink
Log in

A Parallelism Extended Approach for the Enumeration of Orthogonal Arrays

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7016))

  • 1186 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. Finkel, R., Manber, U.: Diba distributed implementation of backtracking. ACM Trans. Program. Lang. Syst. 9, 235–256 (1987)

    Article  Google Scholar 

  3. Message-Passing Interface Forum. MPI-2.0: Extensions to the Message-Passing Interface, ch 9. MPI Forum (June 1997)

    Google Scholar 

  4. Nguyen, M.: Computer-algebraic methods for the construction of designs of experiments. Ph.D. Thesis, Technische Universiteit Eindhoven (2005)

    Google Scholar 

  5. Nguyen, M.V.M.: Some new constructions of strength 3 mixed orthogonal arrays. Journal of Statistical Planning and Inference 138(1), 220–233 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Tsai, P.-W., Gilmour, S.G., Mead, R.: Projective three-level main effects designs robust to model uncertainty. Biometrika 87(2), 467–475 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Computer Engineering, LaTrobe University, Australia

    Hien Phan & Ben Soh

  2. Faculty of Computer Science and Engineering, University of Technology, Ho Chi Minh City, Vietnam

    Man Nguyen

Authors
  1. Hien Phan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ben Soh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Man Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125,, Burwood, VIC, Australia

    Yang Xiang

  2. ICAR-CNR and University of Calabria, Via P. Bucci 41 C, 87036, Rende (CS), Italy

    Alfredo Cuzzocrea

  3. School of Information Technology, Deakin University, Geelong Waurn Ponds Campus, Pigdons Road, 3217, Geelong, VIC, Australia

    Michael Hobbs

  4. School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Wanlei Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phan, H., Soh, B., Nguyen, M. (2011). A Parallelism Extended Approach for the Enumeration of Orthogonal Arrays. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24650-0_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24649-4

  • Online ISBN: 978-3-642-24650-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation