Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SERVER”

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 703 records · Page 39

Disaster-survivable cloud-network mapping

Cloud-computing services are provided to consumers through a network of servers and network equipment. Cloud-network (CN) providers virtualize resources [e.g., virtual machine (VM) and virtual network (VN)] for efficient and secure resource allocation. Disasters are one of the worst threats for CNs as they can causemassive disruptions and CN disconnection. A disaster may also induce post-disaster correlated, cascading failures which can disconnect more CNs. Survivable virtual-network embedding (SVNE) approaches have been studied to protect VNs against single physical-link/- node and dual physical-link failures in communication infrastructure, but massive disruptions due to a disaster and their consequences can make SVNE approaches insufficient to guarantee cloud-computing survivability. In this work, we study the problem of survivable CN mapping from disaster. We consider risk assessment, VM backup location, and post-disaster survivability to reduce the risk of failure and probability of CN disconnection and the penalty paid by operators due to loss of capacity.We formulate the proposed approach as an integer linear program and study two scenarios: a natural disaster, e.g., earthquake and a human-made disaster, e.g., weapons-of-mass-destruction attack. Finally, our illustrative examples show that our approach reduces the risk of CN disconnection and penalty up to 90% compared with a baseline CN mapping approach and increases the CN survivability up to 100% in both scenarios.

97 MATHEMATICS AND COMPUTING↗

Applying queueing theory to evaluate wait-time-savings of triage algorithms

Abstract In the past decade, artificial intelligence (AI) algorithms have made promising impacts in many areas of healthcare. One application is AI-enabled prioritization software known as computer-aided triage and notification (CADt). This type of software as a medical device is intended to prioritize reviews of radiological images with time-sensitive findings, thus shortening the waiting time for patients with these findings. While many CADt devices have been deployed into clinical workflows and have been shown to improve patient treatment and clinical outcomes, quantitative methods to evaluate the wait-time-savings from their deployment are not yet available. In this paper, we apply queueing theory methods to evaluate the wait-time-savings of a CADt by calculating the average waiting time per patient image without and with a CADt device being deployed. We study two workflow models with one or multiple radiologists (servers) for a range of AI diagnostic performances, radiologist’s reading rates, and patient image (customer) arrival rates. To evaluate the time-saving performance of a CADt, we use the difference in the mean waiting time between the diseased patient images in the with-CADt scenario and that in the without-CADt scenario as our performance metric. As part of this effort, we have developed and also share a software tool to simulate the radiology workflow around medical image interpretation, to verify theoretical results, and to provide confidence intervals for the performance metric we defined. We show quantitatively that a CADt triage device is more effective in a busy, short-staffed reading setting, which is consistent with our clinical intuition and simulation results. Although this work is motivated by the need for evaluating CADt devices, the evaluation methodology presented in this paper can be applied to assess the time-saving performance of other types of algorithms that prioritize a subset of customers based on binary outputs.

Thompson, Yee Lam Elim (ORCID:0000000196537707)↗

HPC Node Performance and Energy Modeling with the Co-Location of Applications

Multicore processors have become an integral part of modern large-scale and high-performance parallel and distributed computing systems. This advance became necessary as the demand for increased system performance has exceeded the limits that single core processors can provide. Unfortunately, applications co-located on multicore processors can suffer from decreased performance and increased dynamic energy use as a result of access to shared resources, such as memory. Consequently, it is increasingly important to characterize the performance of applications that execute on these architectures. This work investigates some of the disadvantages of co-location, and presents a methodology for building models capable of utilizing varying amounts of information about a target application and its co-located applications to make predictions about the target application’s execution time and the system’s energy use under arbitrary co-locations of a wide range of application types. The proposed methodology is validated on three different server class Intel Xeon multicore processors using eleven applications from two scientific benchmark suites. The model’s utility for scheduling is also demonstrated in a simulated large-scale high-performance computing environment through the creation of a co-location aware scheduling heuristic. This heuristic demonstrates that scheduling using information generated with the proposed modeling methodology is capable of making significant improvements over a scheduling heuristic that is naive to co-location interference.

performance modeling, energy modeling, resource ma↗

dCache: The Storage System of Choice for Data-Intensive Applications

The ever-increasing volumes of data produced by modern scientific facilities like EuXFEL and LHC put significant stress on data management infrastructure operated by laboratories and research centers. The challenges to be addressed span the entire data life cycle, from ingest and efficient data analysis to long-term preservation, typically involving large tape libraries. dCache, a storage system developed in collaboration between the Deutsches Elektronen-Synchrotron (DESY), Fermi National Accelerator Laboratory, and Nordic e-Infrastructure Collaboration (NeIC), is designed to manage a large number of disk servers and to facilitate transparent data migration to and from archival storage. Its multifaceted approach offers a unified method to support a variety of scientific use cases with the same storage infrastructure, including high-throughput data ingest, data sharing over wide area networks, efficient access from HPC clusters, and long-term data preservation on tertiary storage. Initially developed for high energy physics (HEP) experiments, dCache is now used by various scientific communities, including astrophysics, biomedical research, and life sciences, each having specific requirements. This paper presents architecture, deployment strategies, performance and scalability enhancements, and recent advancements in dCache addressing the needs of scientific communities. Finally, we touch on the development and release process, ensuring the software’s high quality.

DCache↗

RXIO: Design and implementation of high performance RDMA-capable GridFTP

For its low-latency, high bandwidth, and low CPU utilization, Remote Direct Memory Access (RDMA) has established itself as an effective data movement technology in many networking environments. However, the transport protocols of grid run-time systems, such as GridFTP in Globus, are not yet capable of utilizing RDMA. In this study, we examine the architecture of GridFTP for the feasibility of enabling RDMA. An RDMA-capable XIO (RXIO) framework is designed and implemented to extend its XIO system and match the characteristics of RDMA. Our experimental results demonstrate that RDMA can significantly improve the performance of GridFTP, reducing the latency by 32% and increasing the bandwidth by more than three times. In achieving such performance improvements, RDMA dramatically cuts down CPU utilization of GridFTP clients and servers. In conclusion, these results demonstrate that RXIO can effectively exploit the benefits of RDMA for GridFTP. It offers a good prototype to further leverage GridFTP on wide-area RDMA networks.

97 MATHEMATICS AND COMPUTING↗

IrRep: Symmetry eigenvalues and irreducible representations of ab initio band structures

Here, we present IrRep – a Python code that calculates the symmetry eigenvalues of electronic Bloch states in crystalline solids and the irreducible representations under which they transform. As input it receives bandstructures computed with state-of-the-art Density Functional Theory codes such as VASP, Quantum Espresso, or Abinit, as well as any other code that has an interface to Wannier90. Our code is applicable to materials in any of the 230 space groups and double groups preserving time-reversal symmetry with or without spin-orbit coupling included, for primitive or conventional unit cells. This makes IrRep a powerful tool to systematically analyze the connectivity and topological classification of bands, as well as to detect insulators with non-trivial topology, following the Topological Quantum Chemistry formalism: IrRep can generate the input files needed to calculate the (physical) elementary band representations and the symmetry-based indicators using the [CheckTopologicalMat: https://www.cryst.ehu.es/cgi-bin/cryst/programs/magnetictopo.pl] routine of the Bilbao Crystallographic Server. It is also particularly suitable for interfaces with other plane-waves based codes, due to its flexible structure.

97 MATHEMATICS AND COMPUTING↗

Assessing Internet energy intensity: A review of methods and results

Assessing the average energy intensity of Internet transmissions is a complex task that has been a controversial subject of discussion. Estimates published over the last decade diverge by up to four orders of magnitude — from 0.0064 kilowatt-hours per gigabyte (kWh/GB) to 136 kWh/GB. This article presents a review of the methodological approaches used so far in such assessments: i) top–down analyses based on estimates of the overall Internet energy consumption and the overall Internet traffic, whereby average energy intensity is calculated by dividing energy by traffic for a given period of time, ii) model-based approaches that model all components needed to sustain an amount of Internet traffic, and iii) bottom–up approaches based on case studies and generalization of the results. Our analysis of the existing studies shows that the large spread of results is mainly caused by two factors: a) the year of reference of the analysis, which has significant influence due to efficiency gains in electronic equipment, and b) whether end devices such as personal computers or servers are included within the system boundary or not. For an overall assessment of the energy needed to perform a specific task involving the Internet, it is necessary to account for the types of end devices needed for the task, while the energy needed for data transmission can be added based on a generic estimate of Internet energy intensity for a given year. Separating the Internet as a data transmission system from the end devices leads to more accurate models and to results that are more informative for decision makers, because end devices and the networking equipment of the Internet usually belong to different spheres of control. -- Highlights: • Assessments of the energy intensity of the Internet differ by a factor of 20,000. • We review top–down, model-based, and bottom–up estimates from literature. • Main divergence factors are the year studied and the inclusion of end devices. • We argue against extending the Internet system boundary beyond data transmission. • Decision-makers need data that differentiates between end devices and transmission.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A program-level management system for the life cycle environmental and economic assessment of complex building projects

Climate change has become one of the most significant environmental issues, of which about 40% come from the building sector. In particular, complex building projects with various functions have increased, which should be managed from a program-level perspective. Therefore, this study aimed to develop a program-level management system for the life-cycle environmental and economic assessment of complex building projects. The developed system consists of three parts: (i) input part: database server and input data; (ii) analysis part: life cycle assessment and life cycle cost; and (iii) result part: microscopic analysis and macroscopic analysis. To analyze the applicability of the developed system, this study selected ‘U’ University, a complex building project consisting of research facility and residential facility. Through value engineering with experts, a total of 137 design alternatives were established. Based on these alternatives, the macroscopic analysis results were as follows: (i) at the program-level, the life-cycle environmental and economic cost in ‘U’ University were reduced by 6.22% and 2.11%, respectively; (ii) at the project-level, the life-cycle environmental and economic cost in research facility were reduced 6.01% and 1.87%, respectively; and those in residential facility, 12.01% and 3.83%, respective; and (iii) for the mechanical work at the work-type-level, the initial cost was increased 2.9%; but the operation and maintenance phase was reduced by 20.0%. As a result, the developed system can allow the facility managers to establish the operation and maintenance strategies for the environmental and economic aspects from a program-level perspective. - Highlights: • A program-level management system for complex building projects was developed. • Life-cycle environmental and economic assessment can be conducted using the system. • The design alternatives can be analyzed from the microscopic perspective. • The system can be used to establish the optimal O&M strategy at the program-level. • It can be applied to any other country or sector in the global environment.

54 ENVIRONMENTAL SCIENCES↗

GPS signal loss in the wide area monitoring system: Prevalence, impact, and solution

The phasor measurement unit (PMUs), equipped with Global Positioning System (GPS) receivers for precise time synchronization, provides measurements of voltage and current phasors at different nodes of the wide area monitoring system. However, GPS receivers are likely to lose satellite signals due to various unpredictable factors. The prevalence of GPS signal loss (GSL) on PMUs is first investigated using real PMU data. The historical GSL events are extracted from a phasor data concentrator (PDC) and FNET/GridEye server. The correlation between GSL and time, spatial location, solar activity are explored via comprehensive statistical analysis. Furthermore, the impact of GSL on phasor measurement accuracy has been studied via experiments. Finally, several potential solutions to mitigate the impact of GSL on PMUs are discussed and compared.

47 OTHER INSTRUMENTATION↗

SoK: What does it Mean to Benchmark Database Forensics?

