Scheduling problems for a class of parallel distributed systems

Parallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important function of parallel distributed systems is broadcasting to deliver data over an entire system. Multicasting is an expanded function of broadcasting. Broadcast/multicast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a delivering procedure that completes the processing in a short time. There have been many approaches to the minimum broadcast time problem, aiming at the optimal delivering procedure. In this paper, we consider the minimum broadcast/multicast time problem for a parallel distributed system whose topology can be represented by a subclass of split graphs.