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 23.
84. lappuse
... receive descriptors of any field ( 2 ) parameters that can receive descriptors of a particular field ( 3 ) parameters that can receive descriptors of a particular base - field The descriptor parameters in the above examples belong to ...
... receive descriptors of any field ( 2 ) parameters that can receive descriptors of a particular field ( 3 ) parameters that can receive descriptors of a particular base - field The descriptor parameters in the above examples belong to ...
97. lappuse
... receive ( x , i + 1 ) ) ) / 2 ; for ( each VP i in A ) { x [ i ] = t1 [ i ] ; } endtest ( t2 , x , prev ) ; for ... receive the value of the variable . Since inter - PE communication is expensive in general , finding an optimal VP ...
... receive ( x , i + 1 ) ) ) / 2 ; for ( each VP i in A ) { x [ i ] = t1 [ i ] ; } endtest ( t2 , x , prev ) ; for ... receive the value of the variable . Since inter - PE communication is expensive in general , finding an optimal VP ...
185. lappuse
... Receive FIFO Communication Block || STAFF - Link Receive FIFO Send FIFO Figure 5.8 : STAFF - Link . a bad allocation will be inevitable sometimes , and causes not only long I / O latency but also disturbance of communications in other ...
... Receive FIFO Communication Block || STAFF - Link Receive FIFO Send FIFO Figure 5.8 : STAFF - Link . a bad allocation will be inevitable sometimes , and causes not only long I / O latency but also disturbance of communications in other ...
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 agent instance algorithm allocation application program architecture array block buffer cluster coherence communication data-parallel distributed shared memory double-word efficient equation example execution expression Fibonacci tree field FIFO fine-grained FMPP function global grid hardware highly parallel hypercube implementation interface L2 cache language latency mapping massively parallel computer massively parallel processing mechanism member stream memory access memory management memory objects memory system mesh MGCG method Micro Kernel MIMD mono multigrid method multiple network address Neumann boundary condition nodes operating system page table parallel machines parallel programs parallel stream partition performance pixel problem Proc processing elements protocol provides PUX server queue reduction computation shown in Figure SIMD simulation STAFF-Link statement substructure synchronization task topology torus toruses update user-level threads variable vector virtual processors voxel