Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Randomized Algorithms: A System-Level, Poly-Time Analysis
 

Summary: Randomized Algorithms:
A System-Level, Poly-Time Analysis
of Robust Computation
Cesare Alippi, Senior Member, IEEE
Abstract–This paper provides a methodology for analyzing the performance degradation of a computation once affected by
perturbations. The suggested methodology, by relaxing all assumptions made in the related literature, provides design guidelines for
the subsequent implementation of complex computations in physical devices. Implementation issues, such as finite precision
representation, fluctuations of the production parameters, and aging effects, can be studied directly at system level, independently
from any technological aspect and quantization technique. Only the behavioral description of the computational flow, which is assumed
to be Lebesgue measurable and the architecture to be investigated are needed. The suggested analysis is based on the recent theory
of Randomized Algorithms, which transforms the computationally intractable problem of robustness investigation in a poly-time
algorithm by resorting to probability.
Index Terms–Embedded system design, finite precision error analysis, randomized algorithms, sensitivity analysis, system level
design.
ś
1 INTRODUCTION
WE say that an application is robust when the impact of
bounded perturbations on the associated computa-
tion provides a graceful degradation in performance with
respect to a given figure of merit [1], [2], [3], [4], [5]. Testing

  

Source: Alippi, Cesare - Dipartimento di Elettronica e Informazione, Politecnico di Milano

 

Collections: Computer Technologies and Information Sciences