Relational Database Management Systems are the backbone of modern enterprises and public-sector services, and are thus frequent targets of security incidents, insider threats, and thorough regulatory audits. Consequently, databases have become key sources of digital evidence, requiring investigators to reconstruct past activity from audit logs, transaction logs, and backups. Although benchmarking frameworks such as those developed by the Transaction Processing Performance Council (TPC) are widely used to evaluate database performance, they do not capture forensic requirements such as evidentiary completeness, tamper-evidence, chain of custody, or regulatory compliance under GDPR and CCPA. This survey examines the emerging domain of forensic database benchmarking. We gathered prior research on database forensics, secure logging, and tamper-evident data structures; we analyze modern forensic-ready features in commercial and open-source systems (SQL Server Ledger, Oracle Blockchain Tables, PostgreSQL pgAudit, Db2 Audit, Aurora Database Activity Streams, Oracle Real Application Security and IBM Guardium) and assess why existing benchmarks are insufficient. We propose forensic workloads, metrics, and methodologies that incorporate adversarial stressors, deleted-record recovery, and backup analysis. We also identify open research problems and call for a community-driven forensic benchmark suite. The result is an idea for evaluating not only database performance but also forensic soundness, bridging the gap between system engineering, compliance, and digital investigations.

Lenard, Ben↗

Control and data acquisition upgrades for NSTX-U

The extensive NSTX Upgrade (NSTX-U) Project includes major components which allow a doubling of the toroidal field strength to 1 T, of the Neutral Beam heating power to 12 MW, and the plasma current to 2 MA, and substantial structural enhancements to withstand the increased electromagnetic loads. The maximum pulse length will go from 1.5 to 5 s. The larger and more complex forces on the coils will be protected by a Digital Coil Protection System, which requires demanding real-time data input rates, calculations and responses. The amount of conventional digitized data for a given pulse is expected to increase from 2.5 to 5 GB per second of pulse. 2-D Fast Camera data is expected to go from 2.5 GB/pulse to 10, and another 2 GB/pulse is expected from new IR cameras. Our network capacity will be increased by a factor of 10, with 10 Gb/s fibers used for the major trunks. 32-core Linux systems will be used for several functions, including between-shot data processing, MDSplus data serving, between-shot EFIT analysis, real-time processing, and for a new capability, between-shot TRANSP. As a result, improvements to the MDSplus events subsystem will be made through the use of both UDP and TCP/IP based methods and the addition of a dedicated “event server”.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bridging the gap between peak and average loads on science networks

Backbone networks are typically overprovisioned in order to support peak loads. Research and education networks (RENs), for example, are often designed to operate at 20–30% of capacity. Thus, Internet2 upgrades its backbone interconnects when the weekly 95th-percentile load is reliably above 30% of link capacity, and analysis of ESnet traffic between major laboratories shows a substantial gap between peak and average utilization. As science data volumes increase exponentially, it is unclear whether this overprovisioning trend can continue into the future. Even if overprovisioning is possible, it may not be the most cost-effective (and desirable) approach going forward. Under the current mode of free access to RENs, traffic at peak load may include both flows that need to be transferred in near-real time–for example, for computation and instrument monitoring and steering–and flows that are less time-critical, for example, archival and storage replication operations. Thus, peak load does not necessarily indicate the capacity that is absolutely required at that moment. We thus examine how data transfers are impacted when the average network load is increased while the network capacity is kept at the current levels. We also classify data transfers into on-demand (time-critical) and best-effort (less time-critical) and study the impact on both classes for different proportions of both the number of on-demand transfers and amount of bandwidth allocated for on-demand transfers. For our study, we use real transfer logs from production GridFTP servers to do simulation-based experiments as well as real experiments on a testbed. We find that when the transfer load is doubled and the network capacity is fixed at the current level, the gap between peak and average throughput decreases by an average of 18% in the simulation experiments and 16% in the testbed experiments, and the average slowdown experienced by the data transfers is under 1.5×. Moreover, when transfers are classified as on-demand or best-effort, on-demand transfers experience almost no slowdown and the mean slowdown experienced by best-effort transfers is under 2× in the simulation experiments and under 1.2× in the testbed experiments.

97 MATHEMATICS AND COMPUTING↗

Roadmap and Benchmarking: Privacy in Federated Load Forecasting

