Result 1 to 20 of 20 total
Graphs partitioning: An optimal MIMD queueless routing for BPC-permutations on hypercubes. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 8th international conference, PPAM 2009, Wroclaw, Poland, September 13‒16, 2009. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-14389-2/pbk). Lecture Notes in Computer Science 6067, 21-30 (2010).
1
On the optimality of all to all broadcast in k ary n dimensional tori. (English)
Comput. Res. Repos. 2009, Article No. 0909.1374 (2009).
2
Graphs partitioning: an optimal MIMD queueless routing for BPC-permutations on hypercubes (English)
PPAM (1), 21-30 (2009).
3
A methodology for devising optimal all-port all-to-all broadcast algorithms in 2-dimensional tori (English)
LCN, 558- (2003).
4
A generic parallel algorithm for sub-graph isomorphism (English)
PDPTA, 1113-1119 (2002).
5
The multi-level communication: Efficient routing for interconnection networks. (English)
J. Supercomput. 18, No.2, 153-177 (2001).
6
The multi-level communication: efficient routing for interconnection networks (English)
The Journal of Supercomputing 18, No. 2, 153-177 (2001).
7
Porting generalized eigenvalue software on distributed memory machines using systolic model principles (English)
PVM/MPI, 396-403 (1999).
8
Parallel numerical algorithms for distributed memory machines (English)
ACPC, 581-583 (1999).
9
On message routing in distributed memory parallel architectures. (Du routage des messages dans les architectures parallèles à m\ïemoire distribu\ïee.) (English)
RAIRO, Tech. Sci. Inf. 16, No. 3, 297-324 (1997).
10
Du routage des messages dans les architectures parallèles à mémoire distribuée. On message routing in distributed memory parallel architectures. (French)
RAIRO, Tech. Sci. Inf. 16, No. 3, 297-324 (1997).
11
A parallel simulation of a quantitative large-strain polycrystal deformation. (English)
Lengauer, Christian (ed.) et al., Euro-par ’97 parallel processing. 3rd international Euro-Par conference, Passau, Germany, August 26-29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1300, 852-855 (1997).
12
A parallel simulation of a quantitative large-strain polycrystal deformation (English)
Euro-Par, 852-855 (1997).
13
Parallel implementation of a large-strain polycrystal deformation model (English)
PDPTA, 908- (1997).
14
Finite element analysis of laminated and sandwich plates on transputer based parallel computer (English)
PDPTA, 982-992 (1996).
15
Minimal, deadlock free and $o(n)$ space memory routing for k-ary n-cubes with wraparound connections (English)
PDPTA, 511-520 (1995).
16
Routing with compact routing tables: interval labelling scheme for generalized meshes (English)
Applications in Parallel and Distributed Computing, 297-308 (1994).
17
A deadlock free routing algorithm with network size independent buffering space (English)
CONPAR, 489-501 (1990).
18
Méthode de conception d’algorithmes parallèles pour réseaux réguliers. (A method for conception of parallel algorithms for regular networks). (French)
Tech. Sci. Inf. 8, No.1, 63-72 (1989).
19
Performance of a pipeline array of automata with periodic cycle-time. (English)
Math. Soc. Sci. 14, 39-49 (1987).
20
Result 1 to 20 of 20 total
Start
Contact
Print
General Help
