..:: Información Detallada ::..
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus
|
Fecha:
|
2006
|
Tipo:
|
Memoria Congreso
|
|||||||
|---|---|---|---|---|---|---|---|---|---|---|
|
Titulo:
|
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus
|
|||||||||
|
Autores:
|
RAYNAL Michel.
RAJSBAUM Sergio.
TRAVERS Corentin.
AFEK Yehuda.
GAFNI Eli.
|
|||||||||
|
Proyecto:
|
||||||||||
|
País:
|
CONJUNTO
|
|||||||||
|
Congreso:
|
8th International Conference on Distributed Computing and Networks
, (ICDCN 2006)
|
|||||||||
|
Páginas:
|
331-341 Pp.
|
|||||||||
|
Editorial:
|
Springer Berlin / Heidelberg
|
|||||||||
|
ISBN:
|
978-3-540-68139-7
|
|||||||||
|
Enlace:
|
||||||||||
|
Descripción:
|
We address the problem of solving a task T=(T1,...Tm) (called (m,1)-BG), in which a processor returns in an arbitrary one of m simultaneous consensus subtasks T1,...Tm. Processor pi submits to T an input vector of proposals (propi,1,...,propi,m), one entry per subtask, and outputs, from just one subtask l, a pair (l, propj,l) for some j. All processors that output at l output the same proposal.
|
|||||||||

