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

  • Sung-Shik T. Q. Jongmans
  • Farhad Arbab
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9392)


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.


Data Item Connector Family Protocol Code Coordination Language Hybrid Implementation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbab, F.: Reo: a channel-based coordination model for component composition. MSCS 14(3), 329–366 (2004)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Arbab, F.: Puff, The Magic Protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Talcott Festschrift. LNCS, vol. 7000, pp. 169–206. Springer, Heidelberg (2011)Google Scholar
  3. 3.
    Arbab, F., Kokash, N., Meng, S.: Towards Using Reo for Compliance-Aware Business Process Modeling. In: ISoLA 2008. CCIS, vol. 17, pp. 108–123. Springer, Heidelberg (2008)Google Scholar
  4. 4.
    Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. SCP 61(2), 75–113 (2006)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-time Components in BIP. In: SEFM 2006, pp. 3–12. IEEE (2006)Google Scholar
  6. 6.
    Bliudze, S., Sifakis, J.: Causal semantics for the algebra of connectors. Formal Methods in System Design 36(2), 167–194 (2010)CrossRefzbMATHGoogle Scholar
  7. 7.
    Changizi, B., Kokash, N., Arbab, F.: A Unified Toolset for Business Process Model Formalization. In: Preproceedings of FESCA 2010, pp. 147–156 (2010)Google Scholar
  8. 8.
    Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press (2014)Google Scholar
  9. 9.
    Jongmans, S.S., Arbab, F.: Global Consensus through Local Synchronization. In: FOCLASA 2013. CCIS, vol. 393, pp. 174–188. Springer (2013)Google Scholar
  10. 10.
    Jongmans, S.S., Arbab, F.: Modularizing and Specifying Protocols among Threads. In: PLACES 2012. EPTCS, vol. 109, pp. 34–45. CoRR (2013)Google Scholar
  11. 11.
    Jongmans, S.S., Arbab, F.: Toward Sequentializing Overparallelized Protocol Code. In: ICE 2014. EPTCS, vol. 166, pp. 38–44. CoRR (2014)Google Scholar
  12. 12.
    Jongmans, S.S., Arbab, F.: Can High Throughput Atone for High Latency in Compiler-Generated Protocol Code (Technical Report). Tech. Rep. FM-1503, CWI (2015)Google Scholar
  13. 13.
    Jongmans, S.S., Halle, S., Arbab, F.: Automata-based Optimization of Interaction Protocols for Scalable Multicore Platforms. In: Kühn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 65–82. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  14. 14.
    Jongmans, S.S., Santini, F., Arbab, F.: Partially-Distributed Coordination with Reo. In: PDP 2014, pp. 697–706. IEEE (2014)Google Scholar
  15. 15.
    Meng, S., Arbab, F., Baier, C.: Synthesis of Reo circuits from scenario-based interaction specifications. SCP 76(8), 651–680 (2011)zbMATHGoogle Scholar
  16. 16.
    Proença, J., Clarke, D., de Vink, E., Arbab, F.: Dreams: a framework for distributed synchronous coordination. In: SAC 2012, pp. 1510–1515. ACM (2012)Google Scholar
  17. 17.
    Proença, J.: Synchronous Coordination of Distributed Components. Ph.D. thesis, Leiden University (2011)Google Scholar
  18. 18.
    Sirjani, M., Jaghoori, M.M., Baier, C., Arbab, F.: Compositional Semantics of an Actor-Based Language Using Constraint Automata. In: Ciancarini, P., Wiklicky, H. (eds.) COORDINATION 2006. LNCS, vol. 4038, pp. 281–297. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  • Sung-Shik T. Q. Jongmans
    • 1
  • Farhad Arbab
    • 1
  1. 1.Centrum Wiskunde & InformaticaAmsterdamThe Netherlands

Personalised recommendations