Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed Scheduling”

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 631 records · Page 35

Prototype energy models for data centers

Data centers in the United States consume about two percent of the nation’s electricity. Because heat gains from IT equipment drive cooling demand, data centers offer unique opportunities for energy savings. However, no prototype energy model for data centers is available in the suite of existing U.S. Department of Energy’s Commercial Prototype Building Models. Here we present the development of two new data center prototype models and their implementation in OpenStudio and EnergyPlus. The small-size data center model represents a computer room in a building served by computer room air conditioners (CRACs); while the large-sized model represents stand-alone data centers served by computer room air handlers (CRAHs) with a central chiller plant. For each data center model, two levels of IT equipment (ITE) load density were considered, to cover the wide range of IT power density of data centers: 40 and 100 W/ft 2 (430 and 1076 W/m 2 ) for the computer room, and 100 and 500 W/ft 2 (1076 and 5382 W/m 2 ) for the stand-alone data center. All other assumptions, such as building envelope, lighting, HVAC efficiencies and schedules, were based on the minimal requirements of ASHRAE Standard 90.1 at various vintages. We introduced a novel concept of supply and return air approach temperatures to capture the essential effects of non-uniform airflow and temperature distribution in data centers. The approach temperatures were pre-computed by computational fluid dynamics (CFD) simulations for various configurations of ITE loads and airflow containment management in data centers. A new feature was developed in EnergyPlus to implement the approach temperature method. A case study was conducted to demonstrate the use of the data center models. The two data center models cover all U.S. climate zones and can be used to evaluate energy saving measures for data centers, as well as to support development of data center energy efficiency codes and standards.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Probabilistic Zonal Reserve Requirements for Improved Energy Deliverability with Wind Power

In power systems with high penetration of renewable energy resources, uncertainty and variability of these stochastic resources introduce additional challenges for the operation of power systems. To improve the power system's reliability in the face of uncertainty, reserves are required as additional generation capacity to rebalance the power system following random disturbances. However, reserve deliverability is not guaranteed, because it may encounter potential transmission line congestion. Zonal reserve requirements can address this issue, but operators lack efficient ways to allocate reserves to zones while accounting for wind power forecast uncertainty. Herein we propose a methodology for probabilistic zonal reserve requirements to address wind power forecast uncertainties. This method estimates the probability distribution of line flows based on the system generation margin and injection shift factor. This estimate is then used to construct pre-defined and post-zonal reserve requirements. Case studies demonstrate that the proposed method efficiently schedules energy and reserves to balance energy and manage deliverability with wind power forecast uncertainty.We also discuss operational implications of the proposed method.

17 WIND ENERGY↗

Version 0 EOSDIS - An overview

Attention is given to NASA's Earth Observing System Data and Information System (EOSDIS), which is to be a single, distributed but internally consistent evolutionary system to support the planning and execution of EOS data acquisitions and to process, archive, and distribute EOS data products and selected non-EOS data to enable interdisciplinary studies of the earth. V0 EOSDIS, a logical step in this evolutionary process, is to address both technical and managerial challenges. Technical challenges include developing a multidiscipline, distributed system for searching and ordering data in a heterogeneous environment, and standardizing data formats and distribution techniques among differing communities and organizations. Managerial challenges include establishing and maintaining a structure consisting of geographically distributed entities such that cooperative development is carried out effectively despite organizational differences, maintaining interactions with the scientific community to ensure its close involvement despite its size and diversity, and keeping the expectations for V0 consistent with its schedules and resources.

Ramapriyan, H. K.↗

Potential Refinement of the ICRF

The analysis and data used for the ICRF represented the state of the art in global, extragalactic, X/S band microwave astrometry in 1995. The same general analysis method was used to extend the ICRF with subsequent VLBI data in a manner consistent with the original catalog. Since 1995 there have been considerable advances in the geodetic/astrometric VLBI data set and in the analysis that would significantly improve the systematic errors, stability, and density of the next realization of the ICRS when the decision is made to take this step. In particular, data acquired since 1990, including extensive use of the VLBA, are of higher quality and astrometric utility because of changes in instrumentation, schedule design, and networks as well as specifically astrometric intent. The IVS (International VLBI Service for Geodesy and Astrometry) continues to devote a portion of its observing capability to systematic extension of the astrometric data set. Sufficient data distribution exists to select a better set of defining sources. Improvements in troposphere modeling will minimize known systematic astrometric errors while accurate modeling and estimation of station effects from loading and nonlinear motions will permit the reintegration of the celestial reference frame, terrestrial reference frame and Earth orientation parameters though a single VLBI solution. The differences between the current ICRF and the potential next realization will be described.

Ma, Chopo↗

NASA Spacecraft Fault Management Workshop Results

