Adrian Segall, Ouri Wolfson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a 'better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
Number of pages7
ISBN (Print)0818608277
StatePublished - 1988
Externally publishedYes

Bibliographical note

Funding Information:
Dr. HILL reports grants to the University of Calgary from Boehringer-Ingelheim, from NoNO Inc, from Medtronic LLC, from Biogen Inc; In addition, Dr. HILL has a patent US Patent office Number: 62/086,077 licensed to Circle Neurovascular Inc., and a patent US Patent office Number: US 10,916,346 licensed to Circle Neurovascular Inc. and owns stock in Pure Web Incorporated, a company that makes, among other products, medical imaging software, is a director of the Canadian Federation of Neurological Sciences, a not-for-profit group, a director of the Canadian Stroke Consortium, a not-for-profit group, is a director of Circle NeuroVascular Inc., and has received grant support from Alberta Innovates, CIHR, Heart & Stroke Foundation of Canada, National Institutes of Neurological Disorders and Stroke.


Dive into the research topics of 'OPTIMAL COMMUNICATION TOPOLOGIES FOR ATOMIC COMMITMENT.'. Together they form a unique fingerprint.

Cite this