Efficient load balancing on a cluster for large scale online video surveillance

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer.

Cite

CITATION STYLE

APA

Sinha, K., Chowdhury, A. D., Ghosh, S. K., & Banerjee, S. (2009). Efficient load balancing on a cluster for large scale online video surveillance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5408 LNCS, pp. 450–455). https://doi.org/10.1007/978-3-540-92295-7_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free