Browse by Subject "Parallel Computing"

  • Jindal, Prateek; Hockenmaier, Julia; Kale, Laxmikant V. (2013-12-04)
    Topic modeling algorithms (like Latent Dirichlet Allocation) tend to be very slow when run over large document collections. In this presentation, we discuss distributed strategies for topic modeling. We use Charm++ as our ...

    application/pdf

    application/pdfPDF (310Kb)
  • Cochran, William Kenneth (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. ...

    application/pdf

    application/pdfPDF (11Mb)
  • Agarwal, Mayank (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 ...

    application/pdf

    application/pdfPDF (2Mb)
  • DeSouza, Jayant (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 ...

    application/pdf

    application/pdfPDF (598Kb)
  • Choi, Byn; Komuravelli, Rakesh; Lu, Victor; Sung, Hyojin; Bocchino, Robert L., Jr. (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 ...

    application/pdf

    application/pdfPDF (1Mb)
  • Totoni, Ehsan (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 ...

    application/pdf

    application/pdfPDF (3Mb)