This is an old revision of the document!
Distributed systems are computer systems that are connected by a communication network or any technology that features by the delay in its communication. In addition, these systems present an absence of a share clock and shared memory. As a consequence of these absences, it is not easy to observe the order of a distributed system execution trace because events (eg. sending and receiving of messages) generates by computer systems are not always causally related. There are algorithms that are able to determine the causal relation between two events, therefore, these algorithms can partially determine the order of a distributed system execution trace. The vector clock algorithm is widely used to observe the order of a distributed system execution trace.
Example of a system of vector clocks (wikipedia)
As OTM supports the definition of entities that observe and react to a Web application execution trace, we have extended our prototype to observe and react to distributed execution traces using the vector clock algorithm.
Social Web applications like Twitter or Google Reader, where users send or receive messages from other users, have been identified as good examples to use the vector clock algorithm in order to analyze the flow information of these social Web applications1). Using OTM, we show how the matching distributed execution traces can analyze popularity of a piece of news in a social Web applications like Twitter:
Go OTM home.