Browse by Subject "Parallel Computing"
Now showing items 3-8 of 8
(2009-08-18)High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. ...
(2009-05-15)The shift of the microprocessor industry towards multicore architectures has placed a huge burden on the programmers by requiring explicit parallelization for performance. Implicit Parallelization is an alternative that ...
(2004-12)Current parallel programming approaches, which typically use message-passing and shared memory threads, require the programmer to write considerable low-level work management and distribution code to partition and distribute ...
(2015-07-17)We develop scalable algorithms for two-stage stochastic program optimizations. We propose performance optimizations such as cut-window mechanism in Stage 1 and scenario clustering in Stage 2 of benders method for solving ...
(2009-09-22)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 between rays and the primitives. The highest ...
(2015-01-21)Power and energy efficiency are important challenges for the High Performance Computing (HPC) community. Excessive power consumption is a main limitation for further scaling of HPC systems, and researchers believe that ...