High Performance Computing 1
Ideas for dividing work
•Divide
& Conquer
–recursively
partition the data, or the domain, or the task list
–examples:
tree algorithm for N-body problem; multipole; multigrid
–usually
dynamic work assignments