I wonder, have people done research on the parallelizability of different tasks? This is hard in that there obviously different algorithms with different chara

I wonder, have people done research on the parallelizability of different tasks? This is hard in that there obviously different algorithms with different characteristics regarding the same problem where you might tradeoff paralizability for computational difficulty. But there seem to be some domains, like graphics, where million way parallelism aren't uncommon. We tend to think that replacing a O(n) algorithm with an O(n ln(n)) algorithm is a bad idea. But if it lets you spread out your problem over multiple threads it might very well be worth it. Within a certain range the power and silicon required to execute sequentially at a certain speed is, to simplify hugely, a bit more than the square of that speed so there's a lot of potential for improvement. Certainly anything a human brain can do can be done in an embarrassingly parallel way which ought to be of some comfort.