08371 Abstracts Collection – Fault-Tolerant Distributed Algorithms on VLSI Chips

Authors Bernadette Charron-Bost, Shlomi Dolev, Jo Ebergen, Ulrich Schmid



PDF
Thumbnail PDF

File

DagSemProc.08371.1.pdf
  • Filesize: 161 kB
  • 10 pages

Document Identifiers

Author Details

Bernadette Charron-Bost
Shlomi Dolev
Jo Ebergen
Ulrich Schmid

Cite AsGet BibTex

Bernadette Charron-Bost, Shlomi Dolev, Jo Ebergen, and Ulrich Schmid. 08371 Abstracts Collection – Fault-Tolerant Distributed Algorithms on VLSI Chips. In Fault-Tolerant Distributed Algorithms on VLSI Chips. Dagstuhl Seminar Proceedings, Volume 8371, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.08371.1

Abstract

From September the $7^{\text{th}}$, 2008 to September the $10^{\text{th}}$, 2008 the Dagstuhl Seminar 08371 ``Fault-Tolerant Distributed Algorithms on VLSI Chips '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. The seminar was devoted to exploring whether the wealth of existing fault-tolerant distributed algorithms research can be utilized for meeting the challenges of future-generation VLSI chips. During the seminar, several participants from both the VLSI and distributed algorithms' discipline, presented their current research, and ongoing work and possibilities for collaboration were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Keywords
  • Fault-tolerant distributed algorithms
  • fault tolerance
  • VLSI systems-on-chip
  • synchronous vs.\ asynchronous circuits
  • digital logic
  • specifications

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail