11561 search results - page 2132 / 2313 » Open Distributed Processing |
136
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
136
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
217
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
238
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
218
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...