BSP versus LogP
- Author
- BILARDI, G1 2 ; HERLEY, K. T3 ; PIETRACAPRINA, A1 ; PUCCI, G1 ; SPIRAKIS, P4
[1] Dipartimento di Elettronica e Informatica, Università di Padova, 35131 Padova, Italy
[2] Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, Chicago, IL 60607, United States
[3] Department of Computer Science, University College Cork, Cork, Ireland
[4] Computer Technology Institute, Patras, Greece - Issue title
- Coarse-Grained Parallel Algorithms
- Author (monograph)
- DEHNE, F (Editor)1
[1] School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada - Source
Algorithmica. 1999, Vol 24, Num 3-4, pp 405-421 ; ref : 37 ref
- ISSN
- 0178-4617
- Scientific domain
- Computer science
- Publisher
- Springer, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Calcul parallèle Décrochage Entretoise Modèle Modélisation Mémoire répartie Portabilité Processeur Réseau Simulation Variant Modèle logP
- Keyword (en)
- Parallel computation Stalling Bridging Models Modeling Distributed memory Portability Processor Network Simulation Variant
- Keyword (es)
- Cálculo paralelo Descolgadura Arriostramiento Modelo Modelización Memoria compartida Portabilidad Procesador Red Simulación Variante
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1900523
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
Access to the document
Install on your browser
DOI
10.1007/PL00008270 
https://dx.doi.org/10.1007/PL00008270
"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:18:\"10.1007\/PL00008270\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:15:\"BSP versus LogP\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"24\";s:8:\"\u0000*\u0000issue\";s:3:\"3-4\";s:8:\"\u0000*\u0000spage\";s:3:\"405\";s:8:\"\u0000*\u0000epage\";s:3:\"421\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"BILARDI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:12:\"HERLEY, K. T\";i:1;s:16:\"PIETRACAPRINA, A\";i:2;s:8:\"PUCCI, G\";i:3;s:11:\"SPIRAKIS, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:34:\"Coarse-Grained Parallel Algorithms\";s:8:\"\u0000*\u0000title\";s:15:\"BSP versus LogP\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/PL00008270\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:15:\"BSP versus LogP\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"24\";s:8:\"\u0000*\u0000issue\";s:3:\"3-4\";s:8:\"\u0000*\u0000spage\";s:3:\"405\";s:8:\"\u0000*\u0000epage\";s:3:\"421\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"BILARDI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:12:\"HERLEY, K. T\";i:1;s:16:\"PIETRACAPRINA, A\";i:2;s:8:\"PUCCI, G\";i:3;s:11:\"SPIRAKIS, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:34:\"Coarse-Grained Parallel Algorithms\";s:8:\"\u0000*\u0000title\";s:15:\"BSP versus LogP\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/PL00008270\";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;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/PL00008270\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:15:\"BSP versus LogP\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"24\";s:8:\"\u0000*\u0000issue\";s:3:\"3-4\";s:8:\"\u0000*\u0000spage\";s:3:\"405\";s:8:\"\u0000*\u0000epage\";s:3:\"421\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"BILARDI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:12:\"HERLEY, K. T\";i:1;s:16:\"PIETRACAPRINA, A\";i:2;s:8:\"PUCCI, G\";i:3;s:11:\"SPIRAKIS, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:34:\"Coarse-Grained Parallel Algorithms\";s:8:\"\u0000*\u0000title\";s:15:\"BSP versus LogP\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/PL00008270\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:15:\"BSP versus LogP\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"24\";s:8:\"\u0000*\u0000issue\";s:3:\"3-4\";s:8:\"\u0000*\u0000spage\";s:3:\"405\";s:8:\"\u0000*\u0000epage\";s:3:\"421\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"BILARDI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:12:\"HERLEY, K. T\";i:1;s:16:\"PIETRACAPRINA, A\";i:2;s:8:\"PUCCI, G\";i:3;s:11:\"SPIRAKIS, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:34:\"Coarse-Grained Parallel Algorithms\";s:8:\"\u0000*\u0000title\";s:15:\"BSP versus LogP\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/PL00008270\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:15:\"BSP versus LogP\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"24\";s:8:\"\u0000*\u0000issue\";s:3:\"3-4\";s:8:\"\u0000*\u0000spage\";s:3:\"405\";s:8:\"\u0000*\u0000epage\";s:3:\"421\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"BILARDI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:12:\"HERLEY, K. T\";i:1;s:16:\"PIETRACAPRINA, A\";i:2;s:8:\"PUCCI, G\";i:3;s:11:\"SPIRAKIS, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:34:\"Coarse-Grained Parallel Algorithms\";s:8:\"\u0000*\u0000title\";s:15:\"BSP versus LogP\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
arXiv access