Fault Management is a critical aspect of deep-space missions. For the purposes of this paper, fault management is defined as the ability of a system to detect, isolate, and mitigate events that impact, or have the potential to impact, nominal mission operations. The fault management capabilities are commonly distributed across flight and ground subsystems, impacting hardware, software, and mission operations designs. The National Aeronautics and Space Administration (NASA) Discovery & New Frontiers (D&NF) Program Office at Marshall Space Flight Center (MSFC) recently studied cost overruns and schedule delays for 5 missions. The goal was to identify the underlying causes for the overruns and delays, and to develop practical mitigations to assist the D&NF projects in identifying potential risks and controlling the associated impacts to proposed mission costs and schedules. The study found that 4 out of the 5 missions studied had significant overruns due to underestimating the complexity and support requirements for fault management. As a result of this and other recent experiences, the NASA Science Mission Directorate (SMD) Planetary Science Division (PSD) commissioned a workshop to bring together invited participants across government, industry, academia to assess the state of the art in fault management practice and research, identify current and potential issues, and make recommendations for addressing these issues. The workshop was held in New Orleans in April of 2008. The workshop concluded that fault management is not being limited by technology, but rather by a lack of emphasis and discipline in both the engineering and programmatic dimensions. Some of the areas cited in the findings include different, conflicting, and changing institutional goals and risk postures; unclear ownership of end-to-end fault management engineering; inadequate understanding of the impact of mission-level requirements on fault management complexity; and practices, processes, and tools that have not kept pace with the increasing complexity of mission requirements and spacecraft systems. This paper summarizes the findings and recommendations from that workshop, as well as opportunities identified for future investment in tools, processes, and products to facilitate the development of space flight fault management capabilities.

Newhouse, Marilyn↗

Results from the NASA Spacecraft Fault Management Workshop: Cost Drivers for Deep Space Missions

Fault Management, the detection of and response to in-flight anomalies, is a critical aspect of deep-space missions. Fault management capabilities are commonly distributed across flight and ground subsystems, impacting hardware, software, and mission operations designs. The National Aeronautics and Space Administration (NASA) Discovery & New Frontiers (D&NF) Program Office at Marshall Space Flight Center (MSFC) recently studied cost overruns and schedule delays for five missions. The goal was to identify the underlying causes for the overruns and delays, and to develop practical mitigations to assist the D&NF projects in identifying potential risks and controlling the associated impacts to proposed mission costs and schedules. The study found that four out of the five missions studied had significant overruns due to underestimating the complexity and support requirements for fault management. As a result of this and other recent experiences, the NASA Science Mission Directorate (SMD) Planetary Science Division (PSD) commissioned a workshop to bring together invited participants across government, industry, and academia to assess the state of the art in fault management practice and research, identify current and potential issues, and make recommendations for addressing these issues. The workshop was held in New Orleans in April of 2008. The workshop concluded that fault management is not being limited by technology, but rather by a lack of emphasis and discipline in both the engineering and programmatic dimensions. Some of the areas cited in the findings include different, conflicting, and changing institutional goals and risk postures; unclear ownership of end-to-end fault management engineering; inadequate understanding of the impact of mission-level requirements on fault management complexity; and practices, processes, and tools that have not kept pace with the increasing complexity of mission requirements and spacecraft systems. This paper summarizes the findings and recommendations from that workshop, particularly as fault management development issues affect operations and the development of operations capabilities.

Newhouse, Marilyn E.↗

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗

Benefit Assessment of the Precision Departure Release Capability Concept

A Precision Departure Release Capability concept is being evaluated by both the National Aeronautics and Space Administration and the Federal Aviation Administration as part of a larger goal of improving throughput, efficiency and capacity in integrated departure, arrival and surface operations. The concept is believed to have the potential of increasing flight efficiency and throughput by avoiding missing assigned slots and minimizing speed increase or path stretch to recover the slot. The main thrust of the paper is determining the impact of early and late departures from the departure runway when an aircraft has a slot assigned either at a meter fix or at the arrival airport. Results reported in the paper are for two scenarios. The first scenario considers flights out of Dallas/Fort Worth destined for Hartsfield-Jackson International Airport in Atlanta flying through the Meridian meter-fix in the Memphis Center with miles-in-trail constraints. The second scenario considers flights destined to George Bush Intercontinental/Houston Airport with specified airport arrival rate constraint. Results show that delay reduction can be achieved by allowing reasonable speed changes in scheduling. It was determined that the traffic volume between Dallas/Fort Worth and Atlanta via the Meridian fix is low and the departures times are spread enough that large departure schedule uncertainty can be tolerated. Flights can depart early or late within 90 minutes without accruing much more delay due to miles-in-trail constraint at the Meridian fix. In the Houston scenario, 808 arrivals from 174 airports were considered. Results show that delay experienced by the 16 Dallas/Fort Worth departures is higher if initial schedules of the remaining 792 flights are kept unaltered while they are rescheduled. Analysis shows that the probability of getting the initially assigned slot back after perturbation and rescheduling decreases with increasing standard deviation of the departure delay distributions. Results show that most Houston arrivals can be expected to be on time based on the assumed zero-mean Normal departure delay distributions achievable by Precision Departure Release Capability. In the current system, airport-departure delay, which is the sum of gate-departure delay and taxi-out delay, is observed at the airports. This delay acts as a bias, which can be reduced by Precision Departure Release Capability.

