Search NASA⌕ Search

SEARCH · Search NASA

Results for “asynchronous processing”

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 307 records · Page 17

Automatic Halo Management for the Uintah GPU-Heterogeneous Asynchronous Many-Task Runtime

The Uintah computational framework is used for the parallel solution of partial differential equations on adaptive mesh refinement grids using modern supercomputers. Uintah is structured with an application layer and a separate runtime system. Uintah is based on a distributed directed acyclic graph of computational tasks, with a task scheduler that efficiently schedules and executes these tasks on both CPU cores and on-node accelerators. The runtime system identifies task dependencies, creates a task graph prior to the execution of these tasks, automatically generates MPI message tags, and automatically performs halo transfers for simulation variables. Automating halo transfers in a heterogeneous environment poses significant challenges when tasks compute within a few milliseconds, as runtime overhead affects wall time execution, or when simulation variables require large halos spanning most or all of the computational domain, as task dependencies become expensive to process. These challenges are magnified at production scale when application developers require each compute node perform thousands of different halo transfers among thousands simulation variables. The principal contribution of this work is to (1) identify and address inefficiencies that arise when mapping tasks onto the GPU in the presence of automated halo transfers, (2) implement new schemes to reduce runtime system overhead, (3) minimize application developer involvement with the runtime, and (4) show overhead reduction results from these improvements.

Concurrency↗

Exploring the All-to-All Collective Optimization Space with ConnectX CORE-Direct

The all-to-all collective communication operation is used by many scientific applications, and is one of the most time consuming and challenging collective operation to optimize. The algorithms for all-to-all operations typically fall into two classes, logarithmic and linear scaling algorithms, with Bruck's algorithm, a logarithmic scaling algorithm, used in many small-data all-to-all implementations. The recent addition of InfiniBand CORE-Direct support for network management of collective communications offers new opportunities for optimizing all-to-all operation as well as supporting truly asynchronous implementations of these operations. This paper presents several new enhancements to the Bruck small-data algorithm that leverage CORE-Direct and other InfiniBand network capabilities to produce efficient implementations of this collective operation. These include RDMA, SR-RNR, and SR-RTR algorithms. In addition, nonblocking implementations of these collective operations are also presented. Benchmark results show that the RDMA algorithm, which uses CORE-Direct capabilities to offload collective communication management to the Host Channel Adapter (HCA), hardware gather support for sending non-continuous data, and low-latency RDMA semantics, performs the best. For a 64 processes and 128 byte-per-process all-to-all, the RDMA algorithm performs 27% better than Bruck's algorithm implementation in Open MPI and 136% better than the SR-RTR algorithm. In addition, the nonblocking versions of these algorithms have the same performance characteristics as the blocking algorithms. Finally, measurements of computation/communication overlap capacity show that all offloaded algorithms achieve about 98% overlap for large data all-to-all, whereas implementations using host-based progress achieve only about 9.5% overlap.

Venkata, Manjunath Gorentla↗

HYPPO: A Surrogate-Based Multi-Level Parallelism Tool for Hyperparameter Optimization

We present a new software, HYPPO, that enables the automatic tuning of hyperparameters of various deep learning (DL) models. Unlike other hyperparameter optimization (HPO) methods, HYPPO uses adaptive surrogate models and directly accounts for uncertainty in model predictions to find accurate and reliable models that make robust predictions. Using asynchronous nested parallelism, we are able to significantly alleviate the computational burden of training complex architectures and quantifying the uncertainty. HYPPO is implemented in Python and can be used with both TensorFlow and PyTorch libraries. We demonstrate various software features on time-series prediction and image classification problems as well as a scientific application in computed tomography image reconstruction. Finally, we show that (1) we can reduce by an order of magnitude the number of evaluations necessary to find the most optimal region in the hyperparameter space and (2) we can reduce by two orders of magnitude the throughput for such HPO process to complete.

adaptation models↗

Library for Evolutionary Algorithms in Python (LEAP)

