Search NASA⌕ Search

SEARCH · Search NASA

Results for “task allocation”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

TASK ALLOCATION IN GEO-DISTRIBUTED CYBER-PHYSICAL SYSTEMS

This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Task allocation in geo-distributed cyber-physical systems - 256

This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop) components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team

Here we present an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators. The problem aims to find a sequence of targets for each robot to visit and schedule the tasks at the targets with the human operators such that each target is visited exactly once by some robot, the scheduling constraints are satisfied and the maximum mission time of any robot is minimum. This problem is a generalization of the single Traveling Salesman Problem and is NP-Hard. Given k robots and m human operators, an algorithm is developed for solving the TASSP with an approximation ratio equal to 5/2- 1/k when m ≥ k and equal to 7/2 -1/k otherwise. Computational results are also presented to corroborate the performance of the proposed algorithm.

42 ENGINEERING↗
DOE OSTI2023

Energy-efficient cooperative resource allocation and task scheduling for Internet of Things environments

Offloading Internet of Things (IoT) tasks to the cloud for further processing might not always lead to an optimal execution time, particularly in situations such as resource contention, under-provisioning, over-provisioning, and fragmentation. In addition, dynamically optimizing the number of Virtual Machines (VMs) for resource scheduling in order to meet application requirements remains a major research challenge. Further, existing resource scheduling algorithms focus primarily on minimizing operational costs while maximizing resource sharing and utilization. Considering energy utilization as part of the resource allocation and scheduling process as an optimization objective for maintaining load balancing has often been neglected. To address these challenges and more, we propose a cooperative energy-aware resource allocation and scheduling strategy based on a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) multi-criteria decision-making method. Here we used the Grid Workloads Archive dataset to evaluate our proposed approach named TOPREAL. Experimental results with respect to the allocation of VM resources when considering processing a large segment of tasks indicate that TOPREAL outperforms existing algorithms in terms of energy savings, with an average improvement of 40.25%, while maintaining an average improvement of 16.21% when it comes to execution time. Results also demonstrate that our method can save an average of 78.06 processing hours and 63,215kJ of energy when compared to existing scheduling algorithms. These results demonstrate the effectiveness of our proposed model and the viability of using multi-criteria decision-making techniques such as TOPSIS to solve the resource allocation and scheduling problem in edge environments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Fair Concurrent Training of Multiple Models in Federated Learning

Federated learning (FL) enables collaborative learning across multiple clients. In most FL work, all clients train a single learning task. However, the recent proliferation of FL applications may increasingly require multiple FL tasks to be trained simultaneously, sharing clients’ computing resources, which we call Multiple-Model Federated Learning (MMFL). Current MMFL algorithms use naïve average-based client-task allocation schemes that often lead to unfair performance when FL tasks have heterogeneous difficulty levels, as the more difficult tasks may need more client participation to train effectively. Furthermore, in the MMFL setting, we face a further challenge that some clients may prefer training specific tasks to others, and may not even be willing to train other tasks, e.g., due to high computational costs, which may exacerbate unfairness in training outcomes across tasks. We address both challenges by firstly designing FedFairMMFL, a difficulty-aware algorithm that dynamically allocates clients to tasks in each training round, based on the tasks’ current performance levels. We provide guarantees on the resulting task fairness and FedFairMMFL’s convergence rate. We then propose novel auction designs that incentivizes clients to train multiple tasks, so as to fairly distribute clients’ training efforts across the tasks, and extend our convergence guarantees to this setting. Here, we finally evaluate our algorithm with multiple sets of learning tasks on real world datasets, showing that our algorithm improves fairness by improving the final model accuracy and convergence speed of the worst performing tasks, while maintaining the average accuracy across tasks.

Federated learning↗
DOE OSTI2021

Impact Mapping for Geospatial Reasoning and Decision Making

