Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Grid Partition”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

An immersed boundary method for fluid–structure interaction with compressible multiphase flows

This paper presents a two-dimensional immersed boundary method for fluid–structure interaction with compressible multiphase flows involving large structure deformations. This method involves three important parts: flow solver, structure solver and fluid–structure interaction coupling. In the flow solver, the compressible multiphase Navier–Stokes equations for ideal gases are solved by a finite difference method based on a staggered Cartesian mesh, where a fifth-order accuracy Weighted Essentially Non-Oscillation (WENO) scheme is used to handle spatial discretization of the convective term, a fourth-order central difference scheme is employed to discretize the viscous term, the third-order TVD Runge–Kutta scheme is used to discretize the temporal term, and the level-set method is adopted to capture the multi-material interface. In this work, the structure considered is a geometrically non-linear beam which is solved by using a finite element method based on the absolute nodal coordinate formulation (ANCF). The fluid dynamics and the structure motion are coupled in a partitioned iterative manner with a feedback penalty immersed boundary method where the flow dynamics is defined on a fixed Lagrangian grid and the structure dynamics is described on a global coordinate. We perform several validation cases (including fluid over a cylinder, structure dynamics, flow induced vibration of a flexible plate, deformation of a flexible panel induced by shock waves in a shock tube, an inclined flexible plate in a hypersonic flow, and shock-induced collapse of a cylindrical helium cavity in the air), and compare the results with experimental and other numerical data. The present results agree well with the published data and the current experiment. Finally, we further demonstrate the versatility of the present method by applying it to a flexible plate interacting with multiphase flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

VOMS/VOMRS utilization patterns and convergence plan

The Grid community uses two well-established registration services, which allow users to be authenticated under the auspices of Virtual Organizations (VOs). The Virtual Organization Membership Service (VOMS), developed in the context of the Enabling Grid for E-sciencE (EGEE) project, is an Attribute Authority service that issues attributes expressing membership information of a subject within a VO. VOMS allows to partition users in groups, assign them roles and free-form attributes which are then used to drive authorization decisions. The VOMS administrative application, VOMS-Admin, manages and populates the VOMS database with membership information. The Virtual Organization Management Registration Service (VOMRS), developed at Fermilab, extends the basic registration and management functionalities present in VOMS-Admin. It implements a registration workflow that requires VO usage policy acceptance and membership approval by administrators. VOMRS supports management of multiple grid certificates, and handling users' request for group and role assignments, and membership status. VOMRS is capable of interfacing to local systems with personnel information (e.g. the CERN Human Resource Database) and of pulling relevant member information from them. VOMRS synchronizes the relevant subset of information with VOMS. The recent development of new features in VOMS-Admin raises the possibility of rationalizing the support and converging on a single solution by continuing and extending existing collaborations between EGEE and OSG. Such strategy is supported by WLCG, OSG, US CMS, US Atlas, and other stakeholders worldwide. In this paper, we will analyze features in use by major experiments and the use cases for registration addressed by the mature single solution.

99 GENERAL AND MISCELLANEOUS↗

Source Partitioning of Methane Emissions and its Seasonality in the U.S. Midwest

Abstract The methane (CH 4 ) budget and its source partitioning are poorly constrained in the Midwestern United States. We used tall tower (185 m) aerodynamic flux measurements and atmospheric scale factor Bayesian inversions to constrain the monthly budget and to partition the total budget into natural (e.g., wetlands) and anthropogenic (e.g., livestock, waste, and natural gas) sources for the period June 2016 to September 2017. Aerodynamic flux observations indicated that the landscape was a CH 4 source with a mean annual CH 4 flux of +13.7 ± 0.34 nmol m −2 s −1 and was rarely a net sink. The scale factor Bayesian inversion analyses revealed a mean annual source of +12.3 ± 2.1 nmol m −2 s −1 . Flux partitioning revealed that the anthropogenic source (7.8 ± 1.6 Tg CH 4 yr −1 ) was 1.5 times greater than the bottom‐up gridded United States Environmental Protection Agency inventory, in which livestock and oil/gas sources were underestimated by 1.8‐fold and 1.3‐fold, respectively. Wetland emissions (4.0 ± 1.2 Tg CH 4 yr −1 ) were the second largest source, accounting for 34% of the total budget. The temporal variability of total CH 4 emissions was dominated by wetlands with peak emissions occurring in August. In contrast, emissions from oil/gas and other anthropogenic sources showed relatively weak seasonality.

