2008-08-06 18:36:30 +00:00
|
|
|
// This file is part of BOINC.
|
2005-01-20 23:22:22 +00:00
|
|
|
// http://boinc.berkeley.edu
|
2008-08-06 18:36:30 +00:00
|
|
|
// Copyright (C) 2008 University of California
|
2005-01-20 23:22:22 +00:00
|
|
|
//
|
2008-08-06 18:36:30 +00:00
|
|
|
// BOINC is free software; you can redistribute it and/or modify it
|
|
|
|
// under the terms of the GNU Lesser General Public License
|
|
|
|
// as published by the Free Software Foundation,
|
|
|
|
// either version 3 of the License, or (at your option) any later version.
|
2005-01-20 23:22:22 +00:00
|
|
|
//
|
2008-08-06 18:36:30 +00:00
|
|
|
// BOINC is distributed in the hope that it will be useful,
|
2005-01-20 23:22:22 +00:00
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
// See the GNU Lesser General Public License for more details.
|
|
|
|
//
|
2008-08-06 18:36:30 +00:00
|
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
|
|
// along with BOINC. If not, see <http://www.gnu.org/licenses/>.
|
2005-01-20 23:22:22 +00:00
|
|
|
|
2009-06-01 22:15:14 +00:00
|
|
|
#ifndef _SCHED_SEND_
|
|
|
|
#define _SCHED_SEND_
|
|
|
|
|
2008-08-04 18:48:26 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2009-06-01 22:15:14 +00:00
|
|
|
#include "boinc_db.h"
|
2009-08-10 04:56:46 +00:00
|
|
|
#include "sched_types.h"
|
2009-06-01 22:15:14 +00:00
|
|
|
|
2008-12-16 16:29:54 +00:00
|
|
|
extern void send_work();
|
2004-09-10 00:41:48 +00:00
|
|
|
|
|
|
|
extern int add_result_to_reply(
|
2011-06-06 03:40:42 +00:00
|
|
|
SCHED_DB_RESULT& result, WORKUNIT& wu, BEST_APP_VERSION* bavp,
|
2009-03-03 16:38:54 +00:00
|
|
|
bool locality_scheduling
|
2004-09-10 00:41:48 +00:00
|
|
|
);
|
|
|
|
|
2010-07-23 17:43:20 +00:00
|
|
|
inline bool is_anonymous(PLATFORM* platform) {
|
2008-08-04 18:48:26 +00:00
|
|
|
return (!strcmp(platform->name, "anonymous"));
|
|
|
|
}
|
2004-09-10 00:41:48 +00:00
|
|
|
|
|
|
|
extern bool app_core_compatible(WORK_REQ& wreq, APP_VERSION& av);
|
2005-02-02 22:58:46 +00:00
|
|
|
|
2007-05-30 17:25:51 +00:00
|
|
|
// values returned by wu_is_infeasible()
|
2005-04-18 17:54:03 +00:00
|
|
|
//
|
2009-07-29 18:34:27 +00:00
|
|
|
#define INFEASIBLE_MEM 1
|
|
|
|
#define INFEASIBLE_DISK 2
|
|
|
|
#define INFEASIBLE_CPU 3
|
|
|
|
#define INFEASIBLE_WORK_BUF 4
|
|
|
|
#define INFEASIBLE_APP_SETTING 5
|
|
|
|
#define INFEASIBLE_WORKLOAD 6
|
|
|
|
#define INFEASIBLE_DUP 7
|
|
|
|
#define INFEASIBLE_HR 8
|
|
|
|
#define INFEASIBLE_BANDWIDTH 9
|
|
|
|
#define INFEASIBLE_CUSTOM 10
|
2011-05-17 21:11:39 +00:00
|
|
|
#define INFEASIBLE_USER_FILTER 11
|
2005-04-18 17:54:03 +00:00
|
|
|
|
2009-08-31 19:35:46 +00:00
|
|
|
extern int wu_is_infeasible_fast(
|
|
|
|
WORKUNIT&,
|
|
|
|
int res_server_state, int res_priority, double res_report_deadline,
|
|
|
|
APP&, BEST_APP_VERSION&
|
|
|
|
);
|
2006-10-22 00:42:44 +00:00
|
|
|
|
2008-12-16 16:29:54 +00:00
|
|
|
extern double max_allowable_disk();
|
2005-08-04 03:50:04 +00:00
|
|
|
|
2008-12-19 18:14:02 +00:00
|
|
|
extern bool wu_already_in_reply(WORKUNIT& wu);
|
2005-08-04 03:50:04 +00:00
|
|
|
|
2008-12-15 21:14:32 +00:00
|
|
|
extern double estimate_duration(WORKUNIT& wu, BEST_APP_VERSION&);
|
2005-08-04 03:50:04 +00:00
|
|
|
|
2011-06-06 03:40:42 +00:00
|
|
|
extern int update_wu_on_send(WORKUNIT wu, time_t x, APP&, BEST_APP_VERSION&);
|
2005-08-04 03:58:00 +00:00
|
|
|
|
|
|
|
extern void lock_sema();
|
|
|
|
extern void unlock_sema();
|
2007-11-30 23:02:55 +00:00
|
|
|
extern const char* infeasible_string(int);
|
2008-12-16 16:29:54 +00:00
|
|
|
extern bool app_not_selected(WORKUNIT&);
|
2008-12-19 18:14:02 +00:00
|
|
|
extern bool work_needed(bool);
|
2009-03-05 23:08:53 +00:00
|
|
|
extern void send_work_setup();
|
2009-06-01 22:15:14 +00:00
|
|
|
extern int effective_ncpus();
|
|
|
|
extern int preferred_app_message_index;
|
2010-06-25 22:00:09 +00:00
|
|
|
extern void update_n_jobs_today();
|
- server: change the following from per-host to per-(host, app version):
- daily quota mechanism
- reliable mechanism (accelerated retries)
- "trusted" mechanism (adaptive replication)
- scheduler: enforce host scale probation only for apps with
host_scale_check set.
- validator: do scale probation on invalid results
(need this in addition to error and timeout cases)
- feeder: update app version scales every 10 min, not 10 sec
- back-end apps: support --foo as well as -foo for options
Notes:
- If you have, say, cuda, cuda23 and cuda_fermi plan classes,
a host will have separate quotas for each one.
That means it could error out on 100 jobs for cuda_fermi,
and when its quota goes to zero,
error out on 100 jobs for cuda23, etc.
This is intentional; there may be cases where one version
works but not the others.
- host.error_rate and host.max_results_day are deprecated
TODO:
- the values in the app table for limits on jobs in progress etc.
should override rather than config.xml.
Implementation notes:
scheduler:
process_request():
read all host_app_versions for host at start;
Compute "reliable" and "trusted" for each one.
write modified records at end
get_app_version():
add "reliable_only" arg; if set, use only reliable versions
skip over-quota versions
Multi-pass scheduling: if have at least one reliable version,
do a pass for jobs that need reliable,
and use only reliable versions.
Then clear best_app_versions cache.
Score-based scheduling: for need-reliable jobs,
it will pick the fastest version,
then give a score bonus if that version happens to be reliable.
When get back a successful result from client:
increase daily quota
When get back an error result from client:
impose scale probation
decrease daily quota if not aborted
Validator:
when handling a WU, create a vector of HOST_APP_VERSION
parallel to vector of RESULT.
Pass it to assign_credit_set().
Make copies of originals so we can update only modified ones
update HOST_APP_VERSION error rates
Transitioner:
decrease quota on timeout
svn path=/trunk/boinc/; revision=21181
2010-04-15 03:13:56 +00:00
|
|
|
|
2009-06-01 22:15:14 +00:00
|
|
|
#endif
|