There are generally three types of scientific software users: users that solve problems using existing science software tools, researchers that explore new approaches by extending existing code, and educators that teach students scientific concepts. Python is a general-purpose programming language that is accessible to beginners, such as students, but also as a language that has a rich scientific programming ecosystem that facilitates writing research software. Additionally, as high-performance computing (HPC) resources become more readily available, software support for parallel processing becomes more relevant to scientific software.There currently are no Python-based evolutionary computation frameworks that support all three types of scientific software users. Moreover, some support synchronous concurrent fitness evaluation that do not efficiently use HPC resources. We pose here a new Python-based EC framework that uses an established generalized unified approach to EA concepts to provide an easy to use toolkit for users wishing to use an EA to solve a problem, for researchers to implement novel approaches, and for providing a low-bar to entry to EA concepts for students. Additionally, this toolkit provides a scalable asynchronous fitness evaluation implementation friendly to HPC that has been vetted on hardware ranging from laptops to the world’s fastest supercomputer, Summit.

Coletti, Mark↗

The Effect of Shared Information on Pilot/Controller And Controller/Controller Interactions

In order to respond to the increasing demand on limited airspace system resources, a number of applications of information technology have been proposed, or are under investigation, to improve the efficiency, capacity and reliability of ATM (Asynchronous Transfer Mode) operations. Much of the attention in advanced ATM technology has focused on advanced automation systems or decision aiding systems to improve the performance of individual Pilots or Controllers. However, the most significant overall potential for information technology appears to he in increasing the shared information between human agents such as Pilots, Controllers or between interacting Controllers or traffic flow managers. Examples of proposed shared information systems in the US include; Controller Pilot Databank Communication (CPDLC), Traffic Management Advisor (TMA); Automatic Dependent Surveillance (ADS); Collaborative Decision Making (CDM) and NAS Level Common Information Exchange. Air Traffic Management is fundamentally a human centered process consisting of the negotiation, execution and monitoring of contracts between human agents for the allocation of limited airspace, runway and airport surface resources. The decision processes within ATM tend to be Semistructured. Many of the routine elements in ATM decision making on the part of the Controllers or Pilots are well Structured and can be represented by well defined rules or procedures. However in disrupted conditions, the ATM decision processes are often Unstructured and cannot be reduced to a set of discrete rules. As a consequence, the ability to automate ATM processes will be limited and ATM will continue to be a human centric process where the responsibility and the authority for the negotiation will continue to rest with human Controllers and Pilots. The use of information technology to support the human decision process will therefore be an important aspect of ATM modernization. The premise of many of the proposed shared information systems is that the performance of ATM operations will improve with an increase in Shared Situation Awareness between agents (Pilots, Controller, Dispatchers). This will allow better informed control decisions and an improved ability to negotiate between agents. A common information basis may reduce communication load and may increase the level of collaboration in the decision process. In general, information sharing is expected to have advantages for all agents within the system. However there are important questions which remain to be,addressed. For example: What shared information is most important for developing effective Shared Situation Awareness? Are there issues of information saturation? Does information parity create ambiguity in control authority? Will information sharing induce undesirable or unstable gaming behavior between agents? This paper will explore the effect of current and proposed information sharing between different ATM agents. The paper will primarily concentrate on bilateral tactical interactions between specific agents (Pilot/Controller; Controller/Controller; Pilot/Dispatcher; Controller/Dispatcher) however it will also briefly discuss multilateral interaction and more strategic interactions.

Hansman, R. John↗

DeepClone: Lightweight State Replication of Deep Learning Models for Data Parallel Training

Training modern deep neural network (DNN) models involves complex workflows triggered by model exploration, sensitivity analysis, explainability, etc. A key primitive in this context is the ability to clone a model training instance, i.e. “fork” the training process in a potentially different direction, which enables comparisons of different evolution paths using variations of training data and model parameters. However, in a quest improve the training throughput, a mix of data parallel, model parallel, pipeline parallel and layer-wise parallel approaches are making the problem of cloning highly complex. In this paper, we explore the problem of efficient cloning under such circumstances. To this end, we leverage several properties of data-parallel training and layer-wise parallelism to design DeepClone, a cloning approach based on augmenting the execution graph to gain direct access to tensors, which are then sharded and reconstructed asynchronously in order to minimize runtime overhead, standby duration, readiness duration. Compared with state-of-art approaches, DeepClone shows orders of magnitude improvement for several classes of DNN models.

