logoalt Hacker News

thesz • today at 3:57 PM • 0 replies • view on HN

  > without having to figure out the parallelism...
Parallelism can be regular (matrix or tensor operations are examples of that) and irregular (Barnes-Hut as a very simplified example). To extract something like Barnes-Hut from the code with quadratic complexity, one have to make some interesting assumptions. E.g., one has to figure out something.

One may think that regular parallelism is a solved problem, but even nested loops are not always parallelizable without figuring out how to make them to work in parallel.

Then there comes Microsoft Word. Can we make a CPU where Microsoft Word gets executed with maximum IPC achievable? If you do not like MS Word, take a look at Linux Kernel and userland programs as a whole.