Search NASA⌕ Search

SEARCH · Search NASA

Results for “network 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 217 records · Page 12

Space Communications Responsive to Events Across Missions (SCREAM): An Investigation of Network Solutions for Transient Science Space Systems

Space Communications Responsive to Events Across Missions (SCREAM): An Investigation of Network Solutions for Transient Science Space Systems The National Academies have prioritized the pursuit of new scientific discoveries using diverse and temporally coordinated measurements from multiple ground and space-based observatories. Networked communications can enable such measurements by connecting individual observatories and allowing them to operate as a cohesive and purposefully designed system. Timely data flows across terrestrial and space communications networks are required to observe transient scientific events and processes. Currently, communications to space-based observatories experience large latencies due to manual service reservation and scheduling procedures, intermittent signal coverage, and network capacity constraints. If space communications network latencies could be reduced, new discoveries about dynamic scientific processes could be realized. However, science mission and network planners lack a systematic framework for defining, quantifying and evaluating timely space data flow implementation options for transient scientific observation scenarios involving multiple ground and space-based observatories. This dissertation presents a model-based systems engineering approach to investigate and develop network solutions to meet the needs of transient science space systems. First, a systematic investigation of the current transient science operations of the National Aeronautics and Space Administration’s (NASA) Tracking and Data Relay Satellite (TDRS) space data network and the Neil Gehrels Swift Observatory resulted in a formal architectural model for transient science space systems. Two methods individual missions may use to achieve timely network services were defined, quantitatively modeled, and experimentally compared. Next, the architectural model was extended to describe two alternative ways to achieve timely and autonomous space data flows to multiple space-based observatories within the context of a purposefully designed transient science observation scenario. A quantitative multipoint space data flow modeling method based in queueing theory was defined. General system suitability metrics for timeliness, throughput, and capacity were specified to support the evaluation of alternative network data flow implementations. A hypothetical design study was performed to demonstrate the multipoint data flow modeling method and to evaluate alternative data flow implementations using TDRS. The merits of a proposed future TDRS broadcast service to implement multipoint data flows were quantified and compared to expected outcomes using the as-built TDRS network. Then, the architectural model was extended to incorporate commercial network service providers. Quantitative models for Globalstar and Iridium short messaging data services were developed based on publicly available sources. Financial cost was added to the set of system suitability metrics. The hypothetical design study was extended to compare the relative suitability of the as-built TDRS network with the commercial Globalstar and Iridium networks. Finally, results from this research are being applied by NASA missions and network planners. In 2020, Swift implemented the first automated command pipeline, increasing its expected gravitational wave follow-up detection rate by greater than 400%. Current NASA technology initiatives informed by this research will enable future space-based observatories to become interoperable sensing devices connected by a diverse ecosystem of network service providers.

Christopher J. Roberts↗

Long range science scheduling for the Hubble Space Telescope

Observations with NASA's Hubble Space Telescope (HST) are scheduled with the assistance of a long-range scheduling system (SPIKE) that was developed using artificial intelligence techniques. In earlier papers, the system architecture and the constraint representation and propagation mechanisms were described. The development of high-level automated scheduling tools, including tools based on constraint satisfaction techniques and neural networks is described. The performance of these tools in scheduling HST observations is discussed.

Miller, Glenn↗

SPIKE: Application for ASTRO-D mission planning

