The Massively Parallel Processing System JUMP-1Hidehiko Tanaka, Yōichi Muraoka Ohmsha, 1996 - 235 lappuses The work features the development of the fundamental technologies for massively parallel processing, covering research on the applications, the language, the operating system and the hardware architecture. Also the present status and future plans are addressed. The following topics are discussed in the section on applications: the MGCG Method; Parallelization of FEM; Modeling of Group Behaviors; Parallel Visualization; Functional Memory Type Parallel Processing; a Parallel Reduction Algorithm and Combination Algorithm. As for the programming languages, the SIMD-Based Language NCX, the Dataflow-based Language V and the Parallel Object-Oriented Language A-NETL are discussed. In the chapter on operating systems, the subjects Design Philosophy and Objectives; COS Software Architecture and Elements of the Operating System are - amongst others - addressed. Finally, the part on hardware architecture covers an Overview of the JUMP-1 System; Memory Architecture; Network Architecture; I/O Architecture and Implementation Issues. Massively parallel processing is expected to play a crucial role in the development of almost all advanced technologies for the 21st century. This book is intended to serve a large variety of researchers in the area of parallel computing. |
No grāmatas satura
1.3. rezultāts no 52.
22. lappuse
... nodes inside the substructures and that for the nodes on the boundary of the substructures . Next , the nodes inside ... node A = boundary node A Abi xi 22 22 CHAPTER 2. APPLICATIONS 1.
... nodes inside the substructures and that for the nodes on the boundary of the substructures . Next , the nodes inside ... node A = boundary node A Abi xi 22 22 CHAPTER 2. APPLICATIONS 1.
55. lappuse
... node is available . ( 2 ) In case i = 3 , two nodes are connected with an arc . ( 3 ) In case i > 3 , ( 3.1 ) The arcs are stretched so that fi nodes will be connected in a ring , and the distance and direction are defined by using the ...
... node is available . ( 2 ) In case i = 3 , two nodes are connected with an arc . ( 3 ) In case i > 3 , ( 3.1 ) The arcs are stretched so that fi nodes will be connected in a ring , and the distance and direction are defined by using the ...
205. lappuse
... Nodes Pradhan [ 123 ] 12 ( 5 ) 16 ( 5 ) Circular omega [ 130 ] 20 ( 4 ) 5120 Nodes 26 ( 4 ) 53246 Nodes n - Star graph [ 5 ] 7 ( 6 ) 5040 Nodes 8 ( 7 ) 40320 Nodes CCC [ 125 ] 40 ( 3 ) 9-9 4608 Nodes 66 ( 3 ) 12-12 49152 Nodes Hypernet ...
... Nodes Pradhan [ 123 ] 12 ( 5 ) 16 ( 5 ) Circular omega [ 130 ] 20 ( 4 ) 5120 Nodes 26 ( 4 ) 53246 Nodes n - Star graph [ 5 ] 7 ( 6 ) 5040 Nodes 8 ( 7 ) 40320 Nodes CCC [ 125 ] 40 ( 3 ) 9-9 4608 Nodes 66 ( 3 ) 12-12 49152 Nodes Hypernet ...
Citi izdevumi - Skatīt visu
The Massively Parallel Processing System JUMP-1 Hidehiko Tanaka,Yōichi Muraoka Priekšskatījums nav pieejams - 1996 |
Bieži izmantoti vārdi un frāzes
A-NETL address space algorithm allocated architecture array basic block buffer calculated cluster convergence data structures data-parallel Dirichlet boundary condition disk distributed shared memory double-word efficient equation example execution expression Fibonacci tree Fibonet field FIFO fine-grained FMPP function grid hardware highly parallel implementation inner points input interface iteration L2 cache language latency mapping massively parallel computer massively parallel processing memory access memory objects mesh MFlops MGCG method Micro Kernel MIMD mono multigrid method multiple Neumann boundary condition nodes number of processors operating system overhead parallel machines parallel stream partition performance problem Proc processing elements protocol prototype PUX server queue ray tracing reduction computation shown in Figure SIMD simulation speedup STAFF-Link substructure method synchronization T-algorithm Table task topology torus toruses TraceRay update variable vector virtual processors voxel