SIGN IN
SIGN UP
Selecting tile shape for minimal execution time
Full Text:
Pdf
Buy this Article
Authors:
Karin Högstedt
Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA
Larry Carter
San Diego Supercomputing Center and Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA
Jeanne Ferrante
Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA
Published in:
· Proceeding
SPAA '99
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Pages 201 - 211
ACM
New York, NY
, USA
©1999
table of contents
ISBN:1-58113-124-0
doi>
10.1145/305619.305641
1999 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Downloads (cumulative): 201
· Citation Count: 22
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
general
graph theory
parallel architectures
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder