Muutke küpsiste eelistusi

E-raamat: Parallel System Interconnections and Communications

(ISD SA, Heraklion, Greece), (Fordham University, New York, New York, USA), (DSTO, Yarralumla, Australia)
  • Formaat: 416 pages
  • Ilmumisaeg: 08-Oct-2018
  • Kirjastus: CRC Press Inc
  • Keel: eng
  • ISBN-13: 9781482274653
  • Formaat - PDF+DRM
  • Hind: 279,50 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Raamatukogudele
  • Formaat: 416 pages
  • Ilmumisaeg: 08-Oct-2018
  • Kirjastus: CRC Press Inc
  • Keel: eng
  • ISBN-13: 9781482274653

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Network and electronic engineers, systems designers, and graduate students in systems architecture, design or engineering will find this work useful for the comprehensive description it provides of parallel interconnection networks and communications acts, with chapters on network topologies, models and applications; network communications; multistage interconnection networks; hypercube networks; mesh networks; and other parallel networks, including De Bruijn, shuffle-exchange digraphs, circulant, Cayley graphs, and fat-tree. The authors are computer and communications specialists affiliated with university or national organizations. Annotation c. Book News, Inc., Portland, OR (booknews.com)

This introduction to networking large scale parallel computer systems acts as a primary resource for a wide readership, including network systems engineers, electronics engineers, systems designers, computer scientists involved in systems design and implementation of parallel algorithms development, graduate students in systems architecture, design, or engineering.
Network Topologies, Models, and Applications
1(37)
Parallel Systems
1(7)
Programming Paradigms
8(15)
Parallelizing Compilers
10(1)
General Run Time Optimizations
10(2)
Message Passing Model
12(1)
Data Parallel Model
13(1)
Shared Memory Model
14(9)
Theoretical Models
23(14)
Parallel Communication Models
23(4)
Parallel Computation Models
27(1)
Program Locality and Latency Hiding
28(3)
Customization of Interconnection Networks
31(2)
Network Partitioning
33(1)
Amdahl's Law
34(1)
Superlinear Speedup
35(1)
Parallel Benchmarks
35(2)
Network Communications
37(58)
Routing Strategies
37(22)
What is a Packet?
37(2)
Virtual Circuits - Flow Control
39(2)
Routing Strategies
41(1)
Routing Functions
42(3)
Deadlock, Livelock, and Starvation
45(5)
Fault Tolerance, Reliability, and Diagnosis Models
50(9)
Communication Patterns
59(11)
General Routing
60(1)
Permutation Routing
61(4)
Isotonic Routing
65(1)
Other Communication Patterns
65(1)
Embedding Relations
66(3)
Reduction of Communication Problems
69(1)
Routing in General Graphs
70(10)
Performance of Routing Algorithms
70(7)
Fault Tolerant Routing
77(1)
PRAM Emulation on Distributed Memory
78(1)
Optimality and Lower Bounds
79(1)
Performance of Packet Routers
80(15)
Continuous Routing Models
82(1)
Input Buffered Switch
83(1)
Split Input Buffered Switch
84(2)
Output Buffered Switch
86(1)
Central Buffered Switch
87(1)
Performance Comparisons for Generic Switches
88(4)
Large Routers and Networks
92(2)
Technological Constraints - Cost vs. Performance
94(1)
Multistage Interconnection Networks
95(64)
Definitions
95(2)
Representation and Functionalities of Multistage Networks
97(3)
Design and Classification of MINs
100(6)
Blocking Networks
106(15)
Shuffle-Exchange and Omega Network
106(3)
Butterfly Network
109(1)
Inverse Omega, Baseline, Indirect Cube, etc.
110(5)
MIN Performance - Static and Dynamic Patterns
115(1)
Permutation Capability - Static Traffic
115(2)
Bandwidth and Latency - Dynamic Traffic
117(4)
Permutation and Nonblocking Networks
121(9)
Benes Permutation Network
121(4)
Other Permutation Networks
125(1)
The Clos Family of Networks
125(4)
Other Nonblocking Networks
129(1)
Generalized Connectors
130(5)
Fault Tolerance, Reliability, and Diagnosis
135(7)
Fault Tolerance and Reliability
135(5)
Fault Diagnosis Models
140(2)
Special Purpose Networks
142(12)
Sorting Networks
142(6)
Combining Networks
148(4)
Prefix Circuits
152(1)
Balancing and Counting Networks
152(2)
Interconnection Networks in Cryptology
154(1)
Shared Memory Algorithms
154(1)
VLSI Layout and Customization
155(1)
Commercial Multistage Systems
155(4)
Hypercube Networks
159(48)
Topological Properties
159(5)
Hypercube Communication and Sorting
164(27)
Online Permutation Routing
164(5)
Offline Permutation Routing
169(2)
Sorting Algorithms
171(3)
Global Communications
174(3)
Global Communications with Linear Model
177(4)
Dynamic Routing Problems
181(1)
Fault Tolerant Routing
182(8)
Cut-Through, Wormhole, Circuit Switching, and Hot-Potato Routing
190(1)
Hypercube Embeddings and Algorithms
191(5)
Allocation and Scheduling Strategies
196(6)
VLSI Layout and Customization
202(2)
Commercial Hypercube Systems
204(3)
Mesh Networks
207(74)
Topological Properties
207(8)
Meshes and Tori
209(2)
Indexings
211(1)
Communication Models
212(2)
Connection Conflicts
214(1)
Remarks
214(1)
One-Dimensional Arrays
215(15)
Lower Bounds for Routing and Sorting on Arrays
216(1)
Basic Lemmas
217(4)
Routing Randomizations
221(1)
k-k Routing
222(6)
Sorting
228(2)
Two-Dimensional Arrays
230(38)
Online Routing
230(16)
Offline Routing
246(1)
Dynamic Routing Problems
247(1)
Fault Tolerant Routing
248(2)
Cut-Through - Wormhole - Hot-Potato Routing
250(2)
1-1 and k-k Sorting Algorithms
252(15)
Global Communications and Algorithms
267(1)
Mesh-Like Networks
268(6)
Higher Dimensional Arrays
268(1)
Bus-Based Meshes
269(4)
Meshes with Diagonals
273(1)
Coated Mesh
273(1)
Allocation and Scheduling Strategies
274(2)
VLSI Layout and Customization
276(1)
Commercial Mesh Systems
276(5)
Other Parallel Networks
281(38)
De Bruijn Networks
282(15)
Shuffle-Exchange Digraphs
297(5)
Circulant Networks
302(6)
Cayley Graphs
308(9)
Fat-Tree Networks
317(2)
Future Trends in Parallel Communication
319(6)
Bibliography 325(58)
Index 383
Miltos D. Grammatikakis, D. Frank Hsu, Miroslav Kraetzl