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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1457 LNCS, Issue , 1998, Pages 310-331

  Aiex, Renata M ^a   Martins, Simone De L ^a   Ribeiro, Celso C ^a   Rodriguez, Noemi De La R ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; TIMING CIRCUITS;

BENCHMARK CIRCUIT; CIRCUIT PARTITIONING; INITIAL SOLUTION; MULTI-THREAD; MULTIPLE SEARCH; NUMERICAL RESULTS; PARALLEL TABU SEARCH; TABU SEARCH ALGORITHMS;

TABU SEARCH;

EID: 84883476471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0018549     Document Type: Conference Paper

References (41)

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.
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.
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.
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.
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.
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.
7. A. BIRRELL AND B. NELSON, "Implementing remote procedure calls", ACM Transactions on Computer Systems 2 (1984), 39-59.
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.
9. N. CARRIERO AND D. GELERNTER, "How to Write Parallel Programs: A Guide to the Perplexed", ACM Computing Surveys 21 (1989), 323-357.
10. N. CARRIERO, D. GELERNTER, AND T. MATTSON, "Linda in Context", Communications of the ACM 32 (1989), 444-458.
11. P. CIGNONI, D. LAFORENZA, R. PEREGO, R. SCOPIGNO, AND C. MONTANI, "Evaluation of Parallelization Strategies for an Incremental Delaunay Triangulator in E3", Concurrency: Practice and Experience 7 (1995), 61-80.
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.
13. T.G. CRAINIC AND M. TOULOUSE, "Parallel Metaheuristics", Research report, Centre de Recherche sur les Transports, Université de Montréal, 1997.
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.
15. T.G. CRAINIC, M. TOULOUSE, AND M. GENDREAU, "Towards a Taxonomy of Parallel Tabu Search", INFORMS Journal on Computing 9 (1997), 61 72.
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.
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.
18. M. DAVIS-MORADKHAN, Problèmes de Partitionnement dans la Technologie des VLSI, Doctorate thesis, Universlté Paris VI, 1993.
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.
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.
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.
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.
23. M. FRANKLIN AND V. GOVINDAN, "A General Matrix Iterative Model for Dynamic Load Balancing", Parallel Computing 22 (1996), 969-989.
24. A. GEIST, A. BEGUELIN, J. DONGARRA, W. JIANG, R. MANCHEK, AND V. SUNDERMAN, PVM: Parallel Virtual Machine - A User's Guide and Tutorial for Networked Parallel Computing, The MIT Press, 1994.
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.
26. F. GLOVER, "Tabu Search - Part I", ORSA Journal on Computing 1 (1989), 190-206.
27. F. GLOVER, "Tabu Search - Part II", ORSA Journal on Computing 2 (1990), 4-32.
28. F. GLOVER AND M. LAGUNA, "Tabu Search", in Modern Heuristic Techniques for Combinatorial Problems (C.R. Reeves, editor), 70-150, Blackwell, 1993, Londres.
29. F. GLOVER AND M. LAGUNA, Tabu Search, Kluwer, 1997, Boston.
30. A.H. KARP, "Some Experiences with Network Linda", International Journal of High Speed Computing 6 (1994), 55-80.
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.
32. A. MATRONE, P. SCHIANO, AND V. PUOTTI, "LINDA and PVM: A Comparison between Two Environments for Parallel Programming", Parallel Computing 19 (1993), 949-957.
33. Y. MIN AND Z. LI, "Pseudo-Exhaustive Testing Strategy for Large Combinational Circuits", Computer Systems Science and Engineering 1 (1986), 213-220.
34. O. PATASHNIK, Optimal Circuit Segmentation for Pseudo-Exhaustive Testing, Doctorate thesis, Stanford University, Department of Computer Science, 1990.
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.
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.
37. M.W. ROBERTS AND P.K. LALA, "An Algorithm for the Partitioning of Logic Circuits", IEE Proceedings-G 131 (1984), 113-118.
38. SCIENTIFIC COMPUTING ASSOCIATES, Linda's User's Guide and Reference Manual, version 4.0.1 - SP2/POE.
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.
40. V. SUNDERMAN, "PVM: A Framework for Parallel Distributed Computing", Concurrency: Practice and Experience 2 (1990), 315-339.
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.