Communication Topology Analysis for Concurrent Programs

Martel, Matthieu; Gengler, Marc

doi:10.1007/10722468_16

Cited by 8 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Colby [4] presents an analysis that uses control paths to identify threads that may be created at the same point and constructs the communication topology of the program. A more precise control-flow analysis was proposed by Martel and Gengler [15]. Similar to our approach, in their work the accuracy of the analysis is enhanced by analyzing finite automata to eliminate some impossible communication traces.…”

Section: Related Workmentioning

confidence: 95%

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go

Stadtmüller

Sulzmann

Thiemann

2016

Programming Languages and Systems

View full text Add to dashboard Cite

We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check for deadlockfreedom. The approach is implemented and evaluated with a series of examples.

show abstract

Section: Related Workmentioning

confidence: 95%

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go

Stadtmüller

Sulzmann

Thiemann

2016

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…The analysis by Colby [1] for Concurrent ML uses call and fork path information to detect communication patterns between any number of tasks. Martel and Gengler [14] developed a related analysis for the π-calculus. While both analyses are quite capable, they are limited to a simpler variant of message-passing where communication only occurs along channels that are explicitly identified when a process is forked (i.e.…”

Section: Related Workmentioning

confidence: 99%

Communication-Sensitive Static Dataflow for Parallel Message Passing Applications

Bronevetsky¹

2009

2009 International Symposium on Code Generation and Optimization

View full text Add to dashboard Cite

Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance has motivated significant amounts of research on optimization and debugging techniques for such applications. Although this work has produced impressive results, it has also failed to fulfill its full potential. The reason is that while prior work has focused on runtime techniques, there has been very little work on compiler analyses that understand the properties of parallel message passing applications and use this information to improve application performance and quality of debuggers.This paper presents a novel compiler analysis framework that extends dataflow to parallel message passing applications on arbitrary numbers of processes. It works on an extended controlflow graph that includes all possible inter-process interactions of any numbers of processes. This enables dataflow analyses built on top of this framework to incorporate information about the application's parallel behavior and communication topology. The parallel dataflow framework can be instantiated with a variety of specific dataflow analyses as well as abstractions that can tune the accuracy of communication topology detection against its cost.The proposed framework bridges the gap between prior work on parallel runtime systems and sequential dataflow analyses, enabling new transformations, runtime optimizations and bug detection tools that require knowledge of the application's communication topology. We instantiate this framework with two different symbolic analyses and show how these analyses can detect different types of communication patterns, which enables the use of dataflow analyses on a wide variety of real applications. I. IntroductionThe rise of cluster and multi-core computing has driven a revolution in computer hardware and software. As these machines are best utilized by parallel applications that are explicitly written to take advantage of multiple processing cores, their popularity is pushing the development of a wide variety of parallel applications. In particular, message passing applications, where processes use distributed memory and communicate via explicit send and receive operations, have become very popular. These applications are common on a wide variety of platforms and use popular APIs such as BSD sockets, MPI and PVM.The past few decades have seen significant amounts of work on message passing optimization and applications. The bulk of it has focused on runtime and techniques that either improve the underlying hardware (e.g. network processors [12]), the software infrastructure (e.g. self-tuning MPI [6]) or use run-time information to analyze and tune application performance [11]. In contrast, work on static techniques to analyze and optimize such applications has been mostly limited to sequential analyses that either improve the performance of the sequential portions of these applications or improve parallel performance by looking at th...

show abstract

“…Their algorithm can eliminate redundant synchronization, but, like Mercouroff's work, it is limited to programs with static structure. Martel and Gengler have developed a control-flow analysis that determines an approximation of a CML program's communication topology [MG00]. The analysis uses finite automata to approximate the synchronization behavior of a thread and then extracts the topology from the product automata.…”

Section: Related Workmentioning

confidence: 99%

Specialization of CML message-passing primitives

Reppy

Xiao

2007

Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous operations. This mechanism allows programmers to encapsulate complicated communication and synchronization protocols as first-class abstractions, which encourages a modular style of programming where the underlying channels used to communicate with a given thread are hidden behind data and type abstraction.While CML has been in active use for well over a decade, little attention has been paid to optimizing CML programs. In this paper, we present a new program analysis for statically-typed higher-order concurrent languages that enables the compile-time specialization of communication operations. This specialization is particularly important in a multiprocessor or multicore setting, where the synchronization overhead for general-purpose operations are high. Preliminary results from a prototype that we have built demonstrate that specialized channel operations are much faster than the general-purpose operations.Our analysis technique is modular (i.e., it analyzes and optimizes a single unit of abstraction at a time), which plays to the modular style of many CML programs. The analysis consists of three steps: the first is a type-sensitive control-flow analysis that uses the program's type-abstractions to compute more precise results. The second is the construction of an extended control-flow graph using the results of the CFA. The last step is an iterative analysis over the graph that approximates the usage patterns of known channels. Our analysis is designed to detect special patterns of use, such as one-shot channels, fan-in channels, and fan-out channels. We have proven the safety of our analysis and state those results.

show abstract

Communication Topology Analysis for Concurrent Programs

Cited by 8 publications

References 16 publications

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go

Communication-Sensitive Static Dataflow for Parallel Message Passing Applications

Specialization of CML message-passing primitives

Contact Info

Product

Resources

About