Palopo, Kee↗

Preparing for Delivery of the Lunar Ice Cube Compact IR Spectrometer Payload

Lunar Ice Cube, scheduled to be launched on ARTEMIS I in late 2021, is a deep space cubesat mission with the goalsof demonstrating 1) a cubesat-scale instrument (BIRCHES) capable of addressing NASA HEOMD Strategic KnowledgeGaps related to lunar volatile distribution (abundance, location, and transportation physics of water ice), and 2) cubesatpropulsion, via the Busek BIT 3 RF Ion engine. The mission will also demonstrate the AIM/IRIS microcryocooler for thefirst time in deep space. BIRCHES integration is nearly complete, with several changes made to the thermal design toimprove detector performance. Final preflight instrument testing and calibration, our ongoing concern to be emphasizedhere, have been delayed due to the mandated closure rules of NASA facilities. Lunar Ice Cube, along with two othercubesats deployed from ARTEMIS I, Lunar Flashlight and LunaH-Map, will be the first deep cubesat missions to deliverscience data to the Planetary Data System.

Mason, D.↗

Intelligent Partitioning based Fully Parallel AC Security-Constrained Optimal Power Flow

Today’s power grid is becoming more diverse and integrated with high-level distributed energy resources and smart control technologies that is creating a new set of grid management challenges in terms of large-scale, nonlinear, and non-convex problem modeling, complex and time-consuming computation, as well as difficult uncertainty handling. This project focused on solving a challenging multi-period security-constrained generation scheduling problem, which is of great importance for maximizing the social welfare of real-time dispatch, day-ahead market, as well as weekly planning of power systems. Our developed software explored parallel optimization algorithms for complex and realistic power system models, and develop fast, efficient, and robust grid optimization solutions on the high-performance computing platform that will enable increased grid economics, flexibility, resilience, as well as energy security in the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Frontier Job-Centric Telemetry Dataset

Comprehensive analysis of high-performance computing (HPC) systems requires linking workload execution to system behavior. This kind of analysis is vital for diagnosing performance issues, managing capacity, detecting anomalous workloads, and understanding how applications interact with system hardware. This job-centric telemetry dataset unifies scheduler job records with node-level measurements, enabling direct association between workloads and their corresponding power, thermal, and performance characteristics. It contains sanitized, scheduler related metadata for 152,400 individual jobs that ran on the Frontier supercomputer and ended on selected days throughout 2024 and 2025, a subpopulation of ~6.8% of the total number of allocated jobs with non-zero run time on the system over that same period. Each is linked with files that contain telemetry time series records of the power utilization and temperature behavior of its allocated nodes and their processors during the run time of the job. Where available, a portion of the job files also contain network performance time series. Jobs are sampled from select days that reflect normal levels of user activity and possess job size distributions with large numbers of leadership class jobs (>20% of Frontier nodes). Jobs in this dataset attempt to best represent successful user workflows.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Asynchronous distributed-memory task-parallel algorithm for compressible flows on unstructured 3D Eulerian grids

Here, we discuss the implementation of a finite element method, used to numerically solve the Euler equations of compressible flows, using an asynchronous runtime system (RTS). The algorithm is implemented for distributed-memory machines, using stationary unstructured 3D meshes, combining data-, and task-parallelism on top of the Charm++ RTS. Charm++’s execution model is asynchronous by default, allowing arbitrary overlap of computation and communication. Task-parallelism allows scheduling parts of an algorithm independently of, or dependent on, each other. Built-in automatic load balancing enables continuous redistribution of computational load by migration of work units based on real-time CPU load measurement. The RTS also features automatic checkpointing, fault tolerance, resilience against hardware failure, and supports power-, and energy-aware computation. We demonstrate scalability up to 25 x 10 9 cells at $\mathscr{O}$10 4 compute cores and the benefits of automatic load balancing for irregular workloads. The full source code with documentation is available at https://quinoacomputing.org.

42 ENGINEERING↗

Enabling machine learning-ready HPC ensembles with Merlin

