Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
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.