Browse Dept. of Computer Science by Subject "parallel computing"

  • Bhatele, Abhinav; Jain, Nikhil; Livnat, Yarden; Pascucci, Valerio; Bremer, Peer-Timo (2015-07-18)
    The dragonfly topology is becoming a popular choice for building high-radix, low-diameter networks with high-bandwidth links. Even with a powerful network, preliminary experiments on Edison at NERSC have shown that for ...

    application/pdf

    application/pdfPDF (14MB)
  • Agarwal, Arpit (2014-01-16)
    Video conferencing is a popular application to connect people who are geographically distant from each other. People in different parts of the world use video conferencing, however many of them suffer from low bandwidth ...

    application/pdf

    application/pdfPDF (12MB)
  • Salverda, Pierre M.; Zilles, Craig (2003-12)
    MSSP is a new execution paradigm that achieves high performance by removing correctness constraints from the critical path. A collection of concurrently executing slave processors, which are not on the critical path, check ...

    application/pdf

    application/pdfPDF (376kB)
  • Gates, Mark R. (2011-08-25)
    We develop speed, efficiency, and accuracy improvements to a three-dimensional (3D) digital volume correlation (DVC) algorithm, which measures displacement and strain fields throughout the interior of a material. Our goal ...

    application/pdf

    application/pdfPDF (22MB)
  • Shan, Feng (2014-01-16)
    Data analysis is receiving considerable attention with the design of new graphics processing units (GPUs). Our study focuses on geostatistical data analysis, which is currently applied in diverse disciplines such as ...

    application/pdf

    application/pdfPDF (706kB)
  • Bikshandi, Ganesh (2007-01)
    Writing high performance programs is a non-trivial task and remains a challenge even to advanced programmers. This dissertation describes a new data type, Hierarchically Tiled Array (HTA), that simplifies this task. HTAs ...

    application/pdf

    application/pdfPDF (2MB)
  • Sun, Yanhua (2015-04-23)
    Parallel programming has always been difficult due to the complexity of hardware and the diversity of applications. Although significant progress has been achieved over the years, attaining high parallel efficiency on large ...

    application/pdf

    application/pdfPDF (5MB)
  • Tuck, James M.; Baugh, Lee W.; Renau, Jose; Torrellas, Josep (2002-05)
    Speech recognition applications challenge traditional out-of-order processors because of low cache locality and poor branch behavior. We observe that these symptoms may be mitigated my exploiting the existing parallelism ...

    application/pdf

    application/pdfPDF (398kB)