Sciweavers

588 search results - page 103 / 118
» A Fast Distributed Algorithm for Approximating the Maximum M...
Sort
View
PDPTA
2010
13 years 6 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
PVM
2010
Springer
13 years 7 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
14 years 8 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
PODC
2005
ACM
14 years 2 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
INFOCOM
2005
IEEE
14 years 2 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang