%0 Conference Paper %1 culler1993a %A Culler, David %A Karp, Richard %A Patterson, David %A Sahay, Abhijit %A Schauser, Klaus Erik %A Santos, Eunice %A Subramonian, Ramesh %A Thorsten, van Eicken %B Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming %D 1993 %K PRAM, massively parallel logp algorithms, processors, complexity models, analysis, %P 1--12 %T LogP: Towards a Realistic Model of Parallel Computation %X A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly sipecific 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 simpliticy 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, he 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{culler1993a, abstract = {A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly sipecific 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 simpliticy 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, he 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.}, added-at = {2006-03-09T08:15:35.000+0100}, author = {Culler, David and Karp, Richard and Patterson, David and Sahay, Abhijit and Schauser, Klaus Erik and Santos, Eunice and Subramonian, Ramesh and Thorsten, {van Eicken}}, biburl = {https://www.bibsonomy.org/bibtex/2a9454926a6ef5f53338f628d8111dc50/snowball}, booktitle = {Proceedings of the Fourth {ACM} {SIGPLAN} Symposium on Principles \& Practice of Parallel Programming}, checked = {19950124}, interhash = {b574ad31adb9dae6cd0e8dacb1a3ff31}, intrahash = {a9454926a6ef5f53338f628d8111dc50}, keywords = {PRAM, massively parallel logp algorithms, processors, complexity models, analysis,}, month = May, pages = {1--12}, source = {Dept. Library}, timestamp = {2006-03-09T08:15:35.000+0100}, title = {Log{P}: Towards a Realistic Model of Parallel Computation}, year = 1993 }