Search

Your search keyword '"Rajsbaum, Sergio"' showing total 815 results
Start Over Author "Rajsbaum, Sergio"

Refine your results

more »

more »

more »

more »
815 results on '"Rajsbaum, Sergio"'

210. Enciclopedia de Conocimientos Fundamentales. Volumen 5. Matemáticas, Física y Computación

Author

Bracho, Javier, primary, Abreu León, José Luis, additional, Barot, Michael, additional, Espejel Morales, Raúl Arturo, additional, Marquina Fábrega, María Luisa, additional, Martínez Negrete, Marco Antonio, additional, Morán López, José Luis, additional, Núñez Cabrera, Miguel C., additional, Rajsbaum, Sergio, additional, Bribiesca Correa, Ernesto, additional, Galaviz Casas, José, additional, Solsona, Francisco, additional, and Marquina, María Luisa, additional

Published
2010
Full Text
View/download PDF

213. Welcome

Author

Almeida, Virgilio, primary, Navarro, Gonzalo, additional, and Rajsbaum, Sergio, additional

Published
2020
Full Text
View/download PDF

228. On the performance of synchronized programs in distributed networks with random processing times and transmission delays

Author

Rajsbaum, Sergio and Sidi, Moshe

Subjects
Distributed processing (Computers) -- Research, Performance -- Analysis, Business, Computers, Electronics, Electronics and electrical industries
Abstract

Synchronizer operation under random transmission delays and processing times in asynchronous networks yields computations of network performance rate probability distributions. Topology of random variables influence network. Transmission delays of the NBUE distribution type reduce network rate by a vertex degree factor.

Published
1994

237. Wait-Free Solvability of Equality Negation Tasks

Author

Lazic, Marijana, Rajsbaum, Sergio, Lazic, Marijana, and Rajsbaum, Sergio

Abstract

We introduce a family of tasks for n processes, as a generalization of the two process equality negation task of Lo and Hadzilacos (SICOMP 2000). Each process starts the computation with a private input value taken from a finite set of possible inputs. After communicating with the other processes using immediate snapshots, the process must decide on a binary output value, 0 or 1. The specification of the task is the following: in an execution, if the set of input values is large enough, the processes should agree on the same output; if the set of inputs is small enough, the processes should disagree; and in-between these two cases, any output is allowed. Formally, this specification depends on two threshold parameters k and l, with k

Published
2019
Full Text
View/download PDF

238. Wait-Free Solvability of Equality Negation Tasks

Author

Éric Goubault and Marijana Lazić and Jérémy Ledent and Sergio Rajsbaum, Goubault, Éric, Lazić, Marijana, Ledent, Jérémy, Rajsbaum, Sergio, Éric Goubault and Marijana Lazić and Jérémy Ledent and Sergio Rajsbaum, Goubault, Éric, Lazić, Marijana, Ledent, Jérémy, and Rajsbaum, Sergio

Abstract

We introduce a family of tasks for n processes, as a generalization of the two process equality negation task of Lo and Hadzilacos (SICOMP 2000). Each process starts the computation with a private input value taken from a finite set of possible inputs. After communicating with the other processes using immediate snapshots, the process must decide on a binary output value, 0 or 1. The specification of the task is the following: in an execution, if the set of input values is large enough, the processes should agree on the same output; if the set of inputs is small enough, the processes should disagree; and in-between these two cases, any output is allowed. Formally, this specification depends on two threshold parameters k and l, with k

Published
2019
Full Text
View/download PDF

239. Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211)

Author

Esparza, Javier, Fraignaud, Pierre, Muscholl, Anca, and Rajsbaum, Sergio

Subjects
000 Computer science, knowledge, general works, Computer Science
Abstract

The Dagstuhl Seminar "Formal Methods and Fault-Tolerant Distributed Computing: Forging an Alliance" took place May 22-25, 2018. Its goal was to strengthen the interaction between researchers from formal methods and from distributed computing, and help the two communities to better identify common research challenges.

Published
2018
Full Text
View/download PDF

240. t-résilient snapshot immédiat

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Networks, Graphs and Algorithms (GANG), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Instituto de Matematicas [México], Universidad Nacional Autónoma de México (UNAM), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Universidad Nacional Autónoma de México = National Autonomous University of Mexico (UNAM), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Delporte-Gallet, Carole, SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
[SCCO.COMP] Cognitive science/Computer science, [SCCO.COMP]Cognitive science/Computer science
Abstract

