MODLEX: A Multi Objective Data Layout EXploration Framework for Embedded Systems-on-Chip

The memory subsystem is a major contributor to the performance, power, and area of complex SoCs used in feature rich multimedia products. Hence, memory architecture of the embedded DSP is complex and usually custom designed with multiple banks of single-ported or dual ported on-chip scratch pad memory and multiple banks of off-chip memory. Building software for such large complex memories with many of the software components as individually optimized software IPs is a big challenge. In order to obtain good performance and a reduction in memory stalls, the data buffers of the application need to be placed carefully in different types of memory. In this paper we present a unified framework (MODLEX) that combines different data layout optimizations to address the complex DSP memory architectures. Our method models the data layout problem as multi-objective genetic algorithm (GA) with performance and power being the objectives and presents a set of solution points which is attractive from a platform design viewpoint. While most of the work in the literature assumes that performance and power are non-conflicting objectives, our work demonstrates that there is significant trade-off (up to 70%) that is possible between power and performance.

Design of a constrained high data rate CDMA system

This paper deals with the design of a high data rate code-division multiple-access (CDMA) system under a speci¯ed jamming mar- gin speci¯cation as well as hardware and band-width limitations. Several choices had to be made in coming up with the design such as specify-ing the number of subcarriers, choice of spread-ing codes and the nature of the modulation.The rationale behind each of the choices made is given. Descriptions of transmitter and receiver are also included. Relevant simulations of cross-correlation are also provided.

Testing concordance in species boundaries using acoustic, morphological, and molecular data in the field cricket genus Itaropsis (Orthoptera: Grylloidea, Gryllidae: Gryllinae)

In most taxa, species boundaries are inferred based on differences in morphology or DNA sequences revealed by taxonomic or phylogenetic analyses. In crickets, acoustic mating signals or calling songs have species-specific structures and provide a third data set to infer species boundaries. We examined the concordance in species boundaries obtained using acoustic, morphological, and molecular data sets in the field cricket genus Itaropsis. This genus is currently described by only one valid species, Itaropsis tenella, with a broad distribution in western peninsular India and Sri Lanka. Calling songs of males sampled from four sites in peninsular India exhibited significant differences in a number of call features, suggesting the existence of multiple species. Cluster analysis of the acoustic data, molecular phylogenetic analyses, and phylogenetic analyses combining all data sets suggested the existence of three clades. Whatever the differences in calling signals, no full congruence was obtained between all the data sets, even though the resultant lineages were largely concordant with the acoustic clusters. The genus Itaropsis could thus be represented by three morphologically cryptic incipient species in peninsular India; their distributions are congruent with usual patterns of endemism in the Western Ghats, India. Song evolution is analysed through the divergence in syllable period, syllable and call duration, and dominant frequency.

Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems

This paper proposes an algorithm for joint data detection and tracking of the dominant singular mode of a time varying channel at the transmitter and receiver of a time division duplex multiple input multiple output beamforming system. The method proposed is a modified expectation maximization algorithm which utilizes an initial estimate to track the dominant modes of the channel at the transmitter and the receiver blindly; and simultaneously detects the un known data. Furthermore, the estimates are constrained to be within a confidence interval of the previous estimate in order to improve the tracking performance and mitigate the effect of error propagation. Monte-Carlo simulation results of the symbol error rate and the mean square inner product between the estimated and the true singular vector are plotted to show the performance benefits offered by the proposed method compared to existing techniques.

Channel training signal design for reciprocal multiple antenna systems with beamforming

Fast and efficient channel estimation is key to achieving high data rate performance in mobile and vehicular communication systems, where the channel is fast time-varying. To this end, this work proposes and optimizes channel-dependent training schemes for reciprocal Multiple-Input Multiple-Output (MIMO) channels with beamforming (BF) at the transmitter and receiver. First, assuming that Channel State Information (CSI) is available at the receiver, a channel-dependent Reverse Channel Training (RCT) signal is proposed that enables efficient estimation of the BF vector at the transmitter with a minimum training duration of only one symbol. In contrast, conventional orthogonal training requires a minimum training duration equal to the number of receive antennas. A tight approximation to the capacity lower bound on the system is derived, which is used as a performance metric to optimize the parameters of the RCT. Next, assuming that CSI is available at the transmitter, a channel-dependent forward-link training signal is proposed and its power and duration are optimized with respect to an approximate capacity lower bound. Monte Carlo simulations illustrate the significant performance improvement offered by the proposed channel-dependent training schemes over the existing channel-agnostic orthogonal training schemes.

Assessing future rainfall projections using multiple GCMs and a multi-site stochastic downscaling model

Impact of global warming on daily rainfall is examined using atmospheric variables from five General Circulation Models (GCMs) and a stochastic downscaling model. Daily rainfall at eleven raingauges over Malaprabha catchment of India and National Center for Environmental Prediction (NCEP) reanalysis data at grid points over the catchment for a continuous time period 1971-2000 (current climate) are used to calibrate the downscaling model. The downscaled rainfall simulations obtained using GCM atmospheric variables corresponding to the IPCC-SRES (Intergovernmental Panel for Climate Change - Special Report on Emission Scenarios) A2 emission scenario for the same period are used to validate the results. Following this, future downscaled rainfall projections are constructed and examined for two 20 year time slices viz. 2055 (i.e. 2046-2065) and 2090 (i.e. 2081-2100). The model results show reasonable skill in simulating the rainfall over the study region for the current climate. The downscaled rainfall projections indicate no significant changes in the rainfall regime in this catchment in the future. More specifically, 2% decrease by 2055 and 5% decrease by 2090 in monsoon (HAS) rainfall compared to the current climate (1971-2000) under global warming conditions are noticed. Also, pre-monsoon (JFMAM) and post-monsoon (OND) rainfall is projected to increase respectively, by 2% in 2055 and 6% in 2090 and, 2% in 2055 and 12% in 2090, over the region. On annual basis slight decreases of 1% and 2% are noted for 2055 and 2090, 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.

A Diffusion-Based Processor Reallocation Strategy for Tracking Multiple Dynamically Varying Weather Phenomena

Many meteorological phenomena occur at different locations simultaneously. These phenomena vary temporally and spatially. It is essential to track these multiple phenomena for accurate weather prediction. Efficient analysis require high-resolution simulations which can be conducted by introducing finer resolution nested simulations, nests at the locations of these phenomena. Simultaneous tracking of these multiple weather phenomena requires simultaneous execution of the nests on different subsets of the maximum number of processors for the main weather simulation. Dynamic variation in the number of these nests require efficient processor reallocation strategies. In this paper, we have developed strategies for efficient partitioning and repartitioning of the nests among the processors. As a case study, we consider an application of tracking multiple organized cloud clusters in tropical weather systems. We first present a parallel data analysis algorithm to detect such clouds. We have developed a tree-based hierarchical diffusion method which reallocates processors for the nests such that the redistribution cost is less. We achieve this by a novel tree reorganization approach. We show that our approach exhibits up to 25% lower redistribution cost and 53% lesser hop-bytes than the processor reallocation strategy that does not consider the existing processor allocation.

Study on ride comfort assessment of multiple occupants using lumped parameter analysis

Growing consumer expectations continue to fuel further advancements in vehicle ride comfort analysis including development of a comprehensive tool capable of aiding the understanding of ride comfort. To date, most of the work on biodynamic responses of human body in the context of ride comfort mainly concentrates on driver or a designated occupant and therefore leaves the scope for further work on ride comfort analysis covering a larger number of occupants with detailed modeling of their body segments. In the present study, governing equations of a 13-DOF (degrees-of-freedom) lumped parameter model (LPM) of a full car with seats (7-DOF without seats) and a 7-DOF occupant model, a linear version of an earlier non-linear occupant model, are presented. One or more occupant models can be coupled with the vehicle model resulting into a maximum of 48-DOF LPM for a car with five occupants. These multi-occupant models can be formulated in a modular manner and solved efficiently using MATLAB/SIMULINK for a given transient road input. The vehicle model and the occupant model are independently verified by favorably comparing computed dynamic responses with published data. A number of cases with different dispositions of occupants in a small car are analyzed using the current modular approach thereby underscoring its potential for efficient ride quality assessment and design of suspension systems.

Analytical Determination of Residual Strength and Linkup Strength for Flat Panels, with Multiple Site Damage

The problem of multiple site damage in aged airplane fuselage is handled in this paper. The analytical and numerical procedures used for the estimation of the strength of a flat panel with such multi-site damage are presented. Further, numerical results are presented on the residual strength of the panel using fracture mechanics-based approach and the stress levels when the leading crack is likely to link up with multiple site damage cracks. The presence of multiple site damage cracks in the vicinity of leading crack significantly decreases the residual strength of the panel. The model is verified using experimental data from the open literature and the predictions are in good agreement with the measured residual strength.

Structural and thermodynamic properties of Fe1.12Te with multiple phase transitions

The parent compound of iron chalcogenide superconductors, Fe1+yTe, with a range of excess Fe concentrations exhibits intriguing structural and magnetic properties. Here, the interplay of magnetic and structural properties of Fe1.12Te single crystals have been probed by low-temperature synchrotron X-ray powder diffraction, magnetization, and specific heat measurements. Thermodynamic measurements reveal two distinct phase transitions, considered unique to samples possessing excess Fe content in the range of 0.11 <= y <= 0.13. On cooling, an antiferromagnetic transition, T-N approximate to 57K is observed. A closer examination of powder diffraction data suggests that the transition at TN is not purely magnetic, but accompanied by the commencement of a structural phase transition from tetragonal to orthorhombic symmetry. This is followed by a second prominent first-order structural transition at T-S with T-S < T-N, where an onset of monoclinic distortion is observed. The results point to a strong magneto-structural coupling in this material. (C) 2014 AIP Publishing LLC.

Automatic Data Allocation and Buffer Management for Multi-GPU Machines

