메뉴 건너뛰기




Volumn 3732 LNCS, Issue , 2006, Pages 1061-1070

A Grid resource broker supporting advance reservations and benchmark-based resource selection

Author keywords

Adaptation; Advance reservations; Benchmark based resource selection; Globus toolkit; Production Grid; Resource broker; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SOFTWARE; DATA REDUCTION; DATA TRANSFER; SCHEDULING;

EID: 33745296493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_128     Document Type: Conference Paper
Times cited : (21)

References (24)
  • 4
    • 0031223134 scopus 로고    scopus 로고
    • Netsolve: A network server for solving computational science problems
    • H. Casanova and J. Dongarra. Netsolve: A network server for solving computational science problems. Int. J. Supercomput. Appl., 11(3):212-223, 1997.
    • (1997) Int. J. Supercomput. Appl. , vol.11 , Issue.3 , pp. 212-223
    • Casanova, H.1    Dongarra, J.2
  • 5
    • 84974715448 scopus 로고    scopus 로고
    • SNAP: A protocol for negotiating service level agreements and coordinating resource management in distributed systems
    • Feitelson D.G. et al., editors, Job Scheduling Strategies for Parallel Processing, Berlin, Springer-Verlag
    • K. Czajkowski, I. Foster, C. Kesselman, V. Sander, and S. Tuecke. SNAP: A protocol for negotiating service level agreements and coordinating resource management in distributed systems. In Feitelson D.G. et al., editors, Job Scheduling Strategies for Parallel Processing, volume 2537 of Lecture Notes in Computer Science, pages 153-183, Berlin, 2002. Springer-Verlag.
    • (2002) Lecture Notes in Computer Science , vol.2537 , pp. 153-183
    • Czajkowski, K.1    Foster, I.2    Kesselman, C.3    Sander, V.4    Tuecke, S.5
  • 7
    • 0031153727 scopus 로고    scopus 로고
    • Globus: A metacomputing infrastructure toolkit
    • I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. Int. J. Supercomput. Appl., 11(2):115-128, 1997.
    • (1997) Int. J. Supercomput. Appl. , vol.11 , Issue.2 , pp. 115-128
    • Foster, I.1    Kesselman, C.2
  • 8
    • 84981264064 scopus 로고    scopus 로고
    • A distributed resource management architecture that supports advance reservations and co-allocation
    • Washington - Brussels - Tokyo, IEEE
    • I. Foster, C. Kesselman, C. Lee, B. Lindell, K. Nahrstedt, and A. Roy. A distributed resource management architecture that supports advance reservations and co-allocation. In 7th International Workshop on Quality of Service, pages 27-36, Washington - Brussels - Tokyo, 1999. IEEE.
    • (1999) 7th International Workshop on Quality of Service , pp. 27-36
    • Foster, I.1    Kesselman, C.2    Lee, C.3    Lindell, B.4    Nahrstedt, K.5    Roy, A.6
  • 10
    • 33745298685 scopus 로고    scopus 로고
    • Globus. http://www.globus.org.
  • 13
    • 33745326510 scopus 로고    scopus 로고
    • NorduGrid. http://www.nordugrid.org.
  • 14
    • 33745298193 scopus 로고    scopus 로고
    • OpenLDAP. http://www.openldap.org.
  • 15
    • 33745315570 scopus 로고    scopus 로고
    • OpenSSL. http://www.openssl.org.
  • 16
    • 4544309643 scopus 로고    scopus 로고
    • Simulation studies of computation and data scheduling algorithms for data Grids
    • K. Ranganathan and I. Foster. Simulation studies of computation and data scheduling algorithms for data Grids. Journal of Grid Computing, 1(1):53-62, 2003.
    • (2003) Journal of Grid Computing , vol.1 , Issue.1 , pp. 53-62
    • Ranganathan, K.1    Foster, I.2
  • 19
    • 84948957425 scopus 로고    scopus 로고
    • Predicting application run times using historical information
    • Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Berlin, Springer-Verlag
    • W. Smith, I. Foster, and V. Taylor. Predicting application run times using historical information. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1459 of Lecture Notes in Computer Science, Berlin, 1999. Springer-Verlag.
    • (1999) Lecture Notes in Computer Science , vol.1459
    • Smith, W.1    Foster, I.2    Taylor, V.3
  • 20
    • 84947936619 scopus 로고    scopus 로고
    • Using run-time predictions to estimate queue wait times and improve scheduler performance
    • Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Berlin, Springer-Verlag
    • W. Smith, I. Foster, and V. Taylor. Using run-time predictions to estimate queue wait times and improve scheduler performance. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1459 of Lecture Notes in Computer Science, pages 202-219, Berlin, 1999. Springer-Verlag.
    • (1999) Lecture Notes in Computer Science , vol.1459 , pp. 202-219
    • Smith, W.1    Foster, I.2    Taylor, V.3
  • 22
    • 33745325534 scopus 로고    scopus 로고
    • Supercluster.org. Center for HPC Cluster Resource Management. http://www.supercluster.org.
  • 23
    • 33745293580 scopus 로고    scopus 로고
    • Swegrid. http://www.swegrid.se.
  • 24
    • 85130634439 scopus 로고    scopus 로고
    • Dynamically forecasting network performance using the network weather service
    • Rich Wolski. Dynamically forecasting network performance using the network weather service. Journal of Cluster computing, 1(1):119-132, 1998.
    • (1998) Journal of Cluster Computing , vol.1 , Issue.1 , pp. 119-132
    • Wolski, R.1


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