By Topic

On the existence of booster types

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Herlihy ; Dept. of Comput. Sci., Brown Univ., Providence, RI, USA ; E. Ruppert

A data type's consensus number measures its power in asynchronous concurrent models of computation. We characterize the circumstances under which types of high consensus number can be constructed from types with lower consensus numbers, a process called boosting. In settings where boosting is impossible, we can reason about the synchronization power of objects in isolation. We give a new and simple topological condition, called κ-solo-connectivity sufficient to ensure that one-shot types cannot be boosted to consensus number κ. The booster type need not be one-shot; it can be arbitrary. We also show that, for κ>2, any type that is not κ-solo-connected can be boosted to consensus number κ. For types that can be boosted, we establish an upper bound on the amount the consensus number can be increased. For finite types, these properties and bounds are computable. For deterministic one-shot types, the κ-solo-connectivity property also exactly characterizes the types that have consensus number less than κ

Published in:

Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on

Date of Conference:

2000