Objective The reported study evaluated a novel approach to aiding geospatial reasoning and decision making. Background Impact mapping aims to alleviate the cognitive demands of geospatial tasks in part by externalizing data in the form of an integrated decision surface. This is achieved by aggregating data across multiple sources of information and visualizing their combined utility rather than objective measurements or individual utility. Previous research has shown that geospatial decisions improve when aided in this manner, but it remains unknown if dynamic decision making, often plagued by fatigue and anchoring bias, would benefit similarly. Method The experiment implemented a systematic manipulation of the presence of a composite impact map and the number of attributes present in a two-stage disaster relief, resource allocation task to investigate when and how impact mapping is beneficial or deleterious to decision makers. Results The presence of the composite impact map increased the utility of selected sites, increased re-planning decisions, reduced information display views, and reduced workload. Generally, the effect of the composite impact map was greater when participants were asked to evaluate more attributes. Conclusion Composite impact maps appear to improve repeated geospatial reasoning and minimize anchoring bias because they alleviate the cognitive demands otherwise necessary to interpret and maintain information from multiple attributes. Application Data visualization techniques, such as impact mapping, can improve repeated geospatial decision making in environments that include high cognitive demand.

Illingworth, David A.↗
DOE OSTI2020

Evaluating Modern GPU Interconnect: PCIe, NVLink, NV-SLI, NVSwitch and GPUDirect

High performance multi-GPU computing becomes an inevitable trend due to the ever-increasing demand on computation capability in emerging domains such as deep learning, big data and planet-scale simulations. However, the lack of deep understanding on how modern GPUs can be connected and the real impact of state-of-the-art interconnect technology on multi-GPU application performance become a hurdle. In this paper, we fill the gap by conducting a thorough evaluation on five latest types of modern GPU interconnects: PCIe, NVLink-V1, NVLink-V2, NVLink-SLI and NVSwitch, from six high-end servers and HPC platforms: NVIDIA P100-DGX-1, V100-DGX-1, DGX-2, OLCF’s SummitDev and Summit supercomputers, as well as an SLI-linked system with two NVIDIA Turing RTX-2080 GPUs. Based on the empirical evaluation, we have observed four new types of GPU communication network NUMA effects: three are triggered by NVLink’s topology, connectivity and routing, while one is caused by PCIe chipset design issue. These observations indicate that, for a multi-GPU application running in a multi-GPU node, choosing the right GPU combination can impose considerable impact on GPU communication efficiency, as well as an application’s overall performance. Our evaluation can be leveraged in building practical multi-GPU performance models, which are vital for GPU task allocation, scheduling and migration in a shared environment (e.g., AI cloud and HPC centers), as well as communication-oriented performance tuning.

Performance Evaluation, GPU, Interconnect, NUMA, P↗
DOE OSTI2017

The overview in safety review of human factors engineering and control room design in chinese AP1000 nuclear power plant - 174

The first AP1000 nuclear power plant is constructed in Sanmen county in Zhejiang Province in China, which has creative and distinctive design characteristics. Human factors engineering disciplines are applied to the design of the AP1000. In addition to the elements of the program review model(including human factors engineering program management, operating experience review, functional requirements analysis and allocation, task analysis, staffing, integration of human reliability analysis with human factors engineering, human system interface design, procedure development, training program development, human system interface verification and validation, design implementation, human performance monitoring),the minimum inventory of controls, displays, and alarms present in the main control room and at the remote shutdown workstation. These contents mentioned above are reviewed according to standards, rules and regulations. This article introduces review process, and several important issues during the reviewing are described in detail. These issues include many elements, such as operating experience review, task analysis, human system interface design, verification and validation,and so on. This paper emphasizes on the main control room design(including environment and layout). Background noise in the actual main control room may exceed too much to design value. Another important issue is about main control room habitability systems(VES) changes to satisfy post-actuation performance requirements in AP1000 design change proposal. All the wall panel displays will be closed in this design change proposal. Review process and proposal are described in the paper. Since the AP1000 unit in China is the first constructed all over the world, verification and validation are especially important and necessary. The plan of verification and validation, the results summary report of verification and validation, the report of human engineering discrepancies are focus attention. Verification and validation in human factors engineering include HSI task support verification, HFE design verification and integrated system validation. This paper introduces the review process of verification and validation, the issues found in verification and validation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Power allocation by load aggregator with heterogeneous loads using weighted projection

With the recently increasing adoption of transactive energy markets, the role of a load aggregator is becoming increasingly important. Among the many tasks of an aggregator, the task of managing the electricity consumption among a group of grid-interactive efficient buildings according to the demand on the grid is taken up. Specifically, here, the task of allocating a certain amount of power among the participating customers while respecting their preferences and comfort is considered. Modeling this as an aggregate flexibility, the virtual battery conditions that are employed to verify the feasibility of a candidate power profile are derived. A feasible power profile, when allocated, satisfies specified comfort bands. To determine the ideal power requirement of the loads, the model-free control method is employed. The feasible power profile is allocated by embedding the customers’ preferences through weights, posing the power constraint as a hyperplane, and employing a weighted projection from the ideal power requirements onto the constraint plane to solve the considered task. The proposed method is computationally efficient and scalable to any number of heterogeneous thermostatically controlled loads in buildings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Towards elastic in situ analysis for high-performance computing simulations

