Name
Abstract | ||
|---|---|---|
Orc and Reo are two complementary approaches to the problem of coordinating components or services. On one hand, Orc is highly asynchronous, naturally dynamic, and based on ephemeral connections to services. On the other hand, Reo is based on the interplay between synchronization and mutual exclusion, is more static, and establishes more continuous connections between components (services). The question of how Orc and Reo relate to each other naturally arises. In this paper, we present a detailed comparison between the two models. We demonstrate that embedding non-recursive Orc expressions into Reo connectors is straightforward, whereas recursive Orc expressions require an extension to the Reo model. For the other direction, we argue that embedding Reo into Orc would require significantly more effort. We conclude with some general observations and comparisons between the two approaches. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.entcs.2008.03.099 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
detailed comparison,complementary approach,software connectors,reo model,non-recursive orc expression,coordination models orc,orc,embedding reo,reo,ephemeral connection,continuous connection,software connectors.,reo connector,recursive orc expression,coordination languages,general observation,mutual exclusion | Asynchronous communication,Synchronization,Embedding,Programming language,Expression (mathematics),Computer science,Theoretical computer science,Mutual exclusion,Software connectors,Recursion | Journal |
Volume | Issue | ISSN |
194 | 4 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
7 | 0.47 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José Proença | 1 | 158 | 11.75 |
| Dave Clarke | 2 | 416 | 26.19 |