Chen, Zichong↗

CMS multicore scheduling strategy

In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

Perez-Calero Yzquierdo, Antonio↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PLATO (Parallel Load Assignment Tool): A Parallel Workload Partitioner for Particle-based Methods

A key first step in many large-scale high-performance scientific computing applications is the distribution of the computational domain across all participating processors of a parallel computing platform such as a shared memory machine, cluster or a tightly-coupled supercomputer. The primary goal of such a partitioning step is to ensure that the computational work performed by each process remains load-balanced throughout the execution of the parallel application. In this project, a general-purpose parallel partitioning tool, code-named PLATO, was designed and implemented. PLATO assumes that the workload is a set of points in an n-dimensional metric space. These points are abstractions of computational units that may represent point-like computational units such as celestial objects in astrophysics, atoms in materials sciences and molecules in biology/chemistry, or may represent more abstract computational units such as grid points in finite difference methods, grid elements in finite element methods or n-dimensional points in the feature space of a host of other applications. PLATO supports several key and useful capabilities, namely: (a) multiple load partitioning strategies, (b) support for arbitrary user-defined processor topology, (c) pre-fetching data from neighboring processors based on user-defined parameters, and (d) support for arbitrary number and types of attributes associated with each point in the computational domain. PLATO is implemented in the C programming language using Message Passing Interface (MPI) for inter-processor communications and its parallel performance tested on up to 48 processors of a shared memory machine. This report includes a detailed performance study of PLATO using parallel speedup and iso-efficiency as the two main metrics of parallel performance. In addition, a user manual and DOXYGEN generated code documentation have been included for completeness.

97 MATHEMATICS AND COMPUTING↗

Final Technical Report: Distributed Controls for High Penetrations of Renewables

The goal of this effort was to apply four potential control analysis/design approaches to the design of distributed grid control systems to address the impact of latency and communications uncertainty with high penetrations of photovoltaic (PV) generation. The four techniques considered were: optimal fixed structure control; Nyquist stability criterion; vector Lyapunov analysis; and Hamiltonian design methods. A reduced order model of the Western Electricity Coordinating Council (WECC) developed for the Matlab Power Systems Toolbox (PST) was employed for the study, as well as representative smaller systems (e.g., a two-area, three-area, and four-area power system). Excellent results were obtained with the optimal fixed structure approach, and the methodology we developed was published in a journal article. This approach is promising because it offers a method for designing optimal control systems with the feedback signals available from Phasor Measurement Unit (PMU) data as opposed to full state feedback or the design of an observer. The Nyquist approach inherently handles time delay and incorporates performance guarantees (e.g., gain and phase margin). We developed a technique that works for moderate sized systems, but the approach does not scale well to extremely large system because of computational complexity. The vector Lyapunov approach was applied to a two area model to demonstrate the utility for modeling communications uncertainty. Application to large power systems requires a method to automatically expand/contract the state space and partition the system so that communications uncertainty can be considered. The Hamiltonian Surface Shaping and Power Flow Control (HSSPFC) design methodology was selected to investigate grid systems for energy storage requirements to support high penetration of variable or stochastic generation (such as wind and PV) and loads. This method was applied to several small system models.

14 SOLAR ENERGY↗

Reliable Broadcast under Cascading Failures in Interdependent Networks

