Geometric Structure of Problems and Computers

Geometric Structure of Problems and Computers

• On some original MPP’s (e.g. hypercubes) one worried about nearest neighbor structure of algorithms so could match geometric structure of computers and problems.
• This became unnecessary and all that matters on most machines today is data locality
  • e.g. on machines like IBM SP-2, on processor and off processor memory access times are very different but there is no difference between the different processors once you go off CPU
• The year 2005 machines seem different as machine geometry seems relevant especially in PIM designs with physical transit time important as clock speeds increase.

Previous slide

Next slide

Back to the first slide

View Graphic Version

6