메뉴 건너뛰기




Volumn 1900, Issue , 2000, Pages 234-241

Neighbourhood preserving load balancing: A self-organizing approach

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; SELF ORGANIZING MAPS;

EID: 84872751777     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44520-x_32     Document Type: Article
Times cited : (6)

References (11)
  • 3
    • 84937399551 scopus 로고
    • A New Mapping Heuristic Based on Mean Field Annealing
    • Bultan T., Aykanat C.: A New Mapping Heuristic Based on Mean Field Annealing, J. Parallel Distrib. Comput., 1995, vol 16, pp. 452-469
    • (1995) J. Parallel Distrib. Comput. , vol.16 , pp. 452-469
    • Bultan, T.1    Aykanat, C.2
  • 5
    • 0023558425 scopus 로고
    • Nearest-Neighbour Mapping of Finite Element Graphs onto Processor Meshes
    • Sadayappan, P., Ercal, F.: Nearest-Neighbour Mapping of Finite Element Graphs onto Processor Meshes, IEEE Trans. on Computers, Vol. C-36, No 12, 1987, pp. 1408-1424
    • (1987) IEEE Trans. On Computers , vol.C-36 , Issue.12 , pp. 1408-1424
    • Sadayappan, P.1    Ercal, F.2
  • 6
    • 0030105726 scopus 로고    scopus 로고
    • Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves
    • Pilkington, J.R, Baden, S.B.: Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves, IEEE Trans. on Parallel and Distributed Sys. 1997, Volume 7, pp. 288-300
    • (1997) IEEE Trans. On Parallel and Distributed Sys. , vol.7 , pp. 288-300
    • Pilkington, J.R.1    Baden, S.B.2
  • 8
    • 0029459658 scopus 로고
    • Optimizing Parallel Program Execution by Self-Organizing Maps
    • Quittek, J.W., Optimizing Parallel Program Execution by Self-Organizing Maps, Journal of Artificial Neural Networks, Vol.2, No.4, 1995, pp.365-380
    • (1995) Journal of Artificial Neural Networks , vol.2 , Issue.4 , pp. 365-380
    • Quittek, J.W.1
  • 10
    • 85018976122 scopus 로고    scopus 로고
    • University of Paderborn, AG-Monien Home Page (Parallel Computing Group), http://www.uni-paderborn.de/fachbereich/AG/monien.


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