Search NASA⌕ Search

SEARCH · Search NASA

Results for “Queues”

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 109 records · Page 6

A Simulation Study of Paced TCP

In this paper, we study the performance of paced TCP, a modified version of TCP designed especially for high delay- bandwidth networks. In typical networks, TCP optimizes its send-rate by transmitting increasingly large bursts, or windows, of packets, one burst per round-trip time, until it reaches a maximum window-size, which corresponds to the full capacity of the network. In a network with a high delay-bandwidth product, however, Transmission Control Protocol's (TCPs) maximum window-size may be larger than the queue size of the intermediate routers, and routers will begin to drop packets as soon as the windows become too large for the router queues. The TCP sender then concludes that the bottleneck capacity of the network has been reached, and it limits its send-rate accordingly. Partridge proposed paced TCP as a means of solving the problem of queueing bottlenecks. A sender using paced TCP would release packets in multiple, small bursts during a round-trip time in which ordinary TCP would release a single, large burst of packets. This approach allows the sender to increase its send-rate to the maximum window size without encountering queueing bottlenecks. This paper describes the performance of paced TCP in a simulated network and discusses implementation details that can affect the performance of paced TCP.

Kulik, Joanna↗

Job Scheduling Under the Portable Batch System

The typical batch queuing system schedules jobs for execution by a set of queue controls. The controls determine from which queues jobs may be selected. Within the queue, jobs are ordered first-in, first-run. This limits the set of scheduling policies available to a site. The Portable Batch System removes this limitation by providing an external scheduling module. This separate program has full knowledge of the available queued jobs, running jobs, and system resource usage. Sites are able to implement any policy expressible in one of several procedural language. Policies may range from "bet fit" to "fair share" to purely political. Scheduling decisions can be made over the full set of jobs regardless of queue or order. The scheduling policy can be changed to fit a wide variety of computing environments and scheduling goals. This is demonstrated by the use of PBS on an IBM SP-2 system at NASA Ames.

Henderson, Robert L.↗

Delay Banking for Managing Air Traffic

Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.

Green, Steve↗

Network resiliency through memory health monitoring and proactive management

A method for managing a network queue memory includes receiving sensor information about the network queue memory, predicting a memory failure in the network queue memory based on the sensor information, and outputting a notification through a plurality of nodes forming a network and using the network queue memory, the notification configuring communications between the nodes.

Andrade Costa, Carlos H.↗

Job Scheduler-Driven Power Gateway for High Performance Computing

Power gateways in the form of a microgrid can incorporate multiple distributed energy resources (DER) in either grid forming or grid following mode and support high performance computing (HPC) power profiles including the large load-follow requirements observed in multi-user HPC systems. The microgrid’s flexibility to operate in either grid forming or grid following mode and to actively switch between these modes enables baseline power from multiple non-baseline DER while maintaining high power quality metrics for the HPC system. But this enormous flexibility in demand response and time of use shifting is generally programmed independently of any integration with an HPC job scheduler which can better inform the load shaping by the microgrid. While there are many existing approaches where the HPC job scheduler takes in information from the grid to make queue scheduling decisions, this work takes the opposite view and explores a scheduler where the jobs in the queue can directly impact the settings of the grid. Several HPC scheduler strategies are tested where the jobs in the queue directly impact the settings of a microgrid designed for HPC operation which is driving a datacenter with three classes of HPC architectures. The scheduler operation is shown using a microgrid with 64 kW of solar capacity and 320 kWh of battery over a period of 21 days operating with significant low-follow swings, a throttled grid, cloudy conditions, switching between grid following and grid forming modes, and a wide range of battery states-of-charge all while maintaining high quality power metrics. The scheduler provides a mechanism for the job queue to directly impact a power gateway like a microgrid and to improve HPC power outcomes such as maximizing renewable energy usage

microgrid↗

Offline Arterial Signal Timing Optimization for Closely Spaced Intersections

The stop-and-go driving behavior at a busy arterial causes a significant amount of fuel waste and emissions that could be reduced. For closely spaced intersections, the traditional bottom-up signal timing approach could fail under high volumes when the queues reach the upstream intersections. A well-coordinated arterial should manage the queue length to prevent the control from failing. Traditionally, coordination among signalized intersections for an arterial means finding the good offsets for each intersection. The control of the intersections along an arterial can also be coordinated by optimizing splits. Splits impact the capacity of an intersection. Similar to the highway, the capacity drop could cause growing queues. This work is based on the Virtual Phase-Link (VPL) model, a street traffic model designed for online traffic model predictive control, to obtain a top-down offline arterial signal timing. The VPL-based model can guarantee capacity consistency in intersections along an arterial. We, therefore, adopted the VPL-based model and developed an offline signal timing optimization approach. The proposed timing derived from the VPL-based offline signal timing optimization showed very good results in simulation. We also collected field experiment data, which demonstrated overall energy reductions and speed improvements on some sections of the study arterial.

47 OTHER INSTRUMENTATION↗

DIVA/DeviceEditor (DIVA) v5.1

The DIVA software interfaces a process in which researchers design their DNA with a web-based graphical user interface (DeviceEditor), submit their designs to a central queue, and a few weeks later receive their sequence-verified clonal constructs. Each researcher independently designs the DNA to be constructed with a web-based BioCAD tool, and presses a button to submit their designs to a central queue. Researchers have web-based access to their DNA design queues, and can track the progress of their submitted designs as they progress from "evaluation", to "waiting for reagents", to "in progress", to "complete". Researchers access their completed constructs through the central DNA repository. Along the way, all DNA construction success/failure rates are captured in a central database. his success/failure rate data can be leveraged to refine the DNA assembly design process.

Lane, Stephen↗

Queued Up: 2024 Edition, Characteristics of Power Plants Seeking Transmission Interconnection As of the End of 2023 [Slides]

Electric transmission system operators (ISOs, RTOs, or utilities) require projects seeking to connect to the grid to undergo a series of impact studies before they can be built. This process establishes what new transmission equipment or upgrades may be needed before a project can connect to the system and assigns the costs of that equipment. The lists of projects in this process are known as “interconnection queues”. The amount of new electric capacity in these queues is growing dramatically, with nearly 2,600 gigawatts (GW) of total generation and storage capacity now seeking connection to the grid (over 95% of which is for zero-carbon resources like solar, wind, and battery storage). However, most projects that apply for interconnection are ultimately withdrawn, and those that are built are taking longer on average to complete the required studies and become operational. Data from these queues nonetheless provide a general indicator for mid-term trends in developer interest.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Clean Energy Deployment Baseline for the Energy Community and Low-Income Tax Credit Bonuses [Slides]

