By Mostafa Abd-El-Barr, Hesham El-Rewini

ISBN-10: 0471467405

ISBN-13: 9780471467403

Computing device structure bargains with the actual configuration, logical constitution, codecs, protocols, and operational sequences for processing information, controlling the configuration, and controlling the operations over a working laptop or computer. It additionally encompasses observe lengths, guide codes, and the interrelationships one of the major components of a working laptop or computer or workforce of desktops. This two-volume set deals a complete insurance of the sphere of machine association and structure.

Show description

Read Online or Download Advanced Computer Architecture and Parallel Processing PDF

Similar computer science books

Download e-book for iPad: Lessons Learned in Software Testing: A Context-Driven by Cem Kaner, James Bach, Bret Pettichord

The world's top software program trying out specialists lend you their knowledge and years of expertise that will help you keep away from the most typical errors in checking out software program. each one lesson is an statement on the topic of software program trying out, via a proof or instance that indicates you the how, whilst, and why of the trying out lesson.

Extra info for Advanced Computer Architecture and Parallel Processing

Example text

A more detailed discussion on assessing the performance of these networks will be given in Chapter 3. 1 Dynamic Networks The Crossbar The cost of the crossbar system can be measured in terms of the number of switching elements (cross points) required inside the crossbar. Recall that for an N Â N crossbar, the network cost, measured in terms of the number of switching points, is N 2. This is because in an N Â N crossbar a cross point is needed at the intersection of every two lines extended horizontally and vertically inside the switch.

In the upper-broadcast setting the upper input is broadcast to both the upper and the lower outputs. In the lower-broadcast the lower input is broadcast to both the upper and the lower outputs. To establish communication between a given input (source) to a given output (destination), data has to be circulated a number of times around the network. A well-known connection pattern for interconnecting the inputs and the outputs of a single-stage network is the Shuffle – Exchange. Two operations are used.

The delay (latency) complexity measured in terms of the average number of nodes that must be traversed to reach from a source node to a destination node is N/2, that is, O(N). The node degree in the linear array is 2, that is, O(1) and the diameter is (N 2 1), that is, O(N). TEAM LinG - Live, Informative, Non-cost and Genuine ! 6 CHAPTER SUMMARY 45 Tree Networks In a tree-connected network, a given node is connected to both its parent node and to its children nodes. In a k-level complete binary tree network, the network cost (complexity) measured in terms of the number of nodes in the network is O(2k ) and the delay (latency) complexity is O( log2 N).

Download PDF sample

Advanced Computer Architecture and Parallel Processing by Mostafa Abd-El-Barr, Hesham El-Rewini


by Daniel
4.4

Rated 4.25 of 5 – based on 42 votes