| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 452.44 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Multicore platforms have transformed parallelism into a main
concern. Parallel programming models are being put forward
to provide a better approach for application programmers
to expose the opportunities for parallelism by pointing
out potentially parallel regions within tasks, leaving the actual
and dynamic scheduling of these regions onto processors
to be performed at runtime, exploiting the maximum
amount of parallelism.
It is in this context that this paper proposes a scheduling
approach that combines the constant-bandwidth server abstraction
with a priority-aware work-stealing load balancing
scheme which, while ensuring isolation among tasks, enables
parallel tasks to be executed on more than one processor at
a given time instant.
Description
Keywords
Design Algorithms Real-time systems Task-level parallelism Constant-bandwidth servers Capacity sharing Work-stealing