| Commit message (Collapse) | Author | Age |
| |
|
|
|
|
|
|
|
|
| |
Rewrite code in C++.
Remove dependency on GSL.
Modify algorithm; now traverses arrays bottom-up (by splitting the looping region into equal-sized blocks) instead of top-down (splitting the region into a certain number of blocks)
Make multi-threading dynamic
Support SMT (hyper-threading), i.e. threads which share the same cache
|
|
|
|
|
| |
Add a self-test that ensure that all loops cover each grid point
exactly once.
|
|
|
|
|
|
|
|
| |
(Nice idea, but doesn't seem to work right. Maybe only the parameters
need to be chosen differently? But I rather think that a more
intelligent method is necessary.)
darcs-hash:20070826025505-dae7b-ed81bc28a4204d84776d28443be65a995c52699b.gz
|
|
darcs-hash:20070821185122-dae7b-cde121a591484710e62b2b82453ef592d80786e4.gz
|