Reducing the Communication Cost via Chain Pattern Scheduling
|
| Cambridge, Massachusetts July 27-July 29 |
Florina M. Ciorba, National Technical University of Athens Computing Systems Laboratory 9th Heroon Polytechniou Zografou Campus Athens, Greece
Theodore Andronikos, National Technical University of Athens Computing Systems Laboratory 9th Heroon Polytechniou Zografou Campus Athens, Greece
Ioannis Drositis, National Technical University of Athens Computing Systems Laboratory 9th Heroon Polytechniou Zografou Campus Athens, Greece
George Papakonstantinou, National Technical University of Athens Computing Systems Laboratory 9th Heroon Polytechniou Zografou Campus Athens, Greece
Panayotis Tsanakas, National Technical University of Athens Computing Systems Laboratory 9th Heroon Polytechniou Zografou Campus Athens, Greece
Index Terms:
patterns, data locality, communication cost, uniform dependence loop, nested loop scheduling, compute-intensive applications.
Citation:
Florina M. Ciorba, Theodore Andronikos, Ioannis Drositis, George Papakonstantinou, Panayotis Tsanakas, "Reducing the Communication Cost via Chain Pattern Scheduling," nca, pp.186-196, Fourth IEEE International Symposium on Network Computing and Applications, 2005
Usage of this product signifies your acceptance of the
Terms of Use.
|
|
|
|
|
|
|
|