SIGN IN
SIGN UP
Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version)
Full Text:
PDF
Buy this Article
Authors:
David Bernstein
Dept. of Electrical Engineering, Technion - Israel Institute of Technology, Haifa 32000, ISRAEL
Ron Y. Pinter
IBM Israel Scientific Center, Technion City, Haifa 32000, ISRAEL
Michael Rodeh
IBM Israel Scientific Center, Technion City, Haifa 32000, ISRAEL
Published in:
· Proceeding
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pages 325-333
ACM
New York, NY
, USA
©1985
table of contents
ISBN:0-89791-147-4
doi>
10.1145/318593.318662
1985 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 202
· Citation Count: 6
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
algorithms
correctness proofs
design
languages
parallelism and concurrency
performance
sequencing and scheduling
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