PARLE '94: Parallel Architectures and Languages Europe : 6th International PARLE Conference, Athens, Greece, July 4-8, 1994 : ProceedingsCostas Halatsis Springer-Verlag, 1994 - 836 lappuses "This volume presents the proceedings of the 5th International Conference Parallel Architectures and Languages Europe (PARLE '94), held in Athens, Greece in July 1994. PARLE is the main Europe-based event on parallel processing. Parallel processing is now well established within the high-performance computing technology and of stategic importance not only to the computer industry, but also for a wide range of applications affecting the whole economy. The 60 full papers and 24 poster presentations accepted for this proceedings were selected from some 200 submissions by the international program committee; they cover the whole field and give a timely state-of-the-art report on research and advanced applications in parallel computing."--PUBLISHER'S WEBSITE. |
No grāmatas satura
1.3. rezultāts no 85.
30. lappuse
... tree of height 2n . For better understanding we include here this spanning tree construction . Figure 2 shows the spanning tree To of the Petersen graph with the root node 0. Each T , 1 ≤ i ≤ 9 , can be derived from To using an ...
... tree of height 2n . For better understanding we include here this spanning tree construction . Figure 2 shows the spanning tree To of the Petersen graph with the root node 0. Each T , 1 ≤ i ≤ 9 , can be derived from To using an ...
32. lappuse
... tree is a subgraph of the multinode accumulation graph . Thus the algorithm for multinode accumulation can be used to perform the single node scatter function . This needs 10 " 1 time steps in FP , which is optimal . Scattering under ...
... tree is a subgraph of the multinode accumulation graph . Thus the algorithm for multinode accumulation can be used to perform the single node scatter function . This needs 10 " 1 time steps in FP , which is optimal . Scattering under ...
715. lappuse
... tree level by level , starting from the affected leaves at level 0 , and following the path to the root . The certificates of the nodes updated along these paths are recomputed from scratch . Note that all the affected nodes in one ...
... tree level by level , starting from the affected leaves at level 0 , and following the path to the root . The certificates of the nodes updated along these paths are recomputed from scratch . Note that all the affected nodes in one ...
Saturs
Improved Probabilistic Routing on Generalized Hypercubes | 1 |
Efficient Communication in the Folded Petersen Interconnection Networks | 25 |
P Lincoln N MartíOliet J Meseguer L Ricciulli | 49 |
Autortiesības | |
12 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
PARLE '94 Parallel Architectures and Languages Europe: 6th International ... Costas Halatsis Ierobežota priekšskatīšana - 1994 |
Bieži izmantoti vārdi un frāzes
Abstract and-goal application architecture array assignment block broadcasting cache cell compiler Computer Science concurrent data tiles defined delay denote dependence Distributed Computing distributed memory distributed shared memory dynamic edge efficient elements evaluation example execution Figure function garbage collector graph rewriting heuristic hypercube hypergrid IEEE implementation interconnection network iterations language latency Lemma load balancing loop machine mapping matrix mesh MIMD/SIMD multiple multiprocessor node number of processors operation optimal output overhead packets parallel algorithms Parallel and Distributed parallel computer parallel program partitioning performance Petersen graph Petri net phase polynomial priority priority queue problem Proc protocol queue reduce reference rewrite rules routing scheduling scheme Section sequence sequential shared memory SIMD simulation single node speedup step strategy structure synchronization task graph technique Theorem threads topology tree updated variables vector vertical virtual channels visualization