메뉴 건너뛰기




Volumn 7017 LNCS, Issue PART 2, 2011, Pages 109-120

SpotMPI: A framework for auction-based HPC computing using amazon spot instances

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION TOOLKIT; CLOUD PROVIDERS; COMMUNICATION COMPLEXITY; COMPUTING PLATFORM; COST EFFECTIVE; CRITICAL TIME; ECONOMY OF SCALE; FAIR MARKET; FORMAL MODEL; MPI APPLICATIONS; NON-TRIVIAL; OPTIMAL BIDDING; PERFORMANCE PARAMETERS; PRACTICAL COMPUTING; PROGRAMMING PARADIGMS; RESOURCE USE;

EID: 80455140325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24669-2_11     Document Type: Conference Paper
Times cited : (24)

References (30)
  • 1
    • 80455174959 scopus 로고    scopus 로고
    • Starcluster (2010), http://web.mit.edu/stardev/cluster/
    • (2010) Starcluster
  • 4
    • 85060036181 scopus 로고
    • Validity of the single processor approach to achieving large scale computing capabilities
    • ACM, New York
    • Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the Spring Joint Computer Conference, April 18-20, pp. 483-485. ACM, New York (1967)
    • (1967) Proceedings of the Spring Joint Computer Conference, April 18-20 , pp. 483-485
    • Amdahl, G.M.1
  • 7
    • 0039877166 scopus 로고    scopus 로고
    • Timing models and local stopping criteria for asynchronous iterative algorithms
    • Blathras, K., Szyld, D.B., Shi, Y.: Timing models and local stopping criteria for asynchronous iterative algorithms. Journal of Parallel and Distributed Computing 58(3), 446-465 (1999)
    • (1999) Journal of Parallel and Distributed Computing , vol.58 , Issue.3 , pp. 446-465
    • Blathras, K.1    Szyld, D.B.2    Shi, Y.3
  • 10
    • 28044460018 scopus 로고    scopus 로고
    • A higher order estimate of the optimum checkpoint interval for restart dumps
    • Daly, J.T.: A higher order estimate of the optimum checkpoint interval for restart dumps. Future Generation Computer Systems 22(3), 303-312 (2006)
    • (2006) Future Generation Computer Systems , vol.22 , Issue.3 , pp. 303-312
    • Daly, J.T.1
  • 11
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. Communications of the ACM 51(1), 107-113 (2008)
    • (2008) Communications of the ACM , vol.51 , Issue.1 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 12
    • 84940567900 scopus 로고    scopus 로고
    • Ft-mpi: Fault tolerant mpi, supporting dynamic applications in a dynamic world
    • Dongarra, J., Kacsuk, P., Podhorszki, N. (eds.) PVM/MPI 2000. Springer, Heidelberg
    • Fagg, G., Dongarra, J.: Ft-mpi: Fault tolerant mpi, supporting dynamic applications in a dynamic world. In: Dongarra, J., Kacsuk, P., Podhorszki, N. (eds.) PVM/MPI 2000. LNCS, vol. 1908, pp. 346-353. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1908 , pp. 346-353
    • Fagg, G.1    Dongarra, J.2
  • 14
    • 33749067567 scopus 로고    scopus 로고
    • Berkeley lab checkpoint/restart (blcr) for linux clusters
    • IOP Publishing
    • Hargrove, P.H., Duell, J.C.: Berkeley lab checkpoint/restart (blcr) for linux clusters. In: Journal of Physics: Conference Series, vol. 46, p. 494. IOP Publishing (2006)
    • (2006) Journal of Physics: Conference Series , vol.46 , pp. 494
    • Hargrove, P.H.1    Duell, J.C.2
  • 26
    • 77957960970 scopus 로고    scopus 로고
    • Reducing costs of spot instances via checkpointing in the amazon elastic compute cloud
    • IEEE, Los Alamitos
    • Yi, S., Kondo, D., Andrzejak, A.: Reducing costs of spot instances via checkpointing in the amazon elastic compute cloud. In: 2010 IEEE 3rd International Conference on Cloud Computing, pp. 236-243. IEEE, Los Alamitos (2010)
    • (2010) 2010 IEEE 3rd International Conference on Cloud Computing , pp. 236-243
    • Yi, S.1    Kondo, D.2    Andrzejak, A.3
  • 27
    • 84976846528 scopus 로고
    • A first order approximation to the optimum checkpoint interval
    • Young, J.W.: A first order approximation to the optimum checkpoint interval. Communications of the ACM 17(9), 530-531 (1974)
    • (1974) Communications of the ACM , vol.17 , Issue.9 , pp. 530-531
    • Young, J.W.1
  • 30
    • 20444463494 scopus 로고    scopus 로고
    • Ftc-charm++: An in-memory checkpoint-based fault tolerant runtime for charm++ and mpi
    • IEEE, Los Alamitos
    • Zheng, G., Shi, L., Kalé, L.V.: Ftc-charm++: An in-memory checkpoint-based fault tolerant runtime for charm++ and mpi. In: 2004 IEEE International Conference on Cluster Computing, pp. 93-103. IEEE, Los Alamitos (2004)
    • (2004) 2004 IEEE International Conference on Cluster Computing , pp. 93-103
    • Zheng, G.1    Shi, L.2    Kalé, L.V.3


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