Consensus algorithms are an important building block for fault-tolerant distributed systems. This paper investigates approaches to optimize solutions of distributed consensus to the properties of embedded systems. We discuss alternatives that allow constructing better practical solutions in realistic environments. For example, many networked embedded systems are equipped with both ad-hoc commun...

Reaching consensus among multiple processes in a distributed system is fundamental to coordinating distributed actions. In this paper we present a new approach to building survivable consensus objects in a system consisting of a (possibly large) collection of persistent object servers and a transient population of clients. Our consensus object implementation requires minimal support from server...

Consensus building is essential in aligning multiple stakeholder viewpoints which are commonly emerging during the process of requirements elicitation, analysis and validation [15]. In fact, agreement among diverse groups of stakeholders is deemed prerequisite to establishing project cooperation and collaboration. While individuals frequently rank the importance of their personal goals over the...

For patients with recurrent prostate cancer after radical prostatectomy, salvage radiotherapy is the only potentially curative treatment option. However, until recently there has been a paucity of data on the effectiveness of this approach. In light of recently published studies, the Genito-Urinary Radiation Oncologists of Canada (GUROC) met and crafted a consensus statement regarding the curre...

Laplacian-based approximate consensus algorithms are an important and frequently used building block in many distributed applications, including formation control, sensor fusion, and synchronization. These algorithms, however, converge extremely slowly on networks that are more than a few hops in diameter and where values are spatially correlated. This paper presents a new algorithm, Power Law ...

The combination of multiple clustering processes provides a means for building robust document clustering systems. This work focuses on the consolidation of fuzzy clusterings, proposing two consensus functions for soft cluster ensembles based on the Borda and Condorcet positional voting strategies. Experiments conducted on two document corpora reveal that the proposed soft consensus functions a...

Laplacian-based approximate consensus algorithms are an important and frequently used building block in many distributed applications, including formation control, sensor fusion, and synchronization. These algorithms, however, converge extremely slowly on networks that are more than a few hops in diameter and where values are spatially correlated. This paper presents a new algorithm, Power Law ...

In this paper, we present a set of techniques and an approach to support the facilitator in building consensus during group decision making in computer supported group work. The approach utilizes data about each participant's expressed preferences (scores and ranks) for a set of decision alternatives under consideration. The data are analyzed to provide the facilitator with information about th...

terrorism is regarded as among the current issues discussed in the international community. it has particularly attracted the attention of people all over the world, both in the east and the west, after the events of september 11, 2001. however, there is no consensus in determining its semantic framework, with each definition admitting to this terms’ relativity. our religion, nevertheless, is a...

Asynchronous Byzantine consensus algorithms are an important primitive for building Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at least two communication steps for decision; in many systems, this imposes a significant performance overhead. In this paper, we show that it is possible to design Byzantine fault-tolerant consensus algorithms that decide in...