Sciweavers

1205 search results - page 141 / 241
» On P Systems with Bounded Parallelism
Sort
View
CLUSTER
2006
IEEE
14 years 4 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
FAC
2006
92views more  FAC 2006»
13 years 10 months ago
Action Refinement Applied to Late Decisions
In modular approaches to specify concurrent systems a system is built up from components using various operators as e.g. the sequential, the parallel, or the choice (+) operator. U...
Harald Fecher, Mila E. Majster-Cederbaum
DEBS
2008
ACM
13 years 12 months ago
A framework for performance evaluation of complex event processing systems
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques
PODC
1999
ACM
14 years 2 months ago
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
SRDS
2006
IEEE
14 years 4 months ago
Reliably Executing Tasks in the Presence of Untrusted Entities
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
Antonio Fernández, Luis López, Agust...