SPIKE is a mission planning software system developed by a team of programmers at the STScI for use with the Hubble Space Telescope (HST). SPIKE has been developed for the purpose of automating observatory scheduling to increase the effective utilization and ultimately, scientific return from orbiting telescopes. High-level scheduling strategies using both rule-based and neural network approaches have been incorporated. Graphical displays of activities, constraints, and schedules are an important feature of the system. Although SPIKE was originally developed for the HST, it can be used for other astronomy missions including ground-based observatories. One of the missions that has decided to use SPIKE is ASTRO-D, a Japanese X-ray satellite for which the U.S. is providing a part of the scientific payload. Scheduled to fly in Feb. 1993, its four telescopes will focus X-rays over a wide energy range onto CCD's and imaging gas proportional counters. ASTRO-D will be the first X-ray imaging mission operating over the 0.5-12 keV band with high energy resolution. This combination of capabilities will enable a varied and exciting program of astronomical research to be carried out. ASTRO-D is expected to observe 5 to 20 objects per day and a total of several thousands per year. This requires the implementation of an efficient planning and scheduling system which SPIKE can provide. Although the version of SPIKE that will be used for ASTRO-D mission is almost identical to that used for the HST, there are a few differences. For example, ASTRO-D will use two ground stations for data downlinks, instead of the TDRSS system for data transmission. As a consequence ASTRO-D is constrained by limited on-board data storage capacity to schedule high data-rate observations during periods of frequent high bit rate observations accordingly. We will demonstrate the ASTRO-D version of SPIKE to show what SPIKE can provide and how efficiently it creates an observational schedule.

Isobe, T.↗

Oak Ridge Computing Academy: An HPC cluster deployment and management pilot

The High Performance Computing Technologies (HPCT) course is a hands-on High Performance Computing (HPC) cluster deployment and management training program offered as part of the International School for Advanced Studies (SISSA) and the International Center for Theoretical Physics (ICTP) Master in High Performance Computing (MHPC) specialization. Here, this training program introduces students to key concepts in cluster configuration. which include networking, software stack provisioning, job scheduling, and monitoring. The publicly available course materials feature several examples and underlying methods that are broadly applicable to cluster deployment and management. This paper discusses the design of a new workforce development program at the Oak Ridge National Laboratory that is based on HPCT, the Oak Ridge Computing Academy (ORCA). The ORCA pilot program was hosted by the Oak Ridge Leadership Computing Facility (OLCF) in Summer 2025. As a part of this discussion, HPCT and ORCA course contents and infrastructure are outlined, ORCA participant experiences are detailed, and potential opportunities for improvement are discussed.

Education↗

Demonstration of Utility Managed Smart Charging for Multiple Benefit Streams (Final Report)

In the summer of 2020, the U.S. Department of Energy (DOE) awarded funding to Exelon’s Maryland utilities—Baltimore Gas and Electric (BGE), Delmarva Power & Light (DPL), and Potomac Electric Power Company (Pepco)—to implement the Smart Charge Management (SCM) pilot. This initiative aimed to design and implement managed electric vehicle (EV) charging strategies, evaluate the grid impacts of EV charging, and assess the utilities' ability to control EV load based on real-time grid conditions. The SCM pilot explored four aspects for continued improvement: (1) cybersecurity and managed charging functionality testing of two vendor platforms—WeaveGrid (telematics-based) and Shell Recharge Solutions (network-based)—which pursued charge scheduling and optimization through distinct approaches; (2) an analysis by Argonne National Laboratory (ANL) modeling team of three potential SCM enrollment scenarios within BGE and Pepco service territories over the next decade to assess future scalability; (3) employing customer engagement strategies, including surveys and a responsive pricing approach; and (4) the launch and implementation of pilots in Exelon’s Maryland territories in collaboration with WeaveGrid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Hands-On Curriculum for Training in HPC Cluster Deployment and Management

This paper presents the design, methodology, and outcomes of the High-Performance Computing Technologies (HPCT) course, a hands-on training program focused on the system-side of HPC cluster deployment and administration. Delivered as part of the Master in High Performance Computing (MHPC) program, the course introduces students to key concepts in cluster configuration, including networking, software stack provisioning, job scheduling, and monitoring. Initially taught in person, the course was transitioned to an online format during the COVID-19 pandemic. This shift led to the development of openly available instructional material and a flipped-classroom approach that continues to support both in-person and hybrid delivery. All course materials are publicly available at www.hpc.temple.edu/mhpc/hpc-technology/index.html. By documenting the structure, infrastructure, and evolution of HPCT, this paper offers a model for accessible HPC system training that supports workforce development in computational science.

