Deriving distributed algorithms from a general predicate detector

Author

Mitchell, J. Roger ; Garg, Vijay K.

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

fYear

1995

fDate

9-11 Aug 1995

Firstpage

268

Lastpage

273

Abstract

Designing and debugging distributed systems requires the detection of conditions across the entire system. As an illustration, monitoring the status of an application requires detection of termination, and using virtual time requires the periodic calculation of the global virtual time. The generalized conjunctive predicate (GCP) detector offers a method to derive detection algorithms for these and other problems based on optimizing the base algorithm

Keywords

computational complexity; distributed algorithms; program debugging; software engineering; system monitoring; application status monitoring; condition detection; detection algorithms; distributed algorithms; distributed system debugging; distributed system design; generalized conjunctive predicate detector; optimized base algorithm; periodic global virtual time calculation; termination detection; virtual time; Algorithm design and analysis; Application software; Computerized monitoring; Concurrent computing; Debugging; Design engineering; Design optimization; Detectors; Distributed algorithms; Distributed computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1995. COMPSAC 95. Proceedings., Nineteenth Annual International

Conference_Location

Dallas, TX

ISSN

0730-3157

Print_ISBN

0-8186-7119-X

Type

conf

DOI

10.1109/CMPSAC.1995.524790

Filename

524790