Sciweavers

1003 search results - page 147 / 201
» How to Parallelize Sequential Processes
Sort
View
COORDINATION
2004
Springer
15 years 6 months ago
Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, ...
CLOUD
2010
ACM
15 years 6 months ago
Towards automatic optimization of MapReduce programs
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
Shivnath Babu
ICDCS
2000
IEEE
15 years 5 months ago
Scheduling with Global Information in Distributed Systems
Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved...
Fabrizio Petrini, Wu-chun Feng
IPPS
1998
IEEE
15 years 5 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
DEBS
2010
ACM
15 years 5 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon