Communication Costs in Parallel Machines

The original expression for communication time is valid for congested networks.

The cost of message transfer can be accurately modeled without considering the memory layout.

Temporal locality refers to the preferential use of data elements within relatively close storage locations.

Dimension-ordered routing is used to avoid hot-spots.

Cache thrashing can be avoided by using infinite cache sizes.

The communication time is not affected by the number of messages being sent over a link.

Routing mechanisms are not necessary for interconnection networks.

Prefetching cannot play a role in reducing the overhead associated with data access.

Communication deadlock occurs when process A is trying to send a message to process B, which is not trying to send one to process C.

Invalidate and update operations have no overheads associated with them.