data-parallel training↗

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

Thirumalainambi, Rajkumar↗

h5bench: A unified benchmark suite for evaluating HDF5 I/O performance on pre‐exascale platforms

Summary Parallel I/O is a critical technique for moving data between compute and storage subsystems of supercomputers. With massive amounts of data produced or consumed by compute nodes, high‐performant parallel I/O is essential. I/O benchmarks play an important role in this process; however, there is a scarcity of I/O benchmarks representative of current workloads on HPC systems. Toward creating representative I/O kernels from real‐world applications, we have created h5bench , a set of I/O kernels that exercise hierarchical data format version 5 (HDF5) I/O on parallel file systems in numerous dimensions. Our focus on HDF5 is due to the parallel I/O library's heavy usage in various scientific applications running on supercomputing systems. The various tests benchmarked in the h5bench suite include I/O operations (read and write), data locality (arrays of basic data types and arrays of structures), array dimensionality (one‐dimensional arrays, two‐dimensional meshes, three‐dimensional cubes), I/O modes (synchronous and asynchronous). In this paper, we present the observed performance of h5bench executed along several of these dimensions on existing supercomputers (Cori and Summit) and pre‐exascale platforms (Perlmutter, Theta, and Polaris). h5bench measurements can be used to identify performance bottlenecks and their root causes and evaluate I/O optimizations. As the I/O patterns of h5bench are diverse and capture the I/O behaviors of various HPC applications, this study will be helpful to the broader supercomputing and I/O community.

97 MATHEMATICS AND COMPUTING↗

High rate data acquisition from Spacelab/Shuttle

The need for high data rates from a variety of experiments on Spacelab/Shuttle produced the requirement for the Spacelab High Rate Multiplexer/Demultiplexer system. This system acquires serial digital data at asynchronous bit rates from up to sixteen experiments, two data buses, three voice links, two tape recorders, and a universal time channel. Experiment data rates may vary from 200 bps to 16 Mbps while recorded data rates range from 250 Kbps to 32 Mbps. The High Rate Multiplexer (HRM) accepts these data inputs and forms a serial PCM output at flexible rates up to 48 Mbps. This PCM output is transmitted to ground by a Ku-Band RF link via the Tracking and Data Relay Satellite System (TDRSS) or recorded on board for delayed transmission. A complementary ground based High Rate Demultiplexer (HRDM) accepts and demultiplexes the composite PCM data at ground processing locations.

Coffey, R.↗

Causality guided machine learning model on wetland CH 4 emissions across global wetlands

Wetland CH 4 emissions are among the most uncertain components of the global CH 4 budget. The complex nature of wetland CH 4 processes makes it challenging to identify causal relationships for improving our understanding and predictability of CH 4 emissions. In this study, we used the flux measurements of CH 4 from eddy covariance towers (30 sites from 4 wetlands types: bog, fen, marsh, and wet tundra) to construct a causality-constrained machine learning (ML) framework to explain the regulative factors and to capture CH 4 emissions at sub-seasonal scale. We found that soil temperature is the dominant factor for CH 4 emissions in all studied wetland types. Ecosystem respiration (CO 2 ) and gross primary productivity exert controls at bog, fen, and marsh sites with lagged responses of days to weeks. Integrating these asynchronous environmental and biological causal relationships in predictive models significantly improved model performance. More importantly, modeled CH 4 emissions differed by up to a factor of 4 under a +1°C warming scenario when causality constraints were considered. These results highlight the significant role of causality in modeling wetland CH 4 emissions especially under future warming conditions, while traditional data-driven ML models may reproduce observations for the wrong reasons. Our proposed causality-guided model could benefit predictive modeling, large-scale upscaling, data gap-filling, and surrogate modeling of wetland CH 4 emissions within earth system land models.

54 ENVIRONMENTAL SCIENCES↗

ASC CSSE Level 2 Milestone #6362: Resilient Asynchronous Many Task Programming Model

