Scheduling problems for a class of parallel distributed systems

Author

Tamura, Hiroshi ; Tasaki, Futoshi ; Sengoku, Masakazu ; Shinoda, Shoji

Author_Institution

Niigata Inst. of Technol., Kashiwazaki, Japan

fYear

2005

fDate

23-26 May 2005

Firstpage

176

Abstract

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.

Keywords

LAN interconnection; broadcast channels; graph theory; minimisation; multicast communication; multiprocessing systems; parallel processing; wide area networks; LAN connected multiple computers; WAN; broadcasting; minimum broadcast time problem; multicasting; parallel distributed system scheduling; split graphs; system topology; Broadcasting; Computational complexity; Concurrent computing; Costs; Distributed computing; Local area networks; Network topology; Processor scheduling; Research and development; Wide area networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Print_ISBN

0-7803-8834-8

Type

conf

DOI

10.1109/ISCAS.2005.1464553

Filename

1464553