Controlling computationally intensive heterogeneous computational tasks with directive deadlines

Authors:
Yu. E. Malashenko;I. A. Nazarova
Affiliations:
Dorodnicyn Computing Center, Russian Academy of Sciences, Moscow, Russia 119991;Dorodnicyn Computing Center, Russian Academy of Sciences, Moscow, Russia 119991
Venue:
Journal of Computer and Systems Sciences International
Year:
2012

Citing 3
Cited 1

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
Analysis of computer job control under uncertainty

Journal of Computer and Systems Sciences International

Data aggregation for scheduling of resource-intensive computations under uncertainty

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dynamic control model for processing computationally intensive tasks that allow for arbitrary data parallelization in the heterogeneous computing system is considered. Although execution times are not known for tasks, their deadlines should be approved and given. Guaranteed estimates of when each task is completed in the worst case are obtained. The model helps take into account and minimize the maximal possible excess in the assigned deadlines for any set of original tasks.