Homogeneous Multiprocessor Research Articles

The performance analysis of the Homogeneous Multiprocessor Proper

Presents the structure and implementation details of a simulator which was written for the homogeneous multiprocessor proper. The homogeneous multiprocessor is a tightly coupled MIMD architecture composed of a number of processing elements and a distributively controlled network of switches, which permits each processor to access the resources of its two immediate neighbours. In addition, a fast local area network permits each processor to communicate with all other processors in a point-to-point or broadcast mode. The results of two simulation experiments which were carried out using the simulator are also presented. The first experiment was designed to test the behaviour of the network of switches under a varying interprocessor communication demand, while the second experiment was designed to obtain a performance measure of the multiprocessor by simulating a distributed algorithm for the calculation of the autocorrelation functions of a given signal.

Generalized worst-case bounds for an homogeneous multiprocessor model with independent memories—Completion time performance criterion

This paper deals with the performance of the Priority-Driven scheduling algorithm, under various preset ordering rules, on a homogeneous multiprocessor computing model with independent memories. The performance criterion used is the completion time of the schedules. For each ordering rule we prove informative worst-case bounds that generalize the ones derived earlier by D.G. Kafura and V.Y. Shen.

On the Structure of the Homogeneous Multiprocessor

The structure of the homogeneous multiprocessor where each processing element owns its local memory and has access to the memory elements of its two immediate neighbors via dypamically created extended buses is discussed. The algorithm that controls the operation of the extended buses is presented and liveness and safeness properties for the algorithm are proven. Finally, potential uses of the homogeneous multiprocessor, in the fields of image processing and neural network simulation are outlined.

Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories

This paper presents the extreme performance of the promising Q.A.D. algorithm, for scheduling independent jobs under few pre-set ordering rules on the examined model, when the mean-flow time is the performance criterion. Further, an algorithm, based on the idea of Q.A.D., with complexity 0(n 2) is introduced that produces schedules with minimum mean-flow time.