Reliable broadcast is an essential tool to disseminate information among a set of nodes in the presence of failures. We present a novel study of reliable broadcast in interdependent networks, in which the failures in one network may cascade to another network. In particular, we focus on the interdependency between the communication network and power grid network, where the power grid depends on the signals from the communication network for control and the communication network depends on the grid for power. In this paper, we build a resilient solution to handle crash failures in the communication network that may cause cascading failures and may even partition the network. In order to guarantee that all the correct nodes deliver the messages, we use soft links, which are inactive backup links to non-neighboring nodes that are only active when failures occur. At the core of our work is a fully distributed algorithm for the nodes to predict and collect the information of cascading failures so that soft links can be maintained to correct nodes prior to the failures. In the presence of failures, soft links are activated to guarantee message delivery and new soft links are built accordingly for long term robustness. Our evaluation results show that the algorithm achieves low packet drop rate and handles cascading failures with little overhead.

cascading failures↗

An efficient parallel implementation of explicit multirate Runge–Kutta schemes for discontinuous Galerkin computations

Although explicit time integration schemes require small computational efforts per time step, their efficiency is severely restricted by their stability limits. Indeed, the multi-scale nature of some physical processes combined with highly unstructured meshes can lead some elements to impose a severely small stable time step for a global problem. Multirate methods offer a way to increase the global efficiency by gathering grid cells in appropriate groups under local stability conditions. These methods are well suited to the discontinuous Galerkin framework. The parallelization of the multirate strategy is challenging because grid cells have different workloads. The computational cost is different for each sub-time step depending on the elements involved and a classical partitioning strategy is not adequate any more. In this paper, we propose a solution that makes use of multi-constraint mesh partitioning. It tends to minimize the inter-processor communications, while ensuring that the workload is almost equally shared by every computer core at every stage of the algorithm. Particular attention is given to the simplicity of the parallel multirate algorithm while minimizing computational and communication overheads. Our implementation makes use of the MeTiS library for mesh partitioning and the Message Passing Interface for inter-processor communication. Performance analyses for two and three-dimensional practical applications confirm that multirate methods preserve important computational advantages of explicit methods up to a significant number of processors.

97 MATHEMATICS AND COMPUTING↗

Linking Deep and Shallow Convective Mass Fluxes via an Assumed Entrainment Distribution in CAM5‐CLUBB: Parameterization and Simulated Precipitation Variability

Abstract We modify the Zhang‐McFarlane (ZM) deep convection scheme in the Community Atmosphere Model version 5 to couple it with a unified parameterization for boundary‐layer turbulence and shallow convection, that is, Cloud Layers Unified by Binormals (CLUBB). By assuming a lognormal distribution of entrainment rate across the entire moist convective regimes, we link mass fluxes between shallow and deep convection, which are partitioned by the entrainment rate of the shallowest deep convective plume. Hence, a new deep convective closure is established which is coupled to the sub‐grid vertical motion variability in CLUBB. The convection feedback (or memory) effects are also considered to decrease the entrainment spectrum width and enhance the vertical velocity variability that further affect deep convection. Results show that the revised scheme improves the precipitation simulations in terms of the mean state and variability at various timescales, such as the alleviated double‐intertropical convergence zone and more realistic simulations of the seasonal variation of monsoon precipitation over East Asia, Madden‐Julian Oscillation, and precipitation diurnal phase propagations downstream of large terrains. The improvements are still seen in many aspects such as the mean‐state precipitation when turning off the convection feedback impacts in the revised scheme, emphasizing the benefits of using the modified mass‐flux closure. However, the convection feedbacks have considerable effects on the precipitation diurnal cycle simulations over regions with late‐afternoon precipitation peaks. Overall, the revised scheme provides a unified treatment for sub‐grid vertical motions across regimes of boundary‐layer turbulence, shallow convection, and deep convection, leading to better‐simulated precipitation at various timescales.

54 ENVIRONMENTAL SCIENCES↗

Intelligently Partitioned Phasor-EMT Hybrid Simulations of Large-Scale, High-IBR Power Systems

