1914 search results - page 214 / 383 » Using Execution Trace Data to Improve Distributed Systems |
130
Voted
CLUSTER
2006
IEEE
15 years 3 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
158
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
153
Voted
EGH
2010
Springer
15 years 1 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
152
click to vote
SC
2009
ACM
15 years 10 months ago
2009
ACM
MapReduce provides a parallel and scalable programming model for data-intensive business and scientific applications. MapReduce and its de facto open source project, called Hadoop...
133
click to vote
DOLAP
2004
ACM
15 years 8 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...