  We give an elementary statistical analysis of two High Performance Computing
issues, processor cache mapping and network port mapping. In both cases we find
that, as in the birthday paradox, random assignment leads to more frequent
coincidences than one expects a priori. Since these correspond to contention
for limited resources, this phenomenon has important consequences for
performance.
