Sciweavers

1205 search results - page 45 / 241
» On P Systems with Bounded Parallelism
Sort
View
CONCUR
2001
Springer
14 years 4 days ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
PDCAT
2009
Springer
14 years 2 months ago
Analytical Study of Adversarial Strategies in Cluster-based Overlays
Abstract—Awerbuch and Scheideler have shown that peerto-peer overlays networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topo...
Emmanuelle Anceaume, Francisco V. Brasileiro, Roma...
IPPS
2002
IEEE
14 years 16 days ago
Generating Parallel Programs from the Wavefront Design Pattern
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
John Anvik, Steve MacDonald, Duane Szafron, Jonath...
PODC
2009
ACM
14 years 2 months ago
Brief announcement: new bounds for the controller problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
Yuval Emek, Amos Korman
IPPS
2010
IEEE
13 years 5 months ago
Initial characterization of parallel NFS implementations
Parallel NFS (pNFS) is touted as an emergent standard protocol for parallel I/O access in various storage environments. Several pNFS prototypes have been implemented for initial v...
Weikuan Yu, Jeffrey S. Vetter