scholarly journals Studies on the Efficiency of Massively Parallel Computational Method for Large-Scale Computation based on Unstructured Grid

1996 ◽  
Vol 40 ◽  
pp. 1095-1100
Author(s):  
Katsuya SAITOH ◽  
Kazuo KASHIYAMA
Keyword(s):  
Large Scale ◽  
Unstructured Grid ◽  
Computational Method ◽  
Massively Parallel

scholarly journals Acoustoelectronic nanotweezers enable dynamic and large-scale control of nanomaterials

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Peiran Zhang ◽  
Joseph Rufo ◽  
Chuyi Chen ◽  
Jianping Xia ◽  
Zhenhua Tian ◽  
...  
Keyword(s):  
Large Scale ◽  
Condensed Matter ◽  
Dynamic Control ◽  
Massively Parallel ◽  
Large Field ◽  
Graphene Flakes ◽  
Field Dynamic ◽  
Scale Control ◽  
Orientation Pattern ◽  
Resolution Single

AbstractThe ability to precisely manipulate nano-objects on a large scale can enable the fabrication of materials and devices with tunable optical, electromagnetic, and mechanical properties. However, the dynamic, parallel manipulation of nanoscale colloids and materials remains a significant challenge. Here, we demonstrate acoustoelectronic nanotweezers, which combine the precision and robustness afforded by electronic tweezers with versatility and large-field dynamic control granted by acoustic tweezing techniques, to enable the massively parallel manipulation of sub-100 nm objects with excellent versatility and controllability. Using this approach, we demonstrated the complex patterning of various nanoparticles (e.g., DNAs, exosomes, ~3 nm graphene flakes, ~6 nm quantum dots, ~3.5 nm proteins, and ~1.4 nm dextran), fabricated macroscopic materials with nano-textures, and performed high-resolution, single nanoparticle manipulation. Various nanomanipulation functions, including transportation, concentration, orientation, pattern-overlaying, and sorting, have also been achieved using a simple device configuration. Altogether, acoustoelectronic nanotweezers overcome existing limitations in nano-manipulation and hold great potential for a variety of applications in the fields of electronics, optics, condensed matter physics, metamaterials, and biomedicine.

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.

scholarly journals Beyond spatial scalability limitations with a massively parallel method for linear oscillatory problems

2017 ◽  
Vol 32 (6) ◽  
pp. 913-933 ◽  
Author(s):  
Martin Schreiber ◽  
Pedro S Peixoto ◽  
Terry Haut ◽  
Beth Wingate
Keyword(s):  
High Performance ◽  
Large Scale ◽  
Weather Prediction ◽  
Finite Difference Methods ◽  
Scaling Limit ◽  
Performance Model ◽  
Massively Parallel ◽  
Large Set ◽  
Problem Size ◽  
Single Node

This paper presents, discusses and analyses a massively parallel-in-time solver for linear oscillatory partial differential equations, which is a key numerical component for evolving weather, ocean, climate and seismic models. The time parallelization in this solver allows us to significantly exceed the computing resources used by parallelization-in-space methods and results in a correspondingly significantly reduced wall-clock time. One of the major difficulties of achieving Exascale performance for weather prediction is that the strong scaling limit – the parallel performance for a fixed problem size with an increasing number of processors – saturates. A main avenue to circumvent this problem is to introduce new numerical techniques that take advantage of time parallelism. In this paper, we use a time-parallel approximation that retains the frequency information of oscillatory problems. This approximation is based on (a) reformulating the original problem into a large set of independent terms and (b) solving each of these terms independently of each other which can now be accomplished on a large number of high-performance computing resources. Our results are conducted on up to 3586 cores for problem sizes with the parallelization-in-space scalability limited already on a single node. We gain significant reductions in the time-to-solution of 118.3× for spectral methods and 1503.0× for finite-difference methods with the parallelization-in-time approach. A developed and calibrated performance model gives the scalability limitations a priori for this new approach and allows us to extrapolate the performance of the method towards large-scale systems. This work has the potential to contribute as a basic building block of parallelization-in-time approaches, with possible major implications in applied areas modelling oscillatory dominated problems.

scholarly journals Supercomputer simulations of structure formation in the Universe

2016 ◽  
Vol 12 (S325) ◽  
pp. 10-16
Author(s):  
Tomoaki Ishiyama
Keyword(s):  
Domain Decomposition ◽  
Structure Formation ◽  
Short Range ◽  
Large Scale ◽  
Massively Parallel ◽  
Average Performance ◽  
And Performance ◽  
Performance Results ◽  
The Universe ◽  
Peak Speed

AbstractWe describe the implementation and performance results of our massively parallel MPI†/OpenMP‡ hybrid TreePM code for large-scale cosmological N-body simulations. For domain decomposition, a recursive multi-section algorithm is used and the size of domains are automatically set so that the total calculation time is the same for all processes. We developed a highly-tuned gravity kernel for short-range forces, and a novel communication algorithm for long-range forces. For two trillion particles benchmark simulation, the average performance on the fullsystem of K computer (82,944 nodes, the total number of core is 663,552) is 5.8 Pflops, which corresponds to 55% of the peak speed.

Sign in / Sign up

Export Citation Format

Share Document