Compiler and Runtime Techniques for Automatic Parallelization of Sequential Applications

نویسندگان

  • Mojtaba Mehrara
  • Satish Narayanasamy
  • Tim Harris
  • Ganesh Dasika
  • Shuguang Feng
  • Amir Hormati
  • Shantanu Gupta
  • Kevin Fan
  • Hyoun Kyo Cho
  • Hongtao Zhong
  • Kypros Constantinides
  • Andreas Moustakas
  • Mike Chu
  • Manjunath Kudlur
  • Nathan Clark
  • Chun Hsu
  • Yongjun Park
  • Amin Ansari
  • Hyunchul Park
  • Jeff Hao
چکیده

Compiler and Runtime Techniques for Automatic Parallelization of Sequential Applications by Mojtaba Mehrara

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY SHENGYUE WANG IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Pen-Chung Yew, Adviser

Thread-Level Speculation (TLS) allows potentially dependent threads to execute in parallel, by postponing the detection and verification of inter-thread data dependences until runtime. Although TLS greatly simplifies automatic parallelization, only moderate performance improvements have been achieved for general-purpose applications. Thus adequate compiler techniques must be developed to fully ...

متن کامل

Semantic Language Extensions for Implicit Parallel Programming

Several emerging fields of science and engineering are increasingly characterized by computationally intensive programs. Without parallelization, such programs do not benefit from the increasing core counts available in todays chip multiprocessors. However, writing correct and well-performing parallel programs is widely perceived to be an extremely hard problem. In order to understand the chall...

متن کامل

Compiling Sequential Programs for Speculative Parallelism

We present a runtime system and a parallelizing compiler for exploiting speculative parallelism in sequential programs. In speculative executions, the computation consists of tasks which may start before their data or control dependencies are resolved; dependency violation is detected and corrected at runtime. Our runtime system provides a shared memory abstraction and ensures that shared acces...

متن کامل

Transparent runtime parallelization of the R scripting language

Scripting languages such as R and Matlab are widely used in scientific data processing. As the data volume and the complexity of analysis tasks both grow, sequential data processing using these tools often becomes the bottleneck in scientific workflows. We describe pR, a runtime framework for automatic and transparent parallelization of the popular R language used in statistical computing. Reco...

متن کامل

Extending a Task Farming Framework with Dependences to P2P Communications

Grid computing is becoming more and more popular, but contrary to earlier expectations the development of applications for Grid environments is still not possible without expert knowledge in the field of parallelization. Therefore, recent work [14, 4] has combined automatic loop parallelization (in the polytope model) with component-based Grid programming: First, automatic parallelization techn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011