Sciweavers

1855 search results - page 45 / 371
» A coding theorem for distributed computation
Sort
View
RSA
2010
106views more  RSA 2010»
13 years 5 months ago
Thermodynamic limit for large random trees
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
Yuri Bakhtin
EUROPAR
2003
Springer
14 years 4 months ago
Replicated Placements in the Polyhedron Model
Abstract. Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly ...
Peter Faber, Martin Griebl, Christian Lengauer
SIGMETRICS
1998
ACM
14 years 3 months ago
Modeling Set Associative Caches Behavior for Irregular Computations
While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An i...
Basilio B. Fraguela, Ramon Doallo, Emilio L. Zapat...
HPCN
2000
Springer
14 years 2 months ago
A Versatile Support for Binding Native Code to Java
As Java is being considered an appropriate environment for high performance computing, we describe advanced techniques of highly expressive and efficient combining of Java with exi...
Marian Bubak, Dawid Kurzyniec, Piotr Luszczek
IPPS
2008
IEEE
14 years 5 months ago
Energy-efficient high-performance storage system
This project is developing extended versions of RAIDs with low-power, and exploring novel energyefficient disk array architectures using coding techniques for data intensive compu...
Jun Wang