BOINC: A system for public-resource computing and storage

被引：640
作者：
Anderson, DP [1 ]
机构：
[1] Univ Calif Berkeley, Space Sci Lab, Berkeley, CA 94720 USA
来源：
FIFTH IEEE/ACM INTERNATIONAL WORKSHOP ON GRID COMPUTING, PROCEEDINGS | 2004年
关键词：
D O I：
10.1109/GRID.2004.14
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
BOINC (Berkeley Open Infrastructure for Network Computing) is a software system that makes it easy for scientists to create and operate public-resource computing projects. It supports diverse applications, including those with large storage or communication requirements. PC owners can participate in multiple BOINC projects, and can specify how their resources are allocated among these projects. We describe the goals of BOINC, the design issues that we confronted, and our solutions to these problems.
引用
收藏
页码：4 / 10
页数：7
相关论文
共 13 条
  • [1] SETI@home - An experiment in public-resource computing
    Anderson, DP
    Cobb, J
    Korpela, E
    Lebofsky, M
    Werthimer, D
    [J]. COMMUNICATIONS OF THE ACM, 2002, 45 (11) : 56 - 61
  • [2] [Anonymous], 2003, WORKSH EC PEER PEER
  • [3] Entropia: architecture and performance of an enterprise desktop grid system
    Chien, A
    Calder, B
    Elbert, S
    Bhatia, K
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (05) : 597 - 610
  • [4] FEDAK G, 2001, IEEE ACM CCGRID 2001
  • [5] Globus: A metacomputing infrastructure toolkit
    Foster, I
    Kesselman, C
    [J]. INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1997, 11 (02): : 115 - 128
  • [6] FOSTER I, 2003, 2 INT WORKSH PEER TO
  • [7] Foster I., 2002, IEEE COMPUTER, V35
  • [8] GERMAIN C, 2003, ACM INT C SUP, P226
  • [9] Kubiatowicz J., 2000, OCEANSTORE ARCHITECT
  • [10] Atomistic protein folding simulations on the submillisecond time scale using worldwide distributed computing
    Pande, VS
    Baker, I
    Chapman, J
    Elmer, SP
    Khaliq, S
    Larson, SM
    Rhee, YM
    Shirts, MR
    Snow, CD
    Sorin, EJ
    Zagrovic, B
    [J]. BIOPOLYMERS, 2003, 68 (01) : 91 - 109
12