Parallel Multidimensional scaling performance on multicore systems

Proceedings - 4th IEEE International Conference on eScience, eScience 2008

Volumn , Issue , 2008, Pages 695-702

  Bae, Seung Hee ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK DECOMPOSITIONS; BLOCK SIZES; DATA SIZES; GRADIENT DESCENTS; LOAD BALANCES; LOW-DIMENSIONAL SPACES; MULTI CORES; MULTI-CORE SYSTEMS; MULTI-DIMENSIONAL SCALING; NUMBER OF BLOCKS; NUMBER OF THREADS; PARALLEL MATRIX MULTIPLICATIONS; PERFORMANCE COMPARISONS; SPEED-UP FACTORS; TWO-DIMENSIONAL ARRAYS;

DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; TWO DIMENSIONAL;

MACHINE DESIGN;

EID: 62749107651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/eScience.2008.81     Document Type: Conference Paper

References (26)

1. R. C. Agarwal, F. G. Gustavson, and M. Zubair. A high performance matrix multiplication algorithm on a distributed-memory parallel computer, using overlapped communication. IBM Journal of Research and Development, 38(6):673-681, 1994.
2. K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, Berkeley, California, Dec 2006. http://www.eecs.berkeley.edu/Pubs/ TechRpts/2 00 6/EECS-20 0 6-18 3.html.
3. I. Borg and P. J. Groenen. Modern Multidimensional Scaling: Theory and Applications. Springer, New York, NY, U.S.A., 2005.
4. J. Choi, D. W. Walker, and J. J. Dongarra. Pumma: parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency-Practice and Experience, 6(7):543-570, Oct. 1994.
5. G. Chrysanthakopoulos and S. Singh. An asynchronous messaging library for c#. In Proceedings of Workshop on Synchronization and Concurrency in Object-Oriented Language (SCOOL), OOPSLA, San Diego, CA, U.S.A., 2005.
6. J. de Leeuw. Applications of convex analysis to multidimensional scaling. Recent Developments in Statistics, pages 133-145, 1977.
7. J. de Leeuw. Convergence of the majorization method for multidimensional scaling. Journal of Classification, 5(2):163-180, 1988.
8. J. Dongarra, D. Gannon, G. Fox, and K. Kennedy. The impact of multicore on computational science software. CTWatch Quarterly, 3(1), Feb 2007. http://www.ctwatch.org/quarterly/archives/february-2007.
9. J. J. Dongarra and D. W Walker. Software libraries for linear algebra computations on high performance computers. SIAMReview, 37(2):151-180, Jun. 1995.
10. P. Dubey. Recognition, mining and synthesis moves computers to the era of tera. Technology® Intel Magazine, 2005.
11. G. C. Fox. Parallel data mining from multicore to cloudy grids. In International Advanced Research Workshop on High Performance Computing and Grids, HPC2008, Ce-traro, Italy, Jul. 2008.
12. J. Gunnels, C. Lin, G. Morrow, and R. Geijn. A flexible class of parallel matrix multiplication algorithms. In Proceedings of First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (1998IPPS/SPDP '98), pages 110-116, 1998.
13. A. J. Hanson, K. I. Ishkov, and J. H. Ma. Meshview: Visualizing the fourth dimension, 1999. http://www.cs.indiana.edu/~hanson/papers/meshview.pdf.
14. W. J. Heiser and J. de Leeuw. Smacof-1. Technical Report UG-86-02, Department of Data Theory, University of Leiden, Leiden, The Nethelands, 1986.
15. T. Hofmann and J. M. Buhmann. Pairwise data clustering by deterministic annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(1): 1-14, 1997.
16. T. Kohonen. Self-Organizing Maps. Springer-Verlag, Berlin, Germany, 2001.
17. J. B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29(1):1-27, 1964.
18. J. B. Kruskal and M. Wish. Multidimensional Scaling. Sage Publications Inc., Beverly Hills, CA, U.S.A., 1978.
19. J. Richter. Concurrent affairs: Concurrency and coordination runtime. MSDN Magazine, Sep. 2006. http://rasdn.microsoft.com/en-us/magazine/ ccl6355 6.aspx.
20. K. Rose. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of the IEEE, 86(11):2210-2239, 1998.
21. D. Solis. Illustrated C#2005. Apress, Berkely, CA, 2006.
22. H. Sutter. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal, 30(3), 2005.
23. M. Svensén. GTM: The Generative Topographic Mapping. PhD thesis, Neural Computing Research Group, Aston University, Birmingham, U.K., 1998.
24. Y. Takane, F. W. Young, and J. de Leeuw. Nonmetric individual differences multidimensional scaling: an alternating least squares method with optimal scaling features. Psychometrika, 42(1):7-67, 1977.
25. R. A. van de Geijn and J. Watts. Summa: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience, 9(4):255-274, Apr. 1997.
26. W. Vogels. Hpc.net - are cli-based virtual machines suitable for high performance computing? In SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing, page 36, Washington, DC, U.S.A., 2003. IEEE Computer Society.