Search

The frequency, nature, and scope of Soft Error Events (SEEs) is becoming an increasingly significant reliability concern as transistors continuously scale down into ever smaller nanometer memory chip geometries. As part of the on-going research efforts required to address this steadily developing situation, two significant research questions were addressed by the research work presented within this paper. The first research question addressed the possibility of crafting a novel methodology whose application would consistently lead to the creation of viable Monte Carlo SEE Simulators. Each of these Monte Carlo SEE Simulators would need to be capable of adequately profiling SEEs as well as simulating and modeling their impacts on the reliability of a variety of simulated 45-nm SRAM computer memories. The Standard 2-Parameter Weibull Soft Error Event (S2P-WSE) Simulator proposed within this paper as a direct application of this novel methodology successfully produced simulation results that were comparatively equivalent both directly and statistically to the results calculated by the empirically validated Weibull Row-Clustered Soft Error Reliability (WRCSER) model. This WRCSER Model was independently developed and empirically validated against proprietary reliability datasets obtained from testing a CISCO 45-nm SRAM computer memory device in a laboratory setting. The S2P-WSE Simulator itself was validated by means of a Kruskal–Wallis ANOVA test and by direct comparison of both the model and the simulator as a function of their respective failure probability and reliability results on 45-nm SRAM simulated computer memory devices subjected to the same SEE impacts over the course of an entire simulation run. The second research question sought to determine the significance of SEE topography versus a Row-Depth-Only bit error severity assumption on the reliability of simulated 45-nm SRAM computer memories shielded from the accumulating impacts of SEEs by variable error-correction codes, row-depth interleaving distances, and periodic scrubbing time intervals. The simulation runs for both the S2P-WSE Simulator and the T2P-WSE Simulator were carefully setup to ensure that only the potentially divergent factor between the results generated by the two simulators was the T2P-WSE Simulator's stochastically estimated topographical shape for each SEE impacting the simulated computer memory device. The work within this paper successfully demonstrated through direct plots of the two simulators’ failure probability and reliability results and the results of the Kruskal–Wallis ANOVA tests that the topography of SEEs does represent a significant impact on the overall failure probability and reliability of 45-nm SRAM computer memory devices. [ABSTRACT FROM PUBLISHER]

Microwave component design by electromagnetic structure synthesis is attractive because the electromagnetic field has the inherent property to minimize loss, sensitivity to tolerances, and vulnerability to field breakdown. However, it is conceptually and computationally challenging, and its technical possibilities have thus been explored only tentatively so far. This paper introduces a first, but critical new step towards systematic electromagnetic structure synthesis, based on computational time reversal, and employing the time and space discrete transmission line matrix (TLM) method. The novelty of this paper resides in the exploitation of the scattering nature of the TLM model, which allows the near-field of a source or a scatterer to propagate into the far-field and back. By ignoring the conventional restriction that spatial wavelengths must always be much larger than the space discretization step, one can reconstruct multiple impulsive sources with the spatial and temporal resolution of the TLM algorithm. This crucial insight promises to be the key to a successful synthesis strategy. This paper describes the reconstruction of electromagnetic sources through computational time reversal, demonstrates the self-consistency of this procedure by means of a validation example, and outlines the next steps towards a full electromagnetic synthesis capability. [ABSTRACT FROM PUBLISHER]

Simulation has become an indispensable tool in the design and evaluation of mobile systems. By using mobility models that describe constituent movement, one can explore large systems, producing repeatable results for comparison between alternatives. In this paper, we show that a large class of mobility models—including all those in which nodal speed and distance or destination are chosen independently—have a transient period in which the average node speed decreases until converging to some long-term average. This speed decay provides an unsound basis for simulation studies that collect results averaged over time, complicating the experimental process. In this paper, we derive a general framework for describing this decay and apply it to a number of cases. Furthermore, this framework allows us to transform a given mobility model into a stationary one by initializing the simulation using the steady-state speed distribution and using the original speed distribution subsequently. This transformation completely eliminates the transient period and the decay in average node speed and, thus, provides sound models for the simulation of mobile systems. [ABSTRACT FROM AUTHOR]

Ethernet passive optical networks (EPONs) have emerged as the one of the most promising candidates for next-generation access networks. These new architectures couple low-cost optics with advanced edge electronics to offer vastly improved scalability over competing digital subscriber line and cable modem offerings. This paper proposes several novel architectural enhancements for EPON, which will help increase the viability of optical access over a broader range of subscriber access scenarios. Specifically, this paper proposes a two-stage EPON architecture that allows more end-users to share an optical line terminal link, and enables longer access reach/distances (beyond the usual 25 km distance). In addition, a new dynamic bandwidth allocation (DBA) algorithm is proposed to effectively allocate bandwidths between end users. This DBA algorithm can support differentiated services in a network with heterogeneous traffic. We conduct detailed simulation experiments to study the performance and validate the effectiveness of the proposed architecture and algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the air traffic operations and management simulator (ATOMS), which is an air traffic and airspace modeling and simulation system for the analysis of free-flight concepts. This paper describes the design, architecture, functionality, and applications of the ATOMS. It is an intent-based simulator that discretizes the airspace in equal-sized hyper-rectangular cells to maintain intent reference points. It can simulate end-to-end airspace operations and air navigation procedures for conventional air traffic, as well as for free flight. Atmospheric and wind data that are modeled in the ATOMS result in accurate trajectory predictions. The ATOMS uses a multiagent-based modeling paradigm for modular design and easy integration of various air traffic subsystems. A variety of advanced air traffic management (ATM) concepts that are envisioned in free flight are prototyped in the ATOMS, including airborne separation assurance (ASA), cockpit display of traffic information (CDTI), weather avoidance, and decision support systems (DSSs). Experimental results indicate that advanced ATM concepts make a sound case for free flight; however, there is a need to investigate and understand their complex interaction under nonnominal scenarios. [ABSTRACT FROM PUBLISHER]

In this paper, we present a new analytical model that captures link dependencies in all-optical wavelength-division multiplexing (WDM) networks under uniform traffic and enables the estimation of connection-blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them, and their carried traffic. Our validation tests have shown that the analytical dependency model gives accurate results and successfully captures the main dependency characteristics observed in the simulation measurements. The usefulness of the model is illustrated by showing how to use it in enhancing a simulation-based algorithm that we recently proposed for the sparse placement of full wavelength converters in WDM networks. To analytically handle the presence of wavelength converters, a lightpath containing converters is divided into smaller subpaths, such that each subpath is a wavelength-continuous path, and the nodes shared between these subpaths are full wavelength-conversion-capable. The blocking probability of the entire path is obtained by computing the probabilities in the individual subpaths. We validate the analytically-based sparse placement algorithm by comparing it with its simulation-based counterpart using a number of network topologies. [ABSTRACT FROM AUTHOR]

This paper presents physics-based compact models for the C-V and I-V characteristics of AlGaN/GaN HEMT devices. The contribution of only the first energy level in the triangular quantum well at the AlGaN/GaN interface (where most of the charge carriers of the 2-DEG channel reside) is considered, which resulted in an accurate and simple unified charge control model. Based on this, analytical models of the drain current, the gate charge, and the gate capacitances have been developed. The models cover all the different operating regimes of a device. The excellent agreements between the model and measured C-V and I-V characteristics of devices with different gate lengths have demonstrated the validity of the model. [ABSTRACT FROM PUBLISHER]

We discuss a wavelength-division-multiplexed-based passive-optical-network (PON) architecture that allows for incremental upgrade from single-channel time-division multiple-access PONs in order to provide higher bandwidth in the access network. Various dynamic-wavelength and bandwidth-allocation algorithms (DWBAs) for wave-division multiplexed PON are presented; they exploit both interchannel and intrachannel statistical multiplexing in order to achieve better performance, especially when the load on various channels is not symmetric. Three variants of the DWBA are presented, and their performance is compared. While the first variant incurs larger idle times (and, hence, poor performance), the other two algorithms achieve better but different performance with critical dissimilarities. Our analysis also focuses on the fair assignment of excessive bandwidth in the upstream direction to highly loaded optical network units. We compare the performance of DWBA to another algorithm that relies on static-channel allocation. Furthermore, a study is presented wherein the number of wavelengths increases, and a comparison with interleaved polling with adaptive cycle time is shown. We use extensive simulations throughout this paper [ABSTRACT FROM PUBLISHER]

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of $O(\mathrm{lg}\; V \;\mathrm{lg} t)$ O (lg V lg t) parallel steps and $O(V\; \mathrm{lg}\; V)$ O (V lg V) work for data with $V$ V samples and $t$ t contour tree supernodes, and implementations with more than $30\times$ 30 × parallel speed up on both CPU using TBB and GPU using Thrust and up $70\times$ 70 × speed up compared to the serial sweep and merge algorithm. [ABSTRACT FROM AUTHOR]

Large-scale simulation codes typically execute for extended periods of time and often on distributed computational resources. Because these simulations can run for hours, or even days, scientists like to get feedback about the state of the computation and the validity of its results as it runs. It is also important that these capabilities be made available with little impact on the performance and stability of the simulation. Visualizing and exploring data in the early stages of the simulation can help scientists identify problems early, potentially avoiding a situation where a simulation runs for several days, only to discover that an error with an input parameter caused both time and resources to be wasted. We describe an application that aids in the monitoring and analysis of a simulation of the human arterial tree. The application provides researchers with high-level feedback about the state of the ongoing simulation and enables them to investigate particular areas of interest in greater detail. The application also offers monitoring information about the amount of data produced and data transfer performance among the various components of the application. [ABSTRACT FROM AUTHOR]

This work presents the simulator of intelligent transportation systems (SITS). The SITS is based on a microscopic simulation approach to reproduce real traffic conditions in an urban or nonurban network and considers different types of vehicles, drivers, and roads. A dynamical analysis of several traffic phenomena is then addressed. The results of using classical system theory tools notes that it is possible to study traffic systems, taking advantage of the knowledge gathered with automatic control algorithms. In this line of thought, a new modeling formalism based on the embedding of statistics and Fourier transform is also presented. [ABSTRACT FROM PUBLISHER]