Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “queuing model”

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 55 records · Page 3

An analytic performance model of disk arrays and its application

As disk arrays become widely used, tools for understanding and analyzing their performance become increasingly important. In particular, performance models can be invaluable in both configuring and designing disk arrays. Accurate analytic performance models are desirable over other types of models because they can be quickly evaluated, are applicable under a wide range of system and workload parameters, and can be manipulated by a range of mathematical techniques. Unfortunately, analytical performance models of disk arrays are difficult to formulate due to the presence of queuing and fork-join synchronization; a disk array request is broken up into independent disk requests which must all complete to satisfy the original request. We develop, validate, and apply an analytic performance model for disk arrays. We derive simple equations for approximating their utilization, response time, and throughput. We then validate the analytic model via simulation and investigate the accuracy of each approximation used in deriving the analytical model. Finally, we apply the analytical model to derive an equation for the optimal unit of data striping in disk arrays.

Lee, Edward K.↗

Influence of Weather on the Predicted Moisture Content of Field Chopped EnergySorghum and Switchgrass

To determine the effects of weather on harvested moisture content (MC) of switchgrass (Panicum virgatum) and energy sorghum (Sorghum bicolor), tracking of harvest progress on individual fields in the Integrated Biomass Supply and Logistics (IBSAL) model was modified to allow: i) rewetting of swathed material in the drying formulae; and ii) field queuing rules based on equipment availability and weather. Estimated crop yield and initial MC by harvest date, as observed in field trials, along with the modeling of different delays between mowing and harvest allowed estimation of harvested MC, annual tonnage processed and associated processing cost differences by crop and location over 10 years. Extending the hours of annual equipment use had minor implications on cost of production. Energy sorghum proved difficult to dry in the field. Its higher yield, leading to shorter supply distance to the plant, may justify harvesting of energy sorghum early in the season with drier weather. Lastly, later harvest for lower-yielding switchgrass offers MC advantages.

09 BIOMASS FUELS↗

Cyber Threat Screening Using a Queuing-Based Game-Theoretic Approach

Dynamic and uncertain security environments, such as cyber systems, often involve strategic interactions among multiple decision-making agents. In this paper, we consider a cybersecurity setting where a system administrator (defender) has to screen malicious service requests of an attacker who seeks to exhaust available cyber resources and inconvenience users with normal requests. We propose a novel cyber-threat inspection model, based on Stackelberg games, that unies aspects of Threat Security Games with the Erlang-B queuing framework to provide equilibrium strategies for both the attacker and defender. In our proposed model, the defender seeks to determine the optimal number of inspection nodes required to maximize detection probability of malicious requests, while the attacker maximizes the probability of legitimate requests dropping out of the system. We derive analytical expressions of the equilibrium solutions of the proposed Stackelberg game under realistic assumptions on system observability and payoff structure of the players. A numerical case study is presented, and steps for further research are identified.

Cybersecurity, Stackelberg game, Erlang-B loss sys↗

Video transmission on ATM networks

The broadband integrated services digital network (B-ISDN) is expected to provide high-speed and flexible multimedia applications. Multimedia includes data, graphics, image, voice, and video. Asynchronous transfer mode (ATM) is the adopted transport techniques for B-ISDN and has the potential for providing a more efficient and integrated environment for multimedia. It is believed that most broadband applications will make heavy use of visual information. The prospect of wide spread use of image and video communication has led to interest in coding algorithms for reducing bandwidth requirements and improving image quality. The major results of a study on the bridging of network transmission performance and video coding are: Using two representative video sequences, several video source models are developed. The fitness of these models are validated through the use of statistical tests and network queuing performance. A dual leaky bucket algorithm is proposed as an effective network policing function. The concept of the dual leaky bucket algorithm can be applied to a prioritized coding approach to achieve transmission efficiency. A mapping of the performance/control parameters at the network level into equivalent parameters at the video coding level is developed. Based on that, a complete set of principles for the design of video codecs for network transmission is proposed.

Chen, Yun-Chung↗

On-board closed-loop congestion control for satellite based packet switching networks

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

Chu, Pong P.↗

International Conference on Advances in Communication and Control Systems, 1st, Washington, DC, June 18-20, 1987, Proceedings

Theoretical models of communication and control systems are discussed in reviews and reports. Topics addressed include smoothing and identification for random fields, the information and coding capacities of mismatched Gaussian channels, recursive least-squares estimation and Kalman filtering by systolic arrays, Kemp echo digital filters, a periodic test-scheduling scheme for communication and queuing processes, and receivers for direct-sequence systems. Consideration is given to a distributed-parameter model for detecting cracks in rotors, active control of aeroelastic systems governed by functional differential equations, robust multivariable control of large space structures, finite-rank relatively bounded perturbations of semigroup generators, and sensitivity analysis of convex optimal-control problems.

Declaris, Nicholas↗

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗

Towards an Introspective Dynamic Model of Globally Distributed Computing Infrastructures

Large-scale scientific collaborations like ATLAS, Belle II, CMS, DUNE, and others involve hundreds of research institutes and thousands of researchers spread across the globe. These experiments generate petabytes of data, with volumes soon expected to reach exabytes. Consequently, there is a growing need for computation, including structured data processing from raw data to consumer-ready derived data, extensive Monte Carlo simulation campaigns, and a wide range of end-user analysis. To manage these computational and storage demands, centralized workflow and data management systems are implemented. However, decisions regarding data placement and payload allocation are often made disjointly and via heuristic means. A significant obstacle in adopting more effective heuristic or AI-driven solutions is the absence of a quick and reliable introspective dynamic model to evaluate and refine alternative approaches. In this study, we aim to develop such an interactive system using real-world data. By examining job execution records from the PanDA workflow management system, we have pinpointed key performance indicators such as queuing time, error rate, and the extent of remote data access. The dataset includes five months of activity. Additionally, we are creating a generative AI model to simulate time series of payloads, which incorporate visible features like category, event count, and submitting group, as well as hidden features like the total computational load—derived from existing PanDA records and computing site capabilities. These hidden features, which are not visible to job allocators, whether heuristic or AI-driven, influence factors such as queuing times and data movement.

kilic, Ozgur Ozan [Brookhaven National Laboratory ↗

Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior

Electric vehicles are a sustainable substitution to conventional vehicles. This work introduces an integrated framework for urban fast charging infrastructure to address the range anxiety issue. A mesoscopic simulation tool is developed to generate trip trajectories, and simulate charging behavior based on various trip attributes. The resulting charging demand is the key input to a mixed-integer nonlinear program that seeks charging station configuration. The model minimizes the total system cost including charging station and charger installation costs, and charging, queuing, and detouring delays. The problem is solved using a decomposition technique incorporating a commercial solver for small networks, and a heuristic algorithm for large-scale networks, in addition to the Golden Section method. The solution quality and significant superiority in the computational efficiency of the decomposition approach are confirmed in comparison with the implicit enumeration approach. Furthermore, the required infrastructure to support urban trips is explored for future market shares and technologies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Simulating an aerospace multiprocessor

The paper describes a simulator which was used to evaluate the architecture of an aerospace multiprocessor. The simulator models interactions among the processors, memories, the central data bus, and a possible 'job stack'. Special features of the simulator are discussed, including the use of explicitly coded and individually distinguishable 'job models' instead of a statistically defined 'job mix' and a specialized Job Model Definition Language to automate the detailed coding of the models. Some results are presented which show that when the simulator was employed in conjunction with queuing theory and Markov-process analysis, more insight into system behavior was obtained than would have been with any one technique alone.

Mallach, E. G.↗

Balancing Charging Station Utilization and Throughput in Electric Vehicle Charging Stations with Queuing Theory

The rapid increase in electric vehicle (EV) adoption demands enhancements in the efficiency and adaptability of EV supply equipment (EVSE). Traditional EVSE systems often fail to optimize power delivery to meet the variable acceptance rates of EV batteries, resulting in significant energy wastage and reduced operational efficiency. This research addresses these challenges by integrating queuing theory with modular EVSE architectures, offering a dual strategy to optimize the operation of EV charging stations. A simulation model was developed to assess various configurations of charger capacities and outlet numbers. This model aimed to identify the optimal setup that maximizes station utilization while minimizing charging times and maximizing throughput. The model focused on charger capacities ranging from 50 to 250 kW and analyzed the different capacities’ effects on charging times and the number of vehicles served. The results indicate that a charger capacity of 125 kW is optimal, striking a balance between the charging time and the number of EVs served per hour, thus achieving the highest station utilization rate. This capacity allows for servicing a significant number of EVs with moderate increases in charging times. Lower capacities, although capable of serving more vehicles, lead to longer charging times and decreased throughput efficiency. The study underscores the effectiveness of combining queuing theory with flexible, modular charging systems that can dynamically adjust to EV charging demands.

Kumar, Praveen↗

The Space Station Freedom Reliability and Maintainability Assessment Tool

The Reliability and Maintainability Assessment Tool is a stochastic, event-oriented simulation model that has been developed to analyze the functional reliability, availability, and maintainability characteristics of the Space Station Freedom. This tool simulates failures and performs corrective and preventive maintenance tasks, utilizing user-specified maintenance resources, including crewmembers and/or robotics, and accommodates the growth of the station. The model dynamically interfaces with minimal cut sets derived from reliability block diagrams to assess functional status and to determine queuing priorities.

Blumentritt, Will↗

Analyzing and Comparing Biomass Feedstock Supply Systems in China: Corn Stover and Sweet Sorghum Case Studies

This paper analyzes the rural Chinese biomass supply system and models supply chain operations according to U.S. concepts of logistical unit operations: harvest and collection, storage, transportation, preprocessing, and handling and queuing. In this paper, we quantify the logistics cost of corn stover and sweet sorghum in China under different scenarios. We analyze three scenarios of corn stover logistics from northeast China and three scenarios of sweet sorghum stalks logistics from Inner Mongolia in China. The case study estimates that the logistics cost of corn stover and sweet sorghum stalk to be $52.95/dry metric ton and $52.64/dry metric ton, respectively, for the current labor-based biomass logistics system. However, if the feedstock logistics operation is mechanized, the cost of corn stover and sweet sorghum stalk decreases to $36.01/dry metric ton and $35.76/dry metric ton, respectively. The study also includes a sensitivity analysis to identify the cost factors that cause logistics cost variation. Results of the sensitivity analysis show that labor price has the most influence on the logistics cost of corn stover and sweet sorghum stalk, with a variation of $6 to $12/dry metric ton.

09 BIOMASS FUELS↗

GPS Monitoring of Surface Change During and Following the Fortuitous Occurrence of the M(sub w) = 7.3 Landers Earthquake in our Network

Accomplishments: (1) Continues GPS monitoring of surface change during and following the fortuitous occurrence of the M(sub w) = 7.3 Landers earthquake in our network, in order to characterize earthquake dynamics and accelerated activity of related faults as far as 100's of kilometers along strike. (2) Integrates the geodetic constraints into consistent kinematic descriptions of the deformation field that can in turn be used to characterize the processes that drive geodynamics, including seismic cycle dynamics. In 1991, we installed and occupied a high precision GPS geodetic network to measure transform-related deformation that is partitioned from the Pacific - North America plate boundary northeastward through the Mojave Desert, via the Eastern California shear zone to the Walker Lane. The onset of the M(sub w) = 7.3 June 28, 1992, Landers, California, earthquake sequence within this network poses unique opportunities for continued monitoring of regional surface deformation related to the culmination of a major seismic cycle, characterization of the dynamic behavior of continental lithosphere during the seismic sequence, and post-seismic transient deformation. During the last year, we have reprocessed all three previous epochs for which JPL fiducial free point positioning products available and are queued for the remaining needed products, completed two field campaigns monitoring approx. 20 sites (October 1995 and September 1996), begun modeling by development of a finite element mesh based on network station locations, and developed manuscripts dealing with both the Landers-related transient deformation at the latitude of Lone Pine and the velocity field of the whole experiment. We are currently deploying a 1997 observation campaign (June 1997). We use GPS geodetic studies to characterize deformation in the Mojave Desert region and related structural domains to the north, and geophysical modeling of lithospheric behavior. The modeling is constrained by our existing and continued GPS measurements, which will provide much needed data on far-field strain accumulation across the region and on the deformational response of continental lithosphere during and following a large earthquake, forming the basis for kinematic and dynamic modeling of secular and seismic-cycle deformation. GPS geodesy affords both regional coverage and high precision that uniquely bear on these problems.

Miller, M. Meghan↗

A modeling framework for designing and evaluating curbside traffic management policies at Dallas-Fort Worth International Airport

Emerging mobility technologies are changing the transportation system landscape. This is especially evident at airports, such as the Dallas-Fort Worth International Airport (DFW). Without careful analysis, these changes could lead to inefficient and costly airport operations. This paper presents a modeling framework that integrates travel mode encoding, demand projection, and microsimulation to enable airports to develop, simulate, and evaluate curbside traffic managements policies and measure their impact. Here, the framework is utilized to analyze several traffic scenarios and policies for DFW: a baseline scenario which represents DFW traffic pattern as observed in 2018 and projected to 2045, a transit network company (TNC) electrification policy, a TNC queuing policy, a policy that increased transit ridership, a bus-only policy which considers the use of only buses inside DFW, an autonomous vehicle (AV) policy which investigates the impact of autonomous vehicle (AV) adoption on airport operations, and an example COVID-19 scenario which models the impact of the COVID19 pandemic. The simulations’ results demonstrate that: increasing the DFW transit ridership postpones the need for airport curbside expansion the most; encouraging shared-mobility with the bus-only policy produces the most savings in curbside congestion delays; automation and electrification for all passenger vehicle trips to/from DFW generates the most saving in fuel consumption and emissions; and uncontrolled AV adoption incurs the highest increase in fuel consumption, delay, and emissions and could require immediate airport capacity extension. Without policy intervention or investment in additional infrastructure capacity, these results predict the current operations would face significant congestion on high demand days starting as early as 2028. While derived in close partnership with DFW, the methodology presented here can be generalized to any airport.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

HPC-EPIC for High Resolution Simulations of Environmental and Sustainability Assessment

Multiple concerns over the impact of wide scale changes in land management have motivated comprehensive analyses of environmental sustainability of food and biofuel production. These call for high-resolution land management tools that enable comprehensive analyses of natural resources for decision-making. The agroecosystem simulation models with the most biophysical detail are point models, which often have a user interface that allows users to provide inputs and examine results for agricultural field scale analyses. These are not able to meet the needs of high-resolution regional or national simulations. We describe an efficient computational approach for deployment of the Environmental Policy Integrated Climate (EPIC) model at high-resolution spatial scales using high performance computing (HPC) techniques. We developed an integrated procedure for executing the millions of simulations required for high-resolution, regional studies, and also address building databases for model initialization, model forcing data, and model outputs. We first ported EPIC from Windows to an HPC platform and validated output from both platforms. We then developed methods of packaging simulations for efficient, unattended parallel execution on the HPC cluster. The job queuing system, Portable Batch System (PBS) is employed to control job submission. Simulation outputs are extracted to PostgreSQL database for analysis. In a case study covering four counties in central Wisconsin using HPC-EPIC, we finished over 140 K simulations in a total of 10 h on an HPC cluster using 20 nodes. This is a speedup of 40 times. More nodes could be used to achieve larger speedups. The HPC-EPIC model developed in this study is anticipated to provide information useful for high-resolution land use management and decision making. The framework for high-performance computing can be extended to other traditional, point-based biophysical simulation models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗

National Ignition Facility and Managing Location, Component, and State

The National Ignition Facility (NIF) at the Lawrence Livermore National Laboratory is a stadium-sized facility that contains a 192-beam, 1.8-Megajoule, 500-Terawatt, ultraviolet laser system coupled with a 10-meter diameter target chamber. There are over 6,200 Line Replaceable Units (LRUs) comprised of more than 104,000 serialized parts that make up the NIF. Each LRU is a modular unit typically composed of a mechanical housing, laser optics (glass, lenses, or mirrors), and utilities. To date, there are more than 120,000 data sets created to characterize the attributes of these parts. Greater than 51,000 Work Permits have been issued to install, maintain, and troubleshoot the components. One integrated system is used to manage these data, and more. The Location Component and State (LoCoS) system is a web application built using Java Enterprise Edition technologies and is accessed by over 1,200 users. It is either directly or indirectly involved with each aspect of NIF work activity, and interfaces with ten external systems including the Integrated Computer Control System (ICCS) and the Laser Performance Operations Model (LPOM). Besides providing business functionality, LoCoS also acts as the NIF enterprise service bus. In this role, numerous integration approaches had to be adopted including: file exchange, database sharing, queuing, and web services in order to accommodate various business, technical, and security requirements. Architecture and implementation decisions are discussed.

42 ENGINEERING↗