[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-memory connection, and partial bus-memory connection are presented. A type of multiple-bus network, called a partial bus network with K classes, is proposed. Under a nonuniform requesting model called a hierarchical requesting model, the performance of the above multiple-bus networks is analyzed. The costs and fault-tolerant capabilities of each are evaluated and compared with one another. It is shown that the proposed networks are useful in applications requiring high performance and degree of fault tolerance with moderate cost.[[fileno]]2030201030030[[department]]資訊工程學
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
General analytic models for the performance analysis of various unique and redundant path circuit-sw...
The performance of multiple-bus interconnection networks for multiprocessor systems is analyzed, tak...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors analyze the performance of multistage interconnection networks (MINs) for in...
[[abstract]]The authors analyze the performance of multistage interconnection networks (MINs) for in...
Due to the character of the original source materials and the nature of batch digitization, quality ...
. Abstrac t: This paper presents the analysis of a new bus structure, called the hierarchical bus s...
This paper proposes and evaluates a class of interconnection networks, which provide performance com...
Abstract: In order to build large shared-memory multiprocessor systems that take advantage of curren...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
General analytic models for the performance analysis of various unique and redundant path circuit-sw...
The performance of multiple-bus interconnection networks for multiprocessor systems is analyzed, tak...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors analyze the performance of multistage interconnection networks (MINs) for in...
[[abstract]]The authors analyze the performance of multistage interconnection networks (MINs) for in...
Due to the character of the original source materials and the nature of batch digitization, quality ...
. Abstrac t: This paper presents the analysis of a new bus structure, called the hierarchical bus s...
This paper proposes and evaluates a class of interconnection networks, which provide performance com...
Abstract: In order to build large shared-memory multiprocessor systems that take advantage of curren...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
General analytic models for the performance analysis of various unique and redundant path circuit-sw...
The performance of multiple-bus interconnection networks for multiprocessor systems is analyzed, tak...