检索结果-内蒙古大学图书馆

AN optimizing compiler FOR AN SPAP ARCHITECTURE USING AI TOOLS

COMPUTER 1992年第6期25卷 39-48页

作者： AZARIA, H DVIR, A TADIRAN COMMUN GRP DIV COMMUN SYSTHOLONISRAEL

A methodology that allows users to efficiently bridge the gap between high-level language and low-level microcode when implementing intensive mathematical operations and manipulations algorithms is discussed. The use of an optimized special-purpose array processor (SPAP) architecture for numerical computation and a host microprocessor for nonnumerical computation operations is described. The advantages of the optimizing compiler, the target architecture, and the compiler's implementation using AI tools are examined

关键词： AI tools KBS SPAP architecture high-level language knowledge based systems low-level microcode mathematical operations mathematics computing numerical computation optimizing compiler program compilers special-purpose array processor

来源：评论

学校读者我要写书评

暂无评论

Treebeard: An optimizing compiler for Decision Tree Based ML Inference 55

Treebeard: An Optimizing Compiler for Decision Tree Based ML...

引用

55th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Prasad, Ashwin Rajendra, Sampath Rajan, Kaushik Govindarajan, R. Bondhugula, Uday Indian Inst Technol Bangalore Karnataka India Natl Instruments Bangalore Karnataka India Microsoft Res Bangalore Karnataka India

ISBN: (数字)9781665462723

ISBN: (纸本)9781665462723

Decision tree ensembles are among the most commonly used machine learning models. These models are used in a wide range of applications and are deployed at scale. Decision tree ensemble inference is usually performed with libraries such as XGBoost, LightGBM, and Sklearn. These libraries incorporate a fixed set of optimizations for the hardware targets they support. However, maintaining these optimizations is prohibitively expensive with the evolution of hardware. Further, they do not specialize the inference code to the model being used, leaving significant performance on the table. This paper presents TREEBEARD, an optimizing compiler that progressively lowers the inference computation to optimized CPU code through multiple intermediate abstractions. By applying model-specific optimizations at the higher levels, tree walk optimizations at the middle level, and machine-specific optimizations lower down, TREEBEARD can specialize inference code for each model on each supported CPU target. TREEBEARD combines several novel optimizations at various abstraction levels to mitigate architectural bottlenecks and enable SIMD vectorization of tree walks. We implement TREEBEARD using the MLIR compiler infrastructure and demonstrate its utility by evaluating it on a diverse set of benchmarks. TREEBEARD is significantly faster than state-of-the-art systems, XGBoost, Treelite and Hummingbird, by 2.6x, 4.7x and 5.4x respectively in a single-core execution setting, and by 2.3x, 2.7x and 14x respectively in multi-core settings.

关键词： optimizing compiler Decision Tree Ensemble Decision Tree Inference Vectorization Machine Learning

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 370 :: Pli :: Gc33-0004-0 Pli optimizing compiler General Info Mar70

引用

2016年

Ibm :: 370 :: Pli :: Gc33-0004-0 Pli optimizing compiler General Info Mar70 by published by

关键词： attribute attribute option compiler data disk operating dos environment attribute file description function function option gc33-0004-0 general language implemented mar70 operating system optimizing optimizing compiler option program regional data statement statement option variable

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 370 :: Pli :: Sc33-0006-7 Os Pli optimizing compiler Programmers Guide Sep85

引用

2016年

[Auto Generated] Chapter 1. Introduction 1 Chapter 2. The compiler 3 Description of the compiler 4 Job Control statements for Compilation 8 EXEC Statement 8 DD statements For The Standard Data Sets 8 Input (SYSIN, OR SYSCIN) 8 Output CSYSLIN, SYSPUNCH) 9 Temporary Workfile (SYSUT1) 9 Statement Lengths 9 Listing (SYSPRINT) 10 Source statement Library (SYSlIB) 10 Example Of compiler JCl 11 compiler Options 11 Specifying compiler Options 11 Specifying compiler Options in the EXEC Statement 12 Speci

关键词： compiler consecutive data data data set data sets guide indexed data linkage editor load module module operating system optimizing optimizing compiler option program programmers record return code sc33-0006-7 sep85 set sets statement storage vsam data

