Changes between Version 11 and Version 12 of ResearchProjects

Timestamp:

Jan 17, 2011, 11:56:20 AM (14 years ago)

Author:

davea

Comment:

--

ResearchProjects

@@ -4 +4 @@
 Possible research projects involving BOINC and volunteer computing,
 appropriate for senior-level class projects or Masters theses.
-If you're interested, please contact
-[ProjectPeople David Anderson].
+If you're interested, please contact [ProjectPeople David Anderson].
 
 An out-of-date list of conferences related to volunteer computing
@@ -14 +13 @@
 The following tools may be useful:
 
- * The [ClientSim BOINC client simulator]
+ * The [ClientSim BOINC client emulator]
    models a single client attached to one or more projects.
    It's useful for studying client scheduling policies.
@@ -22 +21 @@
  * The [http://boinc.berkeley.edu/trac/browser/trunk/boinc/sched/sched_driver.cpp scheduler driver]
    can be used to measure the maximum throughput (jobs per second) of a BOINC back end.
+
+== Improved scheduling policies ==
+
+Dozens of changes to BOINC's client and server scheduling policies have been proposed
+(see, for example, the archives of the boinc_alpha email list).
+Use the BOINC client emulator and/or EmBOINC to study some of these.
+
+== Symbiotic job scheduling ==
+
+It has been observed (see UCSD work) that different combinations of applications
+run more efficiently than others on multiprocessors,
+because of their respective memory access patterns.
+Instrument the BOINC client to measure this effect
+(i.e., to maintain logs of the rate of progress of applications
+running in different combinations).
+Estimate the overall throughput increase that could be gained by
+doing "symbiosis-aware" job scheduling.
+If it's worth doing, implement it.
 
 == Data-intensive volunteer computing ==
@@ -93 +110 @@
 completing only short jobs in an effort to get credit unfairly.
 
-== Extend and refine the BOINC credit system ==
+== Globalize resource share ==
+
+Currently resource share is enforced on a per-host basis;
+each host's processing resources are allocated in a way that matches
+resource share as closely as possible.
+This can be improved in 2 ways:
+
+First, enforce resource share on a per-volunteer basis.
+Suppose a volunteer is attached to projects A and B,
+and has two hosts, H and J.
+Suppose A runs efficiently on H (e.g. because H has a GPU supported by A)
+and B runs efficiently on B.
+Then we can increase overall throughput by
+using H entirely for A, and J entirely for B.
+
+Second, enforce resource share on a global (cross-volunteer) basis.
+Suppose volunteer V supports project A but has hosts that
+run project B efficiently, and that V trusts B.
+Suppose volunteer W is in the symmetric situation.
+Then we can increase overall throughput by using
+V's hosts for B, and W's hosts for A.
+(This idea is due to Arnaud Legrand from INRIA; please contact him).
+
+In both cases, a study should be one before implementing anything.
+
+== Generalize the BOINC credit system ==
 
 The idea of "credit" - a numerical measure of work done -
@@ -115 +157 @@
 batch completion.
 Develop scheduling policies that optimize batch completion (i.e. makespan).
-
-== Latency-oriented volunteer computing ==
-
-The early volunteer computing projects (SETI@home, Climateprediction.net)
-are "throughput oriented": they want to maximize the number of jobs
+This may require major changes to BOINC's scheduling mechanisms,
+which were originally designed to maximize the number of jobs
 completed per day, not minimize the turnaround time of individual jobs.
-BOINC's scheduling mechanisms reflect this; for example, they try to
-assign multiple jobs at a time so that client/server interactions are minimized.
-
-More recent volunteer computing projects are "latency-oriented":
-they want to minimize the makespan of batches of jobs.
-The project is to redesign BOINC's scheduling mechanisms so that they
-can support latency-oriented computation,
-and to validate the new mechanisms via simulation.
+
+See PortalFeatures.
+
+== Intra-project resource allocation ==
+
+Currently BOINC has only crude mechanisms for allocation resources
+within a project
+(e.g., a project that serves multiple scientists).
+Design a quota system.
+See PortalFeatures.
 
 == Volunteer data archival ==
@@ -160 +201 @@
 Design a library that can be linked to an existing application,
 providing a lightweight BOINC client.
-When the application is run, the library contacts projects
-and gets "microjobs"
+When the application is run, the library contacts projects and gets "microjobs"
 (small or variable-size jobs).
 It computes while the app is open.