Sciweavers

262 search results - page 34 / 53
» Tilings as a programming exercise
Sort
View
ICFP
2002
ACM
14 years 9 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
JCP
2008
126views more  JCP 2008»
13 years 9 months ago
Content-Based Computer Simulation of a Networking Course: An Assessment
This paper presents a successful lab simulation experience to teach signal modulation and demodulation concepts in communication and computer networks to computer science and compu...
Giti Javidi, Ehsan Sheybani
ICS
2005
Tsinghua U.
14 years 3 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
PLDI
2003
ACM
14 years 3 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CC
2008
Springer
193views System Software» more  CC 2008»
13 years 12 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...