Name
Abstract | ||
|---|---|---|
Active objects are programming constructs that abstract distribution 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 concurrent systems. The resulting framework is shown to be fine-grained, user-friendly, and efficient. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2554850.2554957 | SAC |
Keywords | Field | DocType |
design,priority scheduling,active objects,concurrent programming,annotations,languages,concurrency,language classifications | Priority ceiling protocol,Fixed-priority pre-emptive scheduling,Programming language,Fair-share scheduling,Computer science,Two-level scheduling,Priority inheritance,Dynamic priority scheduling,Dependency graph,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
3 | 0.39 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ludovic Henrio | 1 | 304 | 34.43 |
| Justine Rochas | 2 | 18 | 2.15 |