Synchronized parallel optical interconnection subsystem implemented in the RWC-1 massively parallel computer

1999 ◽  
Vol 11 (10) ◽  
pp. 1313-1315 ◽  
Author(s):  
S. Nishimura ◽  
H. Inoue ◽  
H. Matsuoka ◽  
T. Yokota
Keyword(s):  
Parallel Computer ◽  
Massively Parallel ◽  
Optical Interconnection

Synchronized parallel optical interconnection for the massively parallel computer (RWC-1)

1998 ◽  
Author(s):  
Shinji Nishimura ◽  
Hiroaki Inoue ◽  
Hiroshi Matsuoka ◽  
Tatsuya Yokota
Keyword(s):  
Parallel Computer ◽  
Massively Parallel ◽  
Optical Interconnection

scholarly journals Midimew Connected Torus Network for Next Generation Massively Parallel Computer System

2021 ◽  
Vol 179 ◽  
pp. 590-597
Author(s):  
Maryam Manaa Al-Shammari ◽  
Asrar Haque ◽  
M.M. Hafizur Rahman
Keyword(s):  
Computer System ◽  
Parallel Computer ◽  
Massively Parallel ◽  
Next Generation ◽  
Torus Network

ANALYSIS OF A LATENCY HIDING BROADCASTING ALGORITHM ON A RECONFIGURABLE OPTICAL INTERCONNECT

2002 ◽  
Vol 12 (01) ◽  
pp. 41-50 ◽  
Author(s):  
AHMAD AFSAHI ◽  
NIKITAS J. DIMOPOULOS
Keyword(s):  
Recurrence Relations ◽  
Single Port ◽  
Optical Network ◽  
Parallel Computer ◽  
Optical Interconnection ◽  
Free Space Optical ◽  
Loosely Coupled ◽  
Collective Communications ◽  
Broadcasting Algorithm ◽  
Termination Time

Free-space optical interconnection is used to fashion a reconfigurable network. Since network reconfiguration is expensive compared to message transmission in such networks, latency hiding techniques can be used to increase the performance of collective communications operations. Berthome and Ferreira have recently proposed a broadcasting algorithm for their loosely-coupled optically reconfigurable parallel computer where they have shown that the total number of nodes, N(S), informed up to step S follows a recurrence relation. We have adapted their algorithm to our reconfigurable optical network, RON (K, N), which has slightly different modeling. We present a new analysis of this broadcasting algorithm on our network. This paper contributes by providing closed formulations for the N(S) that yield the termination time for both single-port and k-port modeling. The derived closed formulate are easier to computer than the recurrence relations.

Crack Growth and Propagation in Metallic Alloys

1995 ◽  
Vol 409 ◽  
Author(s):  
W. C. Morrey ◽  
L. T. Wille
Keyword(s):  
Large Scale ◽  
Critical Strain ◽  
Cleavage Plane ◽  
Crack Tip ◽  
Metallic Alloys ◽  
Propagation Direction ◽  
Dynamics Simulation ◽  
Parallel Computer ◽  
Massively Parallel ◽  
Tip Position

AbstractUsing large-scale molecular dynamics simulation on a massively parallel computer, we have studied the initiation of cracking in a Monel-like alloy of Cu-Ni. In a low temperature 2D sample, fracture from a notch starts at a little beyond 2.5% critical strain when the propagation direction is perpendicular to a cleavage plane. We discuss a method of characterizing crack tip position using a measure of area around the crack tip.

Sign in / Sign up

Export Citation Format

Share Document