Multi-GPU machines are being increasingly used in high-performance computing. Each GPU in such a machine has its own memory and does not share the address space either with the host CPU or other GPUs. Hence, applications utilizing multiple GPUs have to manually allocate and manage data on each GPU. Existing works that propose to automate data allocations for GPUs have limitations and inefficiencies in terms of allocation sizes, exploiting reuse, transfer costs, and scalability. We propose a scalable and fully automatic data allocation and buffer management scheme for affine loop nests on multi-GPU machines. We call it the Bounding-Box-based Memory Manager (BBMM). BBMM can perform at runtime, during standard set operations like union, intersection, and difference, finding subset and superset relations on hyperrectangular regions of array data (bounding boxes). It uses these operations along with some compiler assistance to identify, allocate, and manage data required by applications in terms of disjoint bounding boxes. This allows it to (1) allocate exactly or nearly as much data as is required by computations running on each GPU, (2) efficiently track buffer allocations and hence maximize data reuse across tiles and minimize data transfer overhead, and (3) and as a result, maximize utilization of the combined memory on multi-GPU machines. BBMM can work with any choice of parallelizing transformations, computation placement, and scheduling schemes, whether static or dynamic. Experiments run on a four-GPU machine with various scientific programs showed that BBMM reduces data allocations on each GPU by up to 75% compared to current allocation schemes, yields performance of at least 88% of manually written code, and allows excellent weak scaling.

Unraveling the Intricate Organization of Mammalian Mitochondrial Presequence Translocases: Existence of Multiple Translocases for Maintenance of Mitochondrial Function

Mitochondria are indispensable organelles implicated in multiple aspects of cellular processes, including tumorigenesis. Heat shock proteins play a critical regulatory role in accurately delivering the nucleus-encoded proteins through membrane-bound presequence translocase (Tim23 complex) machinery. Although altered expression of mammalian presequence translocase components had been previously associated with malignant phenotypes, the overall organization of Tim23 complexes is still unsolved. In this report, we show the existence of three distinct Tim23 complexes, namely, B1, B2, and A, involved in the maintenance of normal mitochondrial function. Our data highlight the importance of Magmas as a regulator of translocase function and in dynamically recruiting the J-proteins DnaJC19 and DnaJC15 to individual translocases. The basic housekeeping function involves translocases B1 and B2 composed of Tim17b isoforms along with DnaJC19, whereas translocase A is nonessential and has a central role in oncogenesis. Translocase B, having a normal import rate, is essential for constitutive mitochondrial functions such as maintenance of electron transport chain complex activity, organellar morphology, iron-sulfur cluster protein biogenesis, and mitochondrial DNA. In contrast, translocase A, though dispensable for housekeeping functions with a comparatively lower import rate, plays a specific role in translocating oncoproteins lacking presequence, leading to reprogrammed mitochondrial functions and hence establishing a possible link between the TIM23 complex and tumorigenicity.

Three Dimensional Fluorescence Imaging Using Multiple Light-Sheet Microscopy

We developed a multiple light-sheet microscopy (MLSM) system capable of 3D fluorescence imaging. Employing spatial filter in the excitation arm of a SPIM system, we successfully generated multiple light-sheets. This improves upon the existing SPIM system and is capable of 3D volume imaging by simultaneously illuminating multiple planes in the sample. Theta detection geometry is employed for data acquisition from multiple specimen layers. This detection scheme inherits many advantages including, background reduction, cross-talk free fluorescence detection and high-resolution at long working distance. Using this technique, we generated 5 equi-intense light-sheets of thickness approximately 7: 5 mm with an inter-sheet separation of 15 mm. Moreover, the light-sheets generated by MLSM is found to be 2 times thinner than the state-of-art SPIM system. Imaging of fluorescently coated yeast cells of size 4 +/- 1 mm (encaged in Agarose gel-matrix) is achieved. Proposed imaging technique may accelerate the field of fluorescence microscopy, cell biology and biophotonics.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Programming for parallel architectures that do not have a shared address space is extremely difficult due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and multiple GPUs, or a distributed-memory cluster are examples of such systems. Past works that try to automate data movement for distributed-memory architectures can lead to excessive redundant communication. In this paper, we propose an automatic data movement scheme that minimizes the volume of communication between compute devices in heterogeneous and distributed-memory systems. We show that by partitioning data dependences in a particular non-trivial way, one can generate data movement code that results in the minimum volume for a vast majority of cases. The techniques are applicable to any sequence of affine loop nests and works on top of any choice of loop transformations, parallelization, and computation placement. The data movement code generated minimizes the volume of communication for a particular configuration of these. We use a combination of powerful static analyses relying on the polyhedral compiler framework and lightweight runtime routines they generate, to build a source-to-source transformation tool that automatically generates communication code. We demonstrate that the tool is scalable and leads to substantial gains in efficiency. On a heterogeneous system, the communication volume is reduced by a factor of 11X to 83X over state-of-the-art, translating into a mean execution time speedup of 1.53X. On a distributed-memory cluster, our scheme reduces the communication volume by a factor of 1.4X to 63.5X over state-of-the-art, resulting in a mean speedup of 1.55X. In addition, our scheme yields a mean speedup of 2.19X over hand-optimized UPC codes.