Loosely synchronous communication, node contention, non-uniform message size, personalized communications, runtime scheduling, static scheduling
In this paper we present several algorithms for all-too-many personalized communications which avoid node contention.
Ranka, Sanjay and Wang, Jhy-Chun, "All-to-Many Communication Avoiding Node Contention" (1992). Electrical Engineering and Computer Science Technical Reports. Paper 165.