Commit 7eda90b2 authored by Misbah Mubarak's avatar Misbah Mubarak
Browse files

adding large-scale configurations, removing debug statements

parent 823d8957
...@@ -3,7 +3,7 @@ ...@@ -3,7 +3,7 @@
"name": "StandaloneSWM", "name": "StandaloneSWM",
"app": "dll", "app": "dll",
"dll_path": "apps/dll/lammps.so", "dll_path": "apps/dll/lammps.so",
"size": 1024, "size": 2048,
"time": 0, "time": 0,
"cfg": "cfg":
{ {
......
...@@ -252,13 +252,13 @@ NearestNeighborSWMUserCode::call() ...@@ -252,13 +252,13 @@ NearestNeighborSWMUserCode::call()
coords.clear(); coords.clear();
pid_again=0; pid_again=0;
xlat_pid_to_coords(pid, coords); xlat_pid_to_coords(pid, coords);
std::cout << "pid " << pid << " has coords.size " << coords.size() << " "; // std::cout << "pid " << pid << " has coords.size " << coords.size() << " ";
for(size_t i=0; i<coords.size(); i++) { // for(size_t i=0; i<coords.size(); i++) {
std::cout << " " << coords[i]; // std::cout << " " << coords[i];
} // }
std::cout << "; which have pid "; // std::cout << "; which have pid ";
xlat_coords_to_pid(coords, pid_again); // xlat_coords_to_pid(coords, pid_again);
std::cout << pid_again << endl; // std::cout << pid_again << endl;
} }
} }
...@@ -292,7 +292,7 @@ NearestNeighborSWMUserCode::call() ...@@ -292,7 +292,7 @@ NearestNeighborSWMUserCode::call()
uint32_t iter_before_sync = 0; uint32_t iter_before_sync = 0;
uint32_t neighbors_size=neighbors.size(); uint32_t neighbors_size=neighbors.size();
uint32_t pkt_rsp_bytes = 0; uint32_t pkt_rsp_bytes = 0;
for(uint32_t iter=0; iter<iteration_cnt; iter++) for(uint32_t iter=0; iter<iteration_cnt; iter++)
{ {
......
...@@ -4,7 +4,7 @@ ...@@ -4,7 +4,7 @@
"size": 4096, "size": 4096,
"cfg": { "cfg": {
"app": "nearest_neighbor", "app": "nearest_neighbor",
"iteration_cnt": 100, "iteration_cnt": 50,
"compute_delay": 0, "compute_delay": 0,
"noop_cnt": 0, "noop_cnt": 0,
"dimension_cnt": 3, "dimension_cnt": 3,
......
...@@ -97,7 +97,7 @@ NEKBONESWMUserCode::NEKBONESWMUserCode( ...@@ -97,7 +97,7 @@ NEKBONESWMUserCode::NEKBONESWMUserCode(
//Total number of ranks //Total number of ranks
Rtotal = Rx*Ry*Rz; Rtotal = Rx*Ry*Rz;
std::cout << "RX: " << Rx << " | RY: " << Ry << " | RZ: " << Rz << " total=RX*RY*RZ: " << Rtotal << " vs. process_cnt: " << process_cnt << std::endl; // std::cout << "RX: " << Rx << " | RY: " << Ry << " | RZ: " << Rz << " total=RX*RY*RZ: " << Rtotal << " vs. process_cnt: " << process_cnt << std::endl;
assert(Rtotal == process_cnt); assert(Rtotal == process_cnt);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment