Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David M. R. Lawson

dblp:134/0990 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 44% Hardware reliability and fault tolerance · 44% Distributed systems · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
error recovery
0.312017
Hierarchical Strategies for Efficient Fault Recovery on the Reconfigurable PAnDA Device · IEEE Trans. Computers 2017
Reconfigurable computing and FPGAs › FPGA reliability
FPGA fault tolerance
0.312017
Hierarchical Strategies for Efficient Fault Recovery on the Reconfigurable PAnDA Device · IEEE Trans. Computers 2017
Distributed systems
fault tolerance
0.112017
Hierarchical Strategies for Efficient Fault Recovery on the Reconfigurable PAnDA Device · IEEE Trans. Computers 2017

Methods — techniques the papers use, named apart from their topics

stochastic repair strategy · 0.3deterministic repair strategy · 0.3
YearPublicationVenuePosition
2017 Hierarchical Strategies for Efficient Fault Recovery on the Reconfigurable PAnDA Device
abstract
A novel hierarchical fault-tolerance methodology for reconfigurable devices is presented. A bespoke multi-reconfigurable FPGA architecture, the programmable analogue and digital array (PAnDA), is introduced allowing fine-grained reconfiguration beyond any other FPGA architecture currently in existence. Fault blind circuit repair strategies, which require no specific information of the nature or location of faults, are developed, exploiting architectural features of PAnDA. Two fault recovery techniques, stochastic and deterministic strategies, are proposed and results of each, as well as a comparison of the two, are presented. Both approaches are based on creating algorithms performing fine-grained hierarchical partial reconfiguration on faulty circuits in order to repair them. While the stochastic approach provides insights into feasibility of the method, the deterministic approach aims to generate optimal repair strategies for generic faults induced into a specific circuit. It is shown that both techniques successfully repair the benchmark circuits used after random faults are induced in random circuit locations, and the deterministic strategies are shown to operate efficiently and effectively after optimisation for a specific use case. The methods are shown to be generally applicable to any circuit on PAnDA, and to be straightforwardly customisable for any FPGA fabric providing some regularity and symmetry in its structure.
Martin Trefzer, David M. R. Lawson, Simon J. Bale, James Alfred Walker, Andrew M. Tyrrell
IEEE Trans. Computers2
2013 Overcoming faults using evolution on the PAnDA architecture
abstract
This paper explores the potential for transistor level fault tolerance on a new Programmable Analogue and Digital Array (PAnDA) architecture1. In particular, this architecture features Combinatorial Configurable Analogue Blocks (CCABs) that can implement a number of combinatorial functions similar to FPGAs. In addition, PAnDA allows one to reconfigure features of the underlying analogue layer. In PAnDA-EINS, the functions that the CCAB can implement are predefined through the use of a routing block. This paper is a study of whether removing this routing block and allowing direct control of the transistors provides benefits for fault tolerance. Experiments are conducted in two stages. In the first stage, a logic function is evolved on a CCAB and then optimised using a GA. A fault is then injected into the substrate, breaking the logic function. The second stage of the experiment consists of evolving the logic function again on the faulty substrate. The results of these experiments show that the removal of the routing block from the CCAB is beneficial for fault tolerance.
Pedro B. Campos, David M. R. Lawson, Simon J. Bale, James Alfred Walker, Martin Trefzer, Andrew M. Tyrrell
IEEE Congress on Evolutionary Computation2