In situ analysis and visualization have grown increasingly popular for enabling direct access to data from high-performance computing (HPC) simulations. As a simulation progresses and interesting physical phenomena emerge, however, the data produced may become increasingly complex, and users may need to dynamically change the type and scale of in situ analysis tasks being carried out and consequently adapt the amount of resources allocated to such tasks. To date, none of the production in situ analysis frameworks offer such an elasticity feature, and for good reason: the assumption that the number of processes could vary during run time would force developers to rethink software and algorithms at every level of the in situ analysis stack. In this paper we present Colza, a data staging service with elastic in situ visualization capabilities. We demonstrate the use of Colza with the Deep Water Impact and the AMR-Wind simulations, coupling them with the ParaView Catalyst and Ascent in situ libraries, and show that Colza enables dynamic rescaling of these widely-used frameworks with no interruption to the simulation or staging service. Here, we highlight the challenges of enabling such elasticity, which requires overcoming these frameworks' reliance on MPI, using distinct engineering approaches, namely dependency injection and dependency overload. To the best of our knowledge, this work is the first to enable elastic in situ visualization capabilities for HPC applications on top of existing production analysis tools.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗
DOE OSTI2019

Highly interactive, steered scientific workflows on HPC systems: optimizing design solutions

Scientific workflows are becoming increasingly important in high performance computing (HPC) settings, as the feasibility and appeal of many simultaneous heterogeneous tasks increases with increasing hardware capabilities. Currently no HPC-based workflow platform supports a dynamically adaptable workflow with interactive steering and analysis at run-time. Furthermore, for most workflow programs, compute resources are fixed for a given instance, resulting in a possible waste of expensive allocation resources when tasks are spawned and killed. Here we describe the design and testing of a run-time-interactive, adaptable, steered workflow tool capable of executing thousands of parallel tasks without an MPI programming model, using a database management system to facilitate task management through multiple live connections. We find that on the Oak Ridge Leadership Computing Facility pre-exascale Summit supercomputer it is possible to launch and interactively steer workflows with thousands of simultaneous tasks with negligible latency. For the case of particle simulation and analysis tasks that run for minutes to hours, this paradigm offers the prospect of a robust and efficient means to perform simulation-space exploration with on-the-fly analysis and adaptation.

Ossyra, John R↗
DOE OSTI2025

Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation

As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Recovery Simulator and Analysis Formulation: Mathematical Framework for Enhanced Resilience and Resource Allocation

This report introduces recovery simulator and analysis (RSA), a framework aimed at enhancing the resilience of electrical grids post-disruption. The RSA model leverages an optimization problem formulation that focuses on maximizing the load served (or optionally customers served) through a coordinated and cooptimized recovery of non-black start generation, transmission lines, feeders and substations subject to labor budget constraints. By integrating advanced linear programming techniques, the simulator selects efficient reocovery pathways, optimizing both short-term and long-term grid recovery strategies. The mathematical framework guides decision-making through a comprehensive evaluation of potential recovery actions, factoring in the trade-offs between labor constraints and load (or optionally customer) restoration efficacy. This enables grid operators to simulate diverse outage scenarios and delineate optimal recovery pathways, thereby prioritizing critical repair tasks and ensuring resource allocation is both economical and effective. The intended use case of RSA is to allow planners to explore many recovery scenarios quickly and determine assets most critical across a wide range of scenarios, and therefore strong candidates for hardening or additional investment. RSA might also be used in an operational setting, following a single event, for exploring efficient recovery pathways.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Hybridization Assessment of Trybrid Pumped Storage Hydropower System—Part 1: A Case Study of Corral Summit

