Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
An optimal synchronizer for the hypercube
SIAM Journal on Computing
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
Supporting systolic and memory communication in iWarp
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Scattering and Gathering Messages in Networks of Processors
IEEE Transactions on Computers
Approximation Algorithms for Minimum Time Broadcast
ISTCS'92 Proceedings of the Israel Symposium on Theory of Computing and Systems
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution
IEEE Transactions on Parallel and Distributed Systems
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Efficient bufferless routing on leveled networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 14.98 |
We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a virtual chatting schedule, and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies for producing efficient virtual chatting schedules on a variety of network topologies.