eCommons

 

Faster Possibility Detection by Combining Two Approaches

Other Titles

Abstract

A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies \PossΦ (read "possibly Φ"), meaning the system could have passed through a global state satisfying Φ. Like the algorithm of Cooper and Marzullo, Φ may be any global state predicate; and like the algorithm of Garg and Waldecker, \PossΦ is detected quite efficiently if Φ has a certain structure. The new algorithm exploits the structure of some predicates Φ not handled by Garg and Waldecker's algorithm to detect \PossΦ more efficiently than is possible with any algorithm that, like Cooper and Marzullo's, evaluates Φ on every global state through which the system could have passed. A second algorithm is also presented for off-line detection of \PossΦ. It uses Strassen's scheme for fast matrix multiplication. The intrinsic complexity of off-line and on-line detection of \PossΦ is discussed.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1995-04

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1511

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record