This report is a part of the deliverables for technical assistance provided to Cat Creek Energy for the Coral Summit Trybrid (Triple Hybrid-Pumped Storage Hydropower, Battery Energy Storage System, and photovoltaic solar energy) energy project. This report explores the operational benefits and challenges of hybridizing an open loop PSH (200MW) located at Mackay, Custer County, Idaho with solar PV (Ground mount 300MW and floating 40MW) and battery (720MWhr). This document reports two activities performed as a part of the hybridization assessment task 1) optimal resource allocation and energy management strategy, and 2) power quality and reliability assessment. From optimal resource allocation and energy management strategy (activity 1), the following key findings can be observed: • Conventional PSH (CPSH) with two reversible pump turbines and separate penstocks can provide required flexibility equivalent to that from two ternary PSH with separate penstock. With single unit CPSH, upper reservoir head cannot be maintained accurately, the variation of water level is rapid and pump mode flexibility is not available. These disadvantages can be overcome by single unit TPSH. However, using two CPSH units with separate penstocks also overcome these disadvantages with the formation of the hydraulic short circuit between two conventional units. • Flooding of the lower reservoir is a severe concern when considering continuous operation for black start. This limits the duration of continuous operation from PSH alone to around 50 hours. Due to the complementary PV and battery action, the duration of continuous operation and smooth power output can be extended. • An optimization problem is framed that maximizes the power output on an hourly basis while minimizing constraint violations and respecting seasonal variations of solar PV and load profiles . Two value streams, arbitrage and baseload generation are served by this profile. It was uncovered that for smooth power output during regular operation, PV curtailment will be required, or the battery capacity needs to be increased above 90MW to accommodate additional PV. From power quality and reliability assessment (activity 2) the following takeaway points can be observed: • The Trybrid, when integrated at the Lost River bus, and limited to 250MW in generation mode and -150MW in the pump mode, causes no violation of voltage or flow.

13 - HYDRO ENERGY↗
DOE OSTI2022

A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS

Existing approaches for allocating resources on edge environments are inefficient and lack the support of heterogeneous edge devices, which in turn fail to optimize the dependency on cloud infrastructures or datacenters. To this extent, we propose in this paper OpERA, a multi-layered edge-based resource allocation optimization framework that supports heterogeneous and seamless execution of offloadable tasks across edge, fog, and cloud computing layers and architectures. By capturing offloadable task requirements, OpERA is capable of identifying suitable resources within nearby edge or fog layers, thus optimizing the execution process. Throughout the paper, we present results which show the effectiveness of our proposed optimization strategy in terms of reducing costs, minimizing energy consumption, and promoting other residual gains in terms of processing computations, network bandwidth, and task execution time. We also demonstrate that by optimizing resource allocation in computation offloading, it is then possible to increase the likelihood of successful task offloading, particularly for computationally intensive tasks that are becoming integral as part of many IoT applications such robotic surgery, autonomous driving, smart city monitoring device grids, and deep learning tasks. The evaluation of our OpERA optimization algorithm reveals that the TOPSIS MCDM technique effectively identifies optimal compute resources for processing offloadable tasks, with a 96% success rate. Moreover, the results from our experiments with a diverse range of use cases show that our OpERA optimization strategy can effectively reduce energy consumption by up to 88%, and operational costs by 76%, by identifying relevant compute resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

VA EDH Advanced Software Pipeline Framework Report: Enhancing Automation and Scalability

The VA Environmental Determinants of Health (EDH) Advanced Software Pipeline Framework is designed to enhance the efficiency, scalability, and security of geospatial data processing workflows. This framework integrates modern data orchestration and containerization technologies, including Prefect for workflow automation, Docker for containerization, and PostgreSQL/PostGIS for geospatial data storage and analysis. It ensures standardized, reproducible, and automated data processing, supporting VA objectives related to substance use risk assessment and recovery research. The pipeline addresses key scalability and performance challenges through horizontal and vertical scaling, high-performance computing (HPC) integration, parallel processing, task caching, and dynamic resource allocation. These optimizations improve throughput and reduce latency, allowing the system to efficiently manage large and complex datasets. Additionally, security and compliance measures—such as data encryption (SSL), Role-Based Access Control (RBAC), and adherence to GDPR and HIPAA standards—safeguard sensitive information throughout data transmission and storage. A key implementation of this framework includes the automation of shelter list geolocation workflows, ensuring that up-to-date data is readily available for VA decision-making. Lessons learned from this project include the transition from in-memory processing to incremental storage writes, improving resource management and reliability. Future enhancements aim to expand automation, integrate AI-driven anomaly detection, and incorporate high-performance computing resources. This framework provides a scalable, secure, and adaptable solution for managing geospatial datasets, reinforcing the VA’s ability to support clinical and strategic initiatives through data-driven decision-making.

97 MATHEMATICS AND COMPUTING↗