ACM Home Page
Please provide us with feedback. Feedback
Efficient measurement of data flow enabling communication-aware parallelisation
Full text PdfPdf (489 KB)
Source ACM International Conference Proceeding Series; Vol. 356 archive
Proceedings of the 1st international forum on Next-generation multicore/manycore technologies table of contents
Cairo, Egypt
SESSION: Performance modelling and analysis table of contents
Article No. 6  
Year of Publication: 2008
ISBN:978-1-60558-407-2
Authors
Peter Bertels  Ghent University, Gent, Belgium
Wim Heirman  Ghent University, Gent, Belgium
Dirk Stroobandt  Ghent University, Gent, Belgium
Sponsors
IBM : IBM
: IBM Center for Advanced Studies, Cairo, Egypt
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 44,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1463768.1463776
What is a DOI?

ABSTRACT

As multicore chips scale to higher processor counts, communication between cores becomes more and more important. Indeed, when a single application is split up among multiple cores, which are connected through a relatively slow network, the amount of communication that is required will have an essential effect on performance. Therefore, if the application can be partitioned in such a way that communication between threads is minimised, or that placement on non-uniform networks can be performed with regards to communication, a significant performance boost can be obtained. But to do this effectively, communication streams inside the application must be known. In this paper, we introduce a profiling tool for Java that can measure data flows between methods. It constructs a communication graph, which combines a traditional call graph with data flow information.

The overhead of profiling is brought down by a factor of 15 through the use of reservoir sampling. We prove that this can be done with a limited decrease in accuracy.

This way, we can quickly estimate communication flows, which forms the critical information that allows an efficient communication-aware parallelisation to be made.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
N. Nethercote and A. Mycroft. Redux: A dynamic dataflow tracer. Electronic Notes in Theoretical Computer Science, 89(2):1--22, October 2003.
 
4
SPEC JVM Client98 Suite. Industry-standard benchmark for measuring Java Virtual Machine performance. In http://www.spec.org/, USA, 1998.
5
 
6
R. E. Walpole and R. H. Myers. Probability and Statistics for Engineers and Scientists. Prentice Hall, 1993.
 
7

Collaborative Colleagues:
Peter Bertels: colleagues
Wim Heirman: colleagues
Dirk Stroobandt: colleagues