mirror-github-bspeice/cuburn
1
0
Fork 0
mirror of https://github.com/stevenrobertson/cuburn.git synced 2025-07-01 05:46:36 -04:00
Code Issues Actions Packages Projects Releases Wiki Activity

Experiments with larger CTAs for IterThread

Browse Source
This commit is contained in:
Steven Robertson
2010-09-12 02:01:03 -04:00
parent e2b1c161cf
commit c13f6a06cf
3 changed files with 36 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
helpers/shuf.py
View File

@ -280,6 +280,21 @@ def shuf_better(a):
print ' With better shuffle: %g' % monte(make(), shuf_better, 1000, 32)
print 'For 32*16:'
t = 512
print ' With no shuffle: %g' % monte(make(), shuf_none, 1000, 32)
print ' With full shuffle: %g' % monte(make(), shuf_all, 1000, 32)
print ' With simple shuffle: %g' % monte(make(), shuf_simple, 1000, 32)
print ' With better shuffle: %g' % monte(make(), shuf_better, 1000, 32)
print 'For 32*32:'
t = 1024
print ' With no shuffle: %g' % monte(make(), shuf_none, 1000, 32)
print ' With full shuffle: %g' % monte(make(), shuf_all, 1000, 32)
print ' With simple shuffle: %g' % monte(make(), shuf_simple, 1000, 32)
print ' With better shuffle: %g' % monte(make(), shuf_better, 1000, 32)
print """
Okay I actually intended this to be a blog post but I started writing before
having done any of the math. Actually the simple shuffle looks like it's