Non-uniform traffic in message-passing systems

Thread View: comp.arch

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Jennifer Lynn Rexford Wed, 27 Jan 1993 20:46

#12377

Author: Jennifer Lynn Rexford
Date: Wed, 27 Jan 1993 20:46

23 lines
1434 bytes

   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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads