Methods and problems of communication in usual networks
P Fraigniaud, E Lazard - Discrete Applied Mathematics, 1994 - Elsevier
This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …
Scheduling time-constrained communication in linear networks
M Adler, RK Sitaraman, AL Rosenberg… - Proceedings of the tenth …, 1998 - dl.acm.org
We study the problem of centrally scheduling multiple messages in a linear network, when
each message has both a release time and a deadline. We show that the problem of …
each message has both a release time and a deadline. We show that the problem of …
[PDF][PDF] Time-constrained scheduling of weighted packets on trees and meshes
M Adler, S Khanna, R Rajaraman… - Proceedings of the …, 1999 - dl.acm.org
The time-constrained packet routing problem is to schedule a set of packets to be routed
through a multi-node network, where every packet has a source and a destination (as in …
through a multi-node network, where every packet has a source and a destination (as in …
Scheduling time-constrained communication in linear networks
Adler, Sitaraman, Unger - Theory of Computing Systems, 2002 - Springer
We study the problem of centrally scheduling multiple messages in a linear network, when
each message has both a release time and a deadline. We show that the problem of …
each message has both a release time and a deadline. We show that the problem of …
Scattering and gathering messages in networks of processors
The operations of scattering and gathering in a network of processors involve one processor
of the network (P/sub 0/) communicating with all other processors. In scattering, P/sub …
of the network (P/sub 0/) communicating with all other processors. In scattering, P/sub …
Precedence-constrained task allocation onto point-to-point networks for pipelined execution
The problem of scheduling directed acyclic task flow graphs to multiprocessor systems using
point-to-point networks is examined. An environment where the application has a strict …
point-to-point networks is examined. An environment where the application has a strict …
Optimal upward planarity testing of single-source digraphs
A directed graph is upward planar if it has a planar drawing such that all the edges are
monotone with respect to the vertical direction. Testing upward planarity and constructing …
monotone with respect to the vertical direction. Testing upward planarity and constructing …
O (Congestion+ Dilation) hot-potato routing on leveled networks
C Busch - Proceedings of the fourteenth annual ACM symposium …, 2002 - dl.acm.org
We study packet routing problems, in which we route a set of N packets on preselected
paths with congestion C and dilation D. For store-and-forward routing, in which nodes have …
paths with congestion C and dilation D. For store-and-forward routing, in which nodes have …
Modeling parallel bandwidth: Local vs. global restrictions
M Adler, PB Gibbons, V Ramachandran… - Proceedings of the ninth …, 1997 - dl.acm.org
Recently there has been an increasing interest in models of parallel computation that
account for the bandwidth limitations in communication networks. Some models (eg, BSP …
account for the bandwidth limitations in communication networks. Some models (eg, BSP …
Nearly tight bounds for wormhole routing
A Ranade, S Schleimer… - Proceedings 35th Annual …, 1994 - ieeexplore.ieee.org
We present nearly tight bounds for wormhole muting on Butterfly networks which indicate it
is fundamentally different from store-and-forward packet routing. For instance, consider the …
is fundamentally different from store-and-forward packet routing. For instance, consider the …