Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource 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 955 records · Page 53

Distributed decision-making for space operations

A programmatic and technical perspective in the context of future space applications is presented, that includes some of the management challenges that arise as the decision-making process becomes increasingly more decentralized. Three challenges are discussed: (1) the degree to which the planners must communicate with each other and with those who are seeking space operations resources, (2) the collection, management, employment and dissemination of the information needed to make decisions, and (3) the challenges connected with schedule integration. The technical perspective presented leads to recommended adaptations to the normal scheduling algorithms that retain the 'degrees of freedom' in the planning result. It is shown that these adaptations are specific technical responses to the programmatic challenges discussed.

Hornstein, Rhoda Shaller↗

Accounting and Accountability for Distributed and Grid Systems

While the advent of distributed and grid computing systems will open new opportunities for scientific exploration, the reality of such implementations could prove to be a system administrator's nightmare. A lot of effort is being spent on identifying and resolving the obvious problems of security, scheduling, authentication and authorization. Lurking in the background, though, are the largely unaddressed issues of accountability and usage accounting: (1) mapping resource usage to resource users; (2) defining usage economies or methods for resource exchange; (3) describing implementation standards that minimize and compartmentalize the tasks required for a site to participate in a grid.

Thigpen, William↗

Lessons Learned from a Complex FUSRAP Site - Sylvania Corning FUSRAP Site - 12269

Since its addition to the Formerly Utilized Sites Remedial Action Program (FUSRAP) in 2005, the Sylvania Corning FUSRAP Site (the Site) in Hicksville, New York, has provided challenges and opportunities from which to gain lessons learned for conducting investigation work at a complex multi-contaminant FUSRAP Site. The United States Army Corps of Engineers (USACE) and its contractors conducted a Comprehensive Environmental Response, Compensation and Liability Act (CERCLA) Remedial Investigation (RI) and are currently in the Feasibility Study (FS) phase at the Site. This paper presents the planning, execution, and reporting lessons learned by USACE during the RI/FS. The Site, operated from 1952 to 1967 for the research, development, and fabrication of nuclear elements under the Atomic Energy Commission, and other government and commercial contracts. Previous investigations performed by the New York State Department of Environmental Conservation (NYSDEC) and the current property owner have identified uranium, thorium, nickel, and chlorinated solvents, as Site contaminants [1]. The property owner is currently under two separate voluntary agreements with NYSDEC to investigate and remediate the Site. USACE's work at the site has been independent of this voluntary agreement and has moved on a parallel path with any work the property owner has completed. The project at the Site is complex because of the radiological and chemical concerns in both soils and groundwater, high hydraulically conductive soils, lack of a shallow aquiclude/aquitard, and a principal water table aquifer underlying the site. Contaminants are migrating from the Site and may potentially impact local drinking water supplies (municipal wells). During the RI/FS process the project team has encountered many issues and has thus developed many resolutions. The issues are organized into three categories: Planning and Contracting, Execution, and Reporting. Planning and Contracting lessons learned include: how to incorporate an overwhelming volume of historical data; how to manage a complex team of three prime contractors innovatively, and how to implement a project under an Award Fee task order. Execution lessons learned include: characterization of investigation derived wastes, and proper approach to radiological scanning of direct-push borings and soil cores. Reporting lessons learned include: coordinating multiple phase (iterative) reporting, large dataset presentation, and the National Priorities List (NPL) designation. The goal of this paper is to provide a resource for other project delivery teams that encounter similar situations on their projects to optimize cost savings, realization of efficiency, shorten schedules, or simply ensure higher quality deliverables. Each FUSRAP project is unique but there are many lessons we can apply to each site to gain efficiency and work more effectively. The Sylvania Corning FUSRAP site is a complex site with both soils and groundwater contamination, contamination to depths of 182 meters, and a highly politically charged environment of PRP involvement. Many of the lessons the project team has learned during the life of the project to date are being shared with others as well as being applied back to this project for future work. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

Mourou, Pascal↗

Large-Scale Compute-Intensive Analysis via a Combined In-situ and Co-scheduling Workflow Approach

