Fast Estimation of Communication Cost for Thread Mapping in Computation Grids Using SVD

Threads migration is performed in parallel programs in order to achieve communication minimization and efficient performance. Since the communication cost of the DSM system have to be measured through the calculation of type-sharing degree between threads, the cost of calculating such metric depends on the problem size of the application programs. The time complexity of calculating the communication costs caused by data sharing between m threads is O(m2n) while n is the number of pages shared by a pair of threads. This study proposed a fast estimation method based on the singular value decomposition (SVD) that could greatly reduce the amount of time required to calculate the type-sharing degree between thread pairs. Experimental results showed that this fast estimation algorithm provide a good solution toward a efficient way to improve the performance of thread migration on grid applications.

[1]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[2]  Heikki Mannila,et al.  Random projection in dimensionality reduction: applications to image and text data , 2001, KDD '01.

[3]  Jyh-Biau Chang,et al.  Teamster-G: a grid-enabled software DSM system , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[4]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[5]  Dmitriy Fradkin,et al.  Experiments with random projections for machine learning , 2003, KDD '03.

[6]  Peter J. Keleher,et al.  Active correlation tracking , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[7]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1986, PODC '86.

[8]  Yolanda Gil,et al.  Pegasus and the Pulsar Search: From Metadata to Execution on the Grid , 2003, PPAM.

[9]  Peter J. Keleher,et al.  Thread migration and communication minimization in DSM systems , 1999 .

[10]  Michael Allen,et al.  Parallel programming: techniques and applications using networked workstations and parallel computers , 1998 .

[11]  Ce-Kuen Shieh,et al.  Distinguishing sharing types to minimize communication in software distributed shared memory systems , 2000, J. Syst. Softw..