Skip to main content
SpringerLink
Log in

Parallel Branch-and-Bound for Chemical Engineering Applications: Load Balancing and Scheduling Issues

Invited Talk

  • Conference paper
  • First Online:
Vector and Parallel Processing — VECPAR 2000 (VECPAR 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1981))

Included in the following conference series:

Abstract

Branch-and-prune (BP) and branch-and-bound (BB) techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Of special interest here are techniques derived from interval analysis, in particular an interval-Newton/generalized-bisection procedure. In this context, we discuss issues of load balancing and work scheduling that arise in the implementation of parallel BB and BP, and describe and analyze techniques for this purpose. These techniques are applied to solve problems appearing in chemical process engineering using a distributed parallel computing system. Results show that a consistently high efficiency can be achieved in solving nonlinear equations, providing excellent scalability. The effectiveness of the approach used is also demonstrated in the consistent superlinear speedup observed in performing global optimization.

Author to whom all correspondence should be addressed. Fax: (219) 631-8366

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. Schnepper, C. A., Stadtherr, M. A.: Application of a Parallel Interval Newton/Generalized Bisection Algorithm to Equation-Based Chemical Process Flowsheeting. Interval Comput., 1993(4) (1993) 40–64

    MATH  MathSciNet  Google Scholar 

  2. Epperly, T. G. W.: Global Optimization of Nonconvex Nonlinear Programs Using Parallel Branch and Bound. Ph.D. thesis. University of Wisconsin, Madison, WI (1995)

    Google Scholar 

  3. Androulakis, I. P., Visweswaran, V., Floudas, C. A.: Distributed Decomposition based Approaches in Global Optimization. In: Floudas, C. A., Pardalos, P. M. (eds.): State of the Art in Global Optimization: Computational Methods and Applications, Kluwer Academic Publishers, Dordrecht (1996) 285–301

    Google Scholar 

  4. Schnepper, C. A., Stadtherr, M. A.: Robust Process Simulation Using Interval Methods. Comput. Chem. Eng. 20 (1996) 187–199

    Article  Google Scholar 

  5. Androulakis, I. P., Floudas, C. A.: Distributed Branch and Bound Algorithms for Global Optimization. In: Pardalos, P. M. (ed.): IMA Volumes in Mathematics and its Applications, Vol. 106. Parallel Processing of Discrete Problems, Springer-Verlag, Berlin (1998) 1–36

    Google Scholar 

  6. Berner, S., McKinnon, K. I. M., Millar, C.: A Parallel Algorithm for the Global Optimization of Gibbs Free Energy. Annals of Operations Research 90 (1999) 271–291

    Article  MATH  MathSciNet  Google Scholar 

  7. Smith, E. M. B., Pantelides, C. C.: A Symbolic Reformulation/Spatial Branch-and-Bound Algorithm for the Global Optimization of Nonconvex MINLPs. Comput. Chem. Eng. 23 (1999) 457–478

    Article  Google Scholar 

  8. Sinha, M., Achenie, L. E. K., Ostrovsky, G. M.:Parallel Branch and Bound Global Optimizer for Product Design. Presented at AIChE Annual Meeting, Dallas, TX, November (1999)

    Google Scholar 

  9. Sinha, M., Achenie, L. E. K.: Parallel Issues in Global Optimization. Presented at AIChE Annual Meeting, Dallas, TX, November, (1999)

    Google Scholar 

  10. Acevedo, J., Pistikopoulos, E. N.: Computational Studies of Stochastic Optimization Algorithms for Process Synthesis under Uncertainty. Comput. Chem. Eng. 20 (1996) S1–S6

    Article  Google Scholar 

  11. Byrd, R. H., Eskow, E., van der Hoek, A., Schnabel, R. B., Oldenkamp, P. B.: A Parallel Global Optimization Method for Solving Molecular Cluster and Polymer Conformation Problems. Proceedings of the Seventh Siam Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA (1995) 72–77

    Google Scholar 

  12. Kleiber, M., Axmann, J. K.: Evolutionary Algorithms for the Optimization of Modified UNIFAC Parameters. Comput. Chem. Eng. 23 (1998) 63–82

    Article  Google Scholar 

  13. Pekny, J. F., Miller, D. L., McRae, G. J.: An Exact Parallel Algorithm for Scheduling When Production Costs Depend on Consecutive System States. Comput. Chem. Eng. 14 (1990) 1009–1023

    Article  Google Scholar 

  14. Pekny, J. F., Miller, D. L., Kudva, G. K.: An Exact Algorithm for Resource Constrained Sequencing with Application to Production Scheduling under an Aggregate Deadline. Comput. Chem. Eng. 17 (1993) 671–682

    Article  Google Scholar 

  15. Kudva, G. K., Pekny, J. F.: DCABB: A Distributed Control Architecture for Branch and Bound Calculations. Comput. Chem. Eng. 19 (1995) 847–865

    Article  Google Scholar 

  16. Subrahmanyam, S., Kudva, G. K., Bassett, M. H., Pekny, J. F.: Application of Distributed Computing to Batch Plant Design and Scheduling. AIChE J. 42 (1996) 1648–161

    Article  Google Scholar 

  17. Fraga, E. S., McKinnon, K. I. M.: Process Synthesis Using Parallel Graph Traversal. Comput. Chem. Eng. 18 (1994) S119–S123

    Article  Google Scholar 

  18. Fraga, E. S., McKinnon, K. I. M.: The Use of Dynamic Programming with Parallel Computers for Process Synthesis. Comput. Chem. Eng. 18 (1994) 1–13

    Article  Google Scholar 

  19. Fraga, E. S., McKinnon, K. I. M.: Portable Code for Process Synthesis Using Workstation Clusters and Distributed Memory Multicomputers. Comput. Chem. Eng. 19 (1995) 759–773

    Article  Google Scholar 

  20. Coon, A. B., Stadtherr, M. A.: Parallel Implementation of Sparse LU Decomposition for Chemical Engineering Applications. Comput. Chem. Eng. 13 (1989) 899–914

    Article  Google Scholar 

  21. Vegeais, J. A., Stadtherr, M. A.: Parallel Processing Strategies for Chemical Process Flowsheeting. AIChE J. 38 (1992) 1399–1407

    Article  Google Scholar 

  22. Zitney, S. E., Stadtherr M. A.: Frontal Algorithms for Equation-Based Chemical Process Flowsheeting on Vector and Parallel Computers. Comput. Chem. Eng. 17 (1993) 319–338

    Article  Google Scholar 

  23. Zitney, S. E., Stadtherr, M. A.: Supercomputing Strategies for the Design and Analysis of Complex Separation Systems. Ind. Eng. Chem. Res. 32 (1993) 604–612

    Article  Google Scholar 

  24. Beigler, L. T., Tjoa I.-B.: A Parallel Implementation for Parameter Estimation With Implicit Models. Annals of Operations Research 42 (1993) 1–23

    Article  Google Scholar 

  25. Moe, H. I., Hertzberg, T.: Advanced Computer Architectures Applied in Dynamic Process Simulation: A Review. Comput. Chem. Eng. 18 (1994) S375–S384

    Article  Google Scholar 

  26. O’Neill, A. J., Kaiser, D. J., Stadtherr, M. A.: Strategies for Multicomponent Equilibrium-Stage Separation Calculations on Parallel Computers. AIChE J. 40 (1994) 65–72

    Article  Google Scholar 

  27. Coon, A. B., Stadtherr, M. A.: Generalized Block-Tridiagonal Matrix Orderings for Parallel Computation in Process Flowsheeting. Comput. Chem. Eng. 19 (1995) 787–805

    Article  Google Scholar 

  28. High, K. A., LaRoche, R. D.: Parallel Nonlinear Optimization Techniques for Chemical Process Design Problems. Comput. Chem. Eng. 19 (1995) 807–825

    Article  Google Scholar 

  29. Ingle, N. K., Mountziaris, T. J.: A Multifrontal Algorithm for the Solution of Large Systems of Equations Using Network-Based Parallel Computing. Comput. Chem. Eng. 19 (1995) 807–825

    Article  Google Scholar 

  30. Anderson, J. S., Kevrekidis, I. G., Rico-Martinez, R.: A Comparison of Recurrent Training Algorithms for Time Series Analysis and System Identification. Comput. Chem. Eng. 20 (1996) S751–S756

    Article  Google Scholar 

  31. Zitney. S. E., Mallya, J. U., Davis, T. A., Stadtherr, M. A.: Multifrontal vs. Frontal Techniques for Chemical Process Simulation on Supercomputers. Comput. Chem. Eng. 20 (1996) 641–646

    Article  Google Scholar 

  32. Mallya, J. U., Stadtherr, M. A.: A Multifrontal Approach for Simulating Equilibrium-Stage Processes on Supercomputers. Ind. Eng. Chem. Res. 36 (1997) 144–151

    Article  Google Scholar 

  33. Mallya, J. U., Zitney, S. E., Choudhary, S., Stadtherr, M. A.: A Parallel Frontal Solver for Large Scale Process Simulation and Optimization. AIChE J. 43 (1997) 1032–1040

    Article  Google Scholar 

  34. Paloschi J. R.: Steps towards Steady-State Simulation on MIMD machines: Solving Almost Block Diagonal Linear Systems. Comput. Chem. Eng. 21 (1997) 691–701

    Article  Google Scholar 

  35. Abdel-Jabbar, N., Carnahan, B., Kravaris, C.: A Multirate Parallel-Modular Algorithm for Dynamic Process Simulation Using Distributed Memory Multicomputers. Comput. Chem. Eng. 23 (1999) 733–761

    Article  Google Scholar 

  36. Mallya, J. U., Zitney, S. E., Choudhary, S., Stadtherr, M. A.: Matrix Reordering Effects on a Parallel Frontal Solver for Large Scale Process Simulation. Comput. Chem. Eng. 23 (1999) 585–593

    Article  Google Scholar 

  37. Vazquez, G. E., Ponzoni, I., Brignole, N. B.: Parallel Depth-First Search on Clusters of Workstations. Presented at SIAM Annual Meeting, Atlanta, GA, May 12–15 (1999)

    Google Scholar 

  38. Vazquez, G. E., Brignole, N. B.: Parallel Distributed Optimization for Chemical Engineering Applications. Presented at SIAM Annual Meeting, Atlanta, GA, May 12–15 (1999)

    Google Scholar 

  39. Brignole, N. B., Ponzoni, I., Sanchez, M. C., Vazquez, G. E.: A Parallel Algorithm for Observability Analysis on Networks of Workstations. Presented at AIChE Annual Meeting, Dallas, TX, November (1999)

    Google Scholar 

  40. Keunings, R.: Parallel Finite Element Algorithms Applied to Computational Rheology. Comput. Chem. Eng. 19 (1995) 647–669

    Article  Google Scholar 

  41. Killough, J. E.: The Application of Parallel Computing to the Flow of Fluids in Porous Media. Comput. Chem. Eng. 19 (1995) 775–786

    Article  Google Scholar 

  42. Stark, S. M., Neurock, M., Klein, M. T.: Comparison of MIMD and SIMD Strategies for Monte Carlo Modeling of Kinetically Coupled Reactions. Comput. Chem. Eng. 19 (1995) 719–742

    Article  Google Scholar 

  43. Traenkle, F., Hill, M. D., Kim, S.: Solving Microstructure Electrostatics on a Proposed Parallel Computer. Comput. Chem. Eng. 19 (1995) 743–757

    Article  Google Scholar 

  44. Yang, H., Kim, S.: Boundary Element Analysis of Particle Mobility in a Cylindrical Channel: Network-Based Parallel Computing with Condor. Comput. Chem. Eng. 19 (1995) 683–692

    Article  Google Scholar 

  45. Poulain, C. A., Finlayson, B. A.: Distributed Computing with Personal Computers. AIChE J. 42 (1996) 290–295

    Article  Google Scholar 

  46. McDonald, C. M., Floudas, C. A.: GLOPEQ: A New Computational Tool for the Phase and Chemical Equilibrium Problem. Comput. Chem. Eng. 21 (1997) 1–23

    Article  Google Scholar 

  47. Hua, J. Z., Brennecke, J. F., Stadtherr, M. A.: Enhanced Interval Analysis for Phase Stability: Cubic Equation of State Models. Ind. Eng. Chem. Res. 37 (1998) 1519–1527

    Article  Google Scholar 

  48. Gau, C.-Y., Brennecke, J. F., Stadtherr, M. A.: Reliable Nonlinear Parameter Estimation in VLE Modeling. Fluid Phase Equilib. 168 (2000) 1–18.

    Article  Google Scholar 

  49. Maranas, C. D., Floudas, C. A: Global Optimization for Molecular Conformation Problems. Anns. Opns. Res. 42 (1993) 85–117

    Article  MATH  Google Scholar 

  50. McKeown, G. P., Rayward-Smith, V. J., Rush, S. A.: Parallel Branch-and-Bound. In: Kronsj, L., Shumsheruddin, D. (eds.): Advances in Parallel Algorithms, Halsted Press, New York (1992) 111–150

    Google Scholar 

  51. Rushmeier, R. A.: Experiments with Parallel Branch-and-Bound Algorithms for the Set Covering Problems. Oper. Res. Lett. 13 (1993) 277–285

    Article  MATH  Google Scholar 

  52. Gendron, B., Crainic, T. G.: Parallel Branch-and-Bound Algorithms-Survey and Synthesis. Oper. Res. 42 (1994) 1042–1066

    Article  MATH  MathSciNet  Google Scholar 

  53. Kumar. V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms. Benjamin-Cummings, Redwood City, CA (1994)

    Google Scholar 

  54. Correa, R., Ferreira, A.: Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework. In: Ferreira, A., Pardalos, P. (eds.): Solving Combinatorial Optimization Problems in Parallel. Vol 1054, Springer-Verlag, Berlin (1996) 171–200

    Chapter  Google Scholar 

  55. Mitra, G., Hai, I., Hajian, M. T.: A Distributed Processing Algorithm for Solving Integer Problems Using a Cluster of Workstations. Parallel Computing 23 (1997) 733–753

    Article  MATH  MathSciNet  Google Scholar 

  56. Correa, R. C.: A Parallel Approximation Scheme for the Multiprocessor Scheduling Problem. Parallel Computing 26 (2000) 47–72

    Article  MATH  MathSciNet  Google Scholar 

  57. Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, UK (1990)

    MATH  Google Scholar 

  58. Hansen, E. R.: Global Optimization Using Interval Analysis. Marcel Dekkar, New York, NY (1992)

    MATH  Google Scholar 

  59. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

  60. Rump, S. M.: Fast and Parallel Interval Arithmetic. BIT 39 (1999) 534–554

    Article  MATH  MathSciNet  Google Scholar 

  61. Frommer, A., Mayer, G.: Parallel Interval Multisplittings. Numer. Math. 56 (1989) 255–267

    Article  MathSciNet  MATH  Google Scholar 

  62. Gan, Q., Yang, Q., Hu, C.: Parallel All-Row Preconditioned Interval Linear Solver for Nonlinear Equations on Multiprocessors. Parallel Computing 20 (1994) 1249–1268

    Article  MATH  MathSciNet  Google Scholar 

  63. Hu, C., Frolov, A., Kearfott, R. B., Yang, Q.: A General Iterative Sparse Linear Solver and its Parallelization for Interval Newton Methods. Reliable Computing 1 (1995) 251–263

    Article  MATH  MathSciNet  Google Scholar 

  64. Hu, C.: Parallel Solutions for Large-Scale General Sparse Nonlinear Systems of Equations. J. Comput. Sci. Tech. 11 (1996) 257–271

    Article  MathSciNet  Google Scholar 

  65. Anstreicher, K. M., Brixius, N., Goux, J.-P., Linderoth, J.: Solving Large Quadratic Assignment Problems On Computational Grids. Presented at 17th International Symposium on Mathematical Programming, Atlanta, GA, August (2000)

    Google Scholar 

  66. Goux, J.-P., Kulkani, S., Linderoth, J., Yoder, M.: An Enabling Framework for Master-Worker Computing Applications on the Computational Grid. Technical Report, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2000)

    Google Scholar 

  67. Vornberger, O.: Load Balancing in a Network of Transputers. Second International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol. 312 (1987) 116–126

    Google Scholar 

  68. Troya, J., Ortega, M.: A Study of Parallel Branch-and-Bound Algorithms with Best-Bound-First Search. Paral. Comput. 11 (1989) 121–126

    Article  MATH  Google Scholar 

  69. Quinn, M. J.: Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer. IEEE Trans. Comp. 39 (1990) 384–387

    Article  MathSciNet  Google Scholar 

  70. Vornberger, O.: Implementing Branch-and-Bound in a Ring of Processors. Proceedings of CONPAR 86 Conference on Algorithms and Hardware for Parallel Processing, Lecture Notes in Computer Science, Vol. 237 (1986) 157–164

    Google Scholar 

  71. Finkel, R., Manber, U.: DIB-A Distributed Implementation of Backtracking. ACM Tran. Prog. Lang. and Syst. 9 (1987) 235–256

    Article  Google Scholar 

  72. Nageshwara Rao, V., Kumar, Parallel Depth First Search. 1. Implementation. Int. J. Paral. Prog. 16 (1987) 479–499

    MATH  Google Scholar 

  73. Luling, R., Monien, B.: Two strategies for Solving the Vertex Cover Problem on a Transputer Network. Third International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol. 392 (1989) 160–170

    Google Scholar 

  74. Clausen, J., Tra., J. L.: Implementations of Parallel Branch-and-Bound Algorithms-Experience with the Graph Partitioning Problem. Anns. Opns. Res. 33 (1991) 331–349

    MATH  Google Scholar 

  75. Blumofe, R. D., Leiserson, C. E.: Scheduling Multithreaded Computations byWork Stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), Santa Fe, New Mexico, November (1994) 356–368

    Google Scholar 

  76. Cybenko, G.: Dynamic Load Balancing for Distributed Memory Multiprocessors. J. Parallel Distr. Com. 7 (1989) 278–301

    Google Scholar 

  77. Heirich, A., Taylor, S.: Load Balancing by Diffusion. Proceedings of 24th International Conference on Parallel Programming, Vol. 3, CRC Press (1995) 192–202

    Google Scholar 

  78. Heirich, A., Arvo, J.: A Competitive Analysis of Load Balancing Strategies for Parallel Ray Tracing. J. Supercomputing 12 (1998) 57–68

    Article  Google Scholar 

  79. Foster, I.: Designing and Building Parallel Programs-Concepts and Tools for Parallel Software Engineering. Addison-Wesley, Reading, MA (1995)

    Google Scholar 

  80. Dijkstra, E. W., Scholten, C. S.: Termination Detection for Diffusing Computations. Inf. Process. Lett. 11 (1980) 1–4

    Article  MATH  MathSciNet  Google Scholar 

  81. Dijkstra, E. W., Feijen, W. H., van Gasteren, A. J. M..: Derivation of a Termination Detection Algorithm for Distributed Computations. Inf. Process. Lett. 16 (1983) 217–219

    Article  Google Scholar 

  82. Gropp,_W., Lusk, E., Skjellum, A.: Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press, Cambridge, MA (1994)

    Google Scholar 

  83. Gropp, W., Lusk, E., Thakur, R.: Using MPI-2: Advanced Features of the Message-Passing Interface. MIT Press, Cambridge, MA (1999)

    Book  Google Scholar 

  84. Gau, C.-Y., Stadtherr, M. A.: Global Nonlinear Parameter Estimation Using Interval Analysis: Parallel Computing Strategies. Presented at AIChE Annual Meeting, Miami Beach, FL, November (1998)

    Google Scholar 

  85. Gau, C.-Y., Stadtherr, M. A.: A Systematic Analysis of Dynamic Load Balancing Strategies for Parallel Interval Analysis. Presented at AIChE Annual Meeting, Dallas, TX, November (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Chemical Engineering, 182 Fitzpatrick Hall, University of Notre Dame, 46556, Notre Dame, IN, USA

    Gau Chao-Yang & Mark A. Stadtherr

Authors
  1. Gau Chao-Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark A. Stadtherr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculdade de Engenharia da Universidade do Porto, Rua Dr. Roberto Frias, 4200-465, Porto, Portugal

    José M. L. M. Palma

  2. Department of Computer Science, University of Tennessee, 37996-1301, Knoxville, TN, USA

    Jack Dongarra

  3. Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera, s/n, Apartado 22012, E-46020, Valencia, Spain

    Vicente Hernández

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chao-Yang, G., Stadtherr, M.A. (2001). Parallel Branch-and-Bound for Chemical Engineering Applications: Load Balancing and Scheduling Issues. In: Palma, J.M.L.M., Dongarra, J., Hernández, V. (eds) Vector and Parallel Processing — VECPAR 2000. VECPAR 2000. Lecture Notes in Computer Science, vol 1981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44942-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-44942-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41999-0

  • Online ISBN: 978-3-540-44942-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation