Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > B. Hardware  > B.8 PERFORMANCE AND RELIABILITY > B.8.1 Reliability, Testing, and Fault-Tolerance
ITHEA Classification Structure > I. Computing Methodologies  > I.2 ARTIFICIAL INTELLIGENCE  > I.2.8 Problem Solving, Control Methods, and Search 
TWO-LEVEL GENETIC ALGORITHM FOR PROGRAMMABLE LOGIC DEVICES RECONFIGURATION
By: Aleksey Gorodilov (3408 reads)
Rating: (1.00/10)

Abstract: The article considers the problem of programmable logic device reconfiguration after a failure of logic elements. The task is relevant to areas such as space exploration and important industrial facilities management that use highly reliable fault-tolerant systems. The article considers the failures of logic elements in the configurable logic blocks. For optimal reconfiguration logic modules must be placed on a programmable logic device without using faulty logic elements, while minimizing occupied area, the bond lengths and delays. The first step in solving the problem is to choose compactly located logic elements that will be involved in the implementation of the circuit. Compactness is understood as the minimum amount of information necessary to describe the set of logic elements. This task can not be solved exactly and effectively, but can be approximately solved by using various heuristics, including genetic algorithms. This article describes several well-known approaches to the problem and offers an original two-level coding method for constructing a genetic algorithm that takes into account features of the problem and uses standard genetic operators. The proposed algorithm is implemented in practice in the form of a computer program to compare its performance with some other algorithms. Comparison of different heuristic algorithms in terms of accuracy of the solution and estimated speed of the proposed algorithm are given. One can say that the proposed genetic algorithm works on average longer than other heuristic algorithms, but finds a more accurate solution. This leads to a reduction of reconfiguration time and, thereby, increase availability ratio of the programmable logic device.

Keywords: programmable logic devices, reconfiguration, reliability, genetic algorithm.

ACM Classification Keywords: I.2 Artificial Intelligence: I.2.8 Problem Solving, Control Methods, and Search - Heuristic methods, B.8 Performance and Reliability: B.8.1 Reliability, Testing, and Fault-Tolerance?

Link:

ДВУХУРОВНЕВЫЙ ГЕНЕТИЧЕСКИЙ АЛГОРИТМ РЕКОНФИГУРАЦИИ ПРОГРАММИРУЕМЫХ ЛОГИЧЕСКИХ ИНТЕГРАЛЬНЫХ СХЕМ (Two-level genetic algorithm for programmable logic devices reconfiguration)

Алексей Городилов

http://www.foibg.com/ijitk/ijitk-vol08/ijitk08-02-p05.pdf

Print
B.8.1 Reliability, Testing, and Fault-Tolerance
article: TWO-LEVEL GENETIC ALGORITHM FOR PROGRAMMABLE LOGIC DEVICES RECONFIGURATION · RESEARCH OF ACCURACY OF GUARANTEED OPERAYTING TIME PREDICTION BY FRACTILE ... · IMAGE SENSORS IN SECURITY AND MEDICAL APPLICATIONS ... · THE INFORMATION-ANALYTICAL SYSTEM FOR DIAGNOSTICS ... · PARAMETRIC IDENTIFICATION AND DIAGNOSIS OF INTEGRATED ... ·
I.2.8 Problem Solving, Control Methods, and Search
article: DEVELOPMENT AND ANALYSIS OF GENETIC ALGORITHM FOR TIME SERIES FORECASTING ... · TWO-LEVEL GENETIC ALGORITHM FOR PROGRAMMABLE LOGIC DEVICES RECONFIGURATION · ADAPTIVE FUZZY PROBABILISTIC CLUSTERING OF INCOMPLETE DATA · Criteria investigations in ant colony optimization algorithm for travelling ... · CRITERIA INVESTIGATIONS IN ANT COLONY OPTIMIZATION ALGORITHM FOR TRAVELLING SALE · АЛГОРИТМ ПОСТРОЕНИЯ ВЫПУКЛОГО ПРОДОЛЖЕНИЯ · ADAPTIVE CLUSTERING OF INCOMPLETE DATA USING NEURO-FUZZY KOHONEN NETWORK · THE EFFECT OF INTRODUCTION OF THE NON-LINEAR CALIBRATION FUNCTION AT THE ... · DECOMPOSITION METHODS FOR LARGE-SCALE TSP · INFORMATIONAL-PARAMETRIC MODEL OF SIGN LANGUAGE FINGERSPELLING UNITS · CONSTRUCTION OF A REALISTIC MOVEMENT ON THE 3D HUMAN MODEL FOR STUDYING AND ... · ПРОГНОЗИРОВАНИЕ ДИНАМИКИ ПОПОЛНЕНИЯ ФОНДО� · SELF-ORGANIZING ROUTING ALGORITHM FOR WIRELESS SENSORS NETWORKS (WSN) USING ... · COMPUTER TECHNOLOGY FOR SIGN LANGUAGE MODELLING · NEURAL NETWORK BASED OPTIMAL CONTROL WITH CONSTRAINTS · LOGICAL MODELS OF COMPOSITE DYNAMIC OBJECTS CONTROL · LIMIT BEHAVIOUR OF DYNAMIC RULE-BASED SYSTEMS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.09 secs ]   [ Memory usage: 7.55MB ]   [ GZIP Disabled ]   [ Server load: 0.38 ]
Powered by Tikiwiki CMS/Groupware