Design of a Bit-sliced network for a shared-memory multiprocessor system:

Abstract: "Packet switching crossbar switches with matching data widths and addressing range will provide the most efficient building blocks for a shared memory multi-processor network, providing the lowest latency consistent with high data throughput and error tolerance for a low device count....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rogers, D. J. (VerfasserIn), Ibbett, R. N. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Edinburgh 1992
Schriftenreihe:University <Edinburgh> / Department of Computer Science: CSR 19
Schlagworte:
Zusammenfassung:Abstract: "Packet switching crossbar switches with matching data widths and addressing range will provide the most efficient building blocks for a shared memory multi-processor network, providing the lowest latency consistent with high data throughput and error tolerance for a low device count. A demonstration device for a 4*4 crossbar switch with 2-bit data paths has been implemented. Results from this show that the pad-bound assumption, inherent in the original argument would be true for a full custom implementation in a sub-micron process. Simulation for the arbitration method used is given, predicting that fairness is only slightly compromised against optimal for the sake of considerable reduction in complexity, if priority is based solely on queue length."
Beschreibung:23 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!