Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 163 records · Page 9

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↗

Multi-protocol header generation system

A communication device includes a data source that generates data for transmission over a bus, and a data encoder that receives and encodes outgoing data. An encoder system receives outgoing data from a data source and stores the outgoing data in a first queue. An encoder encodes outgoing data with a header type that is based upon a header type indication from a controller and stores the encoded data that may be a packet or a data word with at least one layered header in a second queue for transmission. The device is configured to receive at a payload extractor, a packet protocol change command from the controller and to remove the encoded data and to re-encode the data to create a re-encoded data packet and placing the re-encoded data packet in the second queue for transmission.

97 MATHEMATICS AND COMPUTING↗

Remote task queuing by networked computing devices

The described embodiments include a networking subsystem in a second computing device that is configured to receive a task message from a first computing device. Based on the task message, the networking subsystem updates an entry in a task queue with task information from the task message. A processing subsystem in the second computing device subsequently retrieves the task information from the task queue and performs the corresponding task. In these embodiments, the networking subsystem processes the task message (e.g., stores the task information in the task queue) without causing the processing subsystem to perform operations for processing the task message.

Reinhardt, Steven K.↗

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↗

Latency-agnostic memory controller

A computer-implemented method includes receiving, at a memory controller, a new transaction request referencing a new transaction to be executed on a memory. The memory includes two or more memory groups embodying two or more memory technologies, and the memory controller includes two or more group request queues with a respective group request queue corresponding to each memory group of the two or more memory groups. A memory group is selected, by the memory controller, from among the two or more memory groups. The transaction request is placed, by the memory controller, on the respective group request queue corresponding to the selected memory group. The new transaction is executed on the selected memory group. A new response to the new transaction is received, by the memory controller, from the selected memory group. The new response is returned.

97 MATHEMATICS AND COMPUTING↗

Speculative instruction wakeup to tolerate draining delay of memory ordering violation check buffers

A technique for speculatively executing load-dependent instructions includes detecting that a memory ordering consistency queue is full for a completed load instruction. The technique also includes storing data loaded by the completed load instruction into a storage location for storing data when the memory ordering consistency queue is full. The technique further includes speculatively executing instructions that are dependent on the completed load instruction. The technique also includes in response to a slot becoming available in the memory ordering consistency queue, replaying the load instruction. The technique further includes in response to receiving loaded data for the replayed load instruction, testing for a data mis-speculation by comparing the loaded data for the replayed load instruction with the data loaded by the completed load instruction that is stored in the storage location.

Kalamatianos, John↗

Vector send operation for message-based communication

Methods and systems for conducting vector send operations are provided. The processor of a sender node receives a request to perform a collective send operation (e.g., MPI_Broadcast) from a user application, requesting a copy of data in one or more send buffers by sent to each of a plurality of destinations in a destination vector. The processor invokes a vector send operation from a software communications library, placing a remote enqueue atomic send command for each destination node of the destination vector in an entry of a transmit data mover (XDM) command queue in a single call. The processor executes all of the commands in the XDM command queue and writes the data in the one or more send buffers into each receive queue of each destination identified in the destination vector.

Byrne, John L.↗

Enhanced atomics for workgroup synchronization

A technique for synchronizing workgroups is provided. The techniques comprise detecting that one or more non-executing workgroups are ready to execute, placing the one or more non-executing workgroups into one or more ready queues based on the synchronization status of the one or more workgroups, detecting that computing resources are available for execution of one or more ready workgroups, and scheduling for execution one or more ready workgroups from the one or more ready queues in an order that is based on the relative priority of the ready queues.

Dutu, Alexandru↗

Optimizing neural networks

A system and method design and optimize neural networks. The system and method include a data store that stores a plurality of gene vectors that represent diverse and distinct neural networks and an evaluation queue stored with the plurality of gene vectors. Secondary nodes construct, train, and evaluate the neural network and automatically render a plurality of fitness values asynchronously. A primary node executes a gene amplification on a select plurality of gene vectors, a crossing-over of the amplified gene vectors, and a mutation of the crossing-over gene vectors automatically and asynchronously, which are then transmitted to the evaluation queue. The process continuously repeats itself by processing the gene vectors inserted into the evaluation queue until a fitness level is reached, a network's accuracy level plateaus, a processing time period expires, or when some stopping condition or performance metric is met or exceeded.

97 MATHEMATICS AND COMPUTING↗