As the penetration level of power electronics-interfaced renewables such as photovoltaics (PV) and wind has surged in modern electric grids, new operational risks caused by the dynamics of those inverter-based resources (IBRs) are emerging in parallel. Lessons learned from various grid events include that the impact of IBRs on system-level grid stability will become prominent along with the increase of renewables and that the short-timescale dynamic impacts of IBRs on grid stability are not fully captured by current commercial dynamic simulation tools [1] [2]. For example, IBRs can be controlled to mitigate those destabilizing interactions, but conventional phasor-domain tools (e.g. PSS/E, PSLF) often cannot capture that; likewise, the existing electromagnetic transient (EMT) simulation tools (e.g. PSCAD, EMTP) can simulate detailed IBR controls, but for large power systems with many IBRs, slow simulation speeds severely impede the ability to study dynamic events [3] [4]. Massively paralleling simulations using high-performance computing (HPC) can help address this, especially now that cloud-based HPC capability is widely available, but today s EMT tools are not HPC-compatible, and parallelization of dynamic simulation solvers is not trivial because each region can dynamically affect the others. Thus, dynamic simulation of grids with very large numbers of IBRs potentially poses a barrier to the ongoing energy transition.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Macroscopic Traffic Simulation with Open Traffic Models

This paper presents OTM-MPI, an extension of the Open Traffic Models platform (OTM) for running macroscopic traffic simulations in high-performance computing environments. OTM-MPI represents the first open-source, distributed-memory, macroscopic simulation model developed for modern high performance parallel machines and large networks. Macroscopic simulations are appropriate for studying regional traffic scenarios when aggregate trends are of interest, rather than individual vehicle traces. They are also appropriate for studying the routing behavior of classes of vehicles, such as app-informed vehicles. The network partitioning was performed with METIS. Inter-process communication was done with MPI (message-passing interface). Results are provided for two networks: one realistic network which was obtained from Open Street Maps for Chattanooga, TN, and another larger synthetic grid network. The software recorded a speedups of 198x using 256 cores for Chattanooga, and 475x with 1,024 cores for the synthetic network.

macro-scopic traffic simulation↗

A distributed voltage inference framework for cyber-physical attacks detection and localization in active distribution grids

The transition to active distribution grids with real-time monitoring and control depends on the proliferation of advanced communication networks and devices. This paradigm shift towards a cyber-physical architecture also introduces new vulnerabilities for adversaries to exploit and launch sophisticated cyber-physical attacks targeting grid observability. Current research highlights the challenges in distinguishing attacks on voltage phasor or nodal injection measurements and isolating multi-source attack locations in a multiphase distribution grid. The attack detection and localization methods in literature face accuracy issues, applications across diverse attack scenarios, or scalability limits. Here, to bridge these gaps, this paper proposes a distributed Voltage Inference framework for real-time detection and localization of cyber-physical attacks, addressing scalability, adaptability, and accuracy challenges in state-of-the-art methods. The proposed methodology leverages the distributed nature of the Voltage Inference framework through a two-step process of prediction and correction, together with a tractable graph partitioning approach, providing a reliable solution to identify compromised measurement sources and facilitate isolation. Extensive testing on IEEE 13 and 123-node distribution feeders underscores the algorithm’s efficacy, enhancing the security and resilience of active distribution grids against evolving cyber threats. Additionally, Hardware-in-the-Loop (HIL) implementation validates the proposed strategy’s practical applicability in real-world scenarios.

active distribution grids↗

A mass and momentum conserving unsplit semi-Lagrangian framework for simulating multiphase flows

