The Community for Technology Leaders
Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003) (1999)
Austin, Texas
May 31, 1999 to June 4, 1999
ISBN: 0-7695-0222-9
pp: 0324
Kritchal Thitikamol , University of Maryland at College Park
Peter J. Keleher , University of Maryland at College Park
We describe methods of identifying and exploiting sharing patterns in multi-threaded DSM applications. Active correlation tracking is used to determine the affinity, or amount of sharing, in pairs of threads. Thread affinities are combined to create correlation maps, which summarize sharing between all pairs of threads in the application.Correlation maps can be used in two ways. First, they can be used as an aid for performance tuning, Second, they can be used to estimate the impact on communication requirements of reconfiguring running applications through thread migration. Thread migration provides a way of tuning applications for which sharing information is not known a priori, and a means of adapting to dynamic algorithms or environments.We show that i) accurate thread affinities can be obtained without multiple rounds of migration, ii) thread affinities lead to good approximations of application communication requirements, iii) simple heuristics can use thread affinities to efficiently approximate optimal mappings of threads to nodes, and iv) good placement is essential for high performance.
DSM, scheduling, multi-threading.

P. J. Keleher and K. Thitikamol, "Active Correlation Tracking," 2013 IEEE 33rd International Conference on Distributed Computing Systems(ICDCS), Austin, Texas, 1999, pp. 0324.
93 ms
(Ver 3.3 (11022016))