Preemptive Scheduling of Uniform Processor Systems
Journal of the ACM (JACM)
An Adaptive Load Balancing Algorithm Using Simple Prediction Mechanism
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
SONIC - A Plug-In Architecture for Video Processing
FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters
Contention-free many-to-many communication scheduling for high performance clusters
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
| Hi-index | 0.00 |
In this paper we present a new load distribution strategy tailored to real-time, large scale surveillance systems with the objective of providing best effort timeliness of on-line automated video analysis on a cluster of compute nodes. We propose a novel approach to fine grained load balancing, modeled as a makespan minimization problem to reactively minimize the tardiness of processing individual camera feeds. The proposed approach is also robust in the sense that it is not dependent on either the estimates of future loads or the worst case execution requirements of the video processing load. Simulation results with real-life video surveillance data establish that for a desired timeliness in processing the data, our approach reduces the number of compute nodes by a factor of two, compared to systems without the load migration heuristics.