Parallel Computer Routing and Communication: First International Workshop, PCRCW '94, Seattle, Washington, USA, May 16-18, 1994. Proceedings
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.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Do Faster Routers Imply Faster Communication?
Fast Arbitration in Dilated Routers
Performance Analysis of a Minimal Adaptive Router
Performance Evaluation of Adaptive Routing Algorithms for k_ary n_cubes
The Performance of Adaptive Routers on Worst Case Permutations
On the Effect of Queue Sizes and Channel Scheduling Policies in the Segment Router
An Optoelectronic Interconnection Network
Three_Dimensional Network Topologies
Congestion_Free Routing on the CM5 Data Router
A Class of Efficient Minimal Routing Algorithms
Packaging and Multiplexing of Hierarchical Scalable Expanders
Guaranteeing Idempotence for TightlyCoupled FaultTolerant Networks
Design of a Router for FaultTolerant Networks
A Reliable and High_Performance Communication Substrate for Parallel Computers
Network Interface Support for UserLevel Buffer Management
An Interface for Message Passing on Adaptive Packet Routing Networks
Support for Multiple Classes of Traffic in Multicomputer Routers
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
Multi_Address Encoding for Multicast
Routing Algorithms for IBM SP1
Optimized Routing in the Cray T3D
A Damped Adaptive Router Design
Arctic Routing Chip
Citi izdevumi - Skatīt visu
adaptive routing allocation allows applications Architecture assignment assume average bandwidth buffer Chaos chip classes communication compared complexity component Computer congestion connected considered cost cycle delivery dependencies described destination deterministic dilation dimension direction Distributed effect example fault Figure flit flow four frame function given grouping guaranteed hardware header IEEE implementation increases injection input interconnection latency layer limited load logical long messages machine mapping maximum mechanism memory mesh minimal multicast multicomputer multiple network interface node operation output output port overhead packet Parallel passing path patterns performance permutations physical port presented problem Proceedings processing processor protocol queue random receive reduce region requires ring router routing algorithm scheme shown shows simulation single step switch Table throughput topologies traffic transfer virtual channels wires wormhole