Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
The existence of good probabilistic models for the job arrival process and job characteristics is important for the improved understanding of grid systems and the prediction of th...
Michael Oikonomakos, Kostas Christodoulopoulos, Em...
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Current instruction fetch policies in SMT processors are oriented towards optimization of overall throughput and/or fairness. However, they provide no control over how individual ...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
— Analytical communication performance models play an important role in prediction of the execution time of parallel applications on multiprocessors. Apart from designing such a ...