来源：评论

学校读者我要写书评

暂无评论

Treebeard: An optimizing compiler for Decision Tree Based ML Inference 22

Treebeard: An Optimizing Compiler for Decision Tree Based ML...

引用

Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Ashwin Prasad Sampath Rajendra Kaushik Rajan R Govindarajan Uday Bondhugula Indian Institute of Science Bangalore India and National Instruments Bangalore India Microsoft Research Bangalore India Indian Institute of Science Bangalore India

ISBN: (纸本)9781665462723

Decision tree ensembles are among the most commonly used machine learning models. These models are used in a wide range of applications and are deployed at scale. Decision tree ensemble inference is usually performed with libraries such as XGBoost, LightGBM, and Sklearn. These libraries incorporate a fixed set of optimizations for the hardware targets they support. However, maintaining these optimizations is prohibitively expensive with the evolution of hardware. Further, they do not specialize the inference code to the model being used, leaving significant performance on the *** paper presents Treebeard, an optimizing compiler that progressively lowers the inference computation to optimized CPU code through multiple intermediate abstractions. By applying model-specific optimizations at the higher levels, tree walk optimizations at the middle level, and machine-specific optimizations lower down, Treebeard can specialize inference code for each model on each supported CPU target. Treebeard combines several novel optimizations at various abstraction levels to mitigate architectural bottlenecks and enable SIMD vectorization of tree *** implement Treebeard using the MLIR compiler infrastructure and demonstrate its utility by evaluating it on a diverse set of benchmarks. Treebeard is significantly faster than state-of-the-art systems, XGBoost, Treelite and Hummingbird, by 2.6×, 4.7× and 5.4× respectively in a single-core execution setting, and by 2.3×, 2.7× and 14× respectively in multi-core settings.

关键词： optimizing compiler decision tree ensemble decision tree inference vectorization machine learning

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of an optimizing type-centric compiler for a high-level language

Design and implementation of an optimizing type-centric comp...

引用

作者： Dmytro PETRASHKO ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE

学位级别：博士

Production compilers for programming languages face multiple requirements. They should be correct, as we rely on them to produce code. They should be fast, in order to provide a good developer experience. They should also be easy to maintain and evolve. This thesis shows how an expressive high level type system can be used to simplify the devel- opment of a compiler. We demonstrate the system on a compiler for Scala. First, we show how expressive types of high level languages can be used to build internal data structures that provide a statically checked API, ensuring that important properties hold at compile time. Second, we also show how high level language features can be used to abstract the com- ponents of a compiler. We demonstrate this by introducing a type-safe layer on top of the bytecode emission phase. This makes it possible to abstract away the implementation details of the compiler frontend and run the same bytecode emission phase in two different Scala compilers. Third, we present "MiniPhases", a novel way to organize transformation passes in a compiler. MiniPhases impose constraints on the organization of passes that are beneficial for main- tainability, performance, and testability. We include a detailed performance evaluation of MiniPhases which indicates that their speedup is due to improved cache friendliness and to a lower rate of promotions of objects into the old generations of garbage collectors. Finally, we demonstrate how the expressive type system of the language being compiled can be used for static analysis. We present a novel call graph construction algorithm which uses the typing context for context sensitivity. The resulting algorithm is both substantially faster and more precise than existing alternatives. We demonstrate the applicability of this analysis by extending common subexpression elimination to idempotent expression elimination.

关键词： compiler design optimizing compiler compiler performance tree traversal fusion cache locality call graphs parametric polymorphism static analysis Scala

来源：评论

学校读者我要写书评

暂无评论

Accuracy of profile maintenance in optimizing compilers 6

Accuracy of profile maintenance in optimizing compilers

引用

6th Workshop on Interaction Between compilers and Computer Architectures (INTERACT-6)

作者： Wu, YF Intel Corp Programming Syst Res Lab Santa Clara CA 95052 USA

ISBN: (纸本)0769515347

