Declarative Scheduling for Active Objects - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers 29th Symposium On Applied Computing Year : 2014

Declarative Scheduling for Active Objects


Active objects are programming constructs that abstract dis- tribution and help to handle concurrency. In this paper, we extend the multiactive object programming model to offer a priority specification mechanism. This mechanism allows programmers to have control on the scheduling of requests. The priority representation is based on a dependency graph which makes it very convenient to use. This article shows how to use this mechanism from the programmer side, and exposes the main properties of the dependency graph. The software architecture of our implementation is also presented, as it can be applied to various scheduling systems. Finally, we validate our approach through a microbenchmark that shows that the overhead of our priority representation is rather low. On the whole, we provide a general pattern to introduce a prioritized scheduling in active objects or in any other con- current systems. The resulting framework is shown to be fine-grained, user-friendly, and efficient.
Fichier principal
Vignette du fichier
DeclarativeSchedulingForActiveObjects-FINAL.pdf (231.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00916293 , version 1 (10-12-2013)


  • HAL Id : hal-00916293 , version 1


Ludovic Henrio, Justine Rochas. Declarative Scheduling for Active Objects. SAC 2014 - 29th Symposium On Applied Computing, ACM Special Interest Group on Applied Computing, Mar 2014, Gyeongju, South Korea. pp.1-6. ⟨hal-00916293⟩
291 View
236 Download


Gmail Facebook X LinkedIn More