[ main ] [ back ]

15/2009 : How to Speed-up Fault-tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining

RR Number
15/2009
Comment
(Appeares as Brief Announcement at PODC'09)
Author(s)
Andreas Dielacher, Matthias Fuegger, Ulrich Schmid
Abstract
In this paper, we demonstrate that pipelining is a viable approach for speeding up the distributed fault-tolerant DARTS clock generation approach introduced in (F\"ugger, Schmid, Fuchs, Kempf, EDCC'06), where a distributed Byzantine fault-tolerant tick generation algorithm has been used to replace the traditional quartz oscillator and highly balanced clock tree in VLSI Systems-on-Chip (SoCs). We provide a pipelined version of the original DARTS algorithm, termed pDARTS, together with a novel modeling and analysis framework for hardware-implemented asynchronous fault-tolerant distributed algorithms, which is employed for rigorously analyzing its correctness & performance. Our results, which have also been confirmed by an experimental evaluation of an FPGA prototype implementation, reveal that pipelining indeed allows to entirely remove the adverse effect of large interconnect delays on the achievable clock frequency, and demonstrate again that methods and results from distributed algorithms research can successfully be applied in the VLSI context.
Bibtex
@techreport{DFS09:pDARTS,
  author =       "Andreas Dielacher and Matthias Fuegger and Ulrich Schmid",
  title =        "Exploiting Inherent Pipelining in Asynchronous Distributed Algorithms: How to Speed-up Fault-tolerant Clock Generation in VLSI Systems-on-Chip",
  institution =  "Technische Universit{\"a}t Wien, Institut f{\"u}r Technische Informatik",
  address =      "Treitlstr. 1-3/182-1, 1040 Vienna, Austria",
  type =         "Research Report",
  year =         "2009",
  number =       "15/2009"
}
Download
Get paper.pdf - Adobe PDF-format, (415.9238 KB; posted at July 09 2013; )

[ main ] [ back ]