Puff, The Magic Protocol

Arbab, Farhad

doi:10.1007/978-3-642-24933-4_9

Cited by 38 publications

(52 citation statements)

References 75 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first buffered channel initially contains a dummy data item (i.e., its actual value does not matter); the other buffered channels initially contain nothing. As in the literature [1,2], we call this subconnector Sequencer k . Because no new data items can flow into Sequencer k , only cycles through the buffers-ad infinitum-such that only one buffer holds a data item at any time.…”

Section: Experimental Results: Compilationmentioning

confidence: 99%

“…To study the performance advantages of using coordination languages for multicore programming, in ongoing work, we are developing compilation technology for the coordination language Reo [1,2]. Reo facilitates compositional construction of protocol specifications manifested as connectors: channel-based mediums through which threads can communicate with each other.…”

Section: Fig 1 Example Connectors (Ordered Alphabetically)mentioning

confidence: 99%

See 1 more Smart Citation

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

Jongmans

Arbab

2015

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. 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.

show abstract

Section: Experimental Results: Compilationmentioning

confidence: 99%

Section: Fig 1 Example Connectors (Ordered Alphabetically)mentioning

confidence: 99%

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

Jongmans

Arbab

2015

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Reo has a variety of formal semantics [4,8]. In this paper we use its operational constraint automaton (CA) semantics [14].…”

Section: Reomentioning

confidence: 99%

“…Exogenous coordination languages, like BIP [1,2] and Reo [3,4], address this coordination problem by separating coordination of interactions from computation in processes [5]. This enables designers to control interaction using language constructs, making coordination visible to tools like model checkers and compilers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Combine and conquer: Relating BIP and Reo

Dokter

Jongmans

Arbab

et al. 2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. A formal relation between exogenous coordination languages comprises the basis for a solid comparison and consolidation of their fundamental concepts. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic models. We show that these transformations preserve all properties expressible in a common semantics. We use these transformations to define data-sensitive BIP architectures and their composition.

show abstract

interActors: A Model for Separating Communication Concerns of Concurrent Systems

Geng

Jamali

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Puff, The Magic Protocol

Cited by 38 publications

References 75 publications

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

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

Combine and conquer: Relating BIP and Reo

interActors: A Model for Separating Communication Concerns of Concurrent Systems

Contact Info

Product

Resources

About