1118 search results - page 173 / 224 » Scalable Planning for Distributed Stream Processing Systems |
141
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
123
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
145
click to vote
ICDE
2005
IEEE
15 years 8 months ago
2005
IEEE
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
103
click to vote
HPDC
2003
IEEE
15 years 8 months ago
2003
IEEE
We present a study of six batch-pipelined scientific workloads that are candidates for execution on computational grids. Whereas other studies focus on the behavior of single app...
213
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Desktop grids have traditionally focused on executing computation intensive workloads. Can they also be used to execute data-intensive workloads? To answer this question, we prese...