1205 search results - page 38 / 241 » On P Systems with Bounded Parallelism |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
PODC
1997
ACM
13 years 11 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...