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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Evaluating Interconnection Queue Impacts Using Hosting Capacity Analysis

The interconnection queue has been identified as a bottleneck in the efforts to shift the nations generation resources towards renewable sources and meet various state and federal goals. Efforts such as the interconnection innovation e-Xchange (i2X) are therefore trying to come up with ways in which the queue could be altered to make interconnection faster, cheaper, and fairer. This paper proposes using hosting capacity analysis methods to simulate the evolution of a power system as new resources are added. Modeling the interconnection process in this way enables simulation based study of various policy decisions for queue management and cost allocation. Sample results are presented to illustrate how some queue modifications might play out both in distribution and transmission systems.

Distributed Energy Resources, Interconnection↗
NASA NTRS1976

Behavior of queues at signalized intersections in heavy traffic

This paper derives the asymptotic behavior of traffic queues at signalized intersections when the excess of departure capacity over arrivals approaches zero from above. The most interesting result is that the distribution of queue length approaches a negative exponential, with fewer restrictive assumptions than hitherto known. The main improvement results from more precise use of a combinatorial lemma of Spitzer, giving the maximum of the partial sums of a sequence of independent identically distributed random variables, plus some specific constructive probability calculations, many of them involving the Fourier transform. New results are presented on the probability that the queue be below a fixed bound and/or on the probability that the queue be empty. Applications to on-line estimators for real-time traffic control are suggested.

Posner, E. C.↗
NASA NTRS1984

In-trail dynamics of multiple CDTI-equipped aircraft queues

One of the potential problems of in-trail self-spacing with a Cockpit Display of Traffic Information (CDTI) is whether dynamic oscillations would occur in a queue of aircraft flying an approach, similar to the ""accordion'' effect seem with the queue of automobiles in stop-and-go traffic. In order to gain some insight into this potential problem, a brief experiment was conducted with the Transport Systems Research Vehicle (TSRV) ground-based simulator equipped with CDTI which presented the position of other aircraft in the area. Three simulation sessions were conducted wherein queues of up to nine aircraft were built, each one self-spacing on the preceding aircraft. The aircraft crews were rotated to ensure that the pilots had no prior knowledge of the lead aircraft behavior they would be following. Two different spacing criteria were employed: a constant time predictor criterion and a constant time delay criterion. The experiment failed to uncover any dynamic oscillatory tendencies in queues of seven to nine aircraft.

Kelly, J. R.↗
DOE OSTI2015

Store operation with conditional push of a tag value to a queue

According to one embodiment, a method for a store operation with a conditional push of a tag value to a queue is provided. The method includes configuring a queue that is accessible by an application, setting a value at an address in a memory device including a memory and a controller, receiving a request for an operation using the value at the address and performing the operation. The method also includes the controller writing a result of the operation to the address, thus changing the value at the address, the controller determining if the result of the operation meets a condition and the controller pushing a tag value to the queue based on the condition being met, where the tag value in the queue indicates to the application that the condition is met.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

System, method, and computer program product for a two-phase queue

A system, method, and computer program product are provided for accessing a queue. The method includes receiving a first request to reserve a data record entry in a queue, updating a queue state block based on the first request, and returning a response to the request. A second request is received to commit the data record entry and the queue state block is updated based on the second request.

Dally, William J.↗
DOE OSTI2020

Deep Learning-Based Queue-Aware Eco-Approach and Departure System for Plug-In Hybrid Electric Buses at Signalized Intersections: A Simulation Study

Eco-Approach and Departure (EAD) has been considered as a promising eco-driving strategy for vehicles traveling in an urban environment, where information such as signal phase and timing (SPaT) and geometric intersection description is well utilized to guide vehicles passing through intersections in the most energy-efficient manner. Previous studies formulated the optimal trajectory planning problem as finding the shortest path on a graphical model. While this method is effective in terms of energy saving, its computation efficiency can be further enhanced by adopting machine learning techniques. In this paper, we propose an innovative deep learning-based queue-aware eco-approach and departure (DLQ-EAD) system for a plug-in hybrid electric bus (PHEB), which is able to provide an online optimal trajectory for the vehicle considering both the downstream traffic condition (i.e. traffic lights, queues) and the vehicle powertrain efficiency. Based on optimal solutions obtained from the graph-based trajectory planning algorithm (GTPA), a deep neural network (DNN) is developed to learn the optimal vehicle speed for the next time step given its current state. It is demonstrated that the trained DNN can provide energy-efficient trajectories with high computational efficiency and high flexibility adopting to dynamic changes in the surrounding environment. To address the impact of downstream traffic, a queue prediction model is further developed using data from radars and connected vehicles (CVs), as well as signal timing data from SPaT messages. A comprehensive simulation study in the microscopic traffic modeling software PTV VISSIM shows that the proposed DLQ-EAD can achieve 18.7%-24.0% energy efficiency improvements for a single PHEB on various traffic congestion levels. The proposed queue prediction model can be of practical significance even at low penetration rates of CVs. Specifically, additional energy savings of 2.0%-8.2% can be further achieved with 20% vehicles in the network.

Ye, Fei↗
DOE OSTI2023

Circular queue management with split indexes

Methods and apparatus for managing circular queues are disclosed. A pointer designates an index position of a particular queue element and contains an additional pointer state, whereby two pointer values (split indexes) can designate the same index position. Front and rear pointers are respectively managed by dequeue and enqueue logic. The front pointer state and rear pointer state distinguish full and empty queue states when both pointers designate the same index position. Asynchronous dequeue and enqueue operations are supported, no lock is required, and no queue entry is wasted. Hardware and software embodiments for numerous applications are disclosed.

Miniskar, Narasinga Rao↗
DOE OSTI2024

Quantifying Uncertainty in HPC Job Queue Time Predictions

High Performance Computing (HPC) has developed at an unprecedented pace in recent decades. This growth has demanded corresponding development in the area of HPC Operational Data Analytics (ODA), which encompasses a wide range of data analysis techniques, ML/AI efforts, tools, and visualizations. Published studies in ODA offer a variety of practical ways to inform HPC users, administrators, procurement managers, and other stakeholders. Uncertainty analysis, however, is rare in the related published literature. For instance, we identify only 1 out of 14 existing studies focused on job queue time prediction that investigates the uncertainty aspect of their proposed predictions. We recognize the utmost importance uncertainty quantification can have in such predictive analytics solutions, with consequences in how users interpret information they receive, and attempt to bridge this gap. With the goal of improving access to such insights, we develop a process for determining upper and lower bounds of the predicted queue times of a regression model at a specified confidence level. Our current research is focused on the uncertainty in predicting job queue times, yet our approach may be employed in predicting other metrics.

HPC↗
DOE OSTI2021

Automatic Traffic Queue-End Identification using Location-Based Waze User Reports

Traffic queues, especially queues caused by non-recurrent events such as incidents, are unexpected to high-speed drivers approaching the end of queue (EOQ) and become safety concerns. Though the topic has been extensively studied, the identification of EOQ has been limited by the spatial-temporal resolution of traditional data sources. This study explores the potential of location-based crowdsourced data, specifically Waze user reports. It presents a dynamic clustering algorithm that can group the location-based reports in real time and identify the spatial-temporal extent of congestion as well as the EOQ. The algorithm is a spatial-temporal extension of the density-based spatial clustering of applications with noise (DBSCAN) algorithm for real-time streaming data with an adaptive threshold selection procedure. Here, the proposed method was tested with 34 traffic congestion cases in the Knoxville, Tennessee area of the United States. It is demonstrated that the algorithm can effectively detect spatial-temporal extent of congestion based on Waze report clusters and identify EOQ in real-time. The Waze report-based detection are compared to the detection based on roadside sensor data. The results are promising: The EOQ identification time of Waze is similar to the EOQ detection time of traffic sensor data, with only 1.1 min difference on average. In addition, Waze generates 1.9 EOQ detection points every mile, compared to 1.8 detection points generated by traffic sensor data, suggesting the two data sources are comparable in respect of reporting frequency. The results indicate that Waze is a valuable complementary source for EOQ detection where no traffic sensors are installed.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