International audience; Dans un système de n processus communiquant par mémoirepartagée, un snapshot immédiat est un état de la mémoire assurant que si l'écriture réalisée par $q$ est dans le snapshot de $p$ alors lesnapshot de $p$ contient le snapshot obtenu par q. Un snapshot immédiat peut être réalisé dans un système o\`u au plus n-1 processus peuvent tomber en panne. Dans un système où t processus peuvent tomber en panne, unprocessus peut obtenir un snapshot contenant les valeurs écrites par jusqu'àn-t processus. On définit ainsi le t-résilient snapshot immédiat et on établit des liens entre ce problème et les problèmes d'accord comme le consensus et le \k-accord.

Published
2017

247. New Combinatorial Topology Bounds for Renaming: The Upper Bound.

Author

CASTAÑEDA, ARMANDO and RAJSBAUM, SERGIO

Subjects
COMBINATORIAL topology, MATHEMATICAL bounds, COMPUTABLE functions, DISTRIBUTED computing, MACHINE theory, ALGORITHMS, COMPUTER programming
Abstract

In the renaming task, n + 1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, 0, 1, …, K. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process ID. Attiya et al. [1990] showed that renaming has a wait-free solution when K = 2n. Several algebraic topology proofs of a lower bound stating that no such protocol exists when K ≥ 2n have been published. In a companion article, we present the first completely combinatorial renaming lower bound proof stating if n + 1 is a primer power, then renaming is not wait-free solvable when K ≥ 2n. In this article, we show that if n + 1 is not a primer power, then there exists a wait-free renaming protocol for K = 2n - 1. Therefore the renaming lower bound for K ≥ 2n is incorrect. More precisely, our main theorem states that there exists a wait-free renaming protocol for K ≥ 2n if and only if n + 1 is not a prime power. We prove this result using the known equivalence of K-renaming for K = 2n - 1 and the weak symmetry breaking task: processes have no input values and the output values are 0 or 1, and it is required that in every execution in which all processes participate, at least one process decides 1 and at least one process decides 0. Categories and Subject Descriptors: D.1.3 [Programming Techniques]: Concurrent Programming; F.1.1 [Computation by Abstract Devices]: Models of Computation -- computability theory; F.1.2 [Computation by Abstract Devices]: Modes of Computation -- parallelism and concurrency General Terms: Algorithms, Theory [ABSTRACT FROM AUTHOR]

Published
2012
Full Text
View/download PDF

249. Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems.

Author

Mostefaout, Achour, Rajsbaum, Sergio, and Raynal, Michel

Subjects
ASYNCHRONOUS transfer mode, FAULT tolerance (Engineering), DATA transmission systems, MATHEMATICAL analysis
Abstract

This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for which it is possible to solve consensus despite the occurrence of up to f process crashes. The first main result defines acceptable conditions and shows that these are exactly the conditions for which a consensus protocol exists. Two examples of realistic acceptable conditions are presented, and proved to be maximal, in the sense mat they cannot be extended and remain acceptable. The second main result is a generic consensus shared-memory protocol for any acceptable condition. The protocol always guarantees agreement and validity, and terminates (at least) when the inputs satisfy the condition with which the protocol has been instantiated, or when there are no crashes. An efficient version of the protocol is then designed for the message passing model that works when f < n/2, and it is shown that no such protocol exists when f ≥ n/2. It is also shown how the protocol's safety can be traded for its liveness. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

250. Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211)

Author

Javier Esparza and Pierre Fraigniaud and Anca Muscholl and Sergio Rajsbaum, Esparza, Javier, Fraignaud, Pierre, Muscholl, Anca, Rajsbaum, Sergio, Javier Esparza and Pierre Fraigniaud and Anca Muscholl and Sergio Rajsbaum, Esparza, Javier, Fraignaud, Pierre, Muscholl, Anca, and Rajsbaum, Sergio

Abstract

The Dagstuhl Seminar "Formal Methods and Fault-Tolerant Distributed Computing: Forging an Alliance" took place May 22-25, 2018. Its goal was to strengthen the interaction between researchers from formal methods and from distributed computing, and help the two communities to better identify common research challenges.

Published
2018
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results