mirror of https://github.com/BOINC/boinc.git
- client: don't multiply checkpoint interval (i.e., "disk interval" pref)
by # processors. - web: change description of pref to "Applications checkpoint to disk at most every ..." svn path=/trunk/boinc/; revision=19293
This commit is contained in:
parent
656441dc3b
commit
b0d44d7564
|
@ -8566,3 +8566,14 @@ David 12 Oct 2009
|
|||
|
||||
lib/
|
||||
x_util.cpp
|
||||
|
||||
David 12 Oct 2009
|
||||
- client: don't multiply checkpoint interval (i.e., "disk interval" pref)
|
||||
by # processors.
|
||||
- web: change description of pref to
|
||||
"Applications checkpoint to disk at most every ..."
|
||||
|
||||
client/
|
||||
app_start.cpp
|
||||
html/inc/
|
||||
prefs.inc
|
||||
|
|
|
@ -218,10 +218,7 @@ int ACTIVE_TASK::write_app_init_file() {
|
|||
aid.rsc_memory_bound = wup->rsc_memory_bound;
|
||||
aid.rsc_disk_bound = wup->rsc_disk_bound;
|
||||
aid.computation_deadline = result->computation_deadline();
|
||||
int nprocs = gstate.ncpus;
|
||||
if (result->avp->ncudas) nprocs = coproc_cuda->count;
|
||||
if (result->avp->natis) nprocs = coproc_ati->count;
|
||||
aid.checkpoint_period = nprocs*gstate.global_prefs.disk_interval;
|
||||
aid.checkpoint_period = gstate.global_prefs.disk_interval;
|
||||
aid.fraction_done_start = 0;
|
||||
aid.fraction_done_end = 1;
|
||||
#ifdef _WIN32
|
||||
|
|
|
@ -1,6 +1,11 @@
|
|||
<?
|
||||
|
||||
$project_news = array(
|
||||
array("October 12, 2009",
|
||||
"Welcome to <a href=http://escatter11.fullerton.edu/nfs/>NFS@home</a>,
|
||||
a new project from California State University Fullerton.
|
||||
NFS@Home uses volunteer computing to do the lattice sieving step in the Number Field Sieve factorization of large integers."
|
||||
),
|
||||
array("October 4, 2009",
|
||||
"<a href=\"http://www.efmer.eu/boinc/boinc_tasks/\">BoincTasks</a>, a new visual interface to BOINC, has been released for Windows. BoincTasks lets you manage a single computer locally, or all your computers remotely."
|
||||
),
|
||||
|
|
|
@ -208,6 +208,14 @@ $mixed = array(
|
|||
$math = array(
|
||||
"Mathematics, computing, and games",
|
||||
array(
|
||||
array(
|
||||
"NFS@home",
|
||||
"http://escatter11.fullerton.edu/nfs/",
|
||||
"California State University Fullerton",
|
||||
"Factorization of large integers",
|
||||
"NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long.",
|
||||
"NFS_Logo.jpg"
|
||||
),
|
||||
array(
|
||||
"VTU@home",
|
||||
"http://boinc.vgtu.lt/vtuathome/",
|
||||
|
|
|
@ -114,7 +114,7 @@ define("USE_AT_MOST", "Use at most");
|
|||
define("USE_AT_MOST2", "Use at most<span class=note><br>(Can be used to reduce CPU heat)</span>");
|
||||
define("USE_AT_MOST3", "Use at most");
|
||||
define("CPU_USAGE_LIMIT_DESC2", "percent of CPU time");
|
||||
define("DISK_INTERVAL_DESC", "Write to disk at most every");
|
||||
define("DISK_INTERVAL_DESC", "Applications checkpoint to disk at most every");
|
||||
define("DISK_LIMIT_DESC", "Disk and memory usage");
|
||||
define("DISK_MIN_FREE_GB_DESC", "Leave at least");
|
||||
define("DISK_SCHED_MIN_FREE_DESC1", "<br><span class=note>(Values smaller than ");
|
||||
|
|
Loading…
Reference in New Issue