Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of moves among the slave processes. The implementation is carried out on a dedicated cluster of workstations. Experimental results using ISCAS-85/89 benchmark circuits illustrating quality and speedup trends are presented. A comparison of the obtained results is made with the results of a parallel genetic algorithm (GA) implementation.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Sait, S.M., Youssef, H.: Iterative Computer Algorithms and their Application to Engineering. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  2. Sait, S.M., Youssef, H., El-Maleh, A., Minhas, M.R.: Iterative Heuristics for Multiobjective VLSI Standard Cell Placement. In: Proceedings of IJCNN 2001, International Joint Conference on Neural Networks, July 2001, vol. 3, pp. 2224–2229 (2001)

    Google Scholar 

  3. Sait, S.M., Minhas, M.R., Khan, J.A.: Performance and Low-Power Driven VLSI Standard Cell Placement using Tabu Search. In: Proceedings of the 2002 Congress on Evolutionary Computation, May 2002, vol. 1, pp. 372–377 (2002)

    Google Scholar 

  4. Banerjee, P.: Parallel Algorithms for VLSI Computer-Aided Design. Prentice Hall International, Englewood Cliffs (1994)

    Google Scholar 

  5. Cung, V.-D., Martins, S.L., Riberio, C.C., Roucairol, C.: Strategies for the Parallel Implementation of metaheuristics. Essays and Surveys in Metaheuristics, 263–308 (2001)

    Google Scholar 

  6. De Falco, I., Del Balio, R., Tarantino, E., Vaccaro, R.: Improving Search by Incorporating Evolution Principles in Parallel Tabu Search. In: Proc. of the first IEEE Conference on Evolutionary Computation, CEC 1994, June 1994, vol. 1, pp. 823–828 (1994)

    Google Scholar 

  7. Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a Taxonomy of Parallel Tabu Search Heuristics. INFORMS Journal of Computing 9(1), 61–72 (1997)

    Article  MATH  Google Scholar 

  8. Garica, B.-L., Potvin, J.-Y., Rousseau, J.-M.: A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints. Computers & Operations Research 21(9), 1025–1033 (1994)

    Article  Google Scholar 

  9. Malek, M., Guruswamy, M., Pandya, M., Owens, H.: Serial and parallel Simulated Annealing and Tabu Search algorithms for the Traveling Salesman Problem. Annals of Ops. Res. 21, 59–84 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Taillard, E.: Parallel Iterative Search Methods for the Vehicle Routing Problem. Networks 23, 661–673 (1993)

    Article  MATH  Google Scholar 

  11. Chakrapani, J., Skorin-Kapov, J.: Massively Parallel Tabu Search for the Quadratic Assignment Problem. Annals of Operations Research 41, 327–341 (1993)

    Article  MATH  Google Scholar 

  12. Taillard, E.: Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing 17, 443–455 (1991)

    Article  MathSciNet  Google Scholar 

  13. Sait, S.M., Youssef, H.: VLSI Physical Design Automation: Theory and Practice. World Scientific, Singapore (2001)

    Google Scholar 

  14. Yager, R.R.: On Ordered Weighted Averaging Aggregation Operators in Multicriteria Decision Making. IEEE Transaction on Systems, MAN, and Cybernetics 18(1) (January 1988)

    Google Scholar 

  15. Toulouse, M., Crainic, T.G., Gendreau, M.: Issues in Designing Parallel and Distributed Search Algorithms for Discrete Optimization Problems. In: Publication CRT-96-36, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada (1996)

    Google Scholar 

  16. Cant-Paz, E.: A Survey of Parallel Genetic Algorithms. Calculateurs Parallles, Reseaux et Systems Repartis (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Sciences & Engineering, King Fahd University of Petroleum & Minerals, Dhahran, 31261, Saudi Arabia

    Mahmood R. Minhas & Sadiq M. Sait

Authors
  1. Mahmood R. Minhas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sadiq M. Sait
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minhas, M.R., Sait, S.M. (2005). A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_62

Download citation

  • DOI: https://doi.org/10.1007/11424925_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation