Changeset bf1914e
- Timestamp:
- Dec 28, 2020, 4:09:20 PM (4 years ago)
- Branches:
- ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- 3e36f220
- Parents:
- 657c36f (diff), 772b300 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
Jenkins/FullBuild
r657c36f rbf1914e 32 32 33 33 stage('Package') { 34 build job: 'Cforall_Distribute_Ref', parameters: [string(name: 'GitRef', value: commitId), string(name: 'Build', value: currentBuild.number.toString())]34 trigger_dist( commitId, currentBuild.number.toString() ) 35 35 } 36 36 } … … 103 103 } 104 104 105 def trigger_dist(String commitId, String build) { 106 def result = build job: 'Cforall_Distribute_Ref', \ 107 parameters: [ \ 108 string(name: 'GitRef', value: commitId), \ 109 string(name: 'Build' , value: build) \ 110 ] 111 112 echo(result.result) 113 114 if(result.result != 'SUCCESS') { 115 sh("wget -q -O - https://cforall.uwaterloo.ca/jenkins/job/Cforall_Distribute_Ref/${result.number}/consoleText") 116 error(result.result) 117 } 118 } 119 105 120 //=========================================================================================================== 106 121 //Routine responsible of sending the email notification once the build is completed -
benchmark/readyQ/locality.cfa
r657c36f rbf1914e 63 63 } 64 64 65 void access(MyData & this, size_t idx) {65 __attribute__((noinline)) void access(MyData & this, size_t idx) { 66 66 size_t l = this.len; 67 67 this.data[idx % l] += 1; … … 126 126 // ================================================== 127 127 // Do some work by accessing 'cnt' cells in the array 128 void work(MyData & data, size_t cnt, uint64_t & state) {128 __attribute__((noinline)) void work(MyData & data, size_t cnt, uint64_t & state) { 129 129 for (cnt) { 130 130 access(data, __xorshift64(state)); … … 166 166 167 167 void ?{}( MyThread & this, MyData * data, MySpot ** spots, size_t spot_len, size_t cnt, bool share, size_t id) { 168 ((thread&)this){ bench_cluster }; 168 169 this.data = data; 169 170 this.spots.ptr = spots; … … 196 197 unsigned long long global_dmigs = 0; 197 198 198 MyData * data_arrays[nthreads];199 for(i; nthreads) {200 data_arrays[i] = malloc();201 (*data_arrays[i]){ i, wsize };202 }203 204 MySpot * spots[nthreads - nprocs];205 for(i; nthreads - nprocs) {206 spots[i] = malloc();207 (*spots[i]){ i };208 }209 210 199 Time start, end; 211 200 { 201 MyData * data_arrays[nthreads]; 202 for(i; nthreads) { 203 data_arrays[i] = malloc(); 204 (*data_arrays[i]){ i, wsize }; 205 } 206 207 MySpot * spots[nthreads - nprocs]; 208 for(i; nthreads - nprocs) { 209 spots[i] = malloc(); 210 (*spots[i]){ i }; 211 } 212 212 213 BenchCluster bc = { nprocs }; 213 214 threads_left = nprocs; … … 250 251 } 251 252 } 252 } 253 254 printf("Duration (ms) : %'ld\n", (end - start)`dms); 253 254 for(i; nthreads) { 255 delete( data_arrays[i] ); 256 } 257 258 for(i; nthreads - nprocs) { 259 delete( spots[i] ); 260 } 261 } 262 263 printf("Duration (ms) : %'lf\n", (end - start)`dms); 255 264 printf("Number of processors : %'d\n", nprocs); 256 265 printf("Number of threads : %'d\n", nthreads); 257 266 printf("Total Operations(ops) : %'15llu\n", global_count); 258 printf("Work size (64bit words): %'15 llu\n", wsize);267 printf("Work size (64bit words): %'15u\n", wsize); 259 268 printf("Total Operations(ops) : %'15llu\n", global_count); 260 269 printf("Total G Migrations : %'15llu\n", global_gmigs); -
benchmark/readyQ/locality.go
r657c36f rbf1914e 282 282 // Print with nice 's, i.e. 1'000'000 instead of 1000000 283 283 p := message.NewPrinter(language.English) 284 p.Printf("Duration ( ms): %f\n", delta.Seconds());284 p.Printf("Duration (s) : %f\n", delta.Seconds()); 285 285 p.Printf("Number of processors : %d\n", nprocs); 286 286 p.Printf("Number of threads : %d\n", nthreads); -
benchmark/readyQ/rq_bench.hfa
r657c36f rbf1914e 39 39 } else if(stop_count > 0) { \ 40 40 clock_mode = false; \ 41 printf("Running for %l u iterations\n", stop_count); \41 printf("Running for %llu iterations\n", stop_count); \ 42 42 } else { \ 43 43 duration = 5; clock_mode = true;\ -
libcfa/src/parseargs.cfa
r657c36f rbf1914e 105 105 if(opt == options[i].short_name) { 106 106 const char * arg = optarg ? optarg : ""; 107 if( arg[0] == '=' ) { arg++; } 107 108 bool success = options[i].parse( arg, options[i].variable ); 108 109 if(success) continue NEXT_ARG;
Note: See TracChangeset
for help on using the changeset viewer.