Standard

The bulk-synchronous parallel random access machine. / Tiskin, Alexandre.

Euro-Par'96 Parallel Processing (Euro-Par 1996). 1996. p. 327-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1124).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Harvard

Tiskin, A 1996, The bulk-synchronous parallel random access machine. in Euro-Par'96 Parallel Processing (Euro-Par 1996). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1124, pp. 327-338. https://doi.org/10.1007/bfb0024720

APA

Tiskin, A. (1996). The bulk-synchronous parallel random access machine. In Euro-Par'96 Parallel Processing (Euro-Par 1996) (pp. 327-338). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1124). https://doi.org/10.1007/bfb0024720

Vancouver

Tiskin A. The bulk-synchronous parallel random access machine. In Euro-Par'96 Parallel Processing (Euro-Par 1996). 1996. p. 327-338. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/bfb0024720

Author

Tiskin, Alexandre. / The bulk-synchronous parallel random access machine. Euro-Par'96 Parallel Processing (Euro-Par 1996). 1996. pp. 327-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{475b14e4d0cc4a829db2043d216c4ed8,
title = "The bulk-synchronous parallel random access machine",
abstract = "The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for generalpurpose parallel computing. Originally, BSP was defined as a distributed memory model. In this paper we present a new model, called BSPRAM, which is a variant of BSP based on a mixture of shared and distributed memory. The two models are equivalent for some important classes of algorithms. We identify two such classes: oblivious and coarse-block algorithms. Finally, we present BSPRAM algorithms for dense matrix multiplication and Fast Fourier Transform.",
author = "Alexandre Tiskin",
year = "1996",
month = jan,
day = "1",
doi = "10.1007/bfb0024720",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "327--338",
booktitle = "Euro-Par'96 Parallel Processing (Euro-Par 1996)",

}

RIS

TY - GEN

T1 - The bulk-synchronous parallel random access machine

AU - Tiskin, Alexandre

PY - 1996/1/1

Y1 - 1996/1/1

N2 - The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for generalpurpose parallel computing. Originally, BSP was defined as a distributed memory model. In this paper we present a new model, called BSPRAM, which is a variant of BSP based on a mixture of shared and distributed memory. The two models are equivalent for some important classes of algorithms. We identify two such classes: oblivious and coarse-block algorithms. Finally, we present BSPRAM algorithms for dense matrix multiplication and Fast Fourier Transform.

AB - The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for generalpurpose parallel computing. Originally, BSP was defined as a distributed memory model. In this paper we present a new model, called BSPRAM, which is a variant of BSP based on a mixture of shared and distributed memory. The two models are equivalent for some important classes of algorithms. We identify two such classes: oblivious and coarse-block algorithms. Finally, we present BSPRAM algorithms for dense matrix multiplication and Fast Fourier Transform.

UR - http://www.scopus.com/inward/record.url?scp=21444432946&partnerID=8YFLogxK

U2 - 10.1007/bfb0024720

DO - 10.1007/bfb0024720

M3 - Conference contribution

AN - SCOPUS:21444432946

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 327

EP - 338

BT - Euro-Par'96 Parallel Processing (Euro-Par 1996)

ER -

ID: 127724675