Centralized coordination vs. partially-distributed coordination with Reo and constraint automata
| Autor: | Sung-Shik T. Q. Jongmans, Farhad Arbab |
|---|---|
| Přispěvatelé: | Department Computer Science, RS-Research Line Resilience (part of LIRS program) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Concurrency Reo Coordination Language LANGUAGE NETS 0102 computer and information sciences 02 engineering and technology computer.software_genre Notation 01 natural sciences COMPONENT CONNECTORS SOFTWARE TRANSACTIONAL MEMORY LTL MODEL-CHECKING VERIFICATION Coordination protocols SEMANTICS 0202 electrical engineering electronic engineering information engineering IMPLEMENTATION Latency (engineering) Reactive system Programming language Benchmarks CHANNEL-BASED COORDINATION 020207 software engineering REACTIVE SYSTEMS Compilation SPECIFICATIONS Automaton 010201 computation theory & mathematics SYNCHRONIZATION Software transactional memory Compiler Digital Security computer Software CIRCUITS |
| Zdroj: | Science of Computer Programming, 160, 48-77. ELSEVIER SCIENCE BV Science of Computer Programming, 160, pp. 48-77 Science of Computer Programming, 160, 48-77 Jongmans, S-STQ & Arbab 2018, ' Centralized coordination vs. partially-distributed coordination with Reo and constraint automata ', Science of Computer Programming, vol. 160, pp. 48-77 . https://doi.org/10.1016/j.scico.2017.06.004 |
| ISSN: | 0167-6423 |
| DOI: | 10.1016/j.scico.2017.06.004 |
| Popis: | High-level concurrency notations and abstractions have several well-known software engineering advantages when it comes to programming concurrency protocols among threads. 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 handcrafted 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. (C) 2017 Elsevier B.V. All rights reserved. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect