1. Compilation of Reo protocols

    Reo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Recently, Jongmans developed techniques to compile Reo protocols into executable code. Benchmarks show that compilation of Reo protocols can produce code whose performance is comparable or even beats that of hand-crafted programs. Unfortunately, Jongmans' techniques …

    read more
  2. Gossip In NetKAT

    In this talk we will combine the study of NetKAT with the study of dynamic gossip. The talk is largely based on my master thesis, but as I am currently working on this will also contain some work in progress and loose ends. NetKAT is a sound and complete network …

    read more
  3. Deadlock Detection for Actor-based Coroutines

    The actor-based language studied in this research features asynchronous method calls and supports coroutines which allow for the cooperative scheduling of the method invocations belonging to an actor. We model the local behavior of an actor as a well-structured transition system by means of predicate abstraction and derive the decidability …

    read more
  4. Scheduling of Parallel Applications

    Most parallel applications leave the scheduling problem of their constituent processes to a general purpose scheduler, such as an operating system scheduler. Generally, constituent processes of a parallel application interact. For example, one process interacts with another by using its produced data. These interactions of processes introduce dependencies amongst them …

    read more
  5. Investigating Cooperative Scheduling in Parallel and Distributed Systems

    Our ongoing work focuses on an efficient solution to implement cooperative scheduling models through a user-friendly library written using Java 8. This library translates code written in a modelling language named the Abstract Behavioural Specification Language, into executable Java code. We investigate the issues raised by nested parallelism and the …

    read more
  6. Composing Constraint Automata, State-by-State

    When composing Constraint Automata by means of the product, one can run into cases where the amount of resources necessary grows exponentially in the number of automata. If the Constraint Automaton being calculated requires an exponential number of states by its very nature, this is not surprising. However, there are …

    read more
  7. eScience, Theory and Experience

    eScience, or enabling science, involves the theory and practice of how to enable scientists from different domains to take advantage of the latest advancements in computer science and technology. This is mainly achieved via science gateways, also known as virtual research environments, which hide the technical details of accessing and …

    read more

« Page 2 / 30 »

hosted by