Bounded phase analysis of message-passing programs

On Depth-bounded Message Passing Systems

Statistical Analysis of Message Passing Programs to Guide Computer Design

Little data exists on how message passing programs use parallel computers. The behavior of these programs can strongly influence design decisions made for future computer systems. The computer designer’s use of incorrect assumptions about program behavior can degrade performance. In many cases simple statistical parameters describing characteristics such as message sizes, destinations, sources,...

Future-based Static Analysis of Message Passing Programs

Message passing is widely used in industry to develop programs consisting of several distributed communicating components. Developing functionally correct message passing software is very challenging due to the concurrent nature of message exchanges. Nonetheless, many safety-critical applications rely on the message passing paradigm, including air traffic control systems and emergency services,...

Bounded time-stamping in message-passing systems

Consider a distributed system running a protocol in which processes exchange information by passing messages. The gossip problem for the protocol is the following: Whenever a process q receives a message from another process p, q must be able to decide which of p and q has more recent information about r, for every other process r in the system. With this data, q is in a position to update its ...

Trace-Based Run-Time Analysis of Message-Passing Go Programs

We consider the task of analyzing message-passing programs by observing their run-time behavior. We introduce a purely librarybased instrumentation method to trace communication events during execution. A model of the dependencies among events can be constructed to identify potential bugs. Compared to the vector clock method, our approach is much simpler and has in general a significant lower r...