-
David E. Culler,
Richard Karp,
David Patterson,
Abhijit Sahay,
Klaus Erik Schauser,
Eunice Santos,
Ramesh Subramonian,
and Thorsten von Eicken.
LogP: towards a realistic model of parallel computation.
In Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming,
pages 1-12,
1993.
ACM Press.
ISBN: 0-89791-589-5.
[PDF]
Keyword(s): LogP.
Abstract: |
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. it is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples that are implemented on the CM-5. |
@InProceedings{CullerKarpPattersonLogP93,
author = {David E. Culler and Richard Karp and David Patterson and Abhijit Sahay and Klaus Erik Schauser and Eunice Santos and Ramesh Subramonian and Thorsten {von Eicken}},
title = {{LogP}: towards a realistic model of parallel computation},
booktitle = {Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming},
year = {1993},
isbn = {0-89791-589-5},
pages = {1--12},
location = {San Diego, California, United States},
publisher = {ACM Press},
keywords = {LogP},
abstract = {A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. it is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples that are implemented on the CM-5.},
pdf = {PAPERS/CullerKarpPattersonLogP93.pdf}
}
-
Frank Dehne,
Andreas Fabri,
and Andrew Rau-Chaplin.
Scalable parallel geometric algorithms for coarse grained multicomputers.
In Proceedings of the Ninth Annual Symposium on Computational Geometry,
pages 298-307,
1993.
ACM Press.
ISBN: 0-89791-582-8.
[PDF]
Keyword(s): CGM.
@InProceedings{DehneFabriRauCGM93,
author = {Frank Dehne and Andreas Fabri and Andrew Rau-Chaplin},
title = {Scalable parallel geometric algorithms for coarse grained multicomputers},
booktitle = {Proceedings of the Ninth Annual Symposium on Computational Geometry},
year = {1993},
isbn = {0-89791-582-8},
pages = {298--307},
location = {San Diego, California, United States},
publisher = {ACM Press},
pdf = {PAPERS/DehneFabriRauCGM93.pdf},
keywords = {CGM}
}
-
J.-M. Jézéquel.
Transparent Parallelisation Through Reuse: Between a Compiler and a Library Approach.
In O. M. Nierstrasz, editor,
ECOOP'93 proceedings,
number 707 of Lecture Notes in Computer Science,
pages 384-405,
July 1993.
Springer Verlag.
@InProceedings{Jezequel93:Transparent,
author = {J.-M. J\'ez\'equel},
title = {Transparent Parallelisation Through Reuse: Between a Compiler and a Library Approach},
booktitle = {{ECOOP}'93 proceedings},
pages = {384--405},
year = 1993,
editor = {O. M. Nierstrasz},
number = 707,
series = {Lecture Notes in Computer Science},
month = {July},
publisher = {Springer Verlag}
}