[math-fun] Wanted: examples of potentially 'unbalanced' parallelisable computational tasks
A colleague is looking for examples of sizeable computational tasks which can be parallelized, but where the size of the parallel tasks are not the same and may not be easily sizead beforehand. The idea is that decisions about splitting tasks will be taken at runtime on the basis of whatever information becomes available. Contributions welcomed via my email address at www.tinyurl.com/law6k Thank you - Guy
On Sun, 9 Sep 2007, Guy Haworth wrote:
A colleague is looking for examples of sizeable computational tasks which can be parallelized, but where the size of the parallel tasks are not the same and may not be easily sizead beforehand.
Web search, perhaps? The naive approach is to retrieve then intersect the sets of documents matching each individual word, but that's rather... inefficient... for searches like "item 1839623496". Automatic algorithm analysis (model checking and the like) where you can break code up into independent chunks, some of which are much harder than others to analyze, might also work.
participants (2)
-
Guy Haworth -
Jason