Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Optimize algorithms for small problem sizes #16

Open
bmerry opened this issue Feb 2, 2012 · 0 comments
Open

Optimize algorithms for small problem sizes #16

bmerry opened this issue Feb 2, 2012 · 0 comments
Assignees
@bmerry
Labels
auto-migrated sourceforge
Milestone
1.6

Comments

@bmerry
Copy link
Owner

bmerry commented Feb 2, 2012

When the number of elements can be held in local memory, it would make sense to do a single-pass solution. For scanning it may also make sense when only a few iterations within a single workgroup are required, rather than suffer the overheads of 3 passes.

Reported by: bmerry

Original Ticket: clogs/tickets/16
@bmerry bmerry self-assigned this May 9, 2018
@bmerry bmerry added this to the 1.6 milestone May 9, 2018
@bmerry bmerry removed the 1.6 label May 9, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@bmerry bmerry

Labels
auto-migrated sourceforge
Projects
None yet
Milestone
1.6
Development

No branches or pull requests
1 participant
@bmerry