Posada Correa, Fernando [ORNL] (ORCID:000000022565↗

Supercomputing '91; Proceedings of the 4th Annual Conference on High Performance Computing, Albuquerque, NM, Nov. 18-22, 1991

Various papers on supercomputing are presented. The general topics addressed include: program analysis/data dependence, memory access, distributed memory code generation, numerical algorithms, supercomputer benchmarks, latency tolerance, parallel programming, applications, processor design, networks, performance tools, mapping and scheduling, characterization affecting performance, parallelism packaging, computing climate change, combinatorial algorithms, hardware and software performance issues, system issues. (No individual items are abstracted in this volume)

Source record↗

The 1991 research and technology report, Goddard Space Flight Center

The 1991 Research and Technology Report for Goddard Space Flight Center is presented. Research covered areas such as (1) earth sciences including upper atmosphere, lower atmosphere, oceans, hydrology, and global studies; (2) space sciences including solar studies, planetary studies, Astro-1, gamma ray investigations, and astrophysics; (3) flight projects; (4) engineering including robotics, mechanical engineering, electronics, imaging and optics, thermal and cryogenic studies, and balloons; and (5) ground systems, networks, and communications including data and networks, TDRSS, mission planning and scheduling, and software development and test.

Soffen, Gerald↗

Choosing Objectives in Over-Subscription Planning

Many NASA planning problems are over-subscription problems - that is, there are a large number of possible goals of differing value, and the planning system must choose a subset &it car! be accomplished within the limited time and resources available. Examples include planning for telescopes like Hubble, SIRTF, and SOFIA; scheduling for the Deep Space Network; and planning science experiments for a Mars rover. Unfortunately, existing planning systems are not designed to deal with problems like this - they expect a well-defined conjunctive goal and terminate in failure unless the entire goal is achieved. In this paper we develop techniques for over-subscription problems that assist a classical planner in choosing which goals to achieve, and the order in which to achieve them. These techniques use plan graph cost-estimation techniques to construct an orienteering problem, which is then used to provide heuristic advice on the goals and goal order that should considered by a planner.

Smith, David E.↗

NASA Tech Briefs, July 2010

Topics covered include: Wirelessly Interrogated Wear or Temperature Sensors; Processing Nanostructured Sensors Using Microfabrication Techniques; Optical Pointing Sensor; Radio-Frequency Tank Eigenmode Sensor for Propellant Quantity Gauging; High-Temperature Optical Sensor; Integral Battery Power Limiting Circuit for Intrinsically Safe Applications; Configurable Multi-Purpose Processor; Squeezing Alters Frequency Tuning of WGM Optical Resonator; Automated Computer Access Request System; Range Safety for an Autonomous Flight Safety System; Fast and Easy Searching of Files in Unisys 2200 Computers; Parachute Drag Model; Evolutionary Scheduler for the Deep Space Network; Modular Habitats Comprising Rigid and Inflatable Modules; More About N2O-Based Propulsion and Breathable-Gas Systems; Ultrasonic/Sonic Rotary-Hammer Drills; Miniature Piezoelectric Shaker for Distribution of Unconsolidated Samples to Instrument Cells; Lunar Soil Particle Separator; Advanced Aerobots for Scientific Exploration; Miniature Bioreactor System for Long-Term Cell Culture; Electrochemical Detection of Multiple Bioprocess Analytes; Fabrication and Modification of Nanoporous Silicon Particles; High-Altitude Hydration System; Photon Counting Using Edge-Detection Algorithm; Holographic Vortex Coronagraph; Optical Structural Health Monitoring Device; Fuel-Cell Power Source Based on Onboard Rocket Propellants; Polar Lunar Regions: Exploiting Natural and Augmented Thermal Environments; Simultaneous Spectral Temporal Adaptive Raman Spectrometer - SSTARS; Improved Speed and Functionality of a 580-GHz Imaging Radar; Bolometric Device Based on Fluxoid Quantization; Algorithms for Learning Preferences for Sets of Objects; Model for Simulating a Spiral Software-Development Process; Algorithm That Synthesizes Other Algorithms for Hashing; Algorithms for High-Speed Noninvasive Eye-Tracking System; and Adapting ASPEN for Orbital Express.

Source record↗

Performance Analysis of Cloud Computing Architectures Using Discrete Event Simulation

Cloud computing offers the economic benefit of on-demand resource allocation to meet changing enterprise computing needs. However, the flexibility of cloud computing is disadvantaged when compared to traditional hosting in providing predictable application and service performance. Cloud computing relies on resource scheduling in a virtualized network-centric server environment, which makes static performance analysis infeasible. We developed a discrete event simulation model to evaluate the overall effectiveness of organizations in executing their workflow in traditional and cloud computing architectures. The two part model framework characterizes both the demand using a probability distribution for each type of service request as well as enterprise computing resource constraints. Our simulations provide quantitative analysis to design and provision computing architectures that maximize overall mission effectiveness. We share our analysis of key resource constraints in cloud computing architectures and findings on the appropriateness of cloud computing in various applications.

Stocker, John C.↗

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗

Clonal Selection Based Artificial Immune System for Generalized Pattern Recognition

The last two decades has seen a rapid increase in the application of AIS (Artificial Immune Systems) modeled after the human immune system to a wide range of areas including network intrusion detection, job shop scheduling, classification, pattern recognition, and robot control. JPL (Jet Propulsion Laboratory) has developed an integrated pattern recognition/classification system called AISLE (Artificial Immune System for Learning and Exploration) based on biologically inspired models of B-cell dynamics in the immune system. When used for unsupervised or supervised classification, the method scales linearly with the number of dimensions, has performance that is relatively independent of the total size of the dataset, and has been shown to perform as well as traditional clustering methods. When used for pattern recognition, the method efficiently isolates the appropriate matches in the data set. The paper presents the underlying structure of AISLE and the results from a number of experimental studies.

pattern recognition↗

BioSentinel: To the Moon or Beyond?

BioSentinel, an Artemis-1 secondary spacecraft, will carry a biology experiment into deep space for the first time in 50 years. A 6U CubeSat form factor was utilized for the spacecraft and included technologies newly developed or adapted for operations beyond Earth orbit. This is the maiden deep-space voyage for the radio, propulsion system, electrical power system, and BioSensor payload. The spacecraft carries onboard budding yeast, Saccharomyces cerevisiae, as an analog to human cells to test the biological response to deep space radiation. Flying a secondary payload beyond LEO comes with unique challenges with respect to trajectory uncertainty and mission operations planning. BioSentinel does not carry propulsion for trajectory maneuvers, so plans for Comms and Power need to be developed for all trajectories. The nominal plan is a lunar flyby followed by an insertion into Heliocentric orbit. However, some possible scenarios include lunar eclipses that could severely impact the power budget during that phase of the mission, while others could result in a “Retrograde” hyperbola at swingby resulting in the spacecraft traveling inward toward Earth or even towards a collision with the lunar surface. BioSentinel’s final trajectory will not be known until after launch and deployment so possible scenarios need to be planned for ahead of time. This paper discusses the operational scenarios that were planned for as well as the actual execution of the mission operations including: command pass scheduling with the Deep Space Network, selecting bandwidth limits, medium gain antenna versus low gain antenna usage, and conserving power prior to a lunar eclipse. Note: Artemis-1 is planned to launch in the Spring of 2022

BioSentinel↗

Enabling a Larger Deep Space Mission Suite: A Deep Space Network Queuing Antenna for Demand Access

The advent of deep space small spacecraft, as exemplified by the Mars Cubesat One (MarCO), Lunar Trailblazer, Janus, the Escape and Plasma Acceleration and Dynamics Explorers (EscaPADE), and the thirteen Artemis 1 missions, opens the possibility that a much larger number of deep space spacecraft may be launched over the next 10 years and beyond. While scientifically exciting, the prospect of a (much) larger mission suite raises significant challenges for the current approach to ground stations and mission operations. We have been investigating an integrated approach for ground stations and missions operations to enable new modes of operation while maintaining the capabilities of the current operational techniques. This integrated approach is built around three core capabilities: (1) A queuing antenna that enables monitoring the status of a much larger number of spacecraft, and allows spacecraft to transmit requests for telemetry with NASA’s Deep Space Network (DSN); (2) a flexible scheduling system that expands the current DSN scheduling services to enable allocating time on DSN antennas in near real-time; and (3) a cloud-based ground data system that can be spun up and down according to how tracks are assigned by the flexible scheduling system. We shall show that an 18 meter DSN queuing antenna equipped with cyrogenic receivers would enable use of the DSN Demand Access Service for small spacecraft throughout the inner Solar System, thus providing service to a large mission suite. We first discuss the architecture of the queuing antenna and its supporting systems, including, for instance, the service required to generate the schedule for the queueing antenna (which dictates how it slews to monitor multiple spacecraft in a day of operations). Next, we describe the signaling scheme used to encode a request, which is inherited from the already operational DSN Beacon Tone Service, and describe two alternative ways to detect the incoming tone at the ground station, one based on maximum likelihood estimation (MLE), and another one based on Fast-Fourier Transfer (FFT) processing. We then use these results to estimate the maximum range at which a request can be reliably detected as a function of the spacecraft and ground station communication capabilities. Finally, the last part of this part of this paper briefly describes the prototyping effort undertaken at Morehead State University (MSU) and JPL to demonstrate the viability of this new DSN demand access. In particular, we describe the suite of tests conducted using MSU’s 21 meter ground station to validate its use a queuing antenna.

Mattle, Emily↗

Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem

This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.

Adam P. Herrmann↗

Evaluating scheduling algorithms for traffic with heterogeneous performance objectives

Two types of network traffic are considered: traffic with deadlines, for which the most important performance objective is based on loss rate, and packets without deadlines, for which the most important performance objective is based on mean delay. An optimal scheduling algorithm is presented to minimize weighted loss rate and weighted mean delay in the queues that form at the switches and at the network access points of a packet-switched network, where weights reflect the relative importance of packets. Although not practical for implementation, the algorithm is intended as a standard for the comparison of the performance of other scheduling algorithms. The algorithm is more general and lower computational complexity than previously published algorithms, enabling performance evaluation of some important scenarios that could not previously have been considered. Using the optimal performance results of this algorithm, the performance of the first-come-first-served, static priority, and earliest deadline first scheduling algorithms is evaluated. The results suggest that network efficiency could be improved by using a more sophisticated heuristic scheduling algorithm rather than one of the aforementioned algorithms.

Peha, Jon M.↗

Video conferencing made easy

Network video conferencing is advancing rapidly throughout the nation, and the Idaho National Engineering Laboratory (INEL), a Department of Energy (DOE) facility, is at the forefront of the development. Engineers at INEL/EG&G designed and installed a very unique DOE videoconferencing system, offering many outstanding features, that include true multipoint conferencing, user-friendly design and operation with no full-time operators required, and the potential for cost effective expansion of the system. One area where INEL/EG&G engineers made a significant contribution to video conferencing was in the development of effective, user-friendly, end station driven scheduling software. A PC at each user site is used to schedule conferences via a windows package. This software interface provides information to the users concerning conference availability, scheduling, initiation, and termination. The menus are 'mouse' controlled. Once a conference is scheduled, a workstation at the hubs monitors the network to initiate all scheduled conferences. No active operator participation is required once a user schedules a conference through the local PC; the workstation automatically initiates and terminates the conference as scheduled. As each conference is scheduled, hard copy notification is also printed at each participating site. Video conferencing is the wave of the future. The use of these user-friendly systems will save millions in lost productivity and travel cost throughout the nation. The ease of operation and conference scheduling will play a key role on the extent industry uses this new technology. The INEL/EG&G has developed a prototype scheduling system for both commercial and federal government use.

Larsen, D. Gail↗