Modern processors rely, heavily on optimizing compilers to deliver their performance potentials. The compilers on the other hand rely greatly on profile information to focus the optimization efforts and to better match the generated code with the target machines. Maintaining the profile in optimizing compiler is important as many optimizations can benefit from the profile information and they often are performed one after the other. Maintaining a profile is however tedious and error-prone. Erroneous profile is not easy to detect as it affects only the performance, not the correctness, of a pro,grain. Maintaining a profile also inherently loses accuracy, as the profile update operations often have to use probabilistic approximation. In this paper, we measure the accuracy of maintaining CFG profiles in a high-perfomance optimizing compiler. Our data indicates that the compiler maintains the profile more accurately within individual functions than globally across functions, and function inlining may be responsible for the loss of profile accuracy globally. We also identify a number of research issues related to profile maintenance.

关键词： profile-guided optimization profile maintenance probabilistic approximation optimizing compiler performance evaluation

来源：评论

学校读者我要写书评

暂无评论

COMPILE-TIME COPY ELIMINATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1993年第11期23卷 1175-1200页

作者： SCHNORF, P GANAPATHI, M HENNESSY, JL STANFORD UNIV COMP SYST LABSTANFORDCA 94305

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques edge substitution, graph pattern matching, substructure sharing and substructure targeting-was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.

关键词： COPY ELIMINATION AGGREGATE UPDATE PROBLEM SINGLE-ASSIGNMENT LANGUAGE FUNCTIONAL LANGUAGE optimizing compiler

来源：评论

学校读者我要写书评

暂无评论

TIME OPTIMAL LINEAR SCHEDULES FOR ALGORITHMS WITH UNIFORM DEPENDENCIES

引用

IEEE TRANSACTIONS ON COMPUTERS 1991年第6期40卷 723-742页

作者： SHANG, WJ FORTES, JAB PURDUE UNIV SCH ELECT ENGNW LAFAYETTEIN 47907

An algorithm can be thought of as a set of indexed computations and if one computation uses data generated by another computation then this data dependence can be represented by the difference of their indexes (called dependence vector). Many important algorithms are characterized by the fact that data dependencies are uniform, i.e., the values of the dependence vectors are independent of the indexes of computations. Linear schedules are a special class of schedules described by a linear mapping of computation indexes into time. This paper addresses the problem of identifying optimal linear schedules for uniform dependence algorithms so that their execution time is minimized. Procedures are proposed to solve this problem based on the mathematical solution of a nonlinear optimization problem. The complexity of these procedures is independent of the size of the algorithm. Actually, the complexity is exponential in the dimension of the index set of the algorithm and, for all practical purposes, very small due to the limited dimension of the index set of algorithms of practical interest. The results reported in this paper can be used to derive time-optimal systolic designs and applied in optimizing compilers to restructure programs at compile-time in order to maximally exploit available parallelism.

关键词： ALGORITHM MAPPING DATA DEPENDENCY LINEAR SCHEDULE optimizing compiler NESTED-LOOP PROGRAM SYSTOLIC ARRAY TIME-OPTIMAL

来源：评论

学校读者我要写书评

暂无评论

DESIGN OF SPACE-OPTIMAL REGULAR ARRAYS FOR ALGORITHMS WITH LINEAR SCHEDULES

引用

IEEE TRANSACTIONS ON COMPUTERS 1995年第5期44卷 683-694页

作者： TSAY, JC CHANG, PY Inst. of Comput. Sci. & Inf. Eng. Nat. Chiao Tung Univ. Hsinchu Taiwan

The problem of designing space-optimal 2D regular arrays for N x N x N cubical mesh algorithms with linear schedule ai + bj + ck, 1 less than or equal to a less than or equal to b less than or equal to c, and N = nc, is studied. Three novel nonlinear processor allocation methods, each of which works by combining a partitioning technique (gcd-partition) with different nonlinear processor allocation procedures (traces), are proposed to handle different cases, In cases where a + b less than or equal to c, which are dealt with by the first processor allocation method, space-optimal designs can always be obtained in which the number of processing elements is equal to N-2/c. For other cases where a + b > c and either a = b and b = c, two other optimal processor allocation methods are proposed. Besides, the closed form expressions for the optimal number of processing elements are derived for these cases.

关键词： ALGORITHM MAPPING DATA DEPENDENCY LINEAR SCHEDULE MATRIX MULTIPLICATION optimizing compiler SPACE-OPTIMAL SYSTOLIC ARRAY

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：