Browse by Subject "GPU"

  • Sun, Chenguang (2015-05)
    The graph partitioning problem is critical to many traditional applications such as work balancing in distributed computing systems, layout mapping for VLSI designs, and more. Recent emergence of big data sets makes ...

    application/pdf

    application/pdfPDF (209Kb)Restricted to U of Illinois
  • Farivar, Reza; Venkataraman, Shivaram; Li, Yanen; Chan, Ellick M.; Verma, Abhishek; Campbell, Roy H. (2011-05-03)
    Advent of next generation gene sequencing machines has led to computationally intensive alignment problems that can take many hours on a modern computer. Considering the fast increasing rate of introduction of new short ...

    application/pdf

    application/pdfPDF (878Kb)
  • Xu, Zhentao (2015-04-29)
    European-style options are quite popular nowadays. Calculating their theo- retical price is not an easy task because there are many sources of uncertainty. However, we can model these uncertainties with random numbers. In ...

    application/pdf

    application/pdfPDF (213Kb)Restricted Access
  • Bray, Nicholas C. (2010-08-20)
    Abstract Graphics processing units (GPUs) have tremendous computing power, but are hard to program. Most GPU programming languages are extremely low level; no one has run a general-purpose high-level language on a GPU. ...

    application/pdf

    application/pdfPDF (3Mb)
  • Chen, Shuotian (2014-12)
    Many eigenvalue and eigenvector algorithms begin with reducing the input matrix into a tridiagonal form. A tridiagonal matrix is a matrix that has non-zero elements only on its main diagonal, and the two diagonals directly ...

    application/pdf

    application/pdfPDF (467Kb)