Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors

MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typical MATLAB programs have abundant data parallelism. These programs also have control flow dominated scalar regions that have an impact on the program's execution time. Today's computer systems have tremendous computing power in the form of traditional CPU cores and throughput oriented accelerators such as graphics processing units(GPUs). Thus, an approach that maps the control flow dominated regions to the CPU and the data parallel regions to the GPU can significantly improve program performance. In this paper, we present the design and implementation of MEGHA, a compiler that automatically compiles MATLAB programs to enable synergistic execution on heterogeneous processors. Our solution is fully automated and does not require programmer input for identifying data parallel regions. We propose a set of compiler optimizations tailored for MATLAB. Our compiler identifies data parallel regions of the program and composes them into kernels. The problem of combining statements into kernels is formulated as a constrained graph clustering problem. Heuristics are presented to map identified kernels to either the CPU or GPU so that kernel execution on the CPU and the GPU happens synergistically and the amount of data transfer needed is minimized. In order to ensure required data movement for dependencies across basic blocks, we propose a data flow analysis and edge splitting strategy. Thus our compiler automatically handles composition of kernels, mapping of kernels to CPU and GPU, scheduling and insertion of required data transfer. The proposed compiler was implemented and experimental evaluation using a set of MATLAB benchmarks shows that our approach achieves a geometric mean speedup of 19.8X for data parallel benchmarks over native execution of MATLAB.

TCP: thread contention predictor for parallel programs

With proliferation of chip multicores (CMPs) on desktops and embedded platforms, multi-threaded programs have become ubiquitous. Existence of multiple threads may cause resource contention, such as, in on-chip shared cache and interconnects, depending upon how they access resources. Hence, we propose a tool - Thread Contention Predictor (TCP) to help quantify the number of threads sharing data and their sharing pattern. We demonstrate its use to predict a more profitable shared, last level on-chip cache (LLC) access policy on CMPs. Our cache configuration predictor is 2.2 times faster compared to the cycle-accurate simulations. We also demonstrate its use for identifying hot data structures in a program which may cause performance degradation due to false data sharing. We fix layout of such data structures and show up-to 10% and 18% improvement in execution time and energy-delay product (EDP), respectively.

Static analysis for checking data format compatibility of programs

Large software systems are developed by composing multiple programs. If the programs manip-ulate and exchange complex data, such as network packets or files, it is essential to establish that they follow compatible data formats. Most of the complexity of data formats is associated with the headers. In this paper, we address compatibility of programs operating over headers of network packets, files, images, etc. As format specifications are rarely available, we infer the format associated with headers by a program as a set of guarded layouts. In terms of these formats, we define and check compatibility of (a) producer-consumer programs and (b) different versions of producer (or consumer) programs. A compatible producer-consumer pair is free of type mismatches and logical incompatibilities such as the consumer rejecting valid outputs gen-erated by the producer. A backward compatible producer (resp. consumer) is guaranteed to be compatible with consumers (resp. producers) that were compatible with its older version. With our prototype tool, we identified 5 known bugs and 1 potential bug in (a) sender-receiver modules of Linux network drivers of 3 vendors and (b) different versions of a TIFF image library.

Mud-packing frog: A novel breeding behaviour and parental care in a stream dwelling new species of Nyctibatrachus (Amphibia, Anura, Nyctibatrachidae)

Reproductive modes are diverse and unique in anurans. Selective pressures of evolution, ecology and environment are attributed to such diverse reproductive modes. Globally forty different reproductive modes in anurans have been described to date. The genus Nyctibatrachus has been recently revised and belongs to an ancient lineage of frog families in the Western Ghats of India. Species of this genus are known to exhibit mountain associated clade endemism and novel breeding behaviours. The purpose of this study is to present unique reproductive behaviour, oviposition and parental care in a new species Nyctibatrachus kumbara sp. nov. which is described in the paper. Nyctibatrachus kumbara sp. nov. is a medium sized stream dwelling frog. It is distinct from the congeners based on a suite of morphological characters and substantially divergent in DNA sequences of the mitochondrial 16S rRNA gene. Males exhibit parental care by mud packing the egg clutch. Such parental care has so far not been described from any other frog species worldwide. Besides this, we emphasize that three co-occurring congeneric species of Nyctibatrachus, namely N. jog, N. kempholeyensis and Nyctibatrachus kumbara sp. nov. from the study site differ in breeding behaviour, which could represent a case of reproductive character displacement. These three species are distinct in their size, call pattern, reproductive behaviour, maximum number of eggs in a clutch, oviposition and parental care, which was evident from the statistical analysis. The study throws light on the reproductive behaviour of Nyctibatrachus kumbara sp. nov. and associated species to understand the evolution and adaptation of reproductive modes of anurans in general, and Nyctibatrachus in particular from the Western Ghats.

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a first-class manner, including when they are used within loops to traverse and update recursive data structures. Finally, we illustrate the comparative precision of our slices over those of previous approaches using representative examples.

Breeding in bamboo: a novel anuran reproductive strategy discovered in Rhacophorid frogs of the Western Ghats, India

Amphibians exhibit extraordinarily diverse sets of reproductive strategies among vertebrates. Understanding life history strategies in an evolutionary framework is lacking for many amphibian species in the tropics. Here, we report a novel reproductive mode where adult frogs enter hollow internodes of bamboo via a small opening, deposit direct developing eggs, and provide parental care. This behaviour is observed in two species of the frog genus Raorchestes. The first description of this unique life history and details of nest site characteristics and embryo development are provided along with ecological comparisons. Evolution of novel reproductive modes and parental care are discussed in context of natural selection. Dearth of natural history information on amphibians in the Western Ghats and much of the South-East Asian region is highlighted with suggestions for further studies.(c) 2014 The Linnean Society of London, Biological Journal of the Linnean Society, 2014, 114, 1-11.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.