Browse by Subject "parallel programming"

  • Okur, Semih; Erdogan, Cansu; Dig, Danny (2014)
    Parallel libraries continuously evolve from low-level to higher-level abstractions. However, developers are not up-to-date with these higher-level abstractions, thus their parallel code might be hard to read, slow, and ...

    application/pdf

    application/pdfPDF (468Kb)
  • Brodman, James C. (2011-05-25)
    Exploiting parallelism in modern machines increases the di culty of developing applications. Thus, new abstractions are needed that facilitate parallel programming and at the same time allow the programmer to control ...

    application/pdf

    application/pdfPDF (9Mb)
  • Papakonstantinou, Alexandros (2013-02-03)
    This dissertation focuses on efficient generation of custom processors from high-level language descriptions. Our work exploits compiler-based optimizations and transformations in tandem with high-level synthesis (HLS) to ...

    application/pdf

    application/pdfPDF (1Mb)
  • Okur, Semih; Dig, Danny (ACM, 2012-11)
    Parallel programming is hard. The industry leaders hope to convert the hard problem of using parallelism into the easier problem of using a parallel library. Yet, we know little about how programmers adopt these libraries ...

    application/pdf

    application/pdfPDF (958Kb)
  • 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)
  • Bocchino, Robert L., Jr.; Adve, Vikram S.; Adve, Sarita V.; Snir, Marc (2008-11)
    We examine the problem of providing a parallel programming model that guarantees deterministic semantics. We propose a research agenda focusing on the following questions: 1. How to guarantee determinism in a modern ...

    application/pdf

    application/pdfPDF (73Kb)
  • 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)
  • Mansky, William (2014-02-01)
    The VeriF-OPT project seeks to provide a framework for stating and reasoning about compiler optimizations and transformations on parallel programs in the presence of relaxed memory models. The core of the framework is a ...

    application/pdf

    application/pdfPDF (276Kb)
  • Huang, Chao (2007-12)
    Recent developments in supercomputing have brought us massively parallel machines. With the number of processors multiplying, the appetite for more powerful applications that can take advantage of these large scale platforms ...

    application/pdf

    application/pdfPDF (2Mb)