ACM Home Page
Please provide us with feedback. Feedback
Compile-time minimisation of load imbalance in loop nests
Full text PdfPdf (997 KB)
Source International Conference on Supercomputing archive
Proceedings of the 11th international conference on Supercomputing table of contents
Vienna, Austria
Pages: 277 - 284  
Year of Publication: 1997
ISBN:0-89791-902-5
Authors
Rizos Sakellariou  Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K.
John R. Gurd  Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K.
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

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

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
A. I. Barvinok. Computing the Volume, Counting Integral Points, and Exponential Sums. Discrete & Computational Geometry, 10-2, 1993, pp. 123-141.
 
2
 
3
F. Bodin, M. O'Boyle. A Compiler Strategy for Shared Virtual Memories. In B. K. Szymanski, B. Sinharoy (Eds.), Languages, Compilers and Run-Time Systems for Scalable Computers, Kluwer Academic Publishers, 1996, pp. 57-69.
 
4
5
 
6
 
7
8
 
9
10
 
11
 
12
 
13
14
 
15
R. Sakellariou. On the Quest for Perfect Load Balance in Loop-Based Parallel Computations. PhD Thesis, Department of Computer Science, University of Manchester, 1996.
 
16
 
17
 
18
19
 
20


Collaborative Colleagues:
Rizos Sakellariou: colleagues
John R. Gurd: colleagues