From 06621743f586a3dfe8808e1f81f5385d5e018fb0 Mon Sep 17 00:00:00 2001 From: Brandon Holt Date: Sun, 8 Jul 2012 18:57:14 -0700 Subject: [PATCH 1/2] test change --- applications/graph500/softxmt/main.cpp | 2 ++ 1 file changed, 2 insertions(+) diff --git a/applications/graph500/softxmt/main.cpp b/applications/graph500/softxmt/main.cpp index 85c0fc4d5..56ad8fbb4 100644 --- a/applications/graph500/softxmt/main.cpp +++ b/applications/graph500/softxmt/main.cpp @@ -46,6 +46,8 @@ #include #endif +// test change + static int compare_doubles(const void* a, const void* b) { double aa = *(const double*)a; double bb = *(const double*)b; From 0b129c7f18abff5de568c6fc64e661af9dc7806e Mon Sep 17 00:00:00 2001 From: Brandon Holt Date: Sun, 8 Jul 2012 19:05:28 -0700 Subject: [PATCH 2/2] updated readme to reflect test change --- applications/graph500/README-Grappa.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/applications/graph500/README-Grappa.md b/applications/graph500/README-Grappa.md index 360e5e6c6..43a4e26c2 100644 --- a/applications/graph500/README-Grappa.md +++ b/applications/graph500/README-Grappa.md @@ -1,5 +1,7 @@ # Graph500 for Grappa +Another straightforward change. + Graph500 is a fairly new benchmark/competition aimed at encouraging better irregular application performance. Right now, it consists of a single benchmark: breadth-first traversal of a graph structure to create a BFS tree (really just an array `numVertices` long where each element holds the parent of that node). (The next specification will include a Single-Source Shortest Path kernel as well). [Official specification](http://www.graph500.org/specifications) @@ -50,4 +52,4 @@ To break that down a bit: Other options for compiling, etc: -* Compile with DEBUG=1 to get debugging symbols, less variables optimized out, etc. \ No newline at end of file +* Compile with DEBUG=1 to get debugging symbols, less variables optimized out, etc.