Contest Ideas Post Your Contest Ideas!
  1 / 2    
Everyone post up your contest ideas here...I missed the last contest, and I would like to get in the next one...only it seems there hasn't been another one yet. Post your best contest ideas here, and maybe we can get the next challenge going!

My Ideas:
- cuLAPACK -- LAPACK wrapper for cuBLAS (the standard LAPACK library is mostly implemented through calls to BLAS, so this shouldn't be too difficult)

- Object-oriented wrappers for CUDA -- Provide object-oriented wrappers for the cuda libraries so that "less-advanced" developers can make use of the library without having to get into heavy C coding. Popular choices might be Python, C++, C#/VB.NET, Java.

- x264 Encoder/Decoder -- Even though nVidia wants to shy away from codec coding contests (as they target only a small audience of developers), building an h264 encoder/decoder would be a great help to many people that transcode videos (to their iPods, for example).

- Game Engine -- Implement an AI engine for a game (e.g Othello, Chess, Checkers, Poker, FPS Bots, etc.) that uses the multi-processing capabilities of CUDA. Developers will need to submit a working game for this contest; any type of game may be submitted, as long as it makes use of the CUDA engine.

- Database Processing -- Implement an extension to a database that will use CUDA to do parallel processing (i.e. searches, aggregations, etc.). An alternative idea is to use SQLite (written in C, and in the public domain), keeping the code that reads/writes files to disk, but otherwise implement the rest of the functionality in CUDA-based code (so that the database essentially runs from the GPU).

- CIL Translator -- Implement a "translator" (JIT compiler?) for CUDA so that kernels can be written in .NET languages (C#, VB.NET, F#, etc.). This might done by completing a partial port of the Mono library. If this could be implemented, then a follow-up project may be to implement the PFX (Parallel FX) library to let any .NET developer easily write concurrent/parallel programs.

- Virus Scan -- I read an article about how AMD/ATI and an anti-virus company used GPGPU calculations to speed up virus scanning...perhaps someone could implement the same technology on an nVidia card?
Article: [url="http://www.theinquirer.net/en/inquirer/news/2007/09/12/gpgpu-drastically-accelerates-anti-virus-software"]http://www.theinquirer.net/en/inquirer/new...-virus-software[/url]
Everyone post up your contest ideas here...I missed the last contest, and I would like to get in the next one...only it seems there hasn't been another one yet. Post your best contest ideas here, and maybe we can get the next challenge going!



My Ideas:

- cuLAPACK -- LAPACK wrapper for cuBLAS (the standard LAPACK library is mostly implemented through calls to BLAS, so this shouldn't be too difficult)



- Object-oriented wrappers for CUDA -- Provide object-oriented wrappers for the cuda libraries so that "less-advanced" developers can make use of the library without having to get into heavy C coding. Popular choices might be Python, C++, C#/VB.NET, Java.



- x264 Encoder/Decoder -- Even though nVidia wants to shy away from codec coding contests (as they target only a small audience of developers), building an h264 encoder/decoder would be a great help to many people that transcode videos (to their iPods, for example).



- Game Engine -- Implement an AI engine for a game (e.g Othello, Chess, Checkers, Poker, FPS Bots, etc.) that uses the multi-processing capabilities of CUDA. Developers will need to submit a working game for this contest; any type of game may be submitted, as long as it makes use of the CUDA engine.



- Database Processing -- Implement an extension to a database that will use CUDA to do parallel processing (i.e. searches, aggregations, etc.). An alternative idea is to use SQLite (written in C, and in the public domain), keeping the code that reads/writes files to disk, but otherwise implement the rest of the functionality in CUDA-based code (so that the database essentially runs from the GPU).



- CIL Translator -- Implement a "translator" (JIT compiler?) for CUDA so that kernels can be written in .NET languages (C#, VB.NET, F#, etc.). This might done by completing a partial port of the Mono library. If this could be implemented, then a follow-up project may be to implement the PFX (Parallel FX) library to let any .NET developer easily write concurrent/parallel programs.



- Virus Scan -- I read an article about how AMD/ATI and an anti-virus company used GPGPU calculations to speed up virus scanning...perhaps someone could implement the same technology on an nVidia card?

Article: http://www.theinquirer.net/en/inquirer/new...-virus-software

GPU.NET: Write your GPU code in 100% pure C#.

Learn more at tidepowerd.com, and download a free 30-day trial of GPU.NET. Follow @tidepowerd for release updates.



GPU.NET example projects

#1
Posted 09/01/2008 02:08 PM   
How about something simple?

Like the fastest Game of Life implementation on a 16384x16384 matrix... ;)

Christian
How about something simple?



Like the fastest Game of Life implementation on a 16384x16384 matrix... ;)



Christian

#2
Posted 09/01/2008 06:45 PM   
[b]Steganography decoding [/b]- This can help Internet ISPs to scan picture attachments for coded information.
Steganography decoding - This can help Internet ISPs to scan picture attachments for coded information.

Ignorance Rules; Knowledge Liberates!

#3
Posted 09/02/2008 08:45 AM   
[quote name='cbuchner1' date='Sep 1 2008, 02:45 PM']How about something simple?

Like the fastest Game of Life implementation on a 16384x16384 matrix... ;)

Christian
[right][snapback]434081[/snapback][/right]
[/quote]Yeah... these aren't so much contests as "really big things that would cool if someone got around and did."

I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.
[quote name='cbuchner1' date='Sep 1 2008, 02:45 PM']How about something simple?



Like the fastest Game of Life implementation on a 16384x16384 matrix... ;)



