DECOMPOSITION OF AN APPLICATION ON A BUS ARCHITECTURE

A bus oriented multiprocessor contains one bus system to which all the processors are connected. There are one master and several slaves. Th e most serious problem is the bus bottleneck. Ar a time, only one slav e call establish communications through the bus with the master. A sec ond problem is to maintain busy each processor. We suppose we have to execute a task which uses a big amount of data and which can be split into several independent processes. Moreover, the processing time of e ach process is a linear function of its amount of data. The objective is to minimize the makespan by taking into account communication durat ions and processing times. At first, the properties of optimal schedul es are studied. Next, two particular cases with with computation times proportional to their amounts of data are considered. In the first ca se, we have one slave and several processes sent to it. So, the proces sor can compute in masked time after the reception of the first amount of data. In the second case, we have two slaves and only one process is sent to both of therm. Finally, we remark that this approach can be generated.