Matrix algorithms on a hypercube I: matrix multiplication
- Autor
- FOX, G. C1 ; OTTO, S. W; HEY, A. J. G
[1] California inst. technology, Pasadena CA 91125, United States - Fuente
Parallel computing. 1987, Vol 4, Num 1, pp 17-31 ; ref : 17 ref
- CODEN
- PACOEJ
- ISSN
- 0167-8191
- Campo Científico
- Computer science
- Editor
- Elsevier, Amsterdam
- País de la publicación
- Netherlands
- Tipo de documento
- Article
- Idioma
- English
- Palabra clave (fr)
- Algorithme Analyse performance Langage C Matrice carrée Mémoire Méthode décomposition Produit matrice Programme concurrent Traitement parallèle Calculateur MIMD Hypercube Mémoire répartie
- Palabra clave (in)
- Algorithm Performance analysis C language Square matrix Memory Decomposition method Matrix product Concurrent program Parallel processing MIMD computer Hypercube Distributed memory
- Palabra clave (es)
- Algorritmo Análisis eficacia Lenguaje C Matriz cuadrada Memoria Método descomposición Producto matriz Programa competidor Tratamiento paralelo
- Clasificación
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Disciplina
- Computer science : theoretical automation and systems
- Procedencia
- Inist-CNRS
- Base de datos
- PASCAL
- Identificador INIST
- 8284496
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Acceso al documento
Install on your browser
DOI
10.1016/0167-8191(87)90060-3 
https://dx.doi.org/10.1016/0167-8191(87)90060-3
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0167-8191(87)90060-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:9:\"\u0000*\u0000jtitle\";s:18:\"Parallel computing\";s:9:\"\u0000*\u0000stitle\";s:15:\"Parallel comput\";s:7:\"\u0000*\u0000date\";s:4:\"1987\";s:9:\"\u0000*\u0000volume\";s:1:\"4\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"17\";s:8:\"\u0000*\u0000epage\";s:2:\"31\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8191\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FOX\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"OTTO, S. W\";i:1;s:12:\"HEY, A. J. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PACOEJ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Panist
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0167-8191(87)90060-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:9:\"\u0000*\u0000jtitle\";s:18:\"Parallel computing\";s:9:\"\u0000*\u0000stitle\";s:15:\"Parallel comput\";s:7:\"\u0000*\u0000date\";s:4:\"1987\";s:9:\"\u0000*\u0000volume\";s:1:\"4\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"17\";s:8:\"\u0000*\u0000epage\";s:2:\"31\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8191\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FOX\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"OTTO, S. W\";i:1;s:12:\"HEY, A. J. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PACOEJ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Istex
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0167-8191(87)90060-3\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Acceso mediante Unpaywall
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0167-8191(87)90060-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:9:\"\u0000*\u0000jtitle\";s:18:\"Parallel computing\";s:9:\"\u0000*\u0000stitle\";s:15:\"Parallel comput\";s:7:\"\u0000*\u0000date\";s:4:\"1987\";s:9:\"\u0000*\u0000volume\";s:1:\"4\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"17\";s:8:\"\u0000*\u0000epage\";s:2:\"31\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8191\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FOX\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"OTTO, S. W\";i:1;s:12:\"HEY, A. J. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PACOEJ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Europe PubMed Central
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0167-8191(87)90060-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:9:\"\u0000*\u0000jtitle\";s:18:\"Parallel computing\";s:9:\"\u0000*\u0000stitle\";s:15:\"Parallel comput\";s:7:\"\u0000*\u0000date\";s:4:\"1987\";s:9:\"\u0000*\u0000volume\";s:1:\"4\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"17\";s:8:\"\u0000*\u0000epage\";s:2:\"31\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0167-8191\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"FOX\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"OTTO, S. W\";i:1;s:12:\"HEY, A. J. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"PACOEJ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:57:\"Matrix algorithms on a hypercube I: matrix multiplication\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante arXiv
