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...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
In this paper, we describe block matrix algorithms for the iterative solution of large scale linear-quadratic optimal control problems arising from the optimal control of parabolic...
Tarek P. Mathew, Marcus Sarkis, Christian E. Schae...
In this paper, we explore a new form of dissemination called Flash Dissemination that involves dissemination of fixed, rich information to a large number of recipients in as shor...
Mayur Deshpande, Bo Xing, Iosif Lazaridis, Bijit H...
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...