ABSTRACT
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typically run one to two orders of magnitude too slowly to be used interactively. Fortunately, many of these algorithms exhibit coarse-grained task and data parallelism that can be exploited across machines. The SLIPstream project focuses on building a highly-parallel runtime system called Sprout that can harness the computing power of a cluster to execute perception applications with low latency. This paper makes the case for using clusters for perception applications, describes the architecture of the Sprout runtime, and presents two compute-intensive yet interactive applications.
- Visual Object Instance Recognition. http://people.csail.mit.edu/rahimi/projects/objrec/.Google Scholar
- D. J. Abadi, Y. Ahmad, M. Balazinska, U. Çetintemel, M. Cherniack, J. Hwang, W. Lindner, A. S. Maskey, A. Rasin, E. Ryvkina, N. Tatbul, Y. Xing, and S. Zdonik. The Design of the Borealis Stream Processing Engine. In Proc. Innovative Data Systems Research, 2005.Google Scholar
- J. Allard, V. Gouranton, L. Lecointre, S. Limet, E. Melin, B. Raffin, and S. Robert. FlowVR: a middleware for large scale virtual reality applications. In Proc. Euro-Par, 2004.Google ScholarCross Ref
- L. Amini, H. Andrade, R. Bhagwan, F. Eskesen, R. King, P. Selo, Y. Park, and C. Venkatramani. SPC: A Distributed, Scalable Platform for Data Mining. In Proceedings of the Workshop on Data Mining Standards, Services, and Platforms, 2006. Google ScholarDigital Library
- A. F. Bobick and J. W. Davis. The recognition of human movement using temporal templates. PAMI, 23(3), 2001. Google ScholarDigital Library
- I. Buck, T. Foley, D. Horn, J. Sugerman, K. Fatahalian, M. Houston, and P. Hanrahan. Brook for GPUs: Stream Computing on Graphics Hardware. In SIGGRAPH, 2004. Google ScholarDigital Library
- S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, and M. Shah. TelegraphCQ: Continuous Dataflow Processing for an Uncertain World. In Proceedings of the Conference on Innovative Data Systems Research, 2003.Google Scholar
- M. Cherniack, H. Balakrishnan, M. Balazinska, D. Carney, U. Cetintemel, Y. Xing, and S. Zdonik. Scalable Distributed Stream Processing. In Proceedings of the Conference on Innovative Data Systems Research, 2003.Google Scholar
- J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. CACM, 51(1), 2008. Google ScholarDigital Library
- P. Dollar, V. Rabaud, G. Cottrell, and S. Belongie. Behavior recognition via sparse spatio-temporal features. In IEEE Workshop on PETS, 2005.Google ScholarCross Ref
- L. Girod, Y. Mei, R. Newton, S. Rost, A. Thiagarajan, H. Balakrishnan, and S. Madden. XStream: a Signal-Oriented Data Stream Management System. In Proc. International Conference on Data Engineering, 2008. Google ScholarDigital Library
- M. Gordon, W. Thies, and S. Amarasinghe. Exploiting Coarse-Grained Task, Data, and Pipeline Parallelism in Stream Programs. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, October 2006. Google ScholarDigital Library
- J. Gummaraju, J. Coburn, Y. Turner, and M. Rosenblum. Streamware: programming general-purpose multicore processors using streams. In Proc. Architectural Support for Programming Languages and Operating Systems, 2008. Google ScholarDigital Library
- J. Hartigan and M. Wang. A k-means clustering algorithm. Applied Statistics, 28:100--108, 1979.Google ScholarDigital Library
- M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In Proceedings of European Conference on Computer Systems, 2007. Google ScholarDigital Library
- T. Johnson, M. S. Muthukrishnan, V. Shkapenyuk, and O. Spatscheck. Query-aware partitioning for monitoring massive network data streams. In Proc. SIGMOD, 2008. Google ScholarDigital Library
- U. J. Kapasi, S. Rixner, W. J. Dally, B. Khailany, J. H. Ahn, P. Mattson, and J. D. Owens. Programmable Stream Processors. IEEE Computer, pages 54--62, August 2003. Google ScholarDigital Library
- Y. Ke, R. Sukthankar, and M. Hebert. Efficient visual event detection using volumetric features. In Proceedings of International Conference on Computer Vision, 2005. Google ScholarDigital Library
- Y. Ke, R. Sukthankar, and M. Hebert. Event detection in crowded videos. In Proceedings of International Conference on Computer Vision, 2007.Google ScholarCross Ref
- K. Knobe, J. M. Rehg, A. Chauhan, R. S. Nikhil, and U. Ramachandran. Scheduling constrained dynamic applications on clusters. In Proc. Supercomputing, 1999. Google ScholarDigital Library
- I. Laptev and T. Lindeberg. Space-time interest points. In Proc. International Conference on Computer Vision, 2003. Google ScholarDigital Library
- J.-D. Lesage and B. Raffin. A Hierarchical Component Model for Large Parallel Interactive Applications. The Journal of Supercomputing, July 2008.Google Scholar
- D. Lowe. Distinctive image features form scale-invariant keypoints. IJCV, 60(2), 2004. Google ScholarDigital Library
- U. Ramachandran, R. Nikhil, J. M. Rehg, Y. Angelov, A. Paul, S. Adhikari, K. Mackenzie, N. Harel, and K. Knobe. Stampede: a cluster programming middleware for interactive stream-oriented applications. IEEE Trans. Parallel and Distributed Systems, 14(11), 2003. Google ScholarDigital Library
- C. Schuldt, I. Laptev, and B. Caputo. Recognizing human actions: A local SVM approach. In Proc. International Conference on Pattern Recognition, 2004. Google ScholarDigital Library
- V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, 1995. Google ScholarDigital Library
- P. Viola and M. Jones. Rapid object detection using a boosted cascade of simple features. In Proc. Computer Vision and Pattern Recognition, 2001.Google ScholarCross Ref
- J. Wolf, N. Bansal, K. Hildrum, S. Parekh, D. Rajan, R. Wagle, K.-L. Wu, and L. Fleischer. SODA: an optimizing scheduler for large-scale stream-based distributed computer systems. In Proc. ACM/IFIP/USENIX Middleware, 2008. Google ScholarDigital Library
- C. Wren, F. Sparacino, A. Azarbayejani, T. Darrell, T. Starner, A. Kotani, C. Chao, M. Hlavac, K. Russell, and A. Pentland. Perceptive spaces for performance and entertainment: Untethered interaction using computer vision and audition. Applied AI, 11(4), 1996.Google Scholar
- D. Zhang, Z.-Z. Li, H. Song, and L. Liu. A Programming Model for an Embedded Media Processing Architecture. In Embedded Computer Systems: Architectures, Modeling, and Simulation, 2005. Google ScholarDigital Library
Index Terms
- SLIPstream: scalable low-latency interactive perception on streaming data
Recommendations
Slipstream processors: improving both performance and fault tolerance
Special Issue: Proceedings of the ninth international conference on Architectural support for programming languages and operating systems (ASPLOS '00)Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the ...
Slipstream processors: improving both performance and fault tolerance
ASPLOS IX: Proceedings of the ninth international conference on Architectural support for programming languages and operating systemsProcessors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the ...
Slipstream processors: improving both performance and fault tolerance
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the ...
Comments