This report is an outcome of the ASC CSSE Level 2 Milestone 6362: Analysis of Re- silient Asynchronous Many-Task (AMT) Programming Model. It comprises a summary and in-depth analysis of resilience schemes adapted to the AMT programming model. Herein, performance trade-offs of a resilient-AMT prograrnming model are assessed through two ap- proaches: (1) an analytical model realized by discrete event simulations and (2) empirical evaluation of benchmark programs representing regular and irregular workloads of explicit partial differential equation solvers. As part of this effort, an AMT execution simulator and a prototype resilient-AMT programming framework have been developed. The former permits us to hypothesize the performance behavior of a resilient-AMT model, and has undergone a verification and validation (V&V) process. The latter allows empirical evaluation of the perfor- mance of resilience schemes under emulated program failures and enabled the aforementioned V&V process. The outcome indicates that (1) resilience techniques implemented within an AMT framework allow efficient and scalable recovery under frequent failures, that (2) the abstraction of task and data instances in the AMT programming model enables readily us- able Application Program Interfaces (APIs) for resilience, and that (3) this abstraction enables predicting the performance of resilient-AMT applications with a simple simulation infrastruc- ture. This outcome will provide guidance for the design of the AMT programming model and runtime systems, user-level resilience support, and application development for ASC's next generation platforms (NGPs).

97 MATHEMATICS AND COMPUTING↗

Adaptive digital beamforming for a CDMA mobile communications payload

In recent years, Spread-Spectrum Code Division Multiple Access (CDMA) has become a very popular access scheme for mobile communications due to a variety of reasons: excellent performance in multipath environments, high scope for frequency reuse, graceful degradation near saturation, etc. In this way, a CDMA system can support simultaneous digital communication among a large community of relatively uncoordinated users sharing a given frequency band. Nevertheless, there are also important problems associated with the use of CDMA. First, in a conventional CDMA scheme, the signature sequences of asynchronous users are not orthogonal and, as the number of active users increases, the self-noise generated by the mutual interference between users considerably degrades the performance, particularly in the return link. Furthermore, when there is a large disparity in received powers - due to differences in slant range or atmospheric attenuation - the non-zero cross-correlation between the signals gives rise to the so-called near-far problem. This leads to an inefficient utilization of the satellite resources and, consequently, to a drastic reduction in capacity. Several techniques were proposed to overcome this problem, such as Synchronized CDMA - in which the signature sequences of the different users are quasi-orthogonal - and power control. At the expense of increased network complexity and user coordination, these techniques enable the system capacity to be restored by equitably sharing the satellite resources among the users. An alternative solution is presented based upon the use of time-reference adaptive digital beamforming on board the satellite. This technique enables a high number of independently steered beams to be generated from a single phased array antenna, which automatically track the desired user signal and null the unwanted interference source. In order to use a time-reference adaptive antenna in a communications system, the main challenge is to obtain a reference signal highly correlated with the desired user signal and uncorrelated with the interferences. CDMA lends itself very easily to the generation of such a reference signal, thanks to the a priori knowledge of the user's signature sequence. First, the integration of an adaptive antenna in an asynchronous CDMA system is analyzed. The adaptive antenna system can provide increased interference rejection - much higher than that afforded by the code alone - and, since CDMA is mainly interference limited, any reduction in interference converts directly and linearly into an increase in capacity. Analyses and computer simulations are presented that show how an asynchronous CDMA system incorporating adaptive beamforming can provide at least as much capacity as a synchronous system. More importantly, the proposed concept allows the near-far effect to be mitigated without requiring a tight coordination of the users in terms of transmitted power control or network synchronization. The system is extremely robust to the near-far effect because the signals reaching the satellite from directions other than that of the desired user - which are likely to have different power levels - are adaptively canceled by the antenna. Finally, a payload architecture is presented that illustrates the practical implementation of this concept. This digital payload architecture demonstrates that with the advent of high performance CMOS digital processing, the on-board implementation of complex DSP techniques - in particular Digital Beamforming - has become possible, being most attractive for Mobile Satellite Communications.

Munoz-Garcia, Samuel G.↗

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs

DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

Prokopenko, Andrey↗

An Educational Program on Concentrated Solar Power and Heliostats for Power Generation and Industrial Processes