In this work, we present a computational methodology for convection and advection that handles discontinuities with second order accuracy and maintains conservation to machine precision. This method can transport a variety of discontinuous quantities and is used in the context of an incompressible gas–liquid flow to transport the phase interface, momentum, and scalars. The proposed method provides a modification to the three-dimensional, unsplit, second-order semi-Lagrangian flux method of Owkes & Desjardins (JCP, 2014). The modification adds a refined grid that provides consistent fluxes of mass and momentum defined on a staggered grid and discrete conservation of mass and momentum, even for flows with large density ratios. Additionally, the refined grid doubles the resolution of the interface without significantly increasing the computational cost over previous non-conservative schemes. This is possible due to a novel partitioning of the semi-Lagrangian fluxes into a small number of simplices. The proposed scheme is tested using canonical verification tests, rising bubbles, and an atomizing liquid jet.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Moment preserving constrained resampling with applications to particle-in-cell methods

The Moment Preserving Constrained Resampling (MPCR) algorithm for particle resampling is introduced and applied to particle-in-cell (PIC) methods to increase simulation accuracy, reduce compute cost, and/or avoid numerical instabilities. The general algorithm partitions the system space into smaller subsets and resamples the distribution within each subset. Further, the algorithm is designed to conserve any number of particle and grid moments with a high degree of accuracy (i.e. machine accuracy). The effectiveness of MPCR is demonstrated with several numerical tests, including a use-case study in gyrokinetic fusion plasma simulations. Finally, the computational cost of MPCR is negligible compared to the cost of particle evolution in PIC methods, and the tests demonstrate that periodic particle resampling yields a significant improvement in the accuracy and stability of the results.

63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗

Scaling Irregular Applications through Data Aggregation and Software Multithreading

Bioinformatics, data analytics, semantic databases, knowledge discovery are emerging high performance application areas that exploit dynamic, linked data structures such as graphs, unbalanced trees or unstructured grids. These data structures usually are very large, requiring significantly more memory than available on single shared memory systems. Additionally, these data structures are difficult to partition on distributed memory systems. They also present poor spatial and temporal locality, thus generating unpredictable memory and network accesses. The Partitioned Global Address Space (PGAS) programming model seems suitable for these applications, because it allows using a shared memory abstraction across distributed-memory clusters. However, current PGAS languages and libraries are built to target regular remote data accesses and block transfers. Furthermore, they usually rely on the Single Program Multiple Data (SPMD) parallel control model, which is not well suited to the fine grained, dynamic and unbalanced parallelism of irregular applications. In this paper we present {\bf GMT} (Global Memory and Threading library), a custom runtime library that enables efficient execution of irregular applications on commodity clusters. GMT integrates a PGAS data substrate with simple fork/join parallelism and provides automatic load balancing on a per node basis. It implements multi-level aggregation and lightweight multithreading to maximize memory and network bandwidth with fine-grained data accesses and tolerate long data access latencies. A key innovation in the GMT runtime is its thread specialization (workers, helpers and communication threads) that realize the overall functionality. We compare our approach with other PGAS models, such as UPC running using GASNet, and hand-optimized MPI code on a set of typical large-scale irregular applications, demonstrating speedups of an order of magnitude.

Aggregation↗

Communication Simulations for Power System Applications

New smart grid technologies and concepts, such as dynamic pricing, demand response, dynamic state estimation, and wide area monitoring, protection, and control, are expected to require considerable communication resources. As the cost of retrofit can be high, future power grids will require the integration of high-speed, secure connections with legacy communication systems, while still providing adequate system control and security. While considerable work has been performed to create co-simulators for the power domain with load models and market operations, limited work has been performed in integrating communications directly into a power domain solver. The simulation of communication and power systems will become more important as the two systems become more inter-related. This paper will discuss ongoing work at Pacific Northwest National Laboratory to create a flexible, high-speed power and communication system co-simulator for smart grid applications. The framework for the software will be described, including architecture considerations for modular, high performance computing and large-scale scalability (serialization, load balancing, partitioning, cross-platform support, etc.). The current simulator supports the ns-3 (telecommunications) and GridLAB-D (distribution systems) simulators. Ongoing and future work will be described, including planned future expansions for a traditional transmission solver. A test case using the co-simulator, utilizing a transactive demand response system created for the Olympic Peninsula and AEP gridSMART demonstrations, requiring two-way communication between distributed and centralized market devices, will be used to demonstrate the value and intended purpose of the co-simulation environment.

