Name
Abstract | ||
|---|---|---|
We present a framework to order time-dependent tasks with respect to self-organized resource scheduling. The focus is to check if a given task set is executable at all, and in this case we present algorithms to compute a ordering for its tasks. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ISORCW.2011.26 | Object/Component/Service-Oriented Real-Time Distributed Computing Workshops |
Keywords | Field | DocType |
task set,present algorithm,self-organized resource scheduling,time-dependent tasks,time-dependent task,middleware,real time systems,resource allocation,self organization,schedules,transportation | Middleware,Load management,Multiprocessor scheduling,Computer science,Self-organization,Resource scheduling,Real-time computing,Schedule,Resource allocation,Distributed computing,Executable | Conference |
ISBN | Citations | PageRank |
978-0-7695-4377-2 | 1 | 0.38 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mathias Pacher | 1 | 107 | 13.21 |
| Uwe Brinkschulte | 2 | 412 | 52.57 |