Local Scheduling for Volunteer Computing

BOINC, a middleware system for volunteer computing, involves projects, which distribute jobs, and hosts, which execute jobs. The local (host-level) scheduler addresses two issues: when to fetch new jobs from a project and, of the currently runnable jobs, which to execute. It seeks to simultaneously satisfy a number of constraints - such as maintaining given long-term ratios of work between projects, meeting deadlines for job reporting, and providing variety to the volunteer - using uncertain, dynamic information about resources and jobs. We describe these goals and factors, and discuss BOINC's local scheduling policies.

[1]  N. Nisan,et al.  Globally distributed computation over the Internet-the POPCORN project , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[2]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[3]  Chris J. Scheiman,et al.  SuperWeb: research issues in Java‐based global computing , 1997 .

[4]  David P. Anderson,et al.  High-performance task distribution for volunteer computing , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[5]  Andrew A. Chien,et al.  Entropia: architecture and performance of an enterprise desktop grid system , 2003, J. Parallel Distributed Comput..

[6]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7]  Satoshi Hirano,et al.  Bayanihan: building and studying web-based volunteer computing systems using Java , 1999, Future Gener. Comput. Syst..

[8]  G. E. Bryan,et al.  Time Slice , 2021, Encyclopedic Dictionary of Archaeology.

[9]  G. J. Henry,et al.  The UNIX system: The fair share scheduler , 1984, AT&T Bell Laboratories Technical Journal.

[10]  Zvi M. Kedem,et al.  Charlotte: Metacomputing on the Web , 1999, Future Gener. Comput. Syst..

[11]  Chris J. Scheiman,et al.  SuperWeb: research issues in Java-based global computing , 1997, Concurr. Pract. Exp..

[12]  Ashok K. Agrawala,et al.  Models of memory scheduling , 1975, SOSP.

[13]  Subhash Saini,et al.  Local grid scheduling techniques using performance prediction , 2003 .

[14]  J. C. Browne,et al.  Trace driven modeling: Review and overview , 1973, ANSS '73.

[15]  David P. Anderson,et al.  Homogeneous redundancy: a technique to ensure integrity of molecular simulation results using public computing , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[16]  Peter R. Cappello,et al.  Javelin: Parallel computing on the internet , 1999, Future Gener. Comput. Syst..

[17]  Judy Kay,et al.  A fair share scheduler , 1988, CACM.

[18]  B. Allen,et al.  Designing a Runtime System for Volunteer Computing , 2006, ACM/IEEE SC 2006 Conference (SC'06).