45,079 research outputs found
Finding the Important Factors in Large Discrete-Event Simulation: Sequential Bifurcation and its Applications
This contribution discusses experiments with many factors: the case study includes a simulation model with 92 factors.The experiments are guided by sequential bifurcation.This method is most efficient and effective if the true input/output behavior of the simulation model can be approximated through a first-order polynomial possibly augmented with two-factor interactions.The method is explained and illustrated through three related discrete-event simulation models.These models represent three supply chain configurations, studied for an Ericsson factory in Sweden.After simulating 21 scenarios (factor combinations) each replicated five times to account for noise a shortlist with the 11 most important factors is identified for the biggest of the three simulation models.simulation;bifurcation;supply;Sweden
Using an FPGA for Fast Bit Accurate SoC Simulation
In this paper we describe a sequential simulation method to simulate large parallel homo- and heterogeneous systems on a single FPGA. The method is applicable for parallel systems were lengthy cycle and bit accurate simulations are required. It is particularly designed for systems that do not fit completely on the simulation platform (i.e. FPGA). As a case study, we use a Network-on-Chip (NoC) that is simulated in SystemC and on the described FPGA simulator. This enables us to observe the NoC behavior under a large variety of traffic patterns. Compared with the SystemC simulation we achieved a factor 80-300 of speed improvement, without compromising the cycle and bit level accuracy
Impact Assessment of Hypothesized Cyberattacks on Interconnected Bulk Power Systems
The first-ever Ukraine cyberattack on power grid has proven its devastation
by hacking into their critical cyber assets. With administrative privileges
accessing substation networks/local control centers, one intelligent way of
coordinated cyberattacks is to execute a series of disruptive switching
executions on multiple substations using compromised supervisory control and
data acquisition (SCADA) systems. These actions can cause significant impacts
to an interconnected power grid. Unlike the previous power blackouts, such
high-impact initiating events can aggravate operating conditions, initiating
instability that may lead to system-wide cascading failure. A systemic
evaluation of "nightmare" scenarios is highly desirable for asset owners to
manage and prioritize the maintenance and investment in protecting their
cyberinfrastructure. This survey paper is a conceptual expansion of real-time
monitoring, anomaly detection, impact analyses, and mitigation (RAIM) framework
that emphasizes on the resulting impacts, both on steady-state and dynamic
aspects of power system stability. Hypothetically, we associate the
combinatorial analyses of steady state on substations/components outages and
dynamics of the sequential switching orders as part of the permutation. The
expanded framework includes (1) critical/noncritical combination verification,
(2) cascade confirmation, and (3) combination re-evaluation. This paper ends
with a discussion of the open issues for metrics and future design pertaining
the impact quantification of cyber-related contingencies
A Sequential Two-Step Algorithm for Fast Generation of Vehicle Racing Trajectories
The problem of maneuvering a vehicle through a race course in minimum time
requires computation of both longitudinal (brake and throttle) and lateral
(steering wheel) control inputs. Unfortunately, solving the resulting nonlinear
optimal control problem is typically computationally expensive and infeasible
for real-time trajectory planning. This paper presents an iterative algorithm
that divides the path generation task into two sequential subproblems that are
significantly easier to solve. Given an initial path through the race track,
the algorithm runs a forward-backward integration scheme to determine the
minimum-time longitudinal speed profile, subject to tire friction constraints.
With this fixed speed profile, the algorithm updates the vehicle's path by
solving a convex optimization problem that minimizes the resulting path
curvature while staying within track boundaries and obeying affine,
time-varying vehicle dynamics constraints. This two-step process is repeated
iteratively until the predicted lap time no longer improves. While providing no
guarantees of convergence or a globally optimal solution, the approach performs
very well when validated on the Thunderhill Raceway course in Willows, CA. The
predicted lap time converges after four to five iterations, with each iteration
over the full 4.5 km race course requiring only thirty seconds of computation
time on a laptop computer. The resulting trajectory is experimentally driven at
the race circuit with an autonomous Audi TTS test vehicle, and the resulting
lap time and racing line is comparable to both a nonlinear gradient descent
solution and a trajectory recorded from a professional racecar driver. The
experimental results indicate that the proposed method is a viable option for
online trajectory planning in the near future
Fast, Accurate and Detailed NoC Simulations
Network-on-Chip (NoC) architectures have a wide variety of parameters that can be adapted to the designer's requirements. Fast exploration of this parameter space is only possible at a high-level and several methods have been proposed. Cycle and bit accurate simulation is necessary when the actual router's RTL description needs to be evaluated and verified. However, extensive simulation of the NoC architecture with cycle and bit accuracy is prohibitively time consuming. In this paper we describe a simulation method to simulate large parallel homogeneous and heterogeneous network-on-chips on a single FPGA. The method is especially suitable for parallel systems where lengthy cycle and bit accurate simulations are required. As a case study, we use a NoC that was modelled and simulated in SystemC. We simulate the same NoC on the described FPGA simulator. This enables us to observe the NoC behavior under a large variety of traffic patterns. Compared with the SystemC simulation we achieved a speed-up of 80-300, without compromising the cycle and bit level accuracy
- …