Can High Throughput Atone for High Latency in Compiler-Generated Protocol Code?

• Published in: Fundamentals of Software Engineering Vol. 9392; pp. 238 - 258
• Main Authors: Jongmans, Sung-Shik T. Q., Arbab, Farhad
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Artificial intelligence; Computer programming / software development; Connector Family; Coordination Language; Data Item; Hybrid Implementation; Protocol Code; Software Engineering
• ISBN: 9783319246437; 3319246437
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-24644-4_17

High-level concurrency constructs and abstractions have several well-known software engineering advantages when it comes to programming concurrency protocols among threads in multicore applications. To also explore their complementary performance advantages, in ongoing work, we are developing compilation technology for a high-level coordination language, Reo, based on this language’s formal automaton semantics. By now, as shown in our previous work, our tools are capable of generating code that can compete with carefully hand-crafted code, at least for some protocols. An important prerequisite to further advance this promising technology, now, is to gain a better understanding of how the significantly different compilation approaches that we developed so far, which vary in the amount of parallelism in their generated code, compare against each other. For instance, to better and more reliably tune our compilers, we must learn under which circumstances parallel protocol code, with high throughput but also high latency, outperforms sequential protocol code, with low latency but also low throughput. In this paper, we report on an extensive performance comparison between these approaches for a substantial number of protocols, expressed in Reo. Because we have always formulated our compilation technology in terms of a general kind of communicating automaton (i.e., constraint automata), our findings apply not only to Reo but, in principle, to any language whose semantics can be defined in terms of such automata.