Name
Abstract | ||
|---|---|---|
Resource allocation and scheduling for multicore platforms is one of the most critical challenges in today’s embedded computing.
In this paper we focus on a well-known multicore platform, namely the Cell BE processor, and we address the problem of allocating
and scheduling its processors, communication channels and memories, with the goal of minimizing execution time for complex
data streaming applications.
We propose three complete approaches that optimally solve the problem and prove optimality. The first is based on the recursive
application of the Logic Based Benders decomposition, resulting in a three stage algorithm. The second is a pure CP approach
while the third is a hybrid approach integrating the first two.
Extensive experimental evaluation shows the features of each approach and its effectiveness on a specific instance structure. |
Year | DOI | Venue |
|---|---|---|
2011 | https://doi.org/10.1007/s10479-010-0718-x | Annals of Operations Research |
Keywords | Field | DocType |
Constraint based scheduling,Resource allocation,Hybrid solvers,Constraint Programming,Integer Linear Programming,Multicore platforms | Computer science,Scheduling (computing),Constraint programming,Communication channel,Complex data type,Integer programming,Resource allocation,Dynamic priority scheduling,Multi-core processor,Distributed computing | Journal |
Volume | Issue | ISSN |
184 | 1 | 0254-5330 |
Citations | PageRank | References |
7 | 0.47 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Benini | 1 | 13116 | 1188.49 |
| Michele Lombardi | 2 | 270 | 28.86 |
| Michela Milano | 3 | 1117 | 97.67 |
| Martino Ruggiero | 4 | 327 | 21.67 |