Author:
Loulergue F.,Benheddi R.,Gava F.,Louis-Régis D.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Bäumker, W., adn Dittrich, A., Meyer auf der Heide, F.: Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: 3 rd European Symposium on Algorithms (ESA), pp. 17–30 (1995)
2. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Springer, Heidelberg (2004)
3. Bisseling, R.: Parallel Scientific Computation. A structured approach using BSP and MPI. Oxford University Press, Oxford (2004)
4. Bonorden, O., Juurlink, B., von Otte, I., Rieping, O.: The Paderborn University BSP (PUB) library. Parallel Computing 29(2), 187–207 (2003)
5. Bonorden, O., Meyer auf der Heide, F., Wanka, R.: Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: Proceedings of PDPTA (2002)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Snow: A Parallel Computing Framework for the R System;International Journal of Parallel Programming;2008-07-02