Since many distributed-memory machines rely only on point-to-point com- munication between processors, various broadcast operations must be created using this type of primitive. In this paper we consider the fundamental problem of broadcastingk-items from one processor to all the remaining processors on a parallel machine. Using point-to-point communication and the LogP model, we design an algorithm fork-item broadcast whose running time is within an additive constant of the lower bound. We also present an optimal algorithm fork-item broadcast on a variant of LogP.
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence