Fundamentals of distributed system observation

Author

Fidge, Colin

Author_Institution

Dept. of Comput. Sci., Queensland Univ., Qld., Australia

Volume

13

Issue

6

fYear

1996

fDate

11/1/1996 12:00:00 AM

Firstpage

77

Lastpage

83

Abstract

It´s difficult to determine event order in distributed systems because of the observability problem. The author discusses this problem and evaluates different strategies for determining arrival order. The author analyzed four time stamping methods to determine their effectiveness in contending with observability problems. Although he focuses on distributed systems, the concepts also apply to any system exhibiting concurrency-the appearance of two or more events occurring simultaneously-including multiprocessor machines and uniprocessor multitasking. Events in this context may be the execution of single machine instructions or entire procedures; the level of granularity is unimportant. To define event order, the author uses the idea of causality-the ability of one event to affect another-because it allows us to reason independent of any particular time frame

Keywords

message passing; multiprocessing systems; observability; queueing theory; arrival order; causality; concurrency; distributed system observation; event order; granularity; multiprocessor machines; observability problem; single machine instructions; time stamping methods; uniprocessor multitasking; Computer networks; Concurrent computing; Delay; Multitasking; Observability; Physics; Probes; Programming profession; Testing; Watches;

fLanguage

English

Journal_Title

Software, IEEE

Publisher

ieee

ISSN

0740-7459

Type

jour

DOI

10.1109/52.542297

Filename

542297