Spreading things out

• If algorithm requires no communication:

  • Spread out processors arbitrarily
  • No speed advantage to reversibility
  • Still, less energy dissipated per op.

• If alg. requires local communication,delay ~ cycle time, N ? N ? N array

  • Irreversible t = ?(N ), reversible t = O(N ).
  • Reversible advantage only O(N )

1/3

1/4

1/12

Previous slide

Next slide

Back to first slide

View graphic version