Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

TAAS
2008

favoriteEmaildiscussreport

70views more TAAS 2008»

A general characterization of indulgence

13 years 11 months ago

A general characterization of indulgence

Download groups.csail.mit.edu

characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms. Categories and Subject Descriptors: C.2.1 [Computer-Communication Networks]: Network Architecture and Design--Distributed networks; C.2.4 [Computer-Communication Networks]: Distributed Systems; D.4.1 [Operating Systems]: Process Management--Concurrency, Multipro

Rachid Guerraoui, Nancy A. Lynch

Real-time Traffic

Abstract Computing Model | Characterization | Computer-Communication Networks | TAAS 2008 |

claim paper

Related Content

» Timeliness failuredetectors and consensus performance

» A complex generalized Gaussian distribution characterization generation and estimation

» A General Framework for Probabilistic Characterizing Formulae

» Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs

» Generalized ERSS tree model Revisiting working sets

» A characterization of collective conflict for defeasible argumentation

» A General Label Search to investigate classical graph search algorithms

» Octal Bent Generalized Boolean Functions

» The generalized road coloring problem and periodic digraphs

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TAAS
Authors	Rachid Guerraoui, Nancy A. Lynch

Comments (0)