Best-effort parallel execution framework for recognition and mining applications

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Meng, Jiayuan ^a,b   Chakradhar, Srimat ^a   Raghunathan, Anand ^a,c  

^a NEC LABORATORIES AMERICA   (United States)

^b University of Virginia   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION CONTEXTS; BEST-EFFORT; COMPUTATIONAL WORKLOAD; COMPUTING WORKLOADS; CORE MACHINES; EXPLOSIVE GROWTH; EYE DETECTION; INPUT DATAS; K-MEANS; MANY-CORE; MANY-CORE COMPUTING; MULTI CORE; PARALLEL EXECUTIONS; PARALLEL IMPLEMENTATIONS; PARALLEL PROGRAMMING MODEL; PARALLEL-COMPUTING ENVIRONMENT; PROGRAMMING MODELS; SPEED-UPS;

COMPUTER SCIENCE; DISTRIBUTED PARAMETER NETWORKS; EYE PROTECTION; INPUT OUTPUT PROGRAMS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

PARALLEL PROGRAMMING;

EID: 70449885048     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5160991     Document Type: Conference Paper

References (24)

1. K. Alsabti, S. Ranka, and V. Singh. An efficient k-means clustering algorithm. In Proceedings of the 1st Workshop on High Performance Data Mining, Mar. 1998.
2. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. On-line scheduling in the presence of overload. In Proceedings of the 32nd annual symposium on Foundationsof computer science, pages 100-110, 1991.
3. J. Bau, R. Hankins, Q. Jacobson, S. Mitra, B. Saha, and A. A. Tabatabai. Error resilient system architecture (ERSA) for probabilistic applications. In 2007 IEEE Workshop on Silicon Errors in Logic - System Effects, Apr. 2007.
4. J. C. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Kluwer Academic Publishers, 1981.
5. L. Bottou and Y. L. Cun. On-line learning for very large data sets: Research articles. Applied Stochastic Models in Business and Industry, 21(2):137-151, 2005.
6. L. Breslau and S. Shenker. Best-effort versus reservations: A simple comparative analysis. In Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, pages 3-16, 1998.
7. M. A. Breuer. Multi-media applications and imprecise computation. In Proceedings of the 8th Euromicro Conference on Digital System Design, pages 2-7, 2005.
8. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20(3):273-297, 1995.
9. A. Gursoy. Data decomposition for parallel k-means clustering. In International Conference on Parallel Processing and Applied Mathematics, Apr. 2004.
10. T.-Y. Hsieh, K.-J. Lee, and M. A. Breuer. An error-oriented test methodology to improve yield with error-tolerance. In Proceedings of the 24th IEEE VLSI Test Symposium, pages 130-135, 2006.
11. Intel Corporation. Intel Threading Building Blocks. http: //www.threadingbuildingblocks.org.
12. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):881- 892, 2002.
13. D. Kriegman and P. Belhumeur. The Yale Face Database.
14. F. Kurdahi, A. Eltawil, A. K. Djahromi, M. Makhzan, and S. Cheng. Error-aware design. In Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools, pages 8-15, 2007.
15. P. Li and B. Ravindran. Fast, best-effort real-time scheduling algorithms. IEEE Transactions on Computers, 53(9):1159- 1175, 2004.
16. J. W. Liu, K.-J. Lin, W.-K. Shih, A. C. shi Yu, J.-Y. Chung, , andW. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58-68, May 1991.
17. J. B. MacQueen. Some methods for classification and analysis of multivariate observation. In Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, 1967.
18. A. M. Mood, F. A. Graybill, and D. C. Boes. Introduction to the Theory of Statistics. McGraw Hill, 1974.
19. S. Natarajan. Imprecise and Approximate Computation. Kluwer Academic Publishers, 1995.
20. C. Olston and J. Widom. Best-effort cache synchronization with source cooperation. In Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pages 73-84, 2002.
21. N. R. Pal, J. C. Bezdek, and E. C.-K. Tsao. Generalized clustering networks and Kohonen's self-organizing scheme. Neural Networks, IEEE Transactions on, 4(4):549-557, Jul 1993.
22. K. Pearson. On lines and planes of closest fit to systems of point in space. Philosophical Magazine, Sixth Series, 2:559- 572, 1901.
23. A. Sato, H. Imaoka, T. Suzuki, and T. Hosoi. Advances in face detection and recognition technologies. 2005.
24. K. Takahashi and D. Nishiwaki. A class-modular glvq ensemble with outlier learning for handwritten digit recognition. In Proceedings of the Seventh International Conference on Document Analysis and Recognition, page 268, 2003.