Author image not provided
 Bernadette Charron-Bost

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.81
Citation Count317
Publication count36
Publication years1989-2017
Available for download8
Average downloads per article327.13
Downloads (cumulative)2,617
Downloads (12 Months)136
Downloads (6 Weeks)10
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


36 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 36
Result page: 1 2

Sort by:

1
March 2017 Discrete Applied Mathematics: Volume 219 Issue C, March 2017
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides important information on complexity measures of such systems, and so is crucial in ...
Keywords: Cyclic scheduling, Link-reversal algorithms, Max-plus systems, Transience bounds, Network synchronizers

2
July 2015 ICALP 2015: Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous networks, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree. Interestingly, the class ...

3 published by ACM
January 2015 ACM Transactions on Algorithms (TALG): Volume 11 Issue 3, January 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 46,   Downloads (Overall): 273

Full text available: PDFPDF
Link reversal is a versatile algorithm design paradigm, originally proposed by Gafni and Bertsekas in 1981 for routing and subsequently applied to other problems including mutual exclusion, leader election, and resource allocation. Although these algorithms are well known, until now there have been only preliminary results on time complexity, even ...
Keywords: linear dynamical systems, link reversal, Routing, min-plus algebra, time complexity

4
August 2013 FORMATS'13: Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

A large variety of distributed systems, like some classical synchronizers, routers, or schedulers, have been shown to have a periodic behavior after an initial transient phase (Malka and Rajsbaum, WDAG 1991). In fact, each of these systems satisfies recurrence relations that turn out to be linear as soon as we ...

5
October 2011 SSS'11: Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Consensus is the paradigmatic problem in fault-tolerant distributed computing: it requires network nodes that communicate by message passing to agree on common value even in the presence of (benign or malicious) faults. Several algorithms for solving Consensus exist, but few of them have been rigorously verified, much less so formally. ...

6
June 2011 SIROCCO'11: Proceedings of the 18th international conference on Structural information and communication complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Link reversal is the basis of several well-known routing algorithms [1,2,3]. In these algorithms, logical directions are imposed on the communication links and a node that becomes a sink reverses some of its incident links to allow the (re)construction of paths to the destination. In the Full Reversal (FR) algorithm ...

7
June 2011 SIROCCO'11: Proceedings of the 18th international conference on Structural information and communication complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Link reversal is a versatile algorithm design paradigm, originally proposed by Gafni and Bertsekas in 1981 for routing, and subsequently applied to other problems includingmutual exclusion and resource allocation. Although these algorithms arewell-known, until nowthere have been only preliminary results on time complexity, even for the simplest link reversal scheme ...

8 published by ACM
June 2011 SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Downloads (Overall): 75

Full text available: PDFPDF
Although substantial analysis has been done on the Full Reversal (FR) routing algorithm since its introduction by Gafni and Bertsekas in 1981, a complete understanding of its functioning---especially its time complexity---has been missing until now. In this paper, we derive the first exact formula for the time complexity of FR: ...
Keywords: link reversal, min-plus algebra, routing, time complexity, linear dynamical systems

9
October 2010 Information Processing Letters: Volume 110 Issue 21, October, 2010
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 2

Dwork, Lynch, and Stockmeyer [3] and Lamport [4] showed that, in order to solve Consensus in a distributed system, it is sufficient that the system behaves well during a finite period of time. In sharp contrast, Chandra, Hadzilacos, and Toueg [6] proved that a failure detector that, from some time ...
Keywords: Asynchronous system, Consensus, Distributed computing, Failure detectors

10
December 2009 Algorithmic Aspects of Wireless Sensor Networks: 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009. Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A popular algorithm design technique for such systems is link reversal, first proposed by Gafni and Bertsekas [1] for routing, and subsequently employed in algorithms for, e.g., partition-tolerant ...

11
August 2009 RP '09: Proceedings of the 3rd International Workshop on Reachability Problems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

We consider the verification of algorithms expressed in the Heard-Of Model, a round-based computational model for fault-tolerant distributed computing. Rounds in this model are communication-closed, and we show that every execution recording individual events corresponds to a coarser-grained execution based on global rounds such that the local views of all ...

12 published by ACM
August 2009 SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 227

Full text available: PDFPDF
We analyze the correctness and the complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorithms transform an arbitrary directed acyclic input graph into an output graph with at least one route from each node to a special destination ...
Keywords: work complexity, link reversal, routing

13 published by ACM
August 2007 PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Downloads (Overall): 414

Full text available: PDFPDF
Consensus encalpsulates the inherent problems of building fault tolerant distributed systems. In this context, the classic model of Byzantine faulty processes can be restated such that messages from a subset of processes can be arbitrarily corrupted (including addition and omission of messages). We consider the case of dynamic and transient ...
Keywords: transient faults, byzantine fault tolerance, consensus, dynamic faults

14 published by ACM
March 2007 ACM SIGACT News: Volume 38 Issue 1, March 2007
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 319

Full text available: PDFPDF
Consensus is a central problem in fault tolerant distributed computing. A vast number of (positive and negative) results for consensus in various system models have been established. In this paper we isolate three features that all these system models share, and we show that inappropriate modelling choices have led to ...

15
December 2006 PRDC '06: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f /le n/2, and in one communication step with f /le n/3 (f is the maximum number of faulty processes). This leads to a ...

16
April 2004 Journal of Algorithms: Volume 51 Issue 1, 1 April 2004
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 20

We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are ...
Keywords: failures, consensus, synchronous model, time complexity, uniform consensus, distributed algorithm, early deciding algorithms

17
January 2003 Future directions in distributed computing: research and position papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


18
October 2002 SRDS '02: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5

This paper investigates the two main and seemingly antagonistic approaches to broadcasting reliably messages in fault-tolerant distributed systems: the approach based on Reliable Broadcast, and the one based on View Synchronous Communication (or VSC for short). While VSC does more than Reliable Broadcast, this has a cost. We show that ...

19
November 2001 SOFSEM '01: Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Reaching agreement in a distributed system is a fundamental issue of both theoretical and practical importance. Consensus, Atomic Commitment, Atomic Broadcast, Group Membership which are different versions of this paradigm underly much of existing fault-tolerant distributed systems. We describe these problems, explain their relationships, and state some fundamental results on ...

20
January 2001 WORDS '01: Proceedings of the Sixth International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'01)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

Algorithms for solving agreement problems can be classified in two categories:(1)those relying on failure detectors that we call FD-based ,and (2)those that rely on a Group Membership Service that we call GMS-based .The paper discusses the advantages and limitations of these two approaches,and proposes an extension to the GMS-approach that ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us