Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A hardware support mechanism for scheduling resources in a parallel machine environment
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
A multiaccess bus arbitration scheme for VLSI-densed distributed systems
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
| Hi-index | 0.01 |
In this paper, we have studied the interconnection of resources to multiprocessors and the distributed scheduling of these resources. Three different classes of interconnection networks have been investigated; namely, single shared bus, multiple shared buses, and networks with logarithmic delays such as the cube and Omega networks. For a given network, the resource mapping problem entails the search of one (or more) of the free resources which can be connected to each requesting processor. To prevent the bottleneck of sequential scheduling, the type(s) and number(s) of resources desired by a processor are given to the network and it is the responsibility of the network to find the necessary resources and connect them to the processor. The addressing mechanism is, thus, distributed in the network. This is a generalization of conventional interconnection networks with routing tags in which all the resources are of different types.