LogP: towards a realistic model of parallel computation Export

@article{citeulike:883887, 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.}, address = {New York, NY, USA}, author = {Culler, David and Karp, Richard and Patterson, David and Sahay, Abhijit and Schauser, Klaus E. and Santos, Eunice and Subramonian, Ramesh and von Eicken, Thorsten}, booktitle = {PPOPP '93: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming}, citeulike-article-id = {883887}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=155333}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/155332.155333}, doi = {10.1145/155332.155333}, issn = {0362-1340}, journal = {SIGPLAN Not.}, keywords = {algorithm, analysis, logp, parallel}, number = {7}, pages = {1--12}, posted-at = {2006-10-04 20:38:30}, priority = {3}, publisher = {ACM}, title = {LogP: towards a realistic model of parallel computation}, url = {http://dx.doi.org/10.1145/155332.155333}, volume = {28}, year = {1993} }

TY - JOUR ID - citeulike:883887 L3 - citeulike-article-id:883887 N2 - 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. IS - 7 JF - SIGPLAN Not. SN - 0362-1340 AD - New York, NY, USA EP - 12 TI - LogP: towards a realistic model of parallel computation PB - ACM VL - 28 T2 - PPOPP '93: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming SP - 1 KW - algorithm KW - analysis KW - logp KW - parallel AU - Culler, David AU - Karp, Richard AU - Patterson, David AU - Sahay, Abhijit AU - Schauser, Klaus AU - Santos, Eunice AU - Subramonian, Ramesh AU - von Eicken, Thorsten PY - 1993/// UR - http://dx.doi.org/10.1145/155332.155333 ER -