SEARCH · Engineering Papers

Results for “schedules”

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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Spacecraft-Initiated Scheduling of Commercial Communications Services

We propose a software framework enabling a spacecraft in Earth orbit to schedule its own access to space communications services via ground stations and relay satellites. All operations are automated, without a human in the loop, allowing for highly responsive service to meet time-varying needs. We describe a modular software architecture allowing the framework to interface with the scheduling systems of several providers - both government and commercial. Specifically, we present the results of an experiment with Amazon Web Services (AWS) Ground Station, an operational commercial service provider. Proposed software executed scheduling of a ground station antenna with minimal lead time (less than 20 minutes before the start of a pass). During the contact AWS cloud infrastructure was used to demodulate, process, and distribute data products from an orbiting satellite. We believe this work demonstrates the framework's ability to interface with additional providers and potential to integrate more complex decision-making in the future to schedule optimal contacts.

Scheduling↗

NASA NTRS2022

Scheduling For Urban Air Mobility Using Safe Learning

This work considers the scheduling problem for Urban Air Mobility (UAM) vehicles travelling between origin-destination pairs with both hard and soft trip deadlines. Each route is described by a discrete probability distribution over trip completion times (or delay) and over interarrival times of requests (or demand) for the route along with a fixed hard or soft deadline. Soft deadlines carry a cost that is incurred when the deadline is missed. An online, safe scheduler is developed that ensures that hard deadlines are never missed and that average cost of missing soft deadlines is minimized. The system is modelled as a Markov Decision Process (MDP) and safe model based learning is used to find the probabilistic distributions over route delays and demand. Monte Carlo Tree Search (MCTS) Earliest Deadline First (EDF) is used to safely explore the learned models in an online fashion and develop a near-optimal non-preemptive scheduling policy. These results are compared with Value Iteration (VI) and MCTS (Random) scheduling solutions.

Urban Air Mobility↗

NASA NTRSDate not supplied

Scheduling for Urban Air Mobility using Safe Learning

Urban Air Mobility↗

DOE OSTI2021

A Hierarchical Task Scheduler for Heterogeneous Computing

Heterogeneous computing is one of the future directions of HPC. Task scheduling in heterogeneous computing must balance the challenge of optimizing the application performance and the need for an intuitive interface with the programming run-time to maintain programming portability. The challenge is further compounded by the varying data communication time between tasks. This paper proposes RANGER, a hardware-assisted task-scheduling framework. By integrating RISC-V cores with accelerators, the RANGER scheduling framework divides scheduling into global and local levels. At the local level, RANGER further partitions each task into fine-grained subtasks to reduce the overall makespan. At the global level, RANGER maintains the coarse granularity of the task specification, thereby maintaining programming portability. The extensive experimental results demonstrate that RANGER achieves a 12.7× performance improvement on average, while only requires 2.7% of area overhead.

Miniskar, Narasinga Rao↗

DOE OSTI2026

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

DOE OSTI2022

Improving the nonlinear control performance of the supply fan at air handling units using a gain scheduling control strategy

Due to its nonlinear nature, the supply fan at air handling units with the controller tuned at the design condition tends to be aggressive and oscillate under partial load conditions. Here, the objective of this paper is to develop and validate a gain scheduling control strategy to improve its nonlinear control performance. First, a control-oriented model, which does not require numerous physical parameters and extensive test data, is developed to study the nonlinearity of the fan system. Based on the theoretical model and experimental verifications, the issue of an aggressive response with a conventional fixed-gain controller is caused by the fact that the system gain is proportional to the ratio of the duct static pressure to the fan speed. To address the issue, a scheduling function of the measurable duct static pressure and fan speed is proposed to be included in the conventional fixed-gain controller to compensate for the fan system gain variation. The gain scheduling control strategy is found to approximately maintain the identical control performance under all operation conditions. Most importantly, the gain scheduling control strategy can be readily implemented without intensive computation and additional measurements, showing a promising potential in industrial applications.

42 ENGINEERING↗

DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

DOE OSTI2022

MARS: Malleable Actor-Critic Reinforcement Learning Scheduler

In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.

Baheri, Betis↗

DOE OSTI2025

Robustness: The Missing Ingredient in Generation Scheduling

This article highlights robustness as an essential factor to cope with the ever-increasing levels of uncertainty in generation scheduling under significant renewable energy penetration, as is the case in Brazil and Spain. To that end, robust generation scheduling is framed within the different optimization-based approaches that are available for uncertainty handling. In addition, the suitability of robust optimization to accommodate practical security criteria in generation scheduling is also emphasized. Interestingly, this article points out the existence of an effective algorithm allowing the discovery of critical or so-called umbrella scenarios, which paves the way for the implementation of robust generation scheduling in industry practice.

Street, Alexandre↗

DOE OSTI2022

Simulated Night- Shift Schedule Disrupts the Plasma Lipidome and Reveals Early Markers of Cardiovascular Disease Risk

Introduction: The circadian system coordinates daily rhythms in lipid metabolism, storage and utilization. Disruptions of internal circadian rhythms due to altered sleep/wake schedules, such as in night-shift work, have been implicated in increased risk of cardiovascular disease and metabolic disorders. To determine the impact of a night-shift schedule on the human blood plasma lipidome, an in-laboratory simulated shift work study was conducted. Methods: Fourteen healthy young adults were assigned to 3 days of either a simulated day or night-shift schedule, followed by a 24-h constant routine protocol with fixed environmental conditions, hourly isocaloric snacks, and constant wakefulness to investigate endogenous circadian rhythms. Blood plasma samples collected at 3-h intervals were subjected to untargeted lipidomics analysis. Results: More than 400 lipids were identified and quantified across 21 subclasses. Focusing on lipids with low between-subject variation per shift condition, alterations in the circulating plasma lipidome revealed generally increased mean triglyceride levels and decreased mean phospholipid levels after night-shift relative to day-shift. The circadian rhythms of triglycerides containing odd chain fatty acids peaked earlier during constant routine after night-shift. Regardless of shift condition, triglycerides tended to either peak or be depleted at 16:30 h, with chain-specific differences associated with the direction of change. Discussion: The simulated night-shift schedule was associated with altered temporal patterns in the lipidome. This may be premorbid to the elevated cardiovascular risk that has been found epidemiologically in night-shift workers.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1972

System/360 Computer Assisted Network Scheduling (CANS) System

Computer assisted scheduling techniques that produce conflict-free and efficient schedules have been developed and implemented to meet needs of the Manned Space Flight Network. CANS system provides effective management of resources in complex scheduling environment. System is automated resource scheduling, controlling, planning, information storage and retrieval tool.

Brewer, A. C.↗

NASA NTRS1972

A computer method for schedule processing and quick-time updating.

A schedule analysis program is presented which can be used to process any schedule with continuous flow and with no loops. Although generally thought of as a management tool, it has applicability to such extremes as music composition and computer program efficiency analysis. Other possibilities for its use include the determination of electrical power usage during some operation such as spacecraft checkout, and the determination of impact envelopes for the purpose of scheduling payloads in launch processing. At the core of the described computer method is an algorithm which computes the position of each activity bar on the output waterfall chart. The algorithm is basically a maximal-path computation which gives to each node in the schedule network the maximal path from the initial node to the given node.

Mccoy, W. H.↗

NASA NTRS1973

Modification and updating of the Manned Activity Scheduling System (MASS) for shuttle and shuttle payloads analysis. Volume 2: Space shuttle sortie payload analysis

