Sciweavers

1205 search results - page 90 / 241
» On P Systems with Bounded Parallelism
Sort
View
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
13 years 7 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz
PPOPP
2010
ACM
14 years 5 months ago
Modeling advanced collective communication algorithms on cell-based systems
This paper presents and validates performance models for a variety of high-performance collective communication algorithms for systems with Cell processors. The systems modeled in...
Qasim Ali, Samuel P. Midkiff, Vijay S. Pai
ICPP
2007
IEEE
14 years 2 months ago
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
Peng Gu, Jun Wang, Hailong Cai
ICPP
2009
IEEE
13 years 5 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ó...
CCGRID
2003
IEEE
14 years 1 months ago
Large Scale Dissemination Using a Peer-to-Peer Network
The widespread use of broadband networks and the evolution of Peer-to-Peer systems changed dramatically the way Internet is used today. P2P file sharing networks are one of the mo...
Konstantinos G. Zerfiridis, Helen D. Karatza