Engineering Papers⌕ Search

Engineering topics

Roman, Eric

Publications and source records attributed to Roman, Eric.

6 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Parametric Testing and Evaluation of a Novel Biphasic Absorption Process for Post-Combustion Carbon Capture

A novel biphasic CO2 absorption process (BiCAP) is being developed at the University of Illinois. BiCAP is enabled by using a new class of biphasic solvents developed based on multi-property criteria for postcombustion carbon capture. The process was previously demonstrated at the lab-scale, including in 10 kWe absorption and desorption column systems. In the current study, the process has been scaled up by building and testing a 40 kWe integrated capture skid at a power plant. Parametric tests for two biphasic solvents were conducted with the synthetic flue gas made of bottle CO2 gas and air to validate the performance and operational flexibility of the unit with respect to varying process or operating conditions. Operation of the phase separator, which is unique equipment to BiCAP, was verified to be stable and efficient. Two liquid phases could be separated via static settlement based on a density difference and >90% of the CO2 absorbed was concentrated in the separated CO2-rich phase. Results of parametric tests showed that the minimum heat duty appeared at the optimal stripping pressure. A higher stripping temperature was more favourable to improve overall energy performance. Introducing a secondary cold solvent feed stream to the top of the stripper via bypassing the cross heat exchanger helped reduce the heat loss carried with water vapour. Test results also revealed that the heat duty requirement was comparable when the CO2 concentration in flue gas decreased from ~11 to 4 vol.% as the phase separation decoupled the absorption and desorption steps in BiCAP. Under typical steady-state conditions, both biphasic solvents lowered the process heat duty by >40% compared with the reference 30 wt.% monoethanolamine solvent.

Absorption↗
DOE OSTI2017

DINO: Divergent node cloning for sustained redundancy in HPC

Complexity and scale of next generation HPC systems pose significant challenges in fault resilience methods such that contemporary checkpoint/restart (C/R) methods that address fail-stop behavior may be insufficient. Redundant computing has been proposed as an alternative at extreme scale. Triple redundancy has an advantage over C/R in that it can also detect silent data corruption (SDC) and then correct results via voting. However, current redundant computing approaches do not repair failed or corrupted replicas. Consequently, SDCs can no longer be detected after a replica failure since the system has been degraded to dual redundancy without voting capability. Hence, a job may have to be aborted if voting uncovers mismatching results between the remaining two replicas. And while replicas are logically equivalent, they may have divergent runtime states during job execution, which presents a challenge to simply creating new replicas dynamically. This problem is addressed by, DIvergent NOde cloning (DINO), a redundant execution environment that quickly recovers from hard failures. DINO consists of a novel node cloning service integrated into the MPI runtime system that solves the problem of consolidating divergent states among replicas on-the-fly. With DINO, after degradation to dual redundancy, a good replica can be quickly cloned so that triple redundancy is restored. We present experimental results over 9 NAS Parallel Benchmarks (NPB), Sweep3D and LULESH. Results confirm the applicability of the approach and the correctness of the recovery process and indicate that DINO can recover from failures nearly instantly. The cloning overhead depends on the process image size that needs to be transferred between source and destination of the clone operation and varies between 5.60 to 90.48 s. Here, simulation results with our model show that dual redundancy with DINO recovery always outperforms 2x and surpasses 3x redundancy on up to 1 million nodes. To the best of our knowledge, the design and implementation for repairing failed replicas in redundant MPI computing is unprecedented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Affinity-aware checkpoint restart

Current checkpointing techniques employed to overcome faults for HPC applications result in inferior application performance after restart from a checkpoint for a number of applications. This is due to a lack of page and core affinity awareness of the checkpoint/restart (C/R) mechanism, i.e., application tasks originally pinned to cores may be restarted on different cores, and in case of non-uniform memory architectures (NUMA), quite common today, memory pages associated with tasks on a NUMA node may be associated with a different NUMA node after restart. Here, this work contributes a novel design technique for C/R mechanisms to preserve task-to-core maps and NUMA node specific page affinities across restarts. Experimental results with BLCR, a C/R mechanism, enhanced with affinity awareness demonstrate significant performance benefits of 37%-73% for the NAS Parallel Benchmark codes and 6-12% for NAMD with negligible overheads instead of up to nearly four times longer an execution times without affinity-aware restarts on 16 cores.

97 MATHEMATICS AND COMPUTING↗