Constantin Fürst
|
53e05d096c
|
add even more comments and remove an old code line that modified the reference counter of cache data from the outside
|
12 months ago |
Constantin Fürst
|
52566fc13b
|
print to cerr for bad states in the test-main
|
12 months ago |
Constantin Fürst
|
46de3151a2
|
add a lot of comments to the code, also handle errors in the dml handlers gracefully
|
12 months ago |
Constantin Fürst
|
c01eafedae
|
refactor the cacher to reduce complexity, removes the access guarantees (relaxed,immediate,...), uses the fact that other tasks will wait on atomic value change for the cache-pointer if it is nullptr to add the entry to cache structure earlier reducing cost of two threads accessing new entry at the same time, splits the offloading-cache.hpp file into two with one containing the data-class (represents a cache entry and task) and the other containing the cacher itself
|
12 months ago |
Constantin Fürst
|
395d307310
|
fix an issue with the freeing of data in the cacher
|
12 months ago |
Constantin Fürst
|
f19c069b0f
|
always perform copy from src and dst node, add another log output about the split
|
12 months ago |
Constantin Fürst
|
5e30a370ce
|
finish first stage of caching implementation and provide a rudimentary test function in the main
|
12 months ago |
Constantin Fürst
|
d396056230
|
provide first draft of implementations for the cachers functionality
|
12 months ago |
Constantin Fürst
|
623366433b
|
continue modifying the declarations for the cacher and providing some first definitions
|
12 months ago |
Constantin Fürst
|
f91cd3202f
|
add project 'offloading cacher' and function declarations for the cacher in its header file
|
12 months ago |
Constantin Fürst
|
3f5f5f267d
|
note down bullet points for the content of chapter 3 (performance)
|
12 months ago |
Constantin Fürst
|
ef3058ed00
|
add missing tex files after restructure and rewrite the title page in english
|
12 months ago |
Constantin Fürst
|
f9e3e7e4df
|
slight restructuring of the thesis, part of formulating the contents
|
12 months ago |
Constantin Fürst
|
35ae279c3b
|
remove todos and todo page from the tex files, remove test-texcode, add some structure points
|
12 months ago |
Constantin Fürst
|
f0273d526f
|
extend the glossary entry for pcie dmr
|
12 months ago |
Constantin Fürst
|
0c775fc0ce
|
change citation style to ieee standard
|
12 months ago |
Constantin Fürst
|
b124d594bd
|
improve positioning of figures for hw/sw architecture section of chapter 2
|
12 months ago |
Constantin Fürst
|
1f055d84ed
|
write section about dsa hw/sw architecture
|
12 months ago |
Constantin Fürst
|
e137137fbc
|
add new glossary entries and references for chapter 2
|
12 months ago |
Constantin Fürst
|
f5e2a7df6b
|
add checkibw makefile
|
12 months ago |
Constantin Fürst
|
cf2281f827
|
add dsa hw and sw block diagrams
|
12 months ago |
Constantin Fürst
|
1ab7ceb955
|
import actual task description pdf
|
12 months ago |
Constantin Fürst
|
52a026805e
|
use different notation for glossary which results in easier reading and correct result
|
12 months ago |
Constantin Fürst
|
c0c75aa51b
|
use uniform colormap in the plots and use separate output folder for the plots
|
12 months ago |
Constantin Fürst
|
5f72404508
|
re run changed smart peak throughput benchmarks
|
1 year ago |
Constantin Fürst
|
1fca956a0a
|
update the peak throughput plotter to show the difference of smart and allnodes too
|
1 year ago |
Constantin Fürst
|
791184ff10
|
fix mistake in benchmark descriptors for smart peak performance
|
1 year ago |
Constantin Fürst
|
f809eb5847
|
rerun copy benchmark with smart assignment
|
1 year ago |
Constantin Fürst
|
6b9581b8d1
|
add results for the new 512mib internode hbm copy peak perf test
|
1 year ago |
Constantin Fürst
|
0748826fcd
|
use transfer size of 512mib for HBM intranode copy and modify plotter accordingly
|
1 year ago |
Constantin Fürst
|
60a5ba5120
|
refactor the benchmark plotters and submit newly plotted graphs
|
1 year ago |
Constantin Fürst
|
c0f2aa2b64
|
re-plot the benchmarks with the new data
|
1 year ago |
Constantin Fürst
|
1c7369f20e
|
add results for smart and allnodes peak throughput benchmark
|
1 year ago |
Constantin Fürst
|
1e55565072
|
remove previous benchmark results for peak performance
|
1 year ago |
Constantin Fürst
|
475b2d5b5a
|
provide two benchmarks for peak performance, one that is brute force and one that uses smart node assignment and therefore lower utilization
|
1 year ago |
Constantin Fürst
|
9cef69c33f
|
add mdsa v3 benchmark results for peak performance
|
1 year ago |
Constantin Fürst
|
7ced0bce4c
|
fix an issue in the python script that lead to references being modified which caused bad node settings
|
1 year ago |
Constantin Fürst
|
8787b441bc
|
add second type of multi dsa benchmark results
|
1 year ago |
Constantin Fürst
|
6d9002d1e7
|
use different engine configuration depending on whether intra socket (all 4 engines on the socket) or inter socket (src and destination engine, cross copy) is the copy type
|
1 year ago |
Constantin Fürst
|
68a838f0d1
|
add final multi-dsa results
|
1 year ago |
Constantin Fürst
|
c92bb28d9a
|
add intermediate multi-dsa results
|
1 year ago |
Constantin Fürst
|
f11bb710ae
|
add intermediate multi-dsa results
|
1 year ago |
Constantin Fürst
|
7f7230197c
|
dont submit multiple copies - test takes too long and this has almost no effect at work size of 1gib
|
1 year ago |
Constantin Fürst
|
3e102509a9
|
add intermediate multi-dsa results
|
1 year ago |
Constantin Fürst
|
584c5bdfc4
|
add intermediate multi-dsa results
|
1 year ago |
Constantin Fürst
|
e9807df09c
|
use all 8 engines for each copy task, as the engine location does not affect performance
|
1 year ago |
Constantin Fürst
|
5089936f30
|
prepare peak throughput plotter for multi-node results
|
1 year ago |
Constantin Fürst
|
db11eb60e6
|
add 4e results from copy peak perf bench
|
1 year ago |
Constantin Fürst
|
17264186a6
|
small changes to the plotter scripts for nicer display
|
1 year ago |
Constantin Fürst
|
1682b84fb4
|
use a batch size of 8 to check whether multiple engines can increase throughput
|
1 year ago |