Browse Dept. of Computer Science by Title

  • Huang, Xiaohuang (2010-05-19)
    There are two venues for many-core machines to gain higher performance: increasing the number of processors and number of vector units in one SIMD processor. A truly scalable algorithm should take advantage for both ...

    application/pdf

    application/pdfPDF (275Kb)
  • Lim, Hyuk; Kung, Lu-Chuan; Hou, Jennifer C.; Luo, Haiyun (2005-08)
    With the technical advances in ubiquitous computing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figure it into applications. In this paper, ...

    application/pdf

    application/pdfPDF (2Mb)
  • Pundir, Mayank; Leslie, Luke M.; Gupta, Indranil; Campbell, Roy H. (2015-05-07)
    Distributed graph processing systems largely rely on proactive techniques for failure recovery. Unfortunately, these approaches (such as checkpointing) entail a significant overhead. In this paper, we argue that distributed ...

    application/pdf

    application/pdfPDF (1Mb)
  • Bazeghi, Cyrus; Mesa-Martinez, Fracisco J.; Greskamp, Brian; Torrellas, Josep; Renau, Jose (2004-08)
    Microprocessor design complexity is growing rapidly. As a result, current development costs for top of the line processors are staggering, and are doubling every 4 years. As we design ever larger and more complex processors, ...

    application/pdf

    application/pdfPDF (263Kb)