co-simulation↗

Phase-field investigation on the non-equilibrium interface dynamics of rapid alloy solidification

The research program reported here is focused on critical issues that represent conspicuous gaps in current understanding of rapid solidification, limiting our ability to predict and control microstructural evolution (i.e. morphological dynamics and microsegregation) at high undercooling, where conditions depart significantly from local equilibrium. More specifically, through careful application of phase-field modeling, using appropriate thin-interface and anti-trapping corrections and addressing important details such as transient effects and a velocity-dependent (i.e. adaptive) numerics, the current analysis provides a reasonable simulation-based picture of non-equilibrium solute partitioning and the corresponding oscillatory dynamics associated with single-phase rapid solidification and show that this method is a suitable means for a self-consistent simulation of transient behavior and operating point selection under rapid growth conditions. Moving beyond the limitations of conventional theoretical/analytical treatments of non-equilibrium solute partitioning, these results serve to substantiate recent experimental findings and analytical treatments for single-phase rapid solidification. The departure from the equilibrium solid concentration at the solid-liquid interface was often observed during rapid solidification, and the energetic associated non-equilibrium solute partitioning has been treated in detail, providing possible ranges of interface concentrations for a given growth condition. Use of these treatments for analytical description of specific single-phase dendritic and cellular operating point selection, however, requires a model for solute partitioning under a given set of growth conditions. Therefore, analytical solute trapping models which describe the chemical partitioning as a function of steady state interface velocities have been developed and widely utilized in most of the theoretical investigations of rapid solidification. However, these solute trapping models are not rigorously verified due to the difficulty in experimentally measuring under rapid growth conditions. Moreover, since these solute trapping models include kinetic parameters which are difficult to directly measure from experiments, application of the solute trapping models or the associated analytic rapid solidification model is limited. These theoretical models for steady state rapid solidification which incorporate the solute trapping models do not describe the interdependency of solute diffusion, interface kinetics, and alloy thermodynamics. The phase-field approach allows calculating, spontaneously, the non-equilibrium growth effects of alloys and the associated time-dependent growth dynamics, without making the assumptions that solute partitioning is an explicit function of velocity, as is the current convention. In the research described here, by utilizing the phase-field model in the thin-interface limit, incorporating the anti-trapping current term, more quantitatively valid interface kinetics and solute diffusion across the interface are calculated. In order to sufficiently resolve the physical length scales (i.e. interface thickness and diffusion boundary length), grid spacings are continually adjusted in calculations. The full trajectories of transient planar growth dynamics under rapid directional solidification conditions with different pulling velocities are described. As a validation of a model, the predicted steady state conditions are consistent with the analytic approach for rapid growth. It was confirmed that rapid interface dynamics exhibits the abrupt acceleration of the planar front when the effect of the non-equilibrium solute partitioning at the interface becomes signi ficant. This is consistent with the previous linear stability analysis for the non-equilibrium interface dynamics. With an appropriate growth condition, the continuous oscillation dynamics was able to be simulated using continually adjusting grid spacings. This oscillatory dynamics including instantaneous jump of interface velocities are consistent with a previous phenomenological model by and a numerical investigation, which may cause the formation of banded structures. Additionally, the selection of the steady state growth dynamics in the highly undercooled melt is demonstrated. The transition of the growth morphology, interface velocity selection, and solute trapping phenomenon with increasing melt supersaturations was described by the phase-field simulation. The tip selection for the dendritic growth was consistent with Ivantsov's function, and the non-equilibrium chemical partitioning behavior shows good qualitative agreement with the Aziz's solute trapping model even though the model parameter(V D ) remains as an arbitrary constant. This work is able to show the possibility of comprehensive description of rapid alloy growth over the entire time-dependent non-equilibrium phenomenon.

36 MATERIALS SCIENCE↗