diff --git a/checkin_notes b/checkin_notes
index 96156aba65..b8a9562bad 100644
--- a/checkin_notes
+++ b/checkin_notes
@@ -7084,3 +7084,9 @@ David 26 Aug 2008
client/
gui_rpc_server.C,h
gui_rpc_server_ops.C
+
+David 28 Aug 2008
+ - client (Unix): don't assume that LD_LIBRARY_PATH is defined
+
+ client/
+ app_start.C
diff --git a/client/app_start.C b/client/app_start.C
index 595690c602..593279f9aa 100644
--- a/client/app_start.C
+++ b/client/app_start.C
@@ -771,9 +771,12 @@ int ACTIVE_TASK::start(bool first_time) {
//
char libpath[8192];
get_project_dir(wup->project, buf, sizeof(buf));
- sprintf(libpath, "%s:../../%s:.:../..",
- getenv("LD_LIBRARY_PATH"), buf
- );
+ char* p = getenv("LD_LIBRARY_PATH");
+ if (p) {
+ sprintf(libpath, "%s:../../%s:.:../..", p, buf);
+ } else {
+ sprintf(libpath, "../../%s:.:../..", buf);
+ }
fprintf(stderr, "LD PATH: %s\n", libpath);
setenv("LD_LIBRARY_PATH", libpath, 1);
diff --git a/doc/boinc_news.php b/doc/boinc_news.php
index 2aa46133ad..fef292aa08 100644
--- a/doc/boinc_news.php
+++ b/doc/boinc_news.php
@@ -1,6 +1,13 @@
$project_news = array(
+array("August 26, 2008",
+ "Welcome to the
+ NQueens@home project,
+ from the Universidad de Concepción in Chile,
+ which seeks to find the solutions to the N Queens problem
+ for values of 26 and greater."
+),
array("August 19, 2008",
"LinkedIn users: join a
BOINC Users group."
diff --git a/doc/projects.inc b/doc/projects.inc
index 55ff2ac264..8d27193eda 100644
--- a/doc/projects.inc
+++ b/doc/projects.inc
@@ -218,6 +218,14 @@ $math = array(
"This project studies Chess 960, a variant of orthodox chess. In classical chess the starting position of the game never changes. In Chess 960, just before the start of every game, the initial configuration of the chess pieces is determined randomly.",
"chess960athome.jpg"
),
+ array(
+ "NQueens@home",
+ "http://nqueens.ing.udec.cl/",
+ "Universidad de Concepción, Chile",
+ "Game-playing",
+ "The eight queens problem consists of trying to place eight queens on a chessboard so that no queen attacks any other queen. I has long been known that there are 92 solutions, of which 12 are distinct. NQueens@home studies the generalization to N queens on an NxN board, for N=19 and greater.",
+ "NQueens-Logo1b.png"
+ ),
),
);
diff --git a/html/ops/bolt_admin.php b/html/ops/bolt_admin.php
index 55666149e0..a930c2634d 100644
--- a/html/ops/bolt_admin.php
+++ b/html/ops/bolt_admin.php
@@ -24,8 +24,8 @@ function show_course($course) {
Description: $course->description
Created: ".date_str($course->create_time)."
";
- $y = "id>Course map
-
id>Lesson compare
+ $y = "id>Map
+
id>Experiments
";
row2_init($x, $y);
diff --git a/sched/sched_plan.C b/sched/sched_plan.C
index b0adbe3287..7d135d2c99 100644
--- a/sched/sched_plan.C
+++ b/sched/sched_plan.C
@@ -67,6 +67,11 @@ bool app_plan(SCHEDULER_REQUEST& sreq, char* plan_class, HOST_USAGE& hu) {
for (unsigned int i=0; itype, "CUDA")) {
+ COPROC_CUDA* cp2 = (COPROC_CUDA*) cp;
+ if ((cp2->prop.major)*100 + (cp2->prop.minor) <= 100) {
+ log_messages.printf(MSG_DEBUG, "Host GPU architecture < 1.1");
+ return false;
+ }
COPROC* cu = new COPROC (cp->type);
cu->count = 1;
hu.coprocs.coprocs.push_back(cu);