The SprayList: a scalable relaxed priority queue

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by ``spraying'' themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(p log^3 p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log^3 p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. As a result, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Waiting in Queue: A Historical Evaluation of Interconnection Policy

Both states and Independent System Operators (ISO)/Regional Transmission Organizations (RTO) have struggled with long wait times in interconnection queues. As a result, numerous reforms have been proposed to expedite the connection of new resources to the grid. This paper conducts a quantitative analysis of two of these policies: one providing detail hosting capacity information in Massachusetts, the other experimenting with cost allocation in New York. We find that both policies led to a statistically significant decrease in the times projects spend pending in interconnection queues, with New York seeing a small drop in days pending, and Massachusetts seeing a much larger one. We also include an analysis of how energy storage is impacts queue time in these states. These results can help inform regulators who are weighing reforms to interconnection policies, with the goal of reducing wait times.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1979

Application of queueing models to multiprogrammed computer systems operating in a time-critical environment

A model of a central processor (CPU) which services background applications in the presence of time critical activity is presented. The CPU is viewed as an M/M/1 queueing system subject to periodic interrupts by deterministic, time critical process. The Laplace transform of the distribution of service times for the background applications is developed. The use of state of the art queueing models for studying the background processing capability of time critical computer systems is discussed and the results of a model validation study which support this application of queueing models are presented.

Eckhardt, D. E., Jr.↗
NASA NTRS1986

The network queueing system

Described is the implementation of a networked, UNIX based queueing system developed on contract for NASA. The system discussed supports both batch and device requests, and provides the facilities of remote queueing, request routing, remote status, queue access controls, batch request resource quota limits, and remote output return.

Kingsbury, Brent K.↗
NASA NTRS1988

Parallel discrete-event simulation of FCFS stochastic queueing networks

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Nicol, David M.↗
NASA NTRS1990

Queueing models for token and slotted ring networks

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

Peden, Jeffery H.↗
NASA NTRS1990

Stochastic ordering properties and optimal routing control for a class of finite capacity queueing systems

The problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Stochastic ordering and weak majorization properties on critical performance measures are established by means of event-driven inductions. In particular, it is shown that the intuitive 'join the shortest non-full queue' (SNQ) policy is optimal with respect to an overall function that accounts for holding and blocking costs. Moreover, the buffer allocation problem is solved by proving the intuitive result that, for a fixed total buffer capacity, the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
NASA NTRS1991

Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks

The authors present smoothed perturbation analysis (SPA) estimators for the derivative of a number of occupancy-related functions in serial queuing networks with finite buffer spaces. The functions are the average number of customers at a network as seen by an arrival, the probability that a customer is blocked at a particular queue, and the probability that a customer leaves a queue empty. In all three cases, the variable is a parameter of the distribution of service times at one of the queues. The derivative estimators considered are very simple and flexible, and they easily lend themselves to analysis of unbiasedness. Unlike most of the established SPA estimators, the present ones are not based on the computation of hazard rates.

Wardi, Y.↗
DOE OSTI2017

Optimization Scheme for Establishing Queues for Shipment of UNF from Shutdown Reactor Sites - 17554

Approximately 14, 815 used nuclear fuel assemblies (5,800 MTHM) are stored in 486 dry storage cask systems located at 12 independent spent fuel storage installations (ISFSIs) located at shutdown reactor sites located across the U.S. that have no access to spent fuel pools. A preliminary evaluation was performed by the University of North Carolina at Charlotte (UNCC) in collaboration with AREVA to establish optimization schemes for establishing queues for the removal of this used/spent nuclear fuel (hence forth identified as UNF) and Greater than Class C low level wastes (GTCC) found at these shutdown reactor sites. These queues assumed the major portion of the shipment of the UNF and GTCC would be by rail, with heavy haul truck or barge potentially utilized to move the UNF from the site to rail for sites not served directly by rail. The destination for these rail shipments were a hypothetical consolidated interim storage facility (CSF) located in West Texas. The queues were developed based on the total costs and time to finish all shipments needed to remove all the UNF from these shutdown sites. Results are presented for optimization schemes based on a continuous flow of shipments using 1, 2, and 3 crews dedicated to individual ISFSIs and discrete shipments using 2 crews capable of performing operations at multiple ISFSIs. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