Sciweavers

5183 search results - page 645 / 1037
» The Complexity of Distributions
Sort
View
SIGCOMM
1996
ACM
15 years 11 months ago
Multicasting Protocols for High-Speed, Wormhole-Routing Local Area Networks
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
Mario Gerla, Prasasth Palnati, Simon Walton
PVM
1997
Springer
15 years 11 months ago
Message Handling in Parallel Radiance
Photo-realistic computergraphics is an area of research which tries to develop algorithms and methods to render images of arti cial models or worlds as realistically as possible, b...
Erik Reinhard, Alan Chalmers
HOTOS
1993
IEEE
15 years 11 months ago
Using Reconciliation to Share Files Between Occasionally Connected Computers
Future large distributed systems will be made by interconnecting highly autonomous subsystems, rather than by building ever more elaborate complexes which attempt to provide a sin...
John H. Howard
ICPP
1993
IEEE
15 years 11 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris
IPPS
1993
IEEE
15 years 11 months ago
Parallel Algorithms for Hypercube Allocation
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
Yeimkuan Chang, Laxmi N. Bhuyan