Exact analysis of the cache behavior of nested loops
- Author
- CHATTERJEE, Siddhartha1 ; PARKER, Erin1 ; HANLON, Philip J2 ; LEBECK, Alvin R3
[1] Department of Computer Science, The University of North Carolina, Chapel Hill, NC 27599-3175, United States
[2] Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, United States
[3] Department of Computer Science, Duke University, Durham, NC 27708, United States - Conference title
- Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation® (PLDI), Snowbird, Utah, June 20-22, 2001
- Conference name
- Conference on Programming Language Design and Implementation (Snowbird, Utah 2001-06-20)
- Author (monograph)
- Association for Computing Machinery (ACM) ; Special Interest Group on Programming Languages, New York, NY, United States (Funder/Sponsor)
Association for Computing Machinery, New York, NY, United States (Funder/Sponsor) - Source
ACM SIGPLAN notices. 2001, Vol 36, Num 5, pp 286-297 ; ref : 64 ref
- ISSN
- 1523-2867
- Scientific domain
- Computer science
- Publisher
- ACM, Broadway, NY
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Antémémoire Arrangement Calcul symbolique Classification Evaluation performance Hiérarchie mémoire Implantation Modèle dynamique Problème agencement Structure hiérarchisée Transformation programme
- Keyword (en)
- Cache memory Arrangement Symbolic computation Classification Performance evaluation Memory hierarchy Implantation Dynamic model Layout problem Hierarchized structure Program transformation
- Keyword (es)
- Antememoria Arreglo Cálculo simbólico Clasificación Evaluación prestación Jerarquía memoria Implantación Modelo dinámico Problema disposición Estructura jerarquizada Transformación programa
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07C Memory and file management (including protection and security)
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1048189
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1145/381694.378859 
https://dx.doi.org/10.1145/381694.378859
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1145\/381694.378859\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"286\";s:8:\"\u0000*\u0000epage\";s:3:\"297\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHATTERJEE\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Siddhartha\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"PARKER, Erin\";i:1;s:16:\"HANLON, Philip J\";i:2;s:15:\"LEBECK, Alvin R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:137:\"Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation\u00ae (PLDI), Snowbird, Utah, June 20-22, 2001\";s:8:\"\u0000*\u0000title\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:8:\"\u0000*\u0000place\";s:12:\"Broadway, NY\";s:6:\"\u0000*\u0000pub\";s:3:\"ACM\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1145\/381694.378859\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"286\";s:8:\"\u0000*\u0000epage\";s:3:\"297\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHATTERJEE\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Siddhartha\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"PARKER, Erin\";i:1;s:16:\"HANLON, Philip J\";i:2;s:15:\"LEBECK, Alvin R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:137:\"Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation\u00ae (PLDI), Snowbird, Utah, June 20-22, 2001\";s:8:\"\u0000*\u0000title\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:8:\"\u0000*\u0000place\";s:12:\"Broadway, NY\";s:6:\"\u0000*\u0000pub\";s:3:\"ACM\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:21:\"10.1145\/381694.378859\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1145\/381694.378859\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"286\";s:8:\"\u0000*\u0000epage\";s:3:\"297\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHATTERJEE\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Siddhartha\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"PARKER, Erin\";i:1;s:16:\"HANLON, Philip J\";i:2;s:15:\"LEBECK, Alvin R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:137:\"Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation\u00ae (PLDI), Snowbird, Utah, June 20-22, 2001\";s:8:\"\u0000*\u0000title\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:8:\"\u0000*\u0000place\";s:12:\"Broadway, NY\";s:6:\"\u0000*\u0000pub\";s:3:\"ACM\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1145\/381694.378859\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"5\";s:8:\"\u0000*\u0000spage\";s:3:\"286\";s:8:\"\u0000*\u0000epage\";s:3:\"297\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"CHATTERJEE\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Siddhartha\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"PARKER, Erin\";i:1;s:16:\"HANLON, Philip J\";i:2;s:15:\"LEBECK, Alvin R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:137:\"Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation\u00ae (PLDI), Snowbird, Utah, June 20-22, 2001\";s:8:\"\u0000*\u0000title\";s:52:\"Exact analysis of the cache behavior of nested loops\";s:8:\"\u0000*\u0000place\";s:12:\"Broadway, NY\";s:6:\"\u0000*\u0000pub\";s:3:\"ACM\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