Christian

[snapback]434081[/snapback]


Yeah... these aren't so much contests as "really big things that would cool if someone got around and did."



I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.

#4
Posted 09/02/2008 07:37 PM   
[quote name='alex_dubinsky' date='Sep 2 2008, 02:37 PM']Yeah... these aren't so much contests as "really big things that would cool if someone got around and did."

I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.
[right][snapback]434531[/snapback][/right]
[/quote]

[quote]- Game Engine -- Implement an AI engine for a game (e.g Othello, Chess, Checkers, Poker, FPS Bots, etc.) that uses the multi-processing capabilities of CUDA. Developers will need to submit a working game for this contest; any type of game may be submitted, as long as it makes use of the CUDA engine.
[/quote]

Why not have nVidia pick a game and set up an internet game server...then we could write AIs using CUDA to compete and see who wins at the end of the month...
[quote name='alex_dubinsky' date='Sep 2 2008, 02:37 PM']Yeah... these aren't so much contests as "really big things that would cool if someone got around and did."



I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.

[snapback]434531[/snapback]






- Game Engine -- Implement an AI engine for a game (e.g Othello, Chess, Checkers, Poker, FPS Bots, etc.) that uses the multi-processing capabilities of CUDA. Developers will need to submit a working game for this contest; any type of game may be submitted, as long as it makes use of the CUDA engine.





Why not have nVidia pick a game and set up an internet game server...then we could write AIs using CUDA to compete and see who wins at the end of the month...

GPU.NET: Write your GPU code in 100% pure C#.

Learn more at tidepowerd.com, and download a free 30-day trial of GPU.NET. Follow @tidepowerd for release updates.



GPU.NET example projects

#5
Posted 09/02/2008 08:01 PM   
How about a simple sort routine?
You're fed 5M floats in device memory, you have to write them into a new array in sorted order. There could be many "challenge" arrays (some random, some almost-sorted, some with weird clumps). Total time to sort them all correctly wins.

This is an "easy" problem to understand and lets people get started quickly. It's straightforward and not hard to start coding reasonable solutions.

This is a "hard" problem in that there's many many strategies and the winner will likely be a very clever coder who knows how to use local memory caches, effective partitioning, and knowledge of sort algorithms.
The gap between winner and second place will likely be very close.

This is a USEFUL problem in that the winning code would be something other CUDA users or implementers could learn from or use as a library.


The negative is that it's not an impressive application, it can't be used by Nvidia marketing as a cool web graphic with a bold "100x speedup!!!!" logo over it.
How about a simple sort routine?

You're fed 5M floats in device memory, you have to write them into a new array in sorted order. There could be many "challenge" arrays (some random, some almost-sorted, some with weird clumps). Total time to sort them all correctly wins.



This is an "easy" problem to understand and lets people get started quickly. It's straightforward and not hard to start coding reasonable solutions.



This is a "hard" problem in that there's many many strategies and the winner will likely be a very clever coder who knows how to use local memory caches, effective partitioning, and knowledge of sort algorithms.

The gap between winner and second place will likely be very close.



This is a USEFUL problem in that the winning code would be something other CUDA users or implementers could learn from or use as a library.





The negative is that it's not an impressive application, it can't be used by Nvidia marketing as a cool web graphic with a bold "100x speedup!!!!" logo over it.

#6
Posted 09/04/2008 05:13 PM   
[quote name='alex_dubinsky' date='Sep 2 2008, 11:37 AM']I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.
[right][snapback]434531[/snapback][/right]
[/quote]

You'd be surprised how many ways there are to optimize a cellular automaton like Game of Life.
There are some variants using bit packed representations of the matrix, applying SSE streaming operations for computing the next states.

On a GPU you're likely more memory limited than compute limited, hence efficient packing of the cell state would be a requirement to win the challenge.

There are also some interesting approaches using giant Hash tables for transitioning whole blocks of cells to future states. These are the fastest implementations known to date - but would they map well to a GPU? I doubt it.

Christian
[quote name='alex_dubinsky' date='Sep 2 2008, 11:37 AM']I'm thinking a contest is a simple (but not too simple) algorithm that you optimize the crap out of, and compare who's the 1337est optimizer. By definition, simply getting it to work should be the easy part.

[snapback]434531[/snapback]






You'd be surprised how many ways there are to optimize a cellular automaton like Game of Life.

There are some variants using bit packed representations of the matrix, applying SSE streaming operations for computing the next states.



On a GPU you're likely more memory limited than compute limited, hence efficient packing of the cell state would be a requirement to win the challenge.



There are also some interesting approaches using giant Hash tables for transitioning whole blocks of cells to future states. These are the fastest implementations known to date - but would they map well to a GPU? I doubt it.



Christian

#7
Posted 09/06/2008 12:27 PM   
Yeah, game of life sounds cool. I'd love to do it, especially since I've never taken a look at how the game of life works and it's great to explore something new.

Man, i'm really itching to do a contest. I'm a bit apprehensive because I know vvolkov will be a formidable opponent, but I'm willing to take even him on ;-)
Yeah, game of life sounds cool. I'd love to do it, especially since I've never taken a look at how the game of life works and it's great to explore something new.



Man, i'm really itching to do a contest. I'm a bit apprehensive because I know vvolkov will be a formidable opponent, but I'm willing to take even him on ;-)

#8
Posted 09/06/2008 06:36 PM   
[b]I am a student of IIT Delhi. I want to participate in this contest. Could you please explain "Database processing on CUDA" problem elaborately?[/b]
I am a student of IIT Delhi. I want to participate in this contest. Could you please explain "Database processing on CUDA" problem elaborately?

#9
Posted 06/20/2009 11:17 AM   
Hi all

I have some cuda programming experience. I made a fire simulation that used Johannes Schmid's sequential implementation and created a parallel implementation, where I parallelized the computations (I am not strong in graphics, so I left that displaying thing to the CPU). I want to continue working on CUDA in my major project. I am interested in x264 encoder/decoder and in that object-oriented wrappers thing. give me some explanation. Also, I am ready to work on something new. I have 1 year that I'll dedicate to working on a major project so I can do a lot. The only problem is that I don't have any good ideas. If someone could give me references to previous work that I could carry on or some new ideas like the ones given on this page, it would be very useful.

that virus scan link doesn't work anymore.

Ashish
Hi all



I have some cuda programming experience. I made a fire simulation that used Johannes Schmid's sequential implementation and created a parallel implementation, where I parallelized the computations (I am not strong in graphics, so I left that displaying thing to the CPU). I want to continue working on CUDA in my major project. I am interested in x264 encoder/decoder and in that object-oriented wrappers thing. give me some explanation. Also, I am ready to work on something new. I have 1 year that I'll dedicate to working on a major project so I can do a lot. The only problem is that I don't have any good ideas. If someone could give me references to previous work that I could carry on or some new ideas like the ones given on this page, it would be very useful.



