Extending IC-Scheduling via the Sweep Algorithm


Earlier work has developed the rudiments of a scheduling theory for computations having intertask dependencies - modeled via dags - for Internet-based computing. The goal of the schedules produced is to render tasks eligible for execution as fast as possible, with the aim of: (a) utilizing clients' computational resources well, by always having work to… (More)
DOI: 10.1109/PDP.2008.16


11 Figures and Tables

Slides referencing similar topics