🚀 go-pugleaf

   Does anyone know of any papers that characterize realistic
communication patterns in message-passing systems? In particular,
how often are various communication constructs (such as many-to-one,
one-to-many, and others) used over a wide range of applications?
 
   I am looking at non-uniform traffic patterns on point-to-point,
message-passing networks (such as k-ary n-cubes).  The shared-memory
community has models of non-uniform traffic in terms of a ``hot-spot''
memory, that can cause congestion trees in multistage interconnection
networks.  It seems that a ``hot'' node (or set of nodes) in a message
passing environment (or a distributed shared memory environment) would
be analogous.
 
   Any thoughts/references?
 
   I do have one reference ("Hot-Spot Contention in Binary Hypercube
Networks," by Dandamudi and Eager, IEEE TOC, Feb. 1992, pp. 239-244).
 
   Thanks.
 
-- Jennifer
   jrexford@eecs.umich.edu