Skip to main content
SpringerLink
Log in

Cooperative multi-thread parallel tabu search with an application to circuit partitioning

  • Regular Talks
  • Conference paper
  • First Online:
Solving Irregularly Structured Problems in Parallel (IRREGULAR 1998)

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

Abstract

In this work, we propose a cooperative multi-thread parallel tabu search heuristic for the circuit partitioning problem. This procedure is based on the cooperation of multiple search threads. Each thread implements a different variant of a sequential tabu search algorithm, using a different combination of initial solution algorithm and move attribute definition. These threads communicate by exchanging elite solutions. PVM and Linda are used in the implementation of the parallel tabu search procedure. Numerical results reported for a set of ISCAS benchmark circuits illustrate the effectiveness of the parallel tabu search procedure. Comparative results illustrating the efficiency of the implementations in PVM and Linda are also assessed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.M. Aiex, Asynchronous Parallel Tabu Search Strategies with an Application to Graph Partitioning (in Portuguese), M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 1996.

    Google Scholar 

  2. A.A. Andreatta and C.C. Ribeiro, “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits”, Annals of Operations Research 50 (1994), 1–36.

    Google Scholar 

  3. E.C. Archambeau and E.J. Mccluskey, “Fault Coverage of Pseudo-Exhaustive Testing”, Digest of Papers of the 14th International Conference on Fault-Tolerant Computing, 141–145, IEEE, 1984.

    Google Scholar 

  4. P. Badeau, F. Guertin, J.-Y. Potvin, M.Gendreau, and E.D. Taillard, “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows”, Transportation Research C 5 (1997), 109–122.

    Google Scholar 

  5. F. Berglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran”, Special session on “ATPG and Fault Simulation”, IEEE International Symposium on Circuits and Systems, Kyoto, 1985.

    Google Scholar 

  6. S.N. Bhatt, F.R.K. Chung, and A.L. Rosenberg, “Partitioning Circuits for Improved Testability”, Proceedings of the Fourth MIR Conference: Advanced Research in VLSI, 91–106, The MIT Press, Cambridge, 1986.

    Google Scholar 

  7. A. Birrell and B. Nelson, “Implementing remote procedure calls”, ACM Transactions on Computer Systems 2 (1984), 39–59.

    Google Scholar 

  8. S. Bozorgui-Nesbat and E.J. McCluskey, “Structured Design for Testability to Eliminate Test Pattern Generation”, Digest of Papers of the 10th International Symposium on Fault-Tolerant Computing, 158–163, IEEE, 1980.

    Google Scholar 

  9. N. Carriero and D. Gelernter, “How to Write Parallel Programs: A Guide to the Perplexed”, ACM Computing Surveys 21 (1989), 323–357.

    Google Scholar 

  10. N. Carriero, D. Gelernter; and T. Mattson, “Linda in Context”, Communications of the ACM 32 (1989), 444–458.

    Google Scholar 

  11. P. Cignoni, D. Laforenza, R. Perego, R. Scopigno, and C. Montani, “Evaluation of Paxallelization Strategies for an Incremental Delaunay Triangulator in E3”, Concurrency: Practice and Experience 7 (1995), 61–80.

    Google Scholar 

  12. T.G. Crainic and M. Gendreau, “A Cooperative Parallel Tabu Search for Capacited Network Design”, Research report, Centre de Recherche sur les Transports, Université de Montréal, 1997.

    Google Scholar 

  13. T.G. Crainic and M. Toulouse, “Parallel Metaheuristics”, Research report, Centre de Recherche sur les Transports, Université Université Montréal, 1997.

    Google Scholar 

  14. T.G. Crainic, M. Toulouse., and M. Gendreau, “Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements”, Publication 935, Centre de Recherche sur les Transports, Université de Montréal, 1993.

    Google Scholar 

  15. T.G. Crainic, M. Toulouse, and M. Gendreau, “Towards a Taxonomy of Parallel Tabu Search”, INFORMS Journal on Computing 9 (1997), 61–72.

    Google Scholar 

  16. T.G. Crainic, M. Toulouse, and M. Gendreau, “Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements”, OR Spektrum 17 (1995), 113–123.

    Google Scholar 

  17. M. Toulouse, T.G. Crainic, and M. Gendreau, “Communication Issues in Designing Cooperative Multi-Thread Parallel Searches”, in Meta-Heuristics: Theory and Applications (I.H. Osman and J.P. Kelly, editors), 501–522, Kluwer, 1996.

    Google Scholar 

  18. M. Davis-Moradkhan, Problémes de Partitionnement dans la Technologie des VLSI, Doctorate thesis, Université Paris VI, 1993.

    Google Scholar 

  19. M. Davis-Moradkhan and C. Roucairol, “Comparison of Two Heuristics for Partitioning Combinational Circuits for Parallel Pseudo-Exhaustive Testing”, Rapport MASI 92.25, Laboratoire MASI, Université Paris VI, 1992.

    Google Scholar 

  20. M. Davis-Moradkhan and C. Roucairol, “Graph Partitioning Applied to the Problem of Logic Testing of VLSI Combinational Circuits”, Rapport MASI 92.41, Laboratoire MASI, Université Paris VI, 1992.

    Google Scholar 

  21. I. De Falco, R. Del Balio, E. Tarantino, and R. Vacaro, “Improving Search by Incorporating Evolution Principles in Parallel Tabu Search”, Proceedings of the International Conference on Machine Learning, 823–828, 1994.

    Google Scholar 

  22. I. De Falco, R. Del Balio, and E. Tarantino, “Solving the Mapping Problem by Parallel Tabu Search”, Research report, Instituto per la Recerca sui Sistemi Informatici Paralleli — CRN, 1995.

    Google Scholar 

  23. M. Franklin and V. Govindan, “A General Matrix Iterative Model for Dynamic Load Balancing”, Parallel Computing 22 (1996), 969–989.

    Google Scholar 

  24. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sun-derman, PVM: Parallel Virtual Machine — A User's Guide and Tutorial for Networked Parallel Computing, The MIT Press, 1994.

    Google Scholar 

  25. M.Gendreau, P. Badeau, F. Guertin, J.-Y. Potvin, and E.D. Taillard, “A Solution Procedure for Real-Time Routing and Dispatching of Commercial Vehicles”, Publication CRT-96-24, Centre de Recherche sur les Transports, Université de Montréal, 1996.

    Google Scholar 

  26. F. Glover, “Tabu Search — Part I”, ORSA Journal on Computing 1 (1989), 190–206.

    Google Scholar 

  27. F. Glover, “Tabu Search — Part II”, ORSA Journal on Computing 2 (1990), 4–32.

    Google Scholar 

  28. F. Glover and M. Laguna, “Tabu Search”, in Modern Heuristic Techniques for Combinatorial Problems (C.R. Reeves, editor), 70–150, Blackwell, 1993, Londres.

    Google Scholar 

  29. F. Glover and M. Laguna, Tabu Search, Kluwer, 1997, Boston.

    Google Scholar 

  30. A.H. Karp, “Some Experiences with Network Linda”, International Journal of High Speed Computing 6 (1994), 55–80.

    Google Scholar 

  31. S.L. Martins; C.C. Ribeiro, and N.R. Rodriguez, “Parallel Programming Tools for Distributed Memory Environments” (in Portuguese), Investigación Operativa 5 (1996), 67–98.

    Google Scholar 

  32. A. Matrone, P. Schiano, and V. Puotti, "“INDA and PVM: A Comparison between Two Environments for Parallel Programming”, Parallel Computing 19 (1993),949–957.

    Google Scholar 

  33. Y. Min and Z. Li, “Pseudo-Exhaustive Testing Strategy for Large Combinational Circuits”, Computer Systems Science and Engineering 1 (1986), 213–220.

    Google Scholar 

  34. O. Patashnik, Optimal Circuit Segmentation for Pseudo-Exhaustive Testing, Doctorate thesis, Stanford University, Department of Computer Science, 1990.

    Google Scholar 

  35. A. Petrie and R. Kerr, “A Qualitative Comparison of Network Linda and PVM”, Parallel Processing Memorandum PPM/017, Department of Computing Science, University of Newcastle upon Tyne, 1994.

    Google Scholar 

  36. S.C. Porto and C.C. Ribeiro, “Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints”, Journal of Heuristics 1 (1995), 207–223.

    Google Scholar 

  37. M.W. Roberts and P.K. Lala, “An Algorithm for the Partitioning of Logic Circuits”, IEE Proceedings-G 131 (1984), 113–118.

    Google Scholar 

  38. Scientific Computing Associates, Linda's User's Guide and Reference Manual, version 4.0.1 — SP2/POE.

    Google Scholar 

  39. F. Sukup, “Efficiency Evaluation of Some Parallelization Tools on a Workstation Cluster Using the NAS Parallel Benchmarks”, Research report, Vienna University of Technology, Computing Center, 1994.

    Google Scholar 

  40. V. Sunderman, “PVM: A Framework for Parallel Distributed Computing”, Concurrency: Practice and Experience 2 (1990), 315–339.

    Google Scholar 

  41. E.D. Taillard, P. Badeau, M.Gendreau, F. Guertin, and J.-Y. Potvin, “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows”, Transportation Science 31 (1997), 170–186.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Catholic University of Rio de Janeiro, RJ 22453-900, Rio de Janeiro, Brazil

    Renata M. Aiex, Simone de L. Martins, Celso C. Ribeiro & Noemi de la R. Rodriguez

Authors
  1. Renata M. Aiex
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone de L. Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Noemi de la R. Rodriguez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Horst Simon Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aiex, R.M., Martins, S.d.L., Ribeiro, C.C., Rodriguez, N.d.l.R. (1998). Cooperative multi-thread parallel tabu search with an application to circuit partitioning. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018549

Download citation

  • DOI: https://doi.org/10.1007/BFb0018549

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64809-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation