R.A. Finkel and M.H. Solomon, \Processor interconnection strategies," IEEE Trans. Computers, vol. 29, pp. 360-370, May 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....complexity of the system. A plethora of interconnection network topologies have been described in the research literature. They range from very simple structures such as bus, ring or tree, to more sophisticated ones such as the shu e exchange, hypercube, chordal ring, or the Banyan network [1] [2], 3] Many of these networks were designed to target a particular interconnection requirement or to eciently run speci c applications. There are however many application areas The authors are with the Department of Electrical and Computer Engineering, University of Massachusetts, Amherst MA ....

R.A. Finkel and M.H. Solomon, \Processor interconnection strategies," IEEE Trans. Computers, vol. 29, pp. 360-370, May 1980.

....the degree of the network. It can also be used to study tradeo s among several performance or dependability parameters. A vast literature on interconnection networks exists. Networks such as the hypercube, shu e exchange, Banyan, bus, chordal ring, tree and others, have been extensively studied [8, 9]. However, much less has been reported on the problem of synthesizing a network to meet speci c performance and reliability criteria. In our approach, the designer speci es the performance measures of interest. These may be commonplace measures such as bandwidth, diameter, connectivity, or more ....

R. Finkel and M. Solomon. Processor interconnection strategies. IEEE Trans. Computers, 29:360-370, May 1980.

....if r j 0 (mod 4) and r 6= 8; 24. 2.6 Various Families of Bus Networks In this section we survey various direct constructions of bus networks. Some of these constructions apply only in particular cases such as maximum degree 2, or degree equal to the diameter. For Delta = 2, Finkel and Solomon [34] have proposed two networks, called snowflake bus network and dense snowflake bus network. These networks have r log 2 D processors. A construction method based on hypercube to obtain bus networks of varying degree and bus size is the spanning bus hypercube [56] In an r ary, d dimensional ....

R.A. Finkel and M.H. Solomon. Processor interconnection strategies. IEEE Trans. on Computers, C-29:360--371, 1980.

....a pruning cache implementation in the style of that proposed by Scott and Goodman [9] 3. Examples In trying to come up with examples of topologies we skipped the obvious topologies where our scheme would be an obvious fit. These include trees, snowflakes, dense snowflakes and star topologies [4], the lens [5] and various other topologies. Although these are interesting topologies, we think that they are not mainstream and some of them also give an unfair advantage to our proposals by being so hierarchical in nature. To illustrate our approach we chose two topologies because (1) we ....

Marvin H. Solomon and Raphael A. Finkel, "Processor interconnection strategies," IEEE Transactions on Computers, Vol. C-29, pp. 360-371, May 1980.

....the nodes. Network connectivity [74] is defined as the minimum number of nodes or links that must fail to partition the network into two or more disjoint subnetworks. In other words, network connectivity measures the resilience of a network when one or more components fail. Network diameter [26] is the maximum internode distance in the network. It is analogous to the diameter of a circle (which is the maximum distance between any two points on the circle) Higher dimensional networks normally have a smaller network diameter than lower dimensional networks. The mean internode distance ....

R. A. Finkel and M. H. Solomon, "Processor interconnection strategies," IEEE Trans. on Computers, Vol. C-29, No. 5, pp. 360-371, May 1980.

....routers for a direct network based multiprocessor [17] A packet originates at a source node and is consumed at a destination node. 4 The distance between two nodes is the minimum number of links in any path between the nodes. Network diameter is the maximum internode distance in the network [30]. It is analogous to the diameter of a circle (which is the maximum distance between any two points on the circle) Higher dimensional networks normally have a smaller network diameter than lower dimensional networks. The average distance traveled by a packet is dependent on the application ....

R. A. Finkel and M. H. Solomon, "Processor interconnection strategies," IEEE Trans. on Computers, Vol. C-29, No. 5, pp. 360-371, May 1980.

....routing algorithms for Extended Chordal Rings. 3 The interested reader might be referred to [Agra 78] Adam 82] Agra 83] Bhuy 83] Wu 84] Hwan 84] Ragh 86] Gilo 86] or [Sche 91] which deal all with switching networks; topologies for bus oriented networks can be found in [Agra 86] Fink 80] or [Fink 81] Chapter 2 Network Characteristics est modus in rebus sunt certi denique fines Horaz A convenient model for the interconnection topology of multicomputers is a graph G = V; E) where V is the set of nodes representing the processing elements (PE) in the network and E is the ....

R. A. Finkel and M. H. Solomon. "Processor Interconnection Strategies". IEEE Transactions on Computers, Vol. C-29, pp. 360--371, May 1980.

No context found.

R.A. Finkel and M.H. Solomon, "Processor interconnection strategies," IEEE Trans. Comp., vol. C-29, no. 5, pp. 360-370, May 1980

No context found.

R. A. Finkel and M. H. Solomon, "Processor Interconnection Strategies,"

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