Standard

Memory-efficient matrix multiplication in the BSP model. / McColl, W. F.; Tiskin, A.

в: Algorithmica (New York), Том 24, № 3-4, 01.01.1999, стр. 287-297.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

McColl, WF & Tiskin, A 1999, 'Memory-efficient matrix multiplication in the BSP model', Algorithmica (New York), Том. 24, № 3-4, стр. 287-297. https://doi.org/10.1007/PL00008264

APA

McColl, W. F., & Tiskin, A. (1999). Memory-efficient matrix multiplication in the BSP model. Algorithmica (New York), 24(3-4), 287-297. https://doi.org/10.1007/PL00008264

Vancouver

McColl WF, Tiskin A. Memory-efficient matrix multiplication in the BSP model. Algorithmica (New York). 1999 Янв. 1;24(3-4):287-297. https://doi.org/10.1007/PL00008264

Author

McColl, W. F. ; Tiskin, A. / Memory-efficient matrix multiplication in the BSP model. в: Algorithmica (New York). 1999 ; Том 24, № 3-4. стр. 287-297.

BibTeX

@article{a64cf41606a04679a559427860cbb482,
title = "Memory-efficient matrix multiplication in the BSP model",
abstract = "The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Its modification, the BSPRAM model, allows one to combine the advantages of distributed and shared-memory style programming. In this paper we study the BSP memory complexity of matrix multiplication. We propose new memory-efficient BSP algorithms both for standard and for fast matrix multiplication. The BSPRAM model is used to simplify the description of the algorithms. The communication and synchronization complexity of our algorithms is slightly higher than that of known time-efficient BSP algorithms. The current time-efficient and new memory-efficient algorithms are connected by a continuous tradeoff. {\textcopyright} 1999 Springer-Verkg New York Inc.",
keywords = "BSP, Bulk-synchronous parallel computation, Memory efficiency, Parallel matrix multiplication",
author = "McColl, {W. F.} and A. Tiskin",
year = "1999",
month = jan,
day = "1",
doi = "10.1007/PL00008264",
language = "English",
volume = "24",
pages = "287--297",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer Nature",
number = "3-4",

}

RIS

TY - JOUR

T1 - Memory-efficient matrix multiplication in the BSP model

AU - McColl, W. F.

AU - Tiskin, A.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Its modification, the BSPRAM model, allows one to combine the advantages of distributed and shared-memory style programming. In this paper we study the BSP memory complexity of matrix multiplication. We propose new memory-efficient BSP algorithms both for standard and for fast matrix multiplication. The BSPRAM model is used to simplify the description of the algorithms. The communication and synchronization complexity of our algorithms is slightly higher than that of known time-efficient BSP algorithms. The current time-efficient and new memory-efficient algorithms are connected by a continuous tradeoff. © 1999 Springer-Verkg New York Inc.

AB - The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Its modification, the BSPRAM model, allows one to combine the advantages of distributed and shared-memory style programming. In this paper we study the BSP memory complexity of matrix multiplication. We propose new memory-efficient BSP algorithms both for standard and for fast matrix multiplication. The BSPRAM model is used to simplify the description of the algorithms. The communication and synchronization complexity of our algorithms is slightly higher than that of known time-efficient BSP algorithms. The current time-efficient and new memory-efficient algorithms are connected by a continuous tradeoff. © 1999 Springer-Verkg New York Inc.

KW - BSP

KW - Bulk-synchronous parallel computation

KW - Memory efficiency

KW - Parallel matrix multiplication

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

U2 - 10.1007/PL00008264

DO - 10.1007/PL00008264

M3 - Article

AN - SCOPUS:0000743020

VL - 24

SP - 287

EP - 297

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3-4

ER -

ID: 127713163