With the growing complexity of computational and experimental facilities, many scientific researchers are turning to machine learning (ML) techniques to analyze large scale ensemble data. With complexities such as multi-component workflows, heterogeneous machine architectures, parallel file systems, and batch scheduling, care must be taken to facilitate this analysis in a high performance computing (HPC) environment. Here, we present Merlin, a workflow framework to enable large ML-friendly ensembles of scientific HPC simulations. By augmenting traditional HPC with distributed compute technologies, Merlin aims to lower the barrier for scientific subject matter experts to incorporate ML into their analysis. As a producer–consumer workflow model, Merlin enables multi-machine, cross-batch job, dynamically allocated yet persistent workflows capable of utilizing surge-compute resources. Key features of Merlin are a flexible HPC-centric interface, low per-task overhead, multi-tiered fault recovery, and a hierarchical sampling algorithm that allows for $\mathscr{O}$(N) task execution and $\mathscr{O}$(N ln N) task queuing to ensembles of millions of tasks. In addition to Merlin’s design, we test the algorithm’s performance in an HPC center and demonstrate the ability to enqueue 40 million simulations in 100 s, with a 30 millisecond per-task overhead that is independent of ensemble size. Finally, we describe some example applications that Merlin has enabled on leadership-class HPC resources, such as the ML-augmented optimization of nuclear fusion experiments and the calibration of infectious disease models to study the progression of and possible mitigation strategies for COVID-19.

97 MATHEMATICS AND COMPUTING↗

Method for resource control in parallel environments using program organization and run-time support

A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Ekanadham, Kattamuri↗

Method for resource control in parallel environments using program organization and run-time support

A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Ekanadham, Kattamuri↗

Planning Bias: Planning as a Source of Sampling Bias

Many data-driven planning methods are trained on data generated by planners. It is well known that many statistical learning methods are sensitive to sampling bias, and yet there has been little or no attention to planning as a sampling method and its role in introducing sampling bias into planner-generated training data. Recently, it has been demonstrated that A**,* in the presence of problems with variable heuristic error, prefers some solutions over other equally cost-optimal solutions. But, as we discuss in this paper, mitigation may not be as simple as resolving arbitrary tie-breaking by sampling from ties uniformly at random. In this paper, we formalize an intuition of planning bias. We focus on problems which output a single solution. Diverse planning only complicates the problem by generalizing it to bias in the set of sets; we show how it is subject to bias in the single solution. We make some useful observations about deterministic algorithms in contrast to non-deterministic algorithms. We explain how information entropy may be a good way to measure planning bias, and discuss some issues in evaluating practical approaches to measurement. We address the intuition that uniform random tiebreaking should mitigate bias; and sketch a novel approach to constructing an appropriate random distribution for duplicate detection during forward search for unbiased A*. Finally, we suggest directions for future work.

Planning Scheduling Algorithms↗

Dynamic Risk-Aware Patch Scheduling

A program that defines and assesses the dynamic risk of software vulnerabilities and considers the dynamic risks into patch scheduling to reduce security risks posed by vulner­abilities and provide formal guidance to security operations at various organizations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Preparing Distribution Utilities for the Future - Unlocking Demand-Side Management Potential: A Novel Analytical Framework

The balance of supply and demand in the power systems has traditionally been served solely through generation and network capacity planning and operations. However, with increased requirements for flexibility due to the uptake in variable renewable generation sources such as wind and solar there is a need to increased demand-side flexibility. In addition, there are increased communications and flexibility capabilities emerging on the demand-side from the adoption of advanced metering infrastructures and smart meter deployment and intelligent loads such as smart thermostats and schedulable white goods (e.g. dishwashers and washing machines). Unlocking demand-side flexibility can bring system benefits from peak load reduction bringing about generation capacity and network upgrade deferral, to reducing demand and more efficient utilization of generation and network capacity. Unlocking demand-side flexibility is an evolving process for utilities and solutions must be tailored to each specific customer group. Demand-side management (DSM) is a broad set of tools that can include demand response (both dispatchable and non-dispatchable), energy efficiency and distributed energy resources and demand-side technologies. The National Renewable Energy Laboratory (NREL), in collaboration with BSES Rajdhani Power Ltd. (BRPL) and Deloitte, examined the potential of DSM in BRPL’s service territory, developing detailed information on customer classes and willingness to participate in DSM. The study developed modeling frameworks for load analysis and the analysis tools to assess the potential of time-of-use tariffs in motivating customers to reduce their peak period energy consumption. The study shows that BRPL customers, specifically their domestic customers, are willing to participate in DSM programs and that time-of-use pricing can help BRPL reduce their peak demand and help unlock demand-side flexibility.

24 POWER TRANSMISSION AND DISTRIBUTION↗