The Inflation Reduction Act of 2022 introduced, for the first time, place-based federal tax incentives for projects sited in “Energy Communities,” potentially changing the economic calculus of where projects are best sited. Storage projects can qualify for a 10-percentage-point bonus to the Investment Tax Credit (e.g., from 30% to 40%), while wind and solar projects may qualify for either the ITC bonus or a 10% bonus to the Production Tax Credit (e.g., from $\$27.5$ to $\$30.25$/MWh). Energy Communities are areas with historical ties to fossil fuel industries and above average unemployment levels (FFEU), with closed coal mines or power plants, or contaminated properties. They seek to identify locations across the US that could especially benefit from economic revitalization. This report explores how the new federal tax credit incentives are impacting clean energy deployment patterns and establishes historical baselines against which future changes can be compared. We include a few case studies of clean energy projects going specifically to areas that were recently impacted by coal power plant closures to provide concrete examples of investments in Energy Communities. However, this publication does not assess how much of the incentive benefits pass from clean energy developers to hosting communities, nor does it offer a comprehensive view of the economic effects of clean energy deployment on Energy Communities. Key highlights include: - As clean energy projects take multiple years to conceptualize and develop, it is likely too early to see shifts towards Energy Community locations either among newly built projects or those that entered interconnection queues in 2023. - Approximately 35% of onshore wind, 50% of solar, and 60% of storage capacity built in 2023 and the first half of 2024 are located in Energy Communities, making them likely eligible for bonus incentives. While these bonus incentives were not available to projects coming online before 2023, we used 2023 Energy Community definitions to classify whether past projects were built in what is now considered an Energy Community. The deployment levels for 2023-2024 are similar to recent years (2020-2022) for solar and storage but slightly lower for wind. - Clean energy capacity has surged in the interconnection queues over the last few years, with about 45-50% of both recently proposed and total queued capacity being located in Energy Communities. While the amount of capacity in Energy Communities has also grown, its relative share is either stable (solar and storage) or slightly lower (wind) among projects that entered the queue in 2023. - Clean energy projects can be built at lower costs in Energy Communities. The levelized cost of energy after incentives was on average $\$9$/MWh (24%) lower for solar projects and $\$2$/MWh (6%) lower for wind projects built in 2023, relative to projects not located in Energy Communities. Wholesale electricity values at Energy Community locations relative to the rest of the market vary by region. The average value was often higher for wind projects (-$\$3$ to $\$11$/MWh) but lower for solar projects (-$\$6$ to 0/MWh). - Distributed solar that is owned by commercial entities is eligible for the Energy Community bonus and also, potentially, a Low-Income Community bonus. Residential solar installations in qualifying Energy Communities that are third-party owned represent about 10% of the total residential market. Larger commercial and industrial solar installations in Energy Communities make up 17% of the total market in 2023. Nearly 2 GW of distributed solar was built in areas qualifying as Low-Income Communities in 2023, exceeding the available annual program cap of 700 MW. Continued tracking of these trends will be important for system planners, investors, and local communities.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A new traffic control design method for large networks with signalized intersections

The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

Leininger, G. G.↗

A microprocessor based high speed space-borne packet switch

The design and performance evaluation of a single microprocessor based packet switch for use on-board a satellite are presented. The primary design criterion is to maximize the system throughput. A number of protocols and their impact on the switch design are discussed. Stem and processor hardware architectures are described. The flow charts of the software required to accomplish the essential functions are presented and modification needed for use in a multisatellite network are also indicated. Maximum throughput attainable is calculated, desirable characteristics of microprocessors for this application are pointed out. A queue theoretic model of the packet switch has been developed. Analytical relationships of the average waiting times and the queue sizes at the queues and the overall average response time with the various design parameters of the switch have been obtained. A number of graphs showing the effect of variation in the number of input and output lines, data rates, destination functions, speed of output lines and some other design parameters on the performance of the switch are presented and discussed.

Arozullah, M.↗

A microprocessor based satellite borne packet switch

Design considerations applicable to a space-borne single microprocessor based packet switch are identified. These include system architecture decisions and microprocessor selection. The division of tasks among different subroutines is discussed. The primary design criterion is to maximize throughput. The extension to a multi-satellite network is discussed. The maximum throughput attainable is derived. A queue theoretic model has been developed and expressions for average response times and average queue sizes are obtained. A number of graphs showing the effect of various design parameters on the average response time and the average queue sizes are presented.

Crist, S. C.↗

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗

Analysis of exhaustive limited service for token ring networks

Token ring operation is well-understood in the cases of exhaustive, gated, gated limited, and ordinary cyclic service. There is no current data, however, on queueing models for the exhaustive limited service type. This service type differs from the others in that there is a preset maximum (omega) on the number of packets which may be transmitted per token reception, and packets which arrive after token reception may still be transmitted if the preset packet limit has not been reached. Exhaustive limited service is important since it closely approximates a timed token service discipline (the approximation becomes exact if packet lengths are constant). A method for deriving the z-transforms of the distributions of the number of packets present at both token departure and token arrival for a system using exhaustive limited service is presented. This allows for the derivation of a formula for mean queueing delay and queue lengths. The method is theoretically applicable to any omega. Fortunately, as the value of omega becomes large (typically values on the order of omega = 8 are considered large), the exhaustive limited service discipline closely approximates an exhaustive service discipline.

