no. 1
Pipelined decomposable BSP computers
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 1, pp. 43-65.

The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if restricted properly. We will also correct some earlier results about pipelined parallel Turing machines.

DOI : 10.1051/ita:2002004
Classification : 68Q05, 68Q10
Mots clés : BSP, complexity theory, models of compuation, parallel computing, pipelining 
@article{ITA_2002__36_1_43_0,
     author = {Beran, Martin},
     title = {Pipelined decomposable {BSP} computers},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {43--65},
     publisher = {EDP-Sciences},
     volume = {36},
     number = {1},
     year = {2002},
     doi = {10.1051/ita:2002004},
     mrnumber = {1928158},
     zbl = {1013.68087},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita:2002004/}
}
TY  - JOUR
AU  - Beran, Martin
TI  - Pipelined decomposable BSP computers
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2002
SP  - 43
EP  - 65
VL  - 36
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2002004/
DO  - 10.1051/ita:2002004
LA  - en
ID  - ITA_2002__36_1_43_0
ER  - 
%0 Journal Article
%A Beran, Martin
%T Pipelined decomposable BSP computers
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2002
%P 43-65
%V 36
%N 1
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita:2002004/
%R 10.1051/ita:2002004
%G en
%F ITA_2002__36_1_43_0
Beran, Martin. Pipelined decomposable BSP computers. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 1, pp. 43-65. doi : 10.1051/ita:2002004. http://www.numdam.org/articles/10.1051/ita:2002004/

[1] M. Beran, Decomposable bulk synchronous parallel computers, in Proc. of SOFSEM '99. Springer-Verlag, Lecture Notes in Comput. Sci. 1725 (1999) 349-359. http://www.ms.mff.cuni.cz/~beran/publications.html | Zbl

[2] M. Beran, Formalizing, analyzing, and extending the model of bulk synchronous parallel computer, Technical Report V-829. Institute of Computer Science, Academy of Sciences of the Czech Republic (2000). http://www.cs.cas.cz/research/library/reports_800.shtml

[3] O. Bonorden, B. Juurlink, I. Von Otte and I. Rieping, The Paderborn University BSP (PUB) library - design, implementation and performance, in Proc. of 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP). San Juan, Puerto Rico (1999). http://www.uni-paderborn.de/~pub/

[4] P. Van Emde Boas, Machine models and simulations, edited by J. van Leeuwen. Elsevier Science Publishers, Amsterdam, Handb. Theoret. Comput. Sci. A (1990) 1-66. | MR | Zbl

[5] P. Van Emde Boas, The second machine class, model of parallelism, edited by J. van Leeuwen, J.K. Lenstra and A.H.G. Rinnooy Kan. Centre for Mathematics and Computer Science, Amsterdam, Parallel Computers and Computations, CWI Syllabus 9 (1985) 133-161. | MR

[6] A.V. Gerbessiotis and C.J. Siniolakis, Primitive operations on the BSP model, Technical Report PRG-TR-23-96. Oxford University Computing Laboratory, Oxford (1996).

[7] A.V. Gerbessiotis and L.G. Valiant, Direct bulk-synchronous parallel algorithms. J. Parallel Distributed Comput. 22 (1994) 251-267.

[8] D.Q. Goldin, S.A. Smolka and P. Wegner, Turing machines, transition systems, and interaction (submitted). http://www.cs.umb.edu/~dqg/papers/mfcs.ps

[9] J.M.D. Hill, W. Mccoll, D.C. Stefanescu, M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, T. Tsantilas and R. Bisseling, BSPlib: The BSP programming library. BSPlib reference manual with ANSI C examples (1998). http://www.bsp-worldwide.org/implmnts/oxtool/

[10] B.H.H. Juurlink and H.A.G. Wijshoff, Communication primitives for BSP computers. Inform. Process. Lett. 58 (1996) 303-310. | MR | Zbl

[11] R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, edited by J. van Leeuwen. Elsevier Science Publishers, Amsterdam, Handb. Theoret. Comput. Sci. A (1990) 869-941. | MR | Zbl

[12] J. Van Leeuwen and J. Wiedermann, The Turing machine paradigm in contemporary computing, edited by B. Enquist and W. Schmidt. Springer-Verlag, Mathematics Unlimited - 2001 and Beyond (2001) 1139-1155. | MR | Zbl

[13] W.F. Mccoll, Bulk synchronous parallel computing, edited by J.R. Davy and P.M. Dew. Oxford University Press, Abstract Machine Models for Highly Parallel Computers (1995) 41-63. | MR

[14] C. Slot and P. Van Emde Boas, On tape versus core; an application of space efficient perfect hash function to the invariance of space, in Proc. of STOC'84. Washington D.C. (1984) 391-400.

[15] L.G. Valiant, A bridging model for parallel computation. Comm. ACM 33 (1990) 103-111.

[16] P. Wegner, Models and paradigms of interaction. OOPSLA Tutorial Notes (1995).

[17] J. Wiedermann, Weak parallel machines: A new class of physically feasible parallel machine models, in Mathematical Foundations of Computer Science 1992, 17th Int. Symposium (MFCS'92), edited by I.M. Havel and V. Koubek. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 629 (1992) 95-111.

Cité par Sources :