Example: Performance Impact of Memory Copies

• Assume n bytes sent eagerly (and buffered)

  • s + r n + c n

• Rendezvous, not buffered

  • s + s + (s + r n)

• Rendezvous faster if s < cn/2

  • Assumes no delays in responding to rendezvous control information

Previous slide

Next slide

Back to first slide

View graphic version