Skip to main content
SpringerLink
Log in

Load balancing on temporally heterogeneous cluster of workstations for parallel simulated annealing

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Simulated annealing (SA) is a general-purpose optimization technique widely used in various combinatorial optimization problems. However, the main drawback of this technique is a long computation time required to obtain a good quality of solution. Clusters have emerged as a feasible and popular platform for parallel computing in many applications. Computing nodes on many of the clusters available today are temporally heterogeneous. In this study, multiple Markov chain (MMC) parallel simulated annealing (PSA) algorithms have been implemented on a temporally heterogeneous cluster of workstations to solve the graph partitioning problem and their performance has been analyzed in detail. Temporal heterogeneity of a cluster of workstations is harnessed by employing static and dynamic load balancing techniques to further improve efficiency and scalability of the MMC PSA algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fleischer, M.: Simulated annealing: past, present, and future. In: ACM Proc. 27th Conf. on Winter Simulation, Arlington, VA, pp. 155–161 (1995)

    Chapter  Google Scholar 

  3. Li, P., Lee, S.-Y.: Optimization of spatial dose distribution for controlling sidewall shape. In: The 54th International Conference on Electron, Ion, and Photon Beam Technology and Nanofabrication, Anchorage, Alaska, June 1–4 (2010)

    Google Scholar 

  4. Kravitz, S.A., Rutenbar, R.A.: Placement by simulated annealing on a multi-processor. IEEE Trans. Comput-Aided Des. 6, 534–549 (1987)

    Article  Google Scholar 

  5. Natrajan, K.S.: Graph-partitioning on shared-memory multiprocessor systems. In: Proc. Int’l Conf. Parallel Processing, August, vol. 3, pp. 120–124 (1991)

    Google Scholar 

  6. Kravitz, S., Rutenbar, R.: Multiprocessor-based placement by simulated annealing. In: 23rd IEEE Design Automation Conf., pp. 567–573 (1986)

    Google Scholar 

  7. Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Chichester (1989), p. 272

    MATH  Google Scholar 

  8. Greening, D.R.: Parallel simulated annealing techniques. Physica D 2, 293–306 (1990)

    Article  Google Scholar 

  9. Azencott, R.: Simulated Annealing: Parallelization Techniques. Wiley, New York (1992), p. 200

    MATH  Google Scholar 

  10. Chandy, J.A., Banerjee, P.: Parallel simulated annealing strategies for VLSI cell placement. In: IEEE Proc. 9th Int’l Conf. VLSI Design, Jan 03–06, p. 37 (1996)

    Google Scholar 

  11. Sun, W.-J., Sechen, C.: A loosely coupled parallel algorithm for standard cell placement. In: IEEE/ACM Proc. on Computer-aided Design, San Jose, CA, pp. 137–144 (1994)

    Google Scholar 

  12. Banerjee, P., Jones, M.H., Sargent, J.S.: Parallel simulated annealing algorithms for standard cell placement on hypercube multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1, 91–106 (1990)

    Article  Google Scholar 

  13. Casotto, A., Romeo, F., Sangiovanni-Vincentelli, A.: A parallel simulated annealing algorithm for the placement of macro-cells. IEEE Trans. Comput. Aided Des. CAD-6, 838–847 (1987)

    Article  Google Scholar 

  14. Chen, H., Flann, N.S., Watson, D.W.: Parallel genetic simulated annealing: a massively parallel SIMD algorithm. IEEE Trans. Parallel Distrib. Syst. 9(2), 126–136 (1998)

    Article  Google Scholar 

  15. Lee, S.Y., Lee, K.G.: Synchronous and asynchronous parallel simulated annealing with multiple Markov chains. IEEE Trans. Parallel Distrib. Syst. 7, 993–1008 (1996)

    Article  Google Scholar 

  16. Kliewer, G., Tschoke, S.: A general parallel simulated annealing library and its application in airline industry. In: Proc. Int’l Conf. Parallel Processing, IPDPS’00, May 1–5, pp. 55–62 (2000)

    Google Scholar 

  17. Wong, K.L., Constantinides, A.G.: Speculative parallel simulated annealing with acceptance prediction. IEEE Proc. Comput. Digit. Tech. 143(4), 219–223 (1996)

    Article  Google Scholar 

  18. Chandy, J.A., Kim, S., Ramkumar, B., Parkes, S., Banerjee, P.: An evaluation of parallel simulated annealing strategies with application to standard cell placement. IEEE Trans. Comput.- Aided Des. Integr. Circuits Syst. 16(4), 398–410 (1997)

    Article  Google Scholar 

  19. Witte, E.E., Chamberlain, R.D., Franklin, M.A.: Parallel simulated annealing using speculative computation. IEEE Trans. Parallel Distrib. Syst. 2, 483–494 (1991)

    Article  Google Scholar 

  20. Tantar, A.A., Melab, N., Talbi, E.G.: A grid-based genetic algorithm combined with an adaptive simulated annealing for protein structure prediction. Soft Comput. 12(12), 1185–1198 (2008). Spec. Issue on Distributed Bioinspired Algorithms

    Article  MATH  Google Scholar 

  21. Loukil, L., Mehdi, M., Melab, N., Talbi, E., Bouvry, P.: A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid. In: Workshop on Nature Inspired Distributed Computing—IEEE International Symposium on Parallel and Distributed Processing, Rome, Italy, May (2009)

    Google Scholar 

  22. Ou, C.-W., Ranka, S.: Parallel incremental graph partitioning. IEEE Trans. Parallel Distrib. Syst. 8(8), 884–896 (1997)

    Article  Google Scholar 

  23. Sun Microsystems: SUN MPI User’s Guide

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, Auburn University, Aubrun, AL, 36849, USA

    Sourabh Moharil & Soo-Young Lee

Authors
  1. Sourabh Moharil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soo-Young Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soo-Young Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moharil, S., Lee, SY. Load balancing on temporally heterogeneous cluster of workstations for parallel simulated annealing. Cluster Comput 14, 295–310 (2011). https://doi.org/10.1007/s10586-010-0148-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-010-0148-1

Keywords

Search

Navigation