메뉴 건너뛰기




Volumn 5, Issue 3, 2004, Pages 213-234

Generating optimised partitions for parallel finite element computations employing float-encoded genetic algorithms

Author keywords

Dual graph; Float Encoded genetic algorithm; Micro genetic algorithm; Parallel computing, unstructured meshes

Indexed keywords

ENCODING (SYMBOLS); FINITE ELEMENT METHOD; GENETIC ALGORITHMS; GENETIC ENGINEERING; GRAPH THEORY; OPTIMIZATION;

EID: 8344258293     PISSN: 15261492     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (14)

References (39)
  • 1
    • 0002089210 scopus 로고
    • A new interpretation of scheme notation that overturns the binary encoding constraint
    • J. David Schaffer(ed) Morgan Kaufmann Publishers, San Mateo
    • Antonisse, J. (1989): A new interpretation of scheme notation that overturns the binary encoding constraint. In: J. David Schaffer(ed) Proceedings of the third international conference on genetic algorithms, Morgan Kaufmann Publishers, San Mateo, pp. 86-91.
    • (1989) Proceedings of the Third International Conference on Genetic Algorithms , pp. 86-91
    • Antonisse, J.1
  • 2
    • 0242346713 scopus 로고    scopus 로고
    • Meshless Local Patrov-Galerkin (MLPG) approaches for weakly-singular traction & displacement boundary integral equations
    • Atluri, S. N.; Han, Z. D.; Shen, S. (2003): Meshless Local Patrov-Galerkin (MLPG) approaches for weakly-singular traction & displacement boundary integral equations, CMES: Computer Modeling in Engineering & Sciences, vol. 4, no. 5, pp. 507-517.
    • (2003) CMES: Computer Modeling in Engineering & Sciences , vol.4 , Issue.5 , pp. 507-517
    • Atluri, S.N.1    Han, Z.D.2    Shen, S.3
  • 3
    • 0042964833 scopus 로고    scopus 로고
    • The meshless local Petrov-Galerkin (MLPG) method: A simple & less-costly alternative to the finite element and boundary element methods
    • Atluri, S. N.; Shen, S. (2002): The meshless local Petrov-Galerkin (MLPG) method: A simple & less-costly alternative to the finite element and boundary element methods. CMES: Computer Modeling in Engineering & Sciences, vol. 3, no. 1, pp. 11-52
    • (2002) CMES: Computer Modeling in Engineering & Sciences , vol.3 , Issue.1 , pp. 11-52
    • Atluri, S.N.1    Shen, S.2
  • 4
    • 0028419680 scopus 로고
    • A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
    • Barnard, S. T.; Simon. H. D. (1994): A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, vol. 6, pp.101-107.
    • (1994) Concurrency: Practice and Experience , vol.6 , pp. 101-107
    • Barnard, S.T.1    Simon, H.D.2
  • 5
    • 0032041159 scopus 로고    scopus 로고
    • A parallel variant of simulated annealing for optimizing mesh partitions on workstations
    • Bouhmala, N.; Pahud, M. (1998): A parallel variant of simulated annealing for optimizing mesh partitions on workstations. Advances in engineering software, vol. 29, pp. 481-485
    • (1998) Advances in Engineering Software , vol.29 , pp. 481-485
    • Bouhmala, N.1    Pahud, M.2
  • 6
    • 4243809218 scopus 로고
    • Grid partitioning by inertial recursive bisection
    • Department of Computer Science. Belgium
    • De Keyser, J.; Roose, D. (1992): Grid partitioning by inertial recursive bisection. Technical Report TW 174. Department of Computer Science. Belgium
    • (1992) Technical Report , vol.TW 174
    • De Keyser, J.1    Roose, D.2
  • 7
    • 0023849939 scopus 로고
    • A fast simple and efficient automatic FEM domain decomposer
    • Farhat, C. (1988): A fast simple and efficient automatic FEM domain decomposer. Computers and Structures, vol. 28, pp. 579-602.
    • (1988) Computers and Structures , vol.28 , pp. 579-602
    • Farhat, C.1
  • 10
    • 0032309717 scopus 로고    scopus 로고
    • Annealing based heuristics and genetic algorithms for circuit partitioning in parallel test generation
    • Gil, C.; Ortega, J.; Diaz, A. F.; Monotoya, M. G. (1998): Annealing based heuristics and genetic algorithms for circuit partitioning in parallel test generation. Future generation computing systems, vol.14, pp. 439-451.
    • (1998) Future Generation Computing Systems , vol.14 , pp. 439-451
    • Gil, C.1    Ortega, J.2    Diaz, A.F.3    Monotoya, M.G.4
  • 13
    • 0006166393 scopus 로고
    • Real-coded genetic algorithms, virtual alphabets, and blocking
    • Goldberg, D. E. (1991): Real-Coded Genetic Algorithms, Virtual Alphabets, and Blocking. Complex Systems. Vol. 3, pp. 153-171.
    • (1991) Complex Systems , vol.3 , pp. 153-171
    • Goldberg, D.E.1
  • 16
    • 0028493542 scopus 로고
    • Computational results for parallel unstructured mesh computations
    • Jones, M. T.; Plassmann, P. E. (1994): Computational results for parallel unstructured mesh computations. Computing systems in Engineering, vol. 5, pp. 297-309.
    • (1994) Computing Systems in Engineering , vol.5 , pp. 297-309
    • Jones, M.T.1    Plassmann, P.E.2
  • 17
    • 0000991259 scopus 로고
    • Simulated Binary Crossover for Continuous search space
    • Kalyanmoy Deb.; Ram Bhushan Agarwal. (1995): Simulated Binary Crossover for Continuous search space. Complex systems, vol. 9, pp. 115-148.
    • (1995) Complex Systems , vol.9 , pp. 115-148
    • Deb, K.1    Agarwal, R.B.2
  • 18
    • 0040445957 scopus 로고    scopus 로고
    • A combined genetic adaptive search (GeneAs) for engineering design
    • Kalyanmoy Deb.; Goyal. M. (1996): A combined genetic adaptive search (GeneAs) for engineering design. Computer Science and Informatics, vol. 26, pp. 30-45.
    • (1996) Computer Science and Informatics , vol.26 , pp. 30-45
    • Deb, K.1    Goyal, M.2
  • 20
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • Karypis, G.; Vipin Kumar. (1999): A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal of scientific computing, vol. 20, pp. 359-392.
    • (1999) SIAM Journal of Scientific Computing , vol.20 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 21
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • Kernighan, B. W.; Lin, S. (1970): An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, vol. 29, pp. 291-307.
    • (1970) The Bell System Technical Journal , vol.29 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 22
    • 0012212429 scopus 로고    scopus 로고
    • Subdomain generation for parallel finite element analysis
    • Khan, A. I.; Topping, B. H. V. (1998): Subdomain generation for parallel finite element analysis. Computing systems in engineering, vol. 4 , pp. 96-129.
    • (1998) Computing Systems in Engineering , vol.4 , pp. 96-129
    • Khan, A.I.1    Topping, B.H.V.2
  • 24
    • 0001762152 scopus 로고
    • Micro genetic algorithms for stationary and non-stationary optimisation
    • SPIE Proceedings Philadelphia
    • Krishna Kumar, K. (1989): Micro genetic algorithms for stationary and non-stationary optimisation. Intelligent control and adaptive systems, SPIE Proceedings Volume 1196, Philadelphia.
    • (1989) Intelligent Control and Adaptive Systems , vol.1196
    • Krishna Kumar, K.1
  • 26
    • 0028496523 scopus 로고
    • Allocating data to distributed memory multiprocessors by Genetic Algorithms
    • Mansour, N.; Fox, G. C. (1994): Allocating data to distributed memory multiprocessors by Genetic Algorithms. Concurrency: practice and Experience, vol. 6, pp. 485-504
    • (1994) Concurrency: Practice and Experience , vol.6 , pp. 485-504
    • Mansour, N.1    Fox, G.C.2
  • 30
    • 38149144143 scopus 로고
    • Non-linear explicit transient finite element analysis on the Intel Delta
    • Plaskacz, E. J.; Ramirez, M. R.; Gupta, S. (1994): Non-linear explicit transient finite element analysis on the Intel Delta. Computing systems in Engineering, vol. 5, pp. 1-17.
    • (1994) Computing Systems in Engineering , vol.5 , pp. 1-17
    • Plaskacz, E.J.1    Ramirez, M.R.2    Gupta, S.3
  • 31
    • 0004735016 scopus 로고
    • Non-linear genetic representations
    • Manderick, B.; Mannar, R.(ed) Elsevier Science Publishers, Amsterdam
    • Radcliffe, N. J. (1992): Non-linear Genetic Representations. In: Manderick, B.; Mannar, R.(ed) Parallel Problem solving from Nature, Elsevier Science Publishers, Amsterdam, pp. 259-268.
    • (1992) Parallel Problem Solving from Nature , pp. 259-268
    • Radcliffe, N.J.1
  • 35
    • 44949282112 scopus 로고
    • Partitioning of unstructured problems for parallel processing
    • Simon, H.D. (1991): Partitioning of unstructured problems for parallel processing. Computing systems in Engineering, vol. 2, pp. 135-148.
    • (1991) Computing Systems in Engineering , vol.2 , pp. 135-148
    • Simon, H.D.1
  • 36
    • 0003684629 scopus 로고    scopus 로고
    • A combined evolutionary search and multilevel optimisation approach to graph partitioning
    • School of computing and mathematical Sciences, University of Greenwich, London, UK
    • Soper, A. J.; Walshaw, C.; Cross, M. (2001): A combined evolutionary search and multilevel optimisation approach to graph partitioning. Mathematics Research Report 00/IM/58, School of computing and mathematical Sciences, University of Greenwich, London, UK.
    • (2001) Mathematics Research Report 00/IM/58
    • Soper, A.J.1    Walshaw, C.2    Cross, M.3
  • 37
    • 0012179302 scopus 로고    scopus 로고
    • Parallel optimisation algorithms for multilevel mesh partitioning
    • School of computing and mathematical sciences, University of Greenwich, UK
    • Walshaw, C.; Cross, M. (1999): Parallel optimisation algorithms for multilevel mesh partitioning. Mathematics Research Report 99/IM/44, School of computing and mathematical sciences, University of Greenwich, UK
    • (1999) Mathematics Research Report 99/IM/44
    • Walshaw, C.1    Cross, M.2
  • 39
    • 84990643496 scopus 로고
    • Performance of dynamic load balancing algorithms for unstructured mesh calculations
    • Williams, R. D. (1991): Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency, vol. 3, pp. 457-481.
    • (1991) Concurrency , vol.3 , pp. 457-481
    • Williams, R.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.