that virus scan link doesn't work anymore.



Ashish

#10
Posted 06/20/2009 12:01 PM   
Note: - tapas(the guy other than me who posted above) and i are both from iit delhi. sorry for reposting. actually i wanted to edit but ended up making another reply
Note: - tapas(the guy other than me who posted above) and i are both from iit delhi. sorry for reposting. actually i wanted to edit but ended up making another reply

#11
Posted 06/20/2009 12:03 PM   
Contest suggestion:

A CUDA based decoder for color JPEGs (without implementing any fancy options, such as lossless or progressive JPEG). The more functionality performed by CUDA, the better. The winner is the one who decodes a reference JPEG (say, a 4096x4096 pixel behemoth at high quality) the fastest on some standardized CUDA hardware. A bonus contest could involve some smart postprocessing for deblocking of low-bitrate JPEG and judge the visual quality (not processing speed).

The main challenge in this contest is to understand how parallelism might be applied to the decoding of huffman codes (if it is possible at all) To give a good incentive for putting the Huffman decoding on the GPU, one could standardize an Atom based platform (e.g. nVidia ION) for the judging of the contest - here the CPU is particularly weak. ;-)

Motivation: JPEG is reasonably uncomplicated, its basics are commonly taught in computer science and other engineering classes. There are simple JPEG decoders available that might serve as a starting point (and I don't mean the IJG source code).

A jpeg decoder by Pierre Guerrier with modifications by Koen van Eikj: [url="http://www.es.ele.tue.nl/mininoc/doc/pub/mmips_noc.zip"]http://www.es.ele.tue.nl/mininoc/doc/pub/mmips_noc.zip[/url]
(see djpeg_orig folder)
A simple JPEG to BMP converter with Windows GUI based on the above code: [url="http://www.es.ele.tue.nl/~jef/education/5kk53/jpgdrc.zip"]http://www.es.ele.tue.nl/~jef/education/5kk53/jpgdrc.zip[/url]
The JPEG standard (for reference only): [url="http://www.w3.org/Graphics/JPEG/itu-t81.pdf"]http://www.w3.org/Graphics/JPEG/itu-t81.pdf[/url]
U Stanford JPEG encoder+decoder V1.2.1 (mirror): [url="http://ftp.uni-magdeburg.de/aftp/projects/hpux/X11/Graphics/JPEG-1.2.1/"]http://ftp.uni-magdeburg.de/aftp/projects/...ics/JPEG-1.2.1/[/url]
A link to Wikipedia on JPEG: [url="http://en.wikipedia.org/wiki/JPEG"]http://en.wikipedia.org/wiki/JPEG[/url]

Christian
Contest suggestion:



A CUDA based decoder for color JPEGs (without implementing any fancy options, such as lossless or progressive JPEG). The more functionality performed by CUDA, the better. The winner is the one who decodes a reference JPEG (say, a 4096x4096 pixel behemoth at high quality) the fastest on some standardized CUDA hardware. A bonus contest could involve some smart postprocessing for deblocking of low-bitrate JPEG and judge the visual quality (not processing speed).



The main challenge in this contest is to understand how parallelism might be applied to the decoding of huffman codes (if it is possible at all) To give a good incentive for putting the Huffman decoding on the GPU, one could standardize an Atom based platform (e.g. nVidia ION) for the judging of the contest - here the CPU is particularly weak. ;-)



