NDLI: Automatic parallelization of pure method calls via conditional future synthesis

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

A compiler for throughput optimization of graph algorithms on GPUs

Semantics-based program verifiers for all languages

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

Extensible access control with authorization contracts

Purposes, concepts, misfits, and a redesign of git

Accelerating program analyses by cross-program training

Directed synthesis of failing concurrent executions

Automatic enforcement of expressive security policies using enclaves

Semantic subtyping for imperative object-oriented languages

Efficient and thread-safe objects for dynamically-typed languages

Computing repair alternatives for malformed programs using constraint attribute grammars

A practical framework for type inference error explanation

Finding compiler bugs via live code mutation

Automatic parallelization of pure method calls via conditional future synthesis

Hoare-style specifications as correctness conditions for non-linearizable concurrent objects

Speeding up machine-code synthesis

Gentrification gone too far? affordable 2nd-class values for fun and (co-)effect

Apex: automatic programming assignment error explanation

An improved algorithm for slicing machine code

Maximal causality reduction for TSO and PSO

Chain: tasks and channels for reliable intermittent programs

Parsing with first-class derivatives

Hybrid STM/HTM for nested transactions on OpenJDK

Probabilistic model for code with decision trees

Dynamically diagnosing type errors in unsafe code

Finding resume and restart errors in Android applications

Portable inter-workgroup barrier synchronisation for GPUs

An operational semantics for C/C++11 concurrency

Automated reasoning for web page layout

Incremental forest: a DSL for efficiently managing filestores

Asserting reliable convergence for configuration management scripts

Call graphs for languages with parametric polymorphism

Precise and maximal race detection from incomplete traces

GEMs: shared-memory parallel programming for Node.js

The missing link: explaining ELF static linking, semantically

Makalu: fast recoverable allocation of non-volatile memory

Ringer: web automation by demonstration

First-class effect reflection for effect-guided programming

Low-overhead and fully automated statistical debugging with abstraction refinement

Parallel incremental whole-program optimizations for Scala.js

Modeling and analysis of remote memory access programming

FIDEX: filtering spreadsheet data using examples

LaCasa: lightweight affinity and object capabilities in Scala

Dependent partitioning

Type inference for static compilation of JavaScript

Stateless model checking with data-race preemption points

OrcO: a concurrency-first approach to objects

Type soundness for dependent object types (DOT)

Prioritized garbage collection: explicit GC support for software caches

Scalable verification of border gateway protocol configurations with an SMT solver

Java and scala's type systems are unsound: the existential crisis of null pointers

To be precise: regression aware debugging

Automatic parallelization of pure method calls via conditional future synthesis

Content Provider	ACM Digital Library
Author	Sarkar, Vivek Surendran, Rishi
Abstract	We introduce a novel approach for using futures to automatically parallelize the execution of pure method calls. Our approach is built on three new techniques to address the challenge of automatic parallelization via future synthesis: candidate future synthesis, parallelism benefit analysis, and threshold expression synthesis. During candidate future synthesis, our system annotates pure method calls as async expressions and synthesizes a parallel program with future objects and their type declarations. Next, the system performs a parallel benefit analysis to determine which async expressions may need to be executed sequentially due to overhead reasons, based on execution profile information collected from multiple test inputs. Finally, threshold expression synthesis uses the output from parallelism benefit analysis to synthesize predicate expressions that can be used to determine at runtime if a specific pure method call should be executed sequentially or in parallel. We have implemented our approach, and the results obtained from an experimental evaluation of the complete system on a range of sequential Java benchmarks are very encouraging. Our evaluation shows that our approach can provide significant parallel speedups of up to 7.4Ã (geometric mean of 3.69Ã ) relative to the sequential programs when using 8 processor cores, with zero programmer effort beyond providing the sequential program and test cases for parallelism benefit analysis. .
Starting Page	20
Ending Page	38
Page Count	19
File Format	PDF
ISBN	9781450344449
DOI	10.1145/2983990.2984035
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-19
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Automatic parallelization Futures
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

Automatic parallelization of pure method calls via conditional future synthesis

Analysis of pure methods using garbage collection

Automatic parallelization via matrix multiplication

Automatic parallelization of programming languages: past, present and future

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

Scalable hardware support for conditional parallelization

Rewrite Rules supporting Conditional Statements for Automatic Parallelization

Secure Implementation of Asynchronous Method Calls and Futures

AutopaR: An Automatic Parallelization Tool for Recursive Calls

Automatic parallelization of pure method calls via conditional future synthesis

Similar Documents

Automatic parallelization of pure method calls via conditional future synthesis

Analysis of pure methods using garbage collection

Automatic parallelization via matrix multiplication

Automatic parallelization of programming languages: past, present and future

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

Scalable hardware support for conditional parallelization

Rewrite Rules supporting Conditional Statements for Automatic Parallelization

Secure Implementation of Asynchronous Method Calls and Futures

AutopaR: An Automatic Parallelization Tool for Recursive Calls

Automatic parallelization of pure method calls via conditional future synthesis