{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:35:48Z","timestamp":1649104548363},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1997,6]]},"abstract":"<jats:p> We present in this paper general techniques for overlapping communications in parallel numerical kernels. We describe first some dependencies schemes which can be found in most of numerical parallel algorithms and we apply on these schemes methods based on the change of the granularity of the computational tasks. The choice of the granularity in order to obtain a good overlap depends on the main parameters of the target machines. So we present results of benchmarks executed on two parallel distributed memory machines: a Cray T3D and an Intel Paragon. Then we apply the precedent techniques of overlapping on classical numerical kernels, namely: the matrix-vector and the matrix-matrix products and the mono and bi-dimensional FFT. We have implemented to the overlapped versions of these algorithms on a T3D and a Paragon and tuned the parameters of overlapping in order to minimize the total execution time. The results of these experiments demonstrate the accuracy of this approach. <\/jats:p>","DOI":"10.1142\/s012905419700015x","type":"journal-article","created":{"date-parts":[[2003,10,16]],"date-time":"2003-10-16T00:35:19Z","timestamp":1066264519000},"page":"211-235","source":"Crossref","is-referenced-by-count":0,"title":["Methods to Overlap Communications in Parallel Numerical Algorithms"],"prefix":"10.1142","volume":"08","author":[{"given":"C.","family":"Calvin","sequence":"first","affiliation":[{"name":"CEA DRN\/DTP\/SMTH\/LATA, 17 Rue des Martyrs, 38054 Grenoble cedex 9, France"}]},{"given":"L.","family":"Colombet","sequence":"additional","affiliation":[{"name":"CEA\/DI, Cisi, 17 Rue des Martyrs, 38054 Grenoble cedex 9, France"}]},{"given":"Ph.","family":"Michallon","sequence":"additional","affiliation":[{"name":"ETCA\/CREA\/SP, 16 bis, A. Prieur de la c\u00f4te d'or, 94114 Arcueil, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905419700015X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:45:57Z","timestamp":1565138757000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905419700015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1997,6]]}},"alternative-id":["10.1142\/S012905419700015X"],"URL":"https:\/\/doi.org\/10.1142\/s012905419700015x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}