Space shuttle operations include a significant number of launches with a sortie laboratory serving as a facility for manned experimentation in space. Planning a program of space experiments for a facility of this type requires that both the composition of the laboratory payload and the schedule of experiment operations for each payload be carefully selected. Experiment operations are investigated using the manned activity scheduling system (MASS). Schedules provided by these models assist in selecting experiment groups that efficiently use the laboratory resources and yield the desired experiment accomplishment at the program level. An alternate use of the MASS models provides for establishing the time-dependent supporting resources required for a specified candidate payload. A procedure for defining and analyzing shuttle sortie payloads was developed. This procedure was then applied to the definition of mixed-discipline experiment payloads for an advanced technology laboratory (ATL) supported by two-and three-man crews. The ATL payloads, including schedules of experiment operations, were defined to realize a high percentage of experiment accomplishment. The study considers the sensitivity of experiment accomplishment rate to variations of system parameters such as crew cross training, crew operations, shuttle and laboratory resources, ground target systems, and operational orbits.

Huyett, R. C.↗

NASA NTRS1973

Behavioral regulation of gravity - Schedule effects under escape-avoidance procedures

Squirrel monkeys were restrained in a centrifuge capsule and trained to escape and avoid increases in artificial gravity. During escape-avoidance, lever responses reduced centrifugally simulated gravity or postponed scheduled increases. The effect of variation in the interval of postponement (equal to the duration of decrease produced by escape responses) was studied under a multiple schedule of four components. Three components were gravity escape-avoidance with postponement times of 20, 40, and 60 sec. The fourth component was extinction. Each component was associated with a different auditory stimulus. Rate of responding decreased with increasing postponement time and higher mean g-levels occurred at shorter intervals of postponement. Effects of the schedule parameter on response rate and mean g-level were similar to effects of the schedule on free-operant avoidance and on titration behavior maintained by shock.

Clark, F. C.↗

NASA NTRS1980

Payload crew training scheduler (PACTS) user's manual

The operation of the payload specialist training scheduler (PACTS) is discussed in this user's manual which is used to schedule payload specialists for mission training on the Spacelab experiments. The PACTS program is a fully automated interactive, computerized scheduling program equipped with tutorial displays. The tutorial displays are sufficiently detailed for use by a program analyst having no computer experience. The PACTS program is designed to operate on the UNIVAC 1108 computer system, and has the capability to load output into a PDP 11/45 Interactive Graphics Display System for printing schedules. The program has the capacity to handle up to three overlapping Spacelab missions.

Shipman, D. L.↗

NASA NTRS1981

DSN scheduling system

The Deep Space Network (DSN) Scheduling Group provides the operationally oriented administrative support necessary for the effective scheduling of the DSN. The scheduling system plus the levels of schedules are explained.

Dorham, R.↗

NASA NTRS1982

Controller scheduling - A possible algebraic viewpoint

In the applications, one common way to design a control system for a nonlinear plant is to localize its behavior along lines of operation specified by the plant manufacturer, to develop linear multi-variable controls for these localizations, and to schedule those controls with key plant variables which vary smoothly along operating lines. An important part of practical design lore, the art of controller scheduling has received little modern attention from the conceptual point of view. This paper describes four basic types of scheduling questions and outlines some of the theoretical issues associated with them. Schedules are considered in terms of state equations; however, some relations with the input/output description are discussed, together with an analysis of the effects on the overall configuration of approximations made to the individual subsystems.

Sain, M.↗

NASA NTRS1982

NASA Deep Space Network Operations Scheduling

The functioning of the Deep Space Network Operations Scheduling, Jet Propulsion Laboratory, CA is reviewed. The primary objectives of the Operations Scheduling are: to schedule the worldwide global allocation of ground communications, tracking facilities, and equipment; and to provide deep space telecommunications for command, tracking, telemetry, and control in support of flight mission operations and tests. Elements of the earth set are Deep Space Stations (DSS) which provide the telecommunications link between the earth and spacecraft; NASA Communications Network; Network Data Processing Area; Network Operations Control Area which provides operational direction to the DSS; Mission Control and Computing systems; and Mission Support areas which provide flight control of the spacecraft. Elements of the space set include mission priorities and requirements which determine the spacecraft queue for allocating network resources. Scheduling is discussed in terms of long-range (3 years), mid-range (8 weeks), and short-range (2 weeks).

Enari, D. M.↗