1534 search results - page 142 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
181
click to vote
EGH
2010
Springer
15 years 4 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...
171
click to vote
ISORC
2003
IEEE
15 years 11 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
144
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
157
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Provisioning extra resources is necessary when the local resources are not sufficient to meet the user requirements. Commercial Cloud providers offer the extra resources...
187
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...