With all the recent advances in programmability and "useful" precision in GPU's, are there other classes of problems that have become/are becoming computable by GPU:s? Except for the holy grail of "renderman-class" problems of course. We're doing a lot of computational stuff at work, so I find this quite interesting; the gflops/processor disparity between cpus and gpus are quite big. Obviously as gpu capabilities become "wider" the throughput/processor becomes smaller though.
What I guess I'm asking is this:
Are there any "classic" class(es) of problems solvable with vertex/pixel shaders (any version)?
Is any research going on in this area?
What are the major obstacles for this to happen (computational capabilities)?
I'm not personally working with computations, so I'm sure there could be a few persons around here who have more insight into this than me.
Hope this hasn't been asked before.
thanks
What I guess I'm asking is this:
Are there any "classic" class(es) of problems solvable with vertex/pixel shaders (any version)?
Is any research going on in this area?
What are the major obstacles for this to happen (computational capabilities)?
I'm not personally working with computations, so I'm sure there could be a few persons around here who have more insight into this than me.
Hope this hasn't been asked before.
thanks