Parallel heuristic search in multilevel graph partitioning

Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding

Volumn , Issue , 2004, Pages 88-95

  Banos R ^a   Gil, C ^a   Ortega, J ^b   Montoya, F G ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS;

GRAPH PARTITIONING; SIMULATED ANNEALING (SA); TABU SEARCH (TS);

HEURISTIC METHODS;

EID: 3042630877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/empdp.2004.1271432     Document Type: Conference Paper

References (18)

1. Alpert, C.J., and Kahng, A., Recent Developments in Netlist Partitioning: A Survey. Integration: the VLSI Journal, 19/ 1-2 (1995) 1-81.
2. Banerjee, P., Parallel Algorithms for VLSI Computer Aided Design. Prentice Hall, Englewoods Cliffs, NJ, 1994.
3. Klenke, R.H., Williams, R.D., and Aylor, J.H., Parallel-Processing Techniques for Automatic Test Pattern Generation, IEEE Computer, (1992) 71-84.
4. Gil, C., Ortega, J., and Montoya, M.G., Parallel VLSI Test in a Shared Memory Multiprocessors. Concurrency: Practice and Experience, 12/5 (2000) 311-326.
5. Mobasher, B., Jain, N., Han, E.H., and Srivastava J., Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of computer science, University of Minnesota, Minneapolis, (1996).
6. Shekhar, S., and DLiu, D.R., Partitioning similarity graphs: A framework for declustering problems. Information Systems Journal, 21/6, (1996) 475-496.
7. Guo, J., Trinidad, G., and Smith, N., MOZART: A Multi-Objective Zoning And AggRegation Tool. 1st Philippine Computing Science Congress, (2000) 197-201.
8. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Company. San Francisco, 1979.
9. Karypis, G. and Kumar, V., Multilevel K-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48/1 (1998) 96-129.
10. Walshaw, C., Cross, M., Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Computing. 26/12 (2000) 1635-1660.
11. Karypis, G. and Kumar, V., Parallel Multilevel Graph Partitioning, Technical Report TR 95-036, Dept. of Computer Science, Univ. of Minnesota, Minneapolis, 1995.
12. Baños R., Gil, C., Ortega, J., and Montoya, F.G., Multi-level Heuristic Algorithm for Graph Partitioning. In Proc. 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization. LNCS, 2611 (2003) 143-153.
13. Karypis, G., and Kumar, V., A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs". SIAM Journal on Scientific Comput, 20/1 (1998) 359-392.
14. Gil, C., Ortega, J., Montoya, M.G., and Baños R., A Mixed Heuristic for Circuit Partitioning. Computational Optimization and Applications Journal. 23/3 (2002) 321-340.
15. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., Optimization by simulated annealing. Science, 220:671-680, (1983).
16. Glover, F. and Laguna M., Tabu Search. In Modern Heuristic Techniques for Combinatorial Problems. C.R. Reeves (eds.), Blackwell, London, 70-150, (1993).
17. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller E., "Equation of State Calculations by Fast Computing Machines", J. Chem. Phys.,21, 6, 1087-1092, 1953.
18. 35.