Partial Connector Colouring

Dave Clarke 1, 2 José Proença 1, 2
1 KU-IBBT - FUTURE HEALTH DEPARTMENT [KU Leuven]
KU Leuven - Catholic University of Leuven - Katholieke Universiteit Leuven
Abstract : Connector colouring provided an intuitive semantics of Reo connectors which lead to effective implementation techniques, first based on computing colouring tables directly, and later on encodings of colouring into constraints. One weakness of the framework is that it operates globally, giving a colouring to all primitives of the connector in lock-step, including those not involved in the interaction. This global approach limits both scalability and the available concurrency. This paper addresses these problems by introducing partiality into the connector colouring model. Partial colourings allow parts of a connector to operate independently and in isolation, increasing scalability and concurrency.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01529589
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 31, 2017 - 9:59:53 AM
Last modification on : Thursday, February 21, 2019 - 10:31:47 AM
Long-term archiving on : Wednesday, September 6, 2017 - 2:31:38 PM

File

978-3-642-30829-1_5_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dave Clarke, José Proença. Partial Connector Colouring. 14th International Conference on Coordination Models and Languages (COORDINATION), Jun 2012, Stockholm, Sweden. pp.59-73, ⟨10.1007/978-3-642-30829-1_5⟩. ⟨hal-01529589⟩

Share

Metrics

Record views

65

Files downloads

148