{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:06:18Z","timestamp":1729634778251,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2004.1303281","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"234-241","source":"Crossref","is-referenced-by-count":1,"title":["Poly-algorithmic approach applied for fast matrix multiplication on clusters"],"prefix":"10.1109","author":[{"given":"W.","family":"Nasri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/10637199408915454"},{"article-title":"The Grid: Blue print for a New Computing Infrastructure","year":"1999","author":"foster","key":"ref11"},{"key":"ref12","article-title":"FFTW: an adaptive software architecture for the Fast Fourier Transform","author":"frigo","year":"1998","journal-title":"Proceedings of ICASSP"},{"article-title":"Matrix Computations","year":"1996","author":"golub","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626496000029"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/98267.98290","article-title":"Exploitating Fast Matrix Multiplication Within the Level 3 BLAS","volume":"16","author":"higham","year":"1990","journal-title":"ACM Transactions on Mathematical Software"},{"key":"ref16","article-title":"A Poly-algorithm for Parallel Dense Matrix Multiplication on Two-Dimensional Process Grid Topologies","author":"li","year":"1995","journal-title":"Supercomputing'95"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/32.844492"},{"key":"ref19","article-title":"Data distributions for task-parallel programs","author":"rauber","year":"2000","journal-title":"Proc Workshop Compilers for Parallel Computers"},{"journal-title":"High Performance Cluster Computing Architectures and Systems","year":"1999","author":"buyya","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642"},{"journal-title":"Generative Programming","year":"2000","author":"czarnecki","key":"ref6"},{"journal-title":"Parallel Computer Architecture A Hardware-Software Approach","year":"1998","author":"culler","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.924938"},{"key":"ref7","article-title":"A 5\/4-approximation algorithm for identical malleable tasks via phase-by-phase schedules","author":"decker","year":"2001","journal-title":"Technical Report"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4434.708258"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.386.0673"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"}],"event":{"name":"18th International Parallel and Distributed Processing Symposium, 2004.","location":"Santa Fe, NM, USA"},"container-title":["18th International Parallel and Distributed Processing Symposium, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9132\/28950\/01303281.pdf?arnumber=1303281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:57:45Z","timestamp":1497599865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1303281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2004.1303281","relation":{},"subject":[]}}