Large-scale simulations can produce tens of terabytes of data per analysis cycle, complicating and limiting the efficiency of workflows. Traditionally, outputs are stored on the file system and analyzed in post-processing. With the rapidly increasing size and complexity of simulations, this approach faces an uncertain future. Trending techniques consist of performing the analysis in situ, utilizing the same resources as the simulation, and/or off-loading subsets of the data to a compute-intensive analysis system. We introduce an analysis framework developed for HACC, a cosmological N-body code, that uses both in situ and co-scheduling approaches for handling Petabyte-size outputs. An initial in situ step is used to reduce the amount of data to be analyzed, and to separate out the data-intensive tasks handled off-line. The analysis routines are implemented using the PISTON/VTK-m framework, allowing a single implementation of an algorithm that simultaneously targets a variety of GPU, multi-core, and many-core architectures.

Big data↗

A space station onboard scheduling assistant

One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.

Brindle, A. F.↗

Robust Scheduling of Microgrids Considering Unintentional Islanding Conditions

This paper proposes a robust scheduling model for microgrids considering the stochastic unintentional islanding conditions. The proposed model minimizes the total operating cost of the microgrid by efficiently coordinating the supply of power from local distributed energy resources and the main grid. To capture the prevailing uncertainties in renewable generation and demand as well as unintentional islanding conditions, a two-stage adaptive robust optimization model is formulated to minimize the total operating cost under the worst realization of the modeled uncertainties. The column and constraint generation (C&CG) method is used to solve the problem in an iterative manner. The solution of the proposed scheduling model ensures robust microgrid operation in consideration of all possible realization of renewable generation, demand and unintentional islanding condition. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, two micro-turbines, a diesel generator and a battery demonstrate the effectiveness of the proposed approach.

Liu, Guodong↗

A study of interactive control scheduling and economic assessment for robotic systems

A class of interactive control systems is derived by generalizing interactive manipulator control systems. Tasks of interactive control systems can be represented as a network of a finite set of actions which have specific operational characteristics and specific resource requirements, and which are of limited duration. This has enabled the decomposition of the overall control algorithm simultaneously and asynchronously. The performance benefits of sensor referenced and computer-aided control of manipulators in a complex environment is evaluated. The first phase of the CURV arm control system software development and the basic features of the control algorithms and their software implementation are presented. An optimal solution for a production scheduling problem that will be easy to implement in practical situations is investigated.

Source record↗

An end-to-end workflow for executing a classically bootstrapped variational quantum algorithm on an academic quantum computer

Academic quantum computing platforms often face unique challenges in executing quantum workloads due to fragmented software environments and limited engineering support. Unlike commercial ecosystems, academic devices typically evolve without full-stack integration in mind, making it difficult to run complex applications—such as variational quantum algorithms (VQA)—reliably and efficiently. Issues such as incompatible software layers and lack of automated job management significantly increase the overhead of theory-experiment collaboration. To address these challenges, we develop a modular, end-to-end workflow that decouples application-layer code from low-level hardware control, automates circuit submission and result collection, and supports fine-grained circuit-level job scheduling and recovery. The architecture employs a dual-end application programming interface (API) design, enabling robust operation across unstable or resource-constrained hardware backends. For practical use, the framework is lightweight and user-friendly, allowing rapid prototyping of full-stack workflows using basic Python tools. We validate this workflow on a high-fidelity trapped-ion quantum computer by demonstrating a variational quantum eigensolver (VQE) experiment with a classically bootstrapped ansatz initialization technique. The system successfully executed over 60,000 circuits across multiple molecular test cases with minimal human intervention, highlighting the framework’s effectiveness in enabling reproducible, resilient quantum experimentation in academic settings.

Clifford↗

Critical Path-Based Thread Placement for NUMA Systems

Multicore multiprocessors use Non Uniform Memory Architecture (NUMA) to improve their scalability. However,NUMA introduces performance penalties due to remote memory accesses. Without efficiently managing data layout and thread mapping to cores, scientific applications, even if they are optimized for NUMA, may suffer performance loss. In this paper, we present an algorithm that optimizes the placement of OpenMP threads on NUMA processors. By collecting information from hardware counters and defining new metrics to capture the effects of thread placement, the algorithm reduces NUMA performance penalty by minimizing the critical path of OpenMP parallel regions and by avoiding local memory resource contention. We evaluate our algorithm with NPB benchmarks and achieve performance improvement between 8.13% and 25.68%, compared to the OS default scheduling.