Motivation: JPEG is reasonably uncomplicated, its basics are commonly taught in computer science and other engineering classes. There are simple JPEG decoders available that might serve as a starting point (and I don't mean the IJG source code).



A jpeg decoder by Pierre Guerrier with modifications by Koen van Eikj: http://www.es.ele.tue.nl/mininoc/doc/pub/mmips_noc.zip

(see djpeg_orig folder)

A simple JPEG to BMP converter with Windows GUI based on the above code: http://www.es.ele.tue.nl/~jef/education/5kk53/jpgdrc.zip

The JPEG standard (for reference only): http://www.w3.org/Graphics/JPEG/itu-t81.pdf

U Stanford JPEG encoder+decoder V1.2.1 (mirror): http://ftp.uni-magdeburg.de/aftp/projects/...ics/JPEG-1.2.1/

A link to Wikipedia on JPEG: http://en.wikipedia.org/wiki/JPEG



Christian

#12
Posted 06/30/2009 08:46 PM   
[quote name='cbuchner1' post='436225' date='Sep 6 2008, 05:27 AM']You'd be surprised how many ways there are to optimize a cellular automaton like Game of Life.
There are some variants using bit packed representations of the matrix, applying SSE streaming operations for computing the next states.

On a GPU you're likely more memory limited than compute limited, hence efficient packing of the cell state would be a requirement to win the challenge.

There are also some interesting approaches using giant Hash tables for transitioning whole blocks of cells to future states. These are the fastest implementations known to date - but would they map well to a GPU? I doubt it.[/quote]

I like this idea especially because it's simple enough to make a quick simulator no matter what your skill level is, but the problem has layers of complexity you could dive into (like those hash caches, to detect regions in simple repeating states.)

From the LAME encoder contest, I think it's clear that it has to be easy for people to get started and start playing, and Life's simplicity makes it attractive.
[quote name='cbuchner1' post='436225' date='Sep 6 2008, 05:27 AM']You'd be surprised how many ways there are to optimize a cellular automaton like Game of Life.

There are some variants using bit packed representations of the matrix, applying SSE streaming operations for computing the next states.



On a GPU you're likely more memory limited than compute limited, hence efficient packing of the cell state would be a requirement to win the challenge.



There are also some interesting approaches using giant Hash tables for transitioning whole blocks of cells to future states. These are the fastest implementations known to date - but would they map well to a GPU? I doubt it.



I like this idea especially because it's simple enough to make a quick simulator no matter what your skill level is, but the problem has layers of complexity you could dive into (like those hash caches, to detect regions in simple repeating states.)



From the LAME encoder contest, I think it's clear that it has to be easy for people to get started and start playing, and Life's simplicity makes it attractive.

#13
Posted 07/01/2009 01:47 AM   
Just noticed this: [url="http://software.intel.com/en-us/contests/Threading-Challenge-2009/codecontest.php"]Intel Threading Challenge Contests[/url]

The prizes are all trivial, really just a total of $2000 split among 12 contests, but its interesting to see the flavor of the contests as well as the community that's grown up around them. The different challenges are all pretty simple and fundamental, but not toys: searching, sorting, geometric queries, etc.
There's been 6 contests so far and another 6 to come. All of the contests so far could conceivably be templates for GPU contests as well.
Just noticed this: Intel Threading Challenge Contests



The prizes are all trivial, really just a total of $2000 split among 12 contests, but its interesting to see the flavor of the contests as well as the community that's grown up around them. The different challenges are all pretty simple and fundamental, but not toys: searching, sorting, geometric queries, etc.

There's been 6 contests so far and another 6 to come. All of the contests so far could conceivably be templates for GPU contests as well.

#14
Posted 07/05/2009 06:35 AM   
Another good CUDA challenge would be to build an open source (thus, free) Ogg Theora decoder. I just read a story about how Wikipedia is moving all of their video to this format, but it said that Microsoft/Google/Apple/et al. didn't like it and so they weren't going to be building support for it into their new products. Even if it's not as good as H.264 (like Google claims), it would be useful to have a good encoder/decoder that was free, since Ogg codecs have free licenses as well (good for schools and so forth).
Another good CUDA challenge would be to build an open source (thus, free) Ogg Theora decoder. I just read a story about how Wikipedia is moving all of their video to this format, but it said that Microsoft/Google/Apple/et al. didn't like it and so they weren't going to be building support for it into their new products. Even if it's not as good as H.264 (like Google claims), it would be useful to have a good encoder/decoder that was free, since Ogg codecs have free licenses as well (good for schools and so forth).

GPU.NET: Write your GPU code in 100% pure C#.

Learn more at tidepowerd.com, and download a free 30-day trial of GPU.NET. Follow @tidepowerd for release updates.



GPU.NET example projects

#15
Posted 07/19/2009 04:39 PM   
  1 / 2    
Scroll To Top