Design of a hardware accelerator for density based clustering applications

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn , Issue , 2005, Pages 101-106

  Pisharath, Jayaprakash ^a   Choudhary, Alok ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HARDWARE;

CLUSTERING; EXECUTION TIME; HIGH-DENSITY REGIONS; PROBLEM COMPLEXITY;

DATA MINING;

EID: 24944545811     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. L. Barroso, K. Gharachorloo, and F. Bugnion. Memory system characterization of commercial workloads. In Proc. of the International Symposium on Computer Architecture, 1998.
2. J. Bentley. Multidimensional binary search trees used for associative searching. Communication of the ACM, 18(9), September 1975.
3. J. Bradford and J. Fortes. Performance and memory-access characterization of data mining applications. In Workshop on Workload Characterization at the Annual International Symposium on Microarchitecture., 1998.
4. A. Czezowski and P. Christen. How fast is fast? Performance analysis of KDD applications using hardware performance counters on UltraSPARC-III. Technical Report TR-CS-02-03, The Australian National University, Department of Computer Science, September 2002.
5. D. Eisenstein and P. Hut. Hop: A new group finding algorithm for N-body simulations. Journal of Astrophysics, (498): 137-142, 1998.
6. M. Estlick, M. Leeser, J. Theiler, and J. Szymanski. Algorithmic transformations in the implementation of K-means clustering on reconfigurable hardware. In Proc. of the ACM/SIGDA ninth international symposium on Field programmable gate arrays, 2001.
7. T. Hayashi, K. Nakano, and S. Olariu. Work-time optimal k-Merge algorithms on the PRAM. IEEE Transactions on Parallel and Distributed Systems, 9(3):275-282, 1998.
8. J. Kim, X. Qin, and Y. Hsu. Memory characterization of a parallel data mining workload. In Workshop on Workload Characterization: Methodology and Case Studies, 1998.
9. Y. Liu, J. Pisharath, W. Liao, G. Memik, and A. Choudhary. Performance characterization of scalable data mining algorithms. In Proc. of the International Conference on Parallel and Distributed Computing and Systems, 2004.
10. M. Norman, J. Shalf, S. Levy, and G. Daues. Diving deep: Data-management and visualization strategies for adaptive mesh refinement simulations. Computing in Science and Engg., 1(4):36-47, 1999.
11. U. of Washington N-Body Shop. Smooth. http://www-hpcc.astro.Washington. edu/tools/smooth.html.
12. M. Thoennes and C. Weems. Exploration of the performance of a data mining application via hardware based monitoring. The Journal of Supercomputing, 26(1):25-42, 2003.
13. Q. Zhang, R. Chamberlain, R. Indeck, B. West, and J. White. Massively parallel data mining using reconfigurable hardware: Approximate string matching. In Proc. of the International Parallel and Distributed Processing Symposium, 2004.