Sciweavers

36 search results - page 3 / 8
» Minimal Parallelism for Polarizationless P Systems
Sort
View
GPC
2007
Springer
14 years 2 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
CC
2008
Springer
193views System Software» more  CC 2008»
13 years 10 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
IPPS
2000
IEEE
14 years 28 days ago
Fast Measurement of LogP Parameters for Message Passing Platforms
Abstract. Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing i...
Thilo Kielmann, Henri E. Bal, Kees Verstoep
ICPADS
2006
IEEE
14 years 2 months ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
ICPP
2009
IEEE
13 years 6 months ago
Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopte...
Lluis Pamies-Juarez, Pedro García Ló...