메뉴 건너뛰기




Volumn 3908 LNCS, Issue , 2006, Pages 91-104

A random walk topology management solution for grid

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER NETWORKS; RANDOM PROCESSES; SUPERCOMPUTERS; TOPOLOGY;

EID: 33745800644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11749776_8     Document Type: Conference Paper
Times cited : (7)

References (16)
  • 4
    • 0242424274 scopus 로고    scopus 로고
    • Randomly distributed tasks in bounded time
    • T. Böhme, G. Heyer, and H. Unger, editors, IICS. Springer-Verlag, December
    • A. Bui, M. Bui, and D. Sohier. Randomly Distributed Tasks in Bounded Time. In T. Böhme, G. Heyer, and H. Unger, editors, IICS, volume 2877 of Lecture Notes in Computer Science, pages 36-47. Springer-Verlag, December 2003.
    • (2003) Lecture Notes in Computer Science , vol.2877 , pp. 36-47
    • Bui, A.1    Bui, M.2    Sohier, D.3
  • 5
    • 84956867308 scopus 로고    scopus 로고
    • A scalable approach to network enabled servers
    • B. Monien and R. Feldmann, editors, Proceedings of the 8th International EuroPar Conference, Paderborn, Germany, August. Springer-Verlag
    • E. Caron, F. Desprez, F. Lombard, J.-M. Nicod, M. Quinson, and F. Suter. A Scalable Approach to Network Enabled Servers. In B. Monien and R. Feldmann, editors, Proceedings of the 8th International EuroPar Conference, volume 2400 of Lecture Notes in Computer Science, pages 907-910, Paderborn, Germany, August 2002. Springer-Verlag.
    • (2002) Lecture Notes in Computer Science , vol.2400 , pp. 907-910
    • Caron, E.1    Desprez, F.2    Lombard, F.3    Nicod, J.-M.4    Quinson, M.5    Suter, F.6
  • 7
    • 84990704681 scopus 로고
    • A tight lower bound on the cover time for random walks on graphs
    • U. Feige. A tight lower bound on the cover time for random walks on graphs. Random Structures & Algorithms, 6(4):433-438, 1995.
    • (1995) Random Structures & Algorithms , vol.6 , Issue.4 , pp. 433-438
    • Feige, U.1
  • 8
    • 84990704681 scopus 로고
    • A tight upper bound on the cover time for random walks on graphs
    • U. Feige. A tight upper bound on the cover time for random walks on graphs. Random Structures & Algorithms, 6(1):51-54, 1995.
    • (1995) Random Structures & Algorithms , vol.6 , Issue.1 , pp. 51-54
    • Feige, U.1
  • 9
    • 33744815295 scopus 로고    scopus 로고
    • Random circulating word information management for tree construction and a shortest path routing tables computation
    • R. G. Cardenas, editor, Studia Informatica Universalis. Suger, Saint-Denis, rue Catulienne, France
    • O. Flauzac. Random Circulating Word Information Management for Tree Construction and a Shortest Path Routing Tables Computation. In R. G. Cardenas, editor, OPODIS, Studia Informatica Universalis, pages 17-32. Suger, Saint-Denis, rue Catulienne, France, 2001.
    • (2001) OPODIS , pp. 17-32
    • Flauzac, O.1
  • 10
    • 33845382898 scopus 로고    scopus 로고
    • CONFIIT: A middleware for peer to peer computing
    • C. T. M. Gravilova and P. L'Ecuyer, editors, volume 2669 (III) of Lecture Notes in Computer Science, Montréal, Québec, June. Springer-Verlag
    • O. Flauzac, M. Krajecki, and J. Fugère. CONFIIT : a middleware for peer to peer computing. In C. T. M. Gravilova and P. L'Ecuyer, editors, The 2003 International Conference on Computational Science and its Applications (ICCSA 2003), volume 2669 (III) of Lecture Notes in Computer Science, pages 69-78, Montréal, Québec, June 2003. Springer-Verlag.
    • (2003) The 2003 International Conference on Computational Science and Its Applications (ICCSA 2003) , pp. 69-78
    • Flauzac, O.1    Krajecki, M.2    Fugère, J.3
  • 11
    • 0031153727 scopus 로고    scopus 로고
    • Globus: A metacomputing infrastructure toolkit
    • I. Press, editor
    • I. Foster and C. Kesselman. Globus : a metacomputing infrastructure toolkit. In I. Press, editor, Supercomputer Applications, volume 11 (2), pages 115-128, 1997.
    • (1997) Supercomputer Applications , vol.11 , Issue.2 , pp. 115-128
    • Foster, I.1    Kesselman, C.2
  • 14
    • 12444292136 scopus 로고    scopus 로고
    • JXTA 2: A high-performance, massively scalable p2p network
    • IBM developer Works, November
    • S. Li. JXTA 2: A high-performance, massively scalable p2p network. Technical report, IBM developer Works, November 2003.
    • (2003) Technical Report
    • Li, S.1
  • 15
    • 0006217743 scopus 로고
    • Random walks on graphs: A Survey
    • T. S. ed., D. Miklos, and V. T. Sos, editors, Janos Bolyai Mathematical Society
    • L. Lovász. Random walks on graphs : A Survey. In T. S. ed., D. Miklos, and V. T. Sos, editors, Combinatorics: Paul Erdos is Eighty, volume 2, pages 353-398. Janos Bolyai Mathematical Society, 1993.
    • (1993) Combinatorics: Paul Erdos Is Eighty , vol.2 , pp. 353-398
    • Lovász, L.1


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