Data-driven techniques for energy demand forecasting continue to emerge with promising impacts on distribution grid planning. However, the development of robust and generalizable machine learning models requires that representative high quality training data are available. Distributed energy resources have begun to embed intelligence, gathering large amounts of data on customer demand, behavior, and household devices that are connected to the grid. Though utilities aggregate meter-level demand data for load shaping, demand response, outage management, reliability planning, and billing applications, there lies an inherent privacy concern in sharing consumption data that may identify individual consumer behavioral patterns. Hence, while sharing the data is crucial, the private sensitive customer data must be safeguarded from being exposed or manipulated. In this study, we propose a roadmap for implementing a based privacy preserving framework to support the advancement of data-driven analytics in data-sensitive distributed energy resources environments. The roadmap incorporates federated learning–a distributed training framework, differential privacy–a statistical framework that provides guarantees to safeguard the leakage of sensitive data, secure multiparty computation and homomorphic encryption– techniques for encrypting model gradients and applying secure aggregation on the server. Moreover, we perform baseline experiments on the federated short-term load forecasting (STLF) task using open-source residential load profile datasets, offering insights into the challenges of integrating differential privacy into federated learning.

Abebe, Waqwoya [Oak Ridge National Laboratory (ORN↗

scPlantAnnotate: an accurate and robust transformer-based model for plant cell type annotation

Accurate cell type annotation remains a major bottleneck in plant single-cell RNA sequencing (scRNA-seq), where existing tools are often adapted from animal studies and perform sub-optimally on plant data. The lack of plant-specific computational frameworks limits the construction of plant cell atlases and downstream biological discovery. We develop and evaluate scPlantAnnotate, a Transformer-based reference annotation framework tailored for plant scRNA-seq data, and benchmark it against state-of-the-art deep learning and conventional methods across multiple plant species. Species-specific scPlantAnnotate models were trained using curated datasets from Arabidopsis thaliana, Zea mays, Oryza sativa, and Glycine max. We compared scPlantAnnotate with leading baselines under both standard random-split evaluation and a more stringent leave-one-dataset-out setting, which tests robustness to completely unseen datasets and tissue types. scPlantAnnotate consistently outperforms existing approaches across all four species under random-split evaluation. In the leave-one-dataset-out setting for A. thaliana, where performance drops markedly for all methods due to strong batch effects and dataset heterogeneity, scPlantAnnotate nonetheless achieves the highest Accuracy, Macro-F1, Balanced Accuracy, and Macro-AUROC on average and ranks first on most held-out datasets. These results demonstrate improved robustness to dataset shifts, a critical yet underexplored challenge in plant scRNA-seq analysis. A freely accessible web server enables users to annotate their own datasets using pretrained models. scPlantAnnotate provides a plant-specific, Transformer-based framework for single-cell annotation that delivers state-of-the-art performance and enhanced robustness to unseen datasets. By addressing limitations of existing tools and enabling scalable reference-based annotation, scPlantAnnotate supports the development of comprehensive plant cell atlases and facilitates broader use of single-cell genomics in plant biology.

Bioinformatics↗

Validating Safecast data by comparisons to a U. S. Department of Energy Fukushima Prefecture aerial survey

Safecast is a volunteered geographic information (VGI) project where the lay public collects radiation measurements via hand-held sensors that are uploaded to a central server and then made freely available. However, Safecast data fidelity is uncertain given that the these sensors are hand assembled with various levels of technical proficiency, and that the sensors may not be properly deployed. We validated Safecast data gathered in the Fukushima Prefecture shortly after the Daiichi nuclear power plant catastrophe by comparing it with authoritative data collected by the Department of Energy (DOE) and the National Nuclear Security Administration (NNSA) during the same period. We found that the two data sets were highly correlated, though the DOE/NNSA observations were generally higher than the Safecast measurements. We concluded that this high correlation alone makes Safecast a viable data source for detecting and monitoring fallout during radiological emergencies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Application configuration selection for energy-efficient execution on multicore systems

Balanced performance and energy consumption are incorporated in the design of modern computer systems. Several runtime factors, such as concurrency levels, thread mapping strategies, and dynamic voltage and frequency scaling (DVFS) should be considered in order to achieve optimal energy efficiency fora workload. Selecting appropriate run-time factors, however, is one of the most challenging tasks because the run-time factors are architecture-specific and workload-specific. And while most existing works concentrate on either static analysis of the workload or run-time prediction results, we present a hybrid two-step method that utilizes concurrency levels and DVFS settings to achieve the energy efficiency configuration for a worldoad. The experimental results based on a Xeon E5620 server with NPB and PARSEC benchmark suites show that the model is able to predict the energy efficient configuration accurately. On average, an additional 10% EDP (Energy Delay Product) saving is obtained by using run-time DVFS for the entire system. An off-line optimal solution is used to compare with the proposed scheme. Finally, the experimental results show that the average extra EDP saved by the optimal solution is within 5% on selective parallel benchmarks.

97 MATHEMATICS AND COMPUTING↗

A study of the crystal structures and the phase transitions of the ordered double perovskites Sr{sub 2}ScSbO{sub 6} and Ca{sub 2}ScSbO{sub 6}

The crystal structures and phase transitions of the two ordered double perovskites Sr{sub 2}ScSbO{sub 6} and Ca{sub 2}ScSbO{sub 6} were studied using conventional X-ray and neutron powder-diffraction methods. The crystal structures of both compounds have the P2{sub 1}/n space group symmetry at room temperature, resulting from Sc/Sb ordering. The evolution with temperature of the structure of the Sr containing compound shows the presence of three phase transitions with the following sequence: P2{sub 1}/n{yields}I2/m{yields}I4/m{yields}Fm3{sup Macron }m, at about 400, 560 and 650 K, respectively. The smaller size of Ca cation, with respect to that of Sr cation, leads to a large distortion of Ca{sub 2}ScSbO{sub 6} at room temperature. This fact in turn causes that the Ca containing compound shows only the first phase transition from P2{sub 1}/n to I2/m at high temperature at about 1440 K. The analysis of the phase transitions and the refinements have done using the symmetry-adapted modes and the tools of the Bilbao Crystallographic Server. - Graphical abstract: Representation of the new structure resulting from the coupling of the unidimensional GM{sup 4+} and X{sup 3+} modes with the a{sup +}b{sup -}b{sup -} tilting scheme associated to P2{sub 1}/n and the temperature evolution of the amplitudes of the GM{sup 1+}, GM{sup 3+}, GM{sup 4+} and GM{sup 5+} modes of I2/m and I4/m space groups obtained from the NPD data of Sr{sub 2}ScSbO{sub 6}. Highlights: Black-Right-Pointing-Pointer Study of two compounds of the antimony double perovskite family. Black-Right-Pointing-Pointer Determination of the structures at room temperature. Black-Right-Pointing-Pointer Determination of high-temperature phase transitions by X-ray and neutron powder diffraction. Black-Right-Pointing-Pointer Using the symmetry-adapted modes to study the phase transitions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A thick hierarchical rutile TiO{sub 2} nanomaterial with multilayered structure

Highlights: ► We synthesized a new rutile TiO{sub 2} nanomaterial with a hierarchical nanostructure. ► The nano architecture structure consist of nanorods and nanoflower arrays. ► The rutile TiO{sub 2} nanomaterial is thick in size (several 10 μm). ► The TiO{sub 2} nanomaterials present a multilayer structure. - Abstract: In the present paper, we synthesized a new type of rutile TiO{sub 2} nanomaterial with a hierarchical nanostructure using a novel method, which combined dealloying process with chemical synthesis. The structure characters were examined using X-ray diffraction, scanning electron microscopy and transmission electron microscopy. The rutile TiO{sub 2} nanomaterial is thick in size (several 10 μm). The hierarchical structure of the rutile TiO{sub 2} nanomaterial consists of large quantities nanorods and nanoflower arrays. The nanoflowers consist of serveral nanopetals with diameter of 100–200 nm. The cross section of TiO{sub 2} nanomaterials presents a multilayer structure with the layer thickness of about 3–5 μm. The rutile TiO{sub 2} nanomaterial has high specific surface area. The formation mechanism of the rutile TiO{sub 2} nanomaterial was discussed according to the experimental results. The rutile TiO{sub 2} nanomaterial has potential applications in catalysis, photocatalysis and solar cells.

36 MATERIALS SCIENCE↗