Parallel Computer Routing and Communication: First International Workshop, PCRCW '94, Seattle, Washington, USA, May 16-18, 1994. ProceedingsKevin Bolding, Lawrence Snyder Springer Science & Business Media, 1994. gada 28. sept. - 317 lappuses This volume contains revised versions of the 23 regular papers presented at the First International Workshop on Parallel Computer Routing and Communication (PCRCW '94), held in Seattle, Washington in May 1994. Routing for parallel computer communication has recently experienced almost explosive activity: ever increasing processor speeds are placing greater demands on interprocessor communication, while technological advances offer new capabilities to respond to those demands. The contributions from industry and academia cover all areas, from details of hardware design to proofs of theoretical results. There are also many papers dealing with the performance of various adaptive routing schemes, new network topologies, network interfaces, and fault-tolerant issues. |
No grāmatas satura
6.10. rezultāts no 76.
8. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
9. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
10. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
11. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
12. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Do Faster Routers Imply Faster Communication? | 1 |
Fast Arbitration in Dilated Routers | 16 |
Performance Analysis of a Minimal Adaptive Router | 31 |
Performance Evaluation of Adaptive Routing Algorithms for k_ary n_cubes | 45 |
The Performance of Adaptive Routers on Worst Case Permutations | 60 |
On the Effect of Queue Sizes and Channel Scheduling Policies in the Segment Router | 72 |
An Optoelectronic Interconnection Network | 86 |
Three_Dimensional Network Topologies | 101 |
Congestion_Free Routing on the CM5 Data Router | 176 |
A Class of Efficient Minimal Routing Algorithms | 185 |
Packaging and Multiplexing of Hierarchical Scalable Expanders | 200 |
Guaranteeing Idempotence for TightlyCoupled FaultTolerant Networks | 215 |
Design of a Router for FaultTolerant Networks | 226 |
A Reliable and High_Performance Communication Substrate for Parallel Computers | 241 |
Network Interface Support for UserLevel Buffer Management | 256 |
An Interface for Message Passing on Adaptive Packet Routing Networks | 266 |
Support for Multiple Classes of Traffic in Multicomputer Routers | 116 |
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme | 131 |
Multi_Address Encoding for Multicast | 146 |
Routing Algorithms for IBM SP1 | 161 |
Optimized Routing in the Cray T3D | 281 |
A Damped Adaptive Router Design | 295 |
Arctic Routing Chip | 310 |
Citi izdevumi - Skatīt visu
Parallel Computer Routing and Communication: First International Workshop ... Kevin Bolding,Lawrence Snyder Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
2-Phase adaptive algorithm adaptive routing adaptive routing algorithms allocation Architecture average latency bandwidth best-effort bit string buffer butterfly bytes Chaos router chip communication Computer congestion cost Cranium Cray T3D cross-point crossbar cube cycle deadlock deadlock-free delivery derouting destination node deterministic deterministic routing dilation dimension e-cube fault tolerance FIFO flit guaranteed hardware header hypercube idempotent IEEE implementation injection Input Frame input port interconnection networks k-ary latency livelock load logical long messages mapping memory mesh message latency message passing messaging layer metabutterfly metanode multibutterfly multicast multicomputer multidestination multiple region multiplexing multiprocessor network interface offset-cube output frame output port overhead packet switching Parallel parallel computers path performance permutations physical channel priority Proc Proceedings processing processor protocol queue random requires ROMM routing algorithm Section Segment router shown in Figure simulation Symposium throughput topologies traffic virtual channels virtual cut-through wires wormhole routing