The objective of this project was to design and implement a comprehensive educational and applied research program in Concentrated Solar Thermal Power (CSTP) and heliostat technologies at Northeastern University. In alignment with the U.S. Department of Energy's Heliostat Consortium (HelioCon) goals, the project aimed to expand student and public understanding of CSTP systems while simultaneously contributing to workforce development and the broader decarbonization strategy. A particular emphasis was placed on integrating hands-on student design projects and publicly disseminating educational content relevant to CSTP systems. The project addressed a critical gap in renewable energy education: CSTP and heliostats, despite their importance in utility-scale solar energy, are rarely included in standard mechanical engineering programs. This project established new pathways for students to engage with the topic through the creation of a 4-credit graduate/senior elective course, development of five industry-facing short courses, and the inclusion of CSTP-based capstone design projects. Over two academic years, 36 students across six senior design teams developed and tested technologies such as deformable heliostats, beacon-based tracking systems, and solar-powered pyrolizers for biomass-to-biochar conversion. Concurrently, 30 undergraduate and graduate students were enrolled in the new academic course centered around CSTP principles. To ensure the relevance and accessibility of the short course content, the project team engaged with industry professionals, technical policy stakeholders, and potential course participants through structured surveys and informal consultations. Feedback from 28 respondents guided the structure, length, and delivery format of the courses - resulting in a modular design broken into five workshops. The feedback emphasized the need for flexible, asynchronous delivery and practical case studies, particularly in areas such as heliostat control, thermal storage, and solar fuel production. This engagement helped align the courses with the evolving knowledge demands of the renewable energy workforce and ensured that participants from both technical and policy backgrounds could meaningfully benefit from the material. The research and educational activities advanced the understanding of heliostat control systems, optical performance under misalignment, and thermal system integration in solar-driven pyrolysis applications. Methods and designs explored in this project proved to be both technically effective and economically feasible at the lab scale. Prototypes were constructed using commercially available components and custom-fabricated elements, demonstrating that meaningful performance improvements can be achieved with modest material and fabrication costs, supporting the feasibility of student-led research in this field. The public benefit of this project is twofold. First, it cultivates a pipeline of engineers trained to be familiar with CSTP principles, an essential workforce need identified by the Department of Energy for achieving its 2030 cost and deployment targets. Second, it contributes openly accessible educational materials, course content, and experimental frameworks to the broader community, enabling other institutions to adopt or adapt similar programming. Through outreach activities, curriculum integration, and technical exposure, this project contributes to a more informed and capable renewable energy workforce while supporting innovation in heliostat and CSTP system design. A new technical report is being prepared to document the development of the course and its outcomes, with plans to publish it in the ASME Open Access Journal of Engineering to ensure global accessibility, free of cost.

14 SOLAR ENERGY↗

On the Nature of the Hard X-Ray Sources SWIFT J1907.3-2050, IGR J12123-5802 and IGR J19552+0044

The INTEGRAL and Swift hard X-ray surveys have identified a large number of new sources, among which many are proposed as Cataclysmic Variables (CVs). Here we present the first detailed study of three X-ray selected CVs, Swift J1907.3-2050, IGRJ12123-5802, and IGRJ19552+0044 based on XMM-Newton, Suzaku, Swift observations and ground based optical and archival nIR/IR data. Swift J1907.3-2050 is highly variable from hours to monthsyears at all wavelengths. No coherent X-ray pulses are detected but rather transient features. The X-ray spectrum reveals a multi-temperature optically thin plasma absorbed by complex neutral material and a soft black body component arising from a small area. These characteristics are remarkably similar to those observed in magnetic CVs. A supra-solar abundance of nitrogen could arise from nuclear processed material from the donor star. Swift J1907.3-2050 could be a peculiar magnetic CV with the second longest (20.82 h) binary period. IGRJ12123-5802 is variable in the X-rays on a timescale of approximately or greater than 7.6 h. No coherent pulsations are detected, but its spectral characteristics suggest that it could be a magnetic CV of the Intermediate Polar (IP) type. IGRJ19552+0044 shows two X-ray periods, approximately 1.38 h and approximately 1.69 h and a X-ray spectrum characterized by a multi-temperature plasma with little absorption.We derive a low accretion rate, consistent with a CV below the orbital period gap. Its peculiar nIR/IR spectrum suggests a contribution from cyclotron emission. It could either be a pre-polar or an IP with the lowest degree of asynchronism.

X-ray Sources↗

DataSpaces: an interaction and coordination framework for coupled simulation workflows

Emerging high-performance distributed computing environments are enabling new end-to-end formulations in science and engineering that involve multiple interacting processes and data-intensive application workflows. For example, current fusion simulation efforts are exploring coupled models and codes that simultaneously simulate separate application processes, such as the core and the edge turbulence. These components run on different high performance computing resources, need to interact at runtime with each other and with services for data monitoring, data analysis and visualization, and data archiving. As a result, they require efficient and scalable support for dynamic and flexible couplings and interactions, which remains a challenge. This paper presents DataSpaces a flexible interaction and coordination substrate that addresses this challenge. DataSpaces essentially implements a semantically specialized virtual shared space abstraction that can be associatively accessed by all components and services in the application workflow. It enables live data to be extracted from running simulation components, indexes this data online, and then allows it to be monitored, queried and accessed by other components and services via the space using semantically meaningful operators. The underlying data transport is asynchronous, low-overhead and largely memory-to-memory. The design, implementation, and experimental evaluation of DataSpaces using a coupled fusion simulation workflow is presented.

Computer Science↗

On the Nature of the Hard X-ray Sources SWIFT J1907.3-2050, IGR J12123-5802 and IGR J19552+0044

The INTEGRAL and Swift hard X-ray surveys have identified a large number of new sources, among which many are proposed as Cataclysmic Variables (CVs). Here we present the first detailed study of three X-ray selected CVs, Swift J1907.3-2050, IGRJ12123-5802, and IGRJ19552+0044 based on XMM-Newton, Suzaku, Swift observations and ground based optical and archival near-infrared/infrared data. Swift J1907.3-2050 is highly variable from hours to months-years at all wavelengths. No coherent X-ray pulses are detected but rather transient features. The X-ray spectrum reveals a multi-temperature optically thin plasma absorbed by complex neutral material and a soft black body component arising from a small area. These characteristics are remarkably similar to those observed in magnetic CVs. A supra-solar abundance of nitrogen could arise from nuclear processed material from the donor star. Swift J1907.3-2050 could be a peculiar magnetic CV with the second longest (20.82 hours) binary period. IGRJ12123-5802 is variable in the X-rays on a timescale of greater than or approximately 7.6 hours. No coherent pulsations are detected, but its spectral characteristics suggest that it could be a magnetic CV of the Intermediate Polar (IP) type. IGRJ19552+0044 shows two X-ray periods, approximately 1.38 hours and approximately 1.69 hours and a X-ray spectrum characterized by a multi-temperature plasma with little absorption. We derive a low accretion rate, consistent with a CV below the orbital period gap. Its peculiar near-infrared/infrared spectrum suggests a contribution from cyclotron emission. It could either be a pre-polar or an IP with the lowest degree of asynchronism.

individual:↗

DataSpaces: An Interaction and Coordination Framework for Coupled Simulation Workflows

Emerging high-performance distributed computing environments are enabling new end-to-end formulations in science and engineering that involve multiple interacting processes and data-intensive application workflows. For example, current fusion simulation efforts are exploring coupled models and codes that simultaneously simulate separate application processes, such as the core and the edge turbulence, and run on different high performance computing resources. These components need to interact, at runtime, with each other and with services for data monitoring, data analysis and visualization, and data archiving. As a result, they require efficient support for dynamic and flexible couplings and interactions, which remains a challenge. This paper presents Data-Spaces, a flexible interaction and coordination substrate that addresses this challenge. DataSpaces essentially implements a semantically specialized virtual shared space abstraction that can be associatively accessed by all components and services in the application workflow. It enables live data to be extracted from running simulation components, indexes this data online, and then allows it to be monitored, queried and accessed by other components and services via the space using semantically meaningful operators. The underlying data transport is asynchronous, low-overhead and largely memory-to-memory. The design, implementation, and experimental evaluation of DataSpaces using a coupled fusion simulation workflow is presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