99 GENERAL AND MISCELLANEOUS↗

Best of Both Worlds: Integrating Slurm with Kubernetes in a Kubernetes Native Way

We present K-Foundry, a framework that enables the integration of Simple Linux Utility for Resource Management (SLURM) with Kubernetes (K8s) via a Kubernetes-like Control Plane (KCP). Our implementation seamlessly enables a unified communication and scheduling layer for a fleet of multiple diverse computing platforms. While SLURM and K8s traditionally support distinct scheduling models, they have recently started aligning their objectives by moving towards a more converged execution environment.

Beltre, Angel Manuel↗

Computer-Assisted Scheduling System (COMPASS)

COMPASS is interactive planning and scheduling software system used like spreadsheet. System places activities only at feasible times, taking into consideration all constraints imposed upon activity and resources it requires. Version 1.4 written in Ada and contains standard X-Windows interfaces written in C.

Fox, Barry R.↗

Microgravity Science Glovebox

The Microgravity Science Glovebox (MSG) is a versatile research facility designed to permit the flexibility of crew manipulated investigations on the International Space Station (ISS). The MSG configuration has been planned around the concept of an experimental workstation where a variety of experiments can be installed and operated in a fashion very similar to their operation in a ground-based laboratory. The approach has been to provide a large working volume with a significant set of power, data and imaging resources, all enclosed, but accessible by the crew through sealed glove ports. This arrangement allows the advantage of interactive experimentation without unduly compromising the experiment design with restrictions imposed by protective and containment challenges that normally arise in manned space-flight laboratories. In addition, the data and imaging resources allow cooperative monitoring of experiment progress between the crew and ground-based scientists. As ISS utilization evolves, the MSG is scheduled to become a major pathfinder for developing and exploiting the scientific advantages of truly enabling the coupling of experimentation in space with an evaluative response from the crew and investigators.

Roark, Walt↗

Collaborative Resource Allocation

Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

Wang, Yeou-Fang↗

Accrued Delay Application in Trajectory-Based Operations

The air traffic management system lacks integration among its elements often due to using inconsistent information, models, and metrics about the traffic. Transitioning to trajectory-based operations, whereby flights are managed by full trajectories in space and time, will enable more integration, with the help of increased automation. Building on trajectory-based operations, an "accrued delay" metric is proposed, which continuously measures the amount of delay that a flight has accumulated up to the current time, including delays incurred during the current flight and inherited from previous flights through the turnaround process. Through a time-based metering and scheduling example, we show how using accrued delay as a metric can help integrate the decision-making across multiple decision horizons, leading to more efficient and balanced access to airspace services. We show that when prioritizing flights that have already accrued high delay because of a constrained runway resource, significant gains are achieved in terms of reducing total delay and its variance. We studied the sensitivity of these gains to numerous factors, such as time-based versus distance-based horizons, horizon size, and errors in conformance to scheduled times.

delay; trajectory-based operations; time-based flo↗

Accrued Delay Application in Trajectory-Based Operations

The air traffic management system lacks integration among its elements often due to using inconsistent information, models, and metrics about the traffic. Transitioning to trajectory-based operations, whereby flights are managed by full trajectories in space and time, will enable more integration, with the help of increased automation. Building on trajectory-based operations, an "accrued delay" metric is proposed, which continuously measures the amount of delay that a flight has accumulated up to the current time, including delays incurred during the current flight and inherited from previous flights through the turnaround process. Through a time-based metering and scheduling example, we show how using accrued delay as a metric can help integrate the decision-making across multiple decision horizons, leading to more efficient and balanced access to airspace services. We show that when prioritizing flights that have already accrued high delay because of a constrained runway resource, significant gains are achieved in terms of reducing total delay and its variance. We studied the sensitivity of these gains to numerous factors, such as time-based versus distance-based horizons, horizon size, and errors in conformance to scheduled times.

Idris, Husni↗