Document Type
Report
Date
9-1992
Embargo Period
5-7-2012
Keywords
Loosely synchronous communication, node contention, non-uniform message size, personalized communications, runtime scheduling, static scheduling
Language
English
Disciplines
Computer Sciences
Description/Abstract
In this paper we present several algorithms for all-too-many personalized communications which avoid node contention.
Recommended Citation
Ranka, Sanjay and Wang, Jhy-Chun, "All-to-Many Communication Avoiding Node Contention" (1992). Electrical Engineering and Computer Science Technical Reports. Paper 165.
http://surface.syr.edu/eecs_techreports/165
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-92-20