Mario Blaum, Jehoshua Bruck, Gustavo D. Pifarre, and Jorge L. Sanz. On Optimal Placements of Processors in Fault-Tolerant Tori Networks. preprint, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Lower Bounds on Communication Loads and Optimal Placements.. - Cemil Azizoglu And (1998) (3 citations) (Correct)
....d =2) Dividing by the bisection bandwidth, there exists an edge in the bisection with a load k d 1 =8. This means that unlike multistage networks, the maximum load on a link is not linear in the number of processors injecting messages into the network. To alleviate this problem, Blaum et al. [1, 2] have proposed partially populated tori. In this model, processors are attached to a (relatively small) subset of nodes in the network, called a placement. A routing algorithm which utilizes shortest paths is specified together with the placement. An optimal placement is a placement that achieves ....
.... b P are equivalent. 2.1. Problem Definition Our aim is to find placements and associated routing algorithms in the d dimensional k torus T k d that have linear message load (in number of processors in the placement) on edges under the complete exchange scenario. For d = 2; 3, Blaum et al. [1, 2] have investigated placements with k d Gamma1 processors. Evidently, placements with provably maximum possible number of processors are desirable. This raises another important question which we shall address: what is the maximum number of processors a placement could have on T k d without ....
[Article contains additional citation context not shown here]
Mario Blaum, Jehoshua Bruck, Gustavo D. Pifarre, and Jorge L. Sanz. On Optimal Placements of Processors in Fault-Tolerant Tori Networks. preprint, 1997.
Lower Bounds on Communication Loads and Optimal Placements.. - Cemil Azizoglu And (1998) (3 citations) (Correct)
....d =2#. Dividing by the bisection bandwidth, there exists an edge in the bisection with a load # k d 1 =8. This means that unlike multistage networks, the maximum load on a link is not linear in the number of processors injecting messages into the network. To alleviate this problem, Blaum et al. [1, 2] have proposed partially populated tori. In this model, processors are attached to a (relatively small) subset of nodes in the network, called a placement. A routing algorithm which utilizes shortest paths is specified together with the placement. An optimal placement is a placement that achieves ....
.... b P are equivalent. 2.1. Problem Definition Our aim is to find placements and associated routing algorithms in the d dimensional k torus T k d that have linear message load (in number of processors in the placement) on edges under the complete exchange scenario. For d =2; 3, Blaum et al. [1, 2] have investigated placements with k d,1 processors. Evidently, placements with provably maximum possible number of processors are desirable. This raises another important question which we shall address: what is the maximum number of processors a placement could have on T k d without ....
[Article contains additional citation context not shown here]
Mario Blaum, Jehoshua Bruck, Gustavo D. Pifarre, and Jorge L. Sanz. On Optimal Placements of Processors in Fault-Tolerant Tori Networks. preprint, 1997.
Lower Bounds on Communication Loads and Optimal Placements.. - Azizoglu, Egecioglu (1998) (3 citations) (Correct)
.... performance [3] The throughput of an interconnection network is in turn bounded by its bisection width, the minimum number of edges that must be removed in order to split the network into two parts each with about equal number of processors [8] Here, following Blaum, Bruck, Pifarr e, and Sanz [3, 4], we consider the behavior of torus networks with bidirectional links under heavy communication load. We assume that the communication latency is kept minimum by routing the messages through only shortest (minimal length) paths. In particular, we are interested in the scenario where every ....
....by the bisection bandwidth, we find that there must exist an edge in the bisection with a load k d 1 =8. This means that unlike multistage networks, the maximum load on a link is not linear in the number of processors injecting messages into the network. To alleviate this problem, Blaum et al. [3, 4] have proposed partially populated tori . In this model, the underlying network is torodial, but the nodes do not all inject messages into the network. We think of the processors as attached to a (relatively small) subset of nodes (called a placement) while the other nodes are left as routing ....
[Article contains additional citation context not shown here]
Mario Blaum, Jehoshua Bruck, Gustavo D. Pifarr'e, and Jorge L. Sanz. On Optimal Placements of Processors in Fault-Tolerant Tori Networks. preprint, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC