NDLI: Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction

Please wait, while we are loading the content...

Cache locality optimization for recursive programs

DemoMatch: API discovery from demonstrations

BARRACUDA: binary-level analysis of runtime RAces in CUDA programs

Bringing the web up to speed with WebAssembly

Compositional recurrence analysis revisited

Achieving high coverage for floating-point code via unconstrained programming

Decomposition instead of self-composition for proving the absence of timing channels

Component-based synthesis of table consolidation and transformation tasks from examples

Compiling without continuations

Synthesis of divide and conquer parallelism for loops

A formally verified compiler for Lustre

Repairing sequential consistency in C/C++11

Low-synchronization, mostly lock-free, elastic scheduling for streaming runtimes

Fusing effectful comprehensions

BigFoot: static check placement for dynamic race detection

Miniphases: compilation using modular and efficient tree transformations

Context transformations for pointer analysis

Instruction punning: lightweight instrumentation for x86-64

Automatic program inversion using symbolic transducers

Network configuration synthesis with abstract topologies

FunTAL: reasonably mixing a functional language with assembly

Futhark: purely functional GPU-programming with nested parallelism and in-place array updates

Flatten and conquer: a framework for efficient analysis of string constraints

Taming undefined behavior in LLVM

Practical partial evaluation for high-performance dynamic language runtimes

Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction

Synthesizing program input grammars

Dynamic race prediction in linear time

Proactive and adaptive energy-aware programming with mixed typechecking

Efficient and precise points-to analysis: modeling the heap by merging equivalent automata

Low overhead dynamic binary translation on ARM

Control-flow recovery from partial failure reports

Synthesizing highly expressive SQL queries from input-output examples

HoTTSQL: proving query rewrites with univalent SQL semantics

Gradual synthesis for static parallelization of single-pass array-processing programs

Responsive parallel computation: bridging competitive and cooperative threading

Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM

Compiling Markov chain Monte Carlo algorithms for probabilistic modeling

Systematic black-box analysis of collaborative web applications

Simple, fast, and safe manual memory management

Static deadlock detection for asynchronous C# programs

Skeletal program enumeration for rigorous compiler testing

Rigorous analysis of software countermeasures against cache attacks

Synthesizing memory models from framework sketches and Litmus tests

Levity polymorphism

StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data

Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction

Content Provider	ACM Digital Library
Author	Ning, Lin Ding, Yufei Guan, Hui Shen, Xipeng
Abstract	Triangular Inequality (TI) has been used in many manual algorithm designs to achieve good efficiency in solving some distance calculation-based problems. This paper presents our generalization of the idea into a compiler optimization technique, named TI-based strength reduction. The generalization consists of three parts. The first is the establishment of the theoretic foundation of this new optimization via the development of a new form of TI named Angular Triangular Inequality, along with several fundamental theorems. The second is the revealing of the properties of the new forms of TI and the proposal of guided TI adaptation, a systematic method to address the difficulties in effective deployments of TI optimizations. The third is an integration of the new optimization technique in an open-source compiler. Experiments on a set of data mining and machine learning algorithms show that the new technique can speed up the standard implementations by as much as 134X and 46X on average for distance-related problems, outperforming previous TI-based optimizations by 2.35X on average. It also extends the applicability of TI-based optimizations to vector related problems, producing tens of times of speedup. .
Starting Page	33
Ending Page	48
Page Count	16
File Format	PDF
ISBN	9781450349888
DOI	10.1145/3062341.3062377
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-06-14
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Deep learning Strength reduction Compiler Triangle inequality Machine learning Optimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

TOP : A Compiler-Based Framework for Optimizing Machine Learning Algorithms through Generalized Triangle Inequality

Spatial Based Feature Generation for Machine Learning Based Optimization Compilation

Uniaxial Compressive Strength Prediction for Rock Material in Deep Mine Using Boosting-Based Machine Learning Methods and Optimization Algorithms

Route optimization based on the detection of Triangle Inequality Violations

Partitioning streaming parallelism for multi-cores: a machine learning based approach

Feature Mining for Machine Learning Based Compilation Optimization

Generalizations of the Triangle Inequality

Latte: a language, compiler, and runtime for elegant and efficient deep neural networks

Rough set theory based reduction algorithm for decision table

Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction

Similar Documents

TOP : A Compiler-Based Framework for Optimizing Machine Learning Algorithms through Generalized Triangle Inequality

Spatial Based Feature Generation for Machine Learning Based Optimization Compilation

Uniaxial Compressive Strength Prediction for Rock Material in Deep Mine Using Boosting-Based Machine Learning Methods and Optimization Algorithms

Route optimization based on the detection of Triangle Inequality Violations

Partitioning streaming parallelism for multi-cores: a machine learning based approach

Feature Mining for Machine Learning Based Compilation Optimization

Generalizations of the Triangle Inequality

Latte: a language, compiler, and runtime for elegant and efficient deep neural networks

Rough set theory based reduction algorithm for decision table

Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction