Scheduling intense applications most surprising first
We show how results from algorithmic theory are useful in scheduling. Theory allows the efficient creation of synopses of unprocessed data. These synopses can then be used to schedule the processing of the stream. We describe the theory underlying such a scheduler. We show how existing programming models can be extended to accommodate it.
scheduling programming models data streams sketching