Peden, Jeffery H.↗

Systolic array processing of the sequential decoding algorithm

A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.

Chang, C. Y.↗

An architecture for real-time vision processing

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Chien, Chiun-Hong↗

Tactical Surface Metering Procedures for Charlotte Douglas International Airport

NASA has been collaborating with the Federal Aviation Administration (FAA) and aviation industry partners to develop and demonstrate new concepts and technologies for the Integrated Arrival, Departure, and Surface (IADS) traffic management capabilities under the Airspace Technology Demonstration 2 (ATD-2) project. The primary goal of the ATD-2 project is to improve the predictability and the operational efficiency of the air traffic system in metroplex environments while maintaining or improving throughput by enhancing and integrating arrival, departure and surface prediction, scheduling, and management systems. In the Phase 1 Baseline IADS Demonstration, the tactical surface scheduling capability and the user interfaces for ramp controllers and ramp traffic managers were implemented for ramp operations. The purpose of the tactical surface scheduling capability is to provide the airline ramp controller with aircraft pushback advisories that prevent surface congestion and to respond to surface and airspace constraints that become known over relatively short time horizons. For this purpose, the tactical surface metering tool first estimates the capacity of current and near-future runway resources from flight schedule and surveillance data. With demand forecasts and predicted taxi trajectories, this tool computes an efficient runway schedule of aircraft in the planning horizon based on their readiness, Earliest Off-Block Times (EOBTs), and a ration by schedule (RBS) rule. Details on the implementation of the Tactical Surface Metering tool will be provided in the full paper. Both pushback and recommended hold times advisories provided by this surface metering tool are shown on the user interfaces for the ramp controller and the ramp traffic manager, called Ramp Traffic Console (RTC) and Ramp Manager Traffic Console (RMTC), respectively. There is excess queue time in the system due to demand capacity imbalance, this time can be taken as a hold on the runway queue or at the gate and was referred to as the Metering Value. This metering value can be adjusted by the Ramp Manager in collaboration with Air Traffic Controller-Tower Traffic Management Coordinator (TMC). They selected a set of metering values as default values for the tool during human-in-the-loop simulation. As the metering value increases, there is a decrease in the gate hold and increase in the queue time at the runway. Procedures and Information needs related to managing the surface metering procedures were researched in the simulated environment. These procedures will be compared to the procedures adopted at Charlotte Douglas International Airport when the tools were deployed and adopted in November 2017 for one departure push bank per day. Feedback regarding initial issues, information needs such as the need to see EOBTs on the flight data tags and how they compare to scheduled times will also be discussed in the full paper. Initial results will be provided regarding the choice of the metering value and how it was adjusted on a daily basis and what procedures evolved will also be presented in the paper.

surface metering↗

Monitor support on accelerated processing device

A technique for implementing synchronization monitors on an accelerated processing device (“APD”) is provided. Work on an APD includes workgroups that include one or more wavefronts. All wavefronts of a workgroup execute on a single compute unit. A monitor is a synchronization construct that allows workgroups to stall until a particular condition is met. Responsive to all wavefronts of a workgroup executing a wait instruction, the monitor coordinator records the workgroup in an “entry queue.” The workgroup begins saving its state to a general APD memory and, when such saving is complete, the monitor coordinator moves the workgroup to a “condition queue.” When the condition specified by the wait instruction is met, the monitor coordinator moves the workgroup to a “ready queue,” and, when sufficient resources are available on a compute unit, the APD schedules the ready workgroup for execution on a compute unit.

42 ENGINEERING↗