9,514
edits
Compiler Design: Difference between revisions
From dankwiki
→Memory Hierarchy
No edit summary |
|||
| Line 29: | Line 29: | ||
==Memory Hierarchy== | ==Memory Hierarchy== | ||
===Registers | ===Registers=== | ||
* Primary references: Allen/Kennedy ch. 8, Muchnick ch. 16 | * Primary references: Allen/Kennedy ch. 8, Muchnick ch. 16 | ||
| Line 35: | Line 35: | ||
* Primary references: Allen/Kennedy ch. 9, Muchnick ch. 20 | * Primary references: Allen/Kennedy ch. 9, Muchnick ch. 20 | ||
* Loop interchange | * Loop interchange | ||
==See Also== | ==See Also== | ||
* [http://scienceblogs.com/goodmath/2007/10/computing_strongly_connected_c.php Computing Strongly Connected Subgraphs] from [http://scienceblogs.com/goodmath Good Math, Bad Math] | * [http://scienceblogs.com/goodmath/2007/10/computing_strongly_connected_c.php Computing Strongly Connected Subgraphs] from [http://scienceblogs.com/goodmath Good Math, Bad Math] | ||
* The [http://llvm.org/ LLVM] Compiler Infrastructure Project at [http://www.cs.uiuc.edu/ UIUC] | * The [http://llvm.org/ LLVM] Compiler Infrastructure Project at [http://www.cs.uiuc.edu/ UIUC] | ||
