A Cost-Effective FPGA-based Fault Simulation Environment

2011 ◽  
Author(s):  
Angelika Janning ◽  
Johann Heyszl ◽  
Frederic Stumpf ◽  
Georg Sigl
Keyword(s):  
Fault Simulation ◽  
Cost Effective ◽  
Simulation Environment

scholarly journals A Hardware Accelerator for Fault Simulation Utilizing a Reconfigurable Array Architecture

VLSI Design ◽  
1996 ◽  
Vol 4 (2) ◽  
pp. 119-133 ◽  
Author(s):  
Sungho Kang ◽  
Youngmin Hur ◽  
Stephen A. Szygenda
Keyword(s):  
High Speed ◽  
High Performance ◽  
Fault Simulation ◽  
Cost Effective ◽  
Hardware Accelerator ◽  
Software Simulation ◽  
Simulation Speed ◽  
Array Architecture ◽  
Reconfigurable Array ◽  
Speed Advantage

In order to reduce cost and to achieve high speed a new hardware accelerator for fault simulation has been designed. The architecture of the new accelerator is based on a reconfigurabl mesh type processing element (PE) array. Circuit elements at the same topological level are simulated concurrently, as in a pipelined process. A new parallel simulation algorithm expands all of the gates to two input gates in order to limit the number of faults to two at each gate, so that the faults can be distributed uniformly throughout the PE array. The PE array reconfiguration operation provides a simulation speed advantage by maximizing the use of each PE cell.This new approach provides for a high performance, cost effective, gain over software simulation. Simulation results show that the hardware accelerator is orders of magnitude faster than the software simulation program.

scholarly journals Flight-schedule using Dijkstra's algorithm with comparison of routes findings

2022 ◽  
Vol 12 (2) ◽  
pp. 1675
Author(s):  
Israa Ezzat Salem ◽  
Maad M. Mijwil ◽  
Alaa Wagih Abdulqader ◽  
Marwa M. Ismaeel
Keyword(s):  
Lower Cost ◽  
Cost Effective ◽  
Complex Problem ◽  
Search Algorithms ◽  
Destination Node ◽  
Simulation Environment ◽  
Dijkstra Algorithm ◽  
Large Cities ◽  
Shortest Route ◽  
Route Algorithm

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

Sign in / Sign up

Export Citation Format

Share Document