Informatics and computer scienceThe complexity of scheduling for data cache optimization
References (17)
- et al.
Strategies for cache and local memory management by global program transformation
J. Parallel and Distributed Computing
(1988) - et al.
Compilers, Principles, Techniques, and Tools
(1986) - et al.
Computer and Intractability: A Guide to the Theory of NP-Completeness
(1979) Employing register channels for the exploitation of instruction level parallelism
- et al.
Reduction of cache coherence overhead by compiler data layout and loop transformation
- et al.
Scheduling dags for asynchronous multiprocessor execution
IEEE Trans. Parallel and Distributed Computing
(1994) Program optimization for instruction caches
There are more references available in the full text version of this article.
Cited by (4)
Constructive and destructive use of compilers in elliptic curve cryptography
2009, Journal of CryptologyCompiler assisted elliptic curve cryptography
2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Using a light-weighted cache pool to leverage the performance of web picture databases
2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Lookahead scheduling requests for multisize page caching
2001, IEEE Transactions on Computers
Copyright © 1997 Published by Elsevier Inc.