Optimizing Compiler for Engineering Problems

نویسنده

  • Petr R. Ivankov
چکیده

New information technologies provide a lot of prospects for performance improvement. One of them is ”Dynamic Source Code Generation and Compilation”. This article shows how this way provides high performance for engineering problems.

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

ثبت نام

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

منابع مشابه

Supporting Software Distributed Shared Memory with an Optimizing Compiler

To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as possible. A software distributed shared memory (DSM) can solve these problems via proper support by an optimizing compiler. The optimizing compiler can detect shared write operations, using interprocedural pointsto analys...

متن کامل

CertiCoq: A verified compiler for Coq

CertiCoq is a mechanically verified, optimizing compiler for Coq that bridges the gap between certified high-level programs and their translation to machine language. We outline its design as well as the main foundational and engineering challenges involved in building and certifying a compiler for Coq in Coq.

متن کامل

Formal Veri cation of Transformations on Dependency Graphs in Optimizing Compilers

Dependency graphs are used as intermediate representations in optimizing compilers and software-engineering. In a transformational design approach, optimization and reenement transformations are used to transform dependency-graph-based speciications at higher abstraction levels to those at lower abstraction levels. An informal representation would lead to subtle errors, making it diicult to gua...

متن کامل

Building a Bridge Betweenpointer Aliases and Program

In this paper we present a surprisingly simple reduction of the program dependence problem to the may-alias problem. While both problems are undecid-able, providing a reduction between them has great practical importance. Program dependence information is used extensively in compiler optimizations, automatic program parallelizations, code scheduling in super-scalar machines, and in software eng...

متن کامل

Avoiding Implementational Heat Achieving High Performance with Fpga-based Computing

Lawrence Snyder stated the three basic parameters for the MPP portability problem.3 First, a parallel solution using P processors can improve the best sequential solution by a factor of P, at most. Second, HPC problems tend to have thirdor fourth-order complexity, and so parallel computation, while essential, offers only modest benefits. Third, “the whole force of parallelism must be transferre...

متن کامل

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


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

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

ثبت نام

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

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

دوره abs/0808.3100  شماره 

صفحات  -

تاریخ انتشار 2008