Chameneos, a concurrency game for Java, Ada and others

Kaiser, Claude; Pradat-Peyre, Jean-François

doi:10.1109/aiccsa.2003.1227495

Cited by 7 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section describes three novel implementations of classical examples used to showcase the expressiveness of concurrent programming frameworks: a thread ring [Halen et al 1998], a parallel genuine prime sieve [Kahn and Macqueen 1977] and a chameneos-redux [Kaiser and Pradat-Peyre 2003]. We chose here popular examples that are well documented such that curious readers can easily lookup similar implementations in their favorite programming environment.…”

Section: Examples and Experimental Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Molecule

Bocq¹,

Daenen²

2012

Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

Molecule is a domain specific language library embedded in Scala for easing the creation of scalable and modular concurrent applications on the JVM. Concurrent applications are modeled as parallel process networks that exchange information over mobile and type-safe messaging interfaces.In this paper, we present a concurrent programming environment that combines functional and imperative programming. Using a monad, we structure the sequential or parallel coordination of user-level threads, without JVM modifications or compiler support. Our mobile channel interfaces expose reusable and parallelizable higher-order functions, as if they were streams in a lazily evaluated functional programming language. The support for graceful termination of entire process networks is simplified by integrating channel poisoning with monadic exceptions and resource control. Our runtime and system-level interfaces leverage message batching and a novel flow parallel scheduler to limit expensive context switches in multicore environments. We illustrate the expressiveness and performance benefits on a 24core AMD Opteron machine with three classical examples: a thread ring, a genuine prime sieve and a chameneos-redux.

show abstract

Section: Examples and Experimental Resultsmentioning

confidence: 99%

“…This application is described by Kaiser and Pradat-Peyre [2003] along with its implementation in Java. We will not provide here the complete implementation but we will highlight the higher expressiveness resulting from the higher-order and type-safe communication primitives of Molecule and their embedding in Scala's type system.…”

Section: The Chameneos-reduxmentioning

confidence: 99%

Molecule

Bocq¹,

Daenen²

2012

Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

show abstract

“…• chameneos: n actors ("chameneos") connect to a central broker, who picks pairs and sends them their respective ActorReferences, so they can interact peer-to-peer [34]; • counting: actor A sends n numbers to B, who adds them;…”

Section: Discussionmentioning

confidence: 99%

Verifying message-passing programs with dependent behavioural types

Scalas

Yoshida

Benussi

2019

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Concurrent and distributed programming is notoriously hard. Modern languages and toolkits ease this difficulty by offering message-passing abstractions, such as actors (e.g., Erlang, Akka, Orleans) or processes (e.g., Go): they allow for simpler reasoning w.r.t. shared-memory concurrency, but do not ensure that a program implements a given specification.To address this challenge, it would be desirable to specify and verify the intended behaviour of message-passing applications using types, and ensure that, if a program type-checks and compiles, then it will run and communicate as desired.We develop this idea in theory and practice. We formalise a concurrent functional language λ π ⩽ , with a new blend of behavioural types (from π -calculus theory), and dependent function types (from the Dotty programming language, a.k.a. the future Scala 3). Our theory yields four main payoffs: (1) it verifies safety and liveness properties of programs via typelevel model checking; (2) unlike previous work, it accurately verifies channel-passing (covering a typical pattern of actor programs) and higher-order interaction (i.e., sending/receiving mobile code); (3) it is directly embedded in Dotty, as a toolkit called Effpi, offering a simplified actor-based API; (4) it enables an efficient runtime system for Effpi, for highly concurrent programs with millions of processes/actors.

show abstract

“…version was only 2.76× slower than cps while being a generic solution, and the monad version was 8.69× slower than cps. [29] is a concurrency game aimed at measuring context switching and synchronization overheads. Our implementation uses MVars for synchronization.…”

Section: Concurrent Benchmarksmentioning

confidence: 99%

Retrofitting effect handlers onto OCaml

Sivaramakrishnan

Dolan²,

White³

et al. 2021

Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Effect handlers have been gathering momentum as a mechanism for modular programming with user-defined effects. Effect handlers allow for non-local control flow mechanisms such as generators, async/await, lightweight threads and coroutines to be composably expressed. We present a design and evaluate a full-fledged efficient implementation of effect handlers for OCaml, an industrial-strength multi-paradigm programming language. Our implementation strives to maintain the backwards compatibility and performance profile of existing OCaml code. Retrofitting effect handlers onto OCaml is challenging since OCaml does not currently have any nonlocal control flow mechanisms other than exceptions. Our implementation of effect handlers for OCaml: (i) imposes a mean 1% overhead on a comprehensive macro benchmark suite that does not use effect handlers; (ii) remains compatible with program analysis tools that inspect the stack; and (iii) is efficient for new code that makes use of effect handlers. CCS Concepts: • Software and its engineering → Runtime environments; Concurrent programming structures; Control structures; Parallel programming languages; Concurrent programming languages.

show abstract

Chameneos, a concurrency game for Java, Ada and others

Cited by 7 publications

References 7 publications

Molecule

Molecule

Verifying message-passing programs with dependent behavioural types

Retrofitting effect handlers onto OCaml

Contact Info

Product

Resources

About