Browse College of Engineering by Contributor "Kale, Laxmikant"

  • Sasidharan, Aparna (2018-07-13)
    The problem discussed in this thesis is distributed data partitioning and data re-ordering on many-core architectures. We present extensive literature survey, with examples from various application domains - scientific ...

    application/pdf

    application/pdfPDF (8MB)
  • Gopalakrishnan Menon, Harshitha Menon (2016-10-10)
    One of the critical factors that affect the performance of many applications is load imbalance. Applications are increasingly becoming sophisticated and are using irregular structures and adaptive refinement techniques, ...

    application/pdf

    application/pdfPDF (3MB)
  • Mikida, Eric P. (2019-04-15)
    Discrete Event Simulation (DES) can be an important tool across various domains such as Engineering, Military, Biology, High Performance Computing, and many others. Interacting systems in these domains can be simulated ...

    application/pdf

    application/pdfPDF (4MB)
  • Maleki, Saeed (2015-11-10)
    Parallelizing large sized problem in parallel systems has always been a challenge for programmer. This difficulty is caused by the complexity of the existing systems as well as the target problems. This is becoming a greater ...

    application/pdf

    application/pdfPDF (5MB)
  • Miron, Justin (2017-05)
    The divergence of priorities between high performance computing (HPC) and cloud infrastructure has made scaling tightly coupled parallel applications in the cloud less viable than their supercomputer counterparts. As a ...

    application/pdf

    application/pdfPDF (761kB)Restricted to U of Illinois
  • Narayanan, Venkatasubrahmanian (2020-05-15)
    The divergence of application behavior from optimal network usage leads to performance bottlenecks induced by communication. Communication performances are known to worsen when dealing with large quantities of small messages, ...

    application/pdf

    application/pdfPDF (938kB)
  • Yang, Chih-Chieh (2017-08-23)
    In the foreseeable future, high-performance supercomputers will continue to evolve in the direction of attempting to build distributed, immensely parallel and highly heterogeneous machines. It is well known that in order ...

    application/pdf

    application/pdfPDF (3MB)
  • Vipul Harsh, - (2017-07-05)
    Standard parallel sorting algorithms like sample sort rely on data partitioning techniques to distribute keys across processors. The sampling cost in sample sort for good load balance is prohibitive for massive clusters. ...

    application/pdf

    application/pdfPDF (518kB)
  • Smith, Adam Randall (2015-09-23)
    The next challenge in the evolution of supercomputers will be the transition to exascale systems. However, while the move from terascale to petascale processing was considered evolutionary, it is widely believed that ...

    application/pdf

    application/pdfPDF (1MB)
  • Senthil Kumar Karthik, - (2018-04-24)
    Connectivity in a graph is a well-studied problem. Various parallel algorithms to detect and label connected components exist, many of which are optimized for a shared-memory environment. However, scientific and engineering ...

    application/pdf

    application/pdfPDF (669kB)