A long-lost relic from the eastern ghats: morphology, distribution and habitat of sepsophis punctatus Beddome, 1870 (Squamata: Scincidae)

Sepsophis punctatus Beddome 1870, the only species of a monotypic genus, was described based on a single specimen from the Eastern Ghats of India. We rediscovered the species based on specimens from Odisha and Andhra Pradesh state, India, after a gap of 137 years, including four specimens from close to the type locality. The holotype was studied in detail, and we present additional morphological characters of the species with details on natural history, habitat and diet. The morphological characters of the holotype along with two additional specimens collected by Beddome are compared with the specimens collected by us. We also briefly discuss the distribution of other members of the subfamily Scincinae and their evolutionary affinities.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Multiple sub-row buffers in DRAM: unlocking performance and energy improvement opportunities

The twin demands of energy-efficiency and higher performance on DRAM are highly emphasized in multicore architectures. A variety of schemes have been proposed to address either the latency or the energy consumption of DRAMs. These schemes typically require non-trivial hardware changes and end up improving latency at the cost of energy or vice-versa. One specific DRAM performance problem in multicores is that interleaved accesses from different cores can potentially degrade row-buffer locality. In this paper, based on the temporal and spatial locality characteristics of memory accesses, we propose a reorganization of the existing single large row-buffer in a DRAM bank into multiple sub-row buffers (MSRB). This re-organization not only improves row hit rates, and hence the average memory latency, but also brings down the energy consumed by the DRAM. The first major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves weighted speedup by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. The proposed MSRB organization enables opportunities for the management of multiple row-buffers at the memory controller level. As the memory controller is aware of the behaviour of individual cores it allows us to implement coordinated buffer allocation schemes for different cores that take into account program behaviour. We demonstrate two such schemes, namely Fairness Oriented Allocation and Performance Oriented Allocation, which show the flexibility that memory controllers can now exploit in our MSRB organization to improve overall performance and/or fairness. Further, the MSRB organization enables additional opportunities for DRAM intra-bank parallelism and selective early precharging of the LRU row-buffer to further improve memory access latencies. These two optimizations together provide an additional 5.9% performance improvement.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Spontaneous Lorentz violation: the case of infrared QED

It is by now clear that the infrared sector of quantum electrodynamics (QED) has an intriguingly complex structure. Based on earlier pioneering work on this subject, two of us recently proposed a simple modification of QED by constructing a generalization of the U(1) charge group of QED to the ``Sky'' group incorporating the well-known spontaneous Lorentz violation due to infrared photons, but still compatible in particular with locality (Balachandran and Vaidya, Eur Phys J Plus 128:118, 2013). It was shown that the ``Sky'' group is generated by the algebra of angle-dependent charges and a study of its superselection sectors has revealed a manifest description of spontaneous breaking of the Lorentz symmetry. We further elaborate this approach here and investigate in some detail the properties of charged particles dressed by the infrared photons. We find that Lorentz violation due to soft photons may be manifestly codified in an angle-dependent fermion mass, modifying therefore the fermion dispersion relations. The fact that the masses of the charged particles are not Lorentz invariant affects their spin content, and time dilation formulas for decays should also get corrections.

An addition to the endemic Indian radiation of Eutropis: Phylogenetic position of Eutropis dissimilis Hallowell (Squamata: Scincidae)

Skinks of the genus Eutropis represent one of the most widespread and speciose lizard groups in tropical Asia. Numerous recent studies have utilized a variety of genes and methods to reconstruct the phylogeny of these lizards, however these studies have not resolved the placement of one of the widely distributed Eutropis Fitzinger, E. dissimilis. We have sequenced a specimen of E. dissimilis from the type locality and our result suggests that it is part of the Indian radiation of Eutropis and not related to African Trachylepis Fitzinger or Southeast Asian Dasia Gray as previously suggested. Furthermore, we report that the sequence of E. dissimilis used in an earlier study of the once cosmopolitan genus `Mabuya' may have been erroneously identified and appears to be a sequence of E. novemcarinata. We also demonstrate that the evolution of a clear lower eyelid, which was considered a synapomorphy for the sister genus Trachylepis, has arisen multiple times in Eutropis.

Bi-Modal DRAM Cache: Improving Hit Rate, Hit Latency and Bandwidth

In this paper, we present Bi-Modal Cache - a flexible stacked DRAM cache organization which simultaneously achieves several objectives: (i) improved cache hit ratio, (ii) moving the tag storage overhead to DRAM, (iii) lower cache hit latency than tags-in-SRAM, and (iv) reduction in off-chip bandwidth wastage. The Bi-Modal Cache addresses the miss rate versus off-chip bandwidth dilemma by organizing the data in a bi-modal fashion - blocks with high spatial locality are organized as large blocks and those with little spatial locality as small blocks. By adaptively selecting the right granularity of storage for individual blocks at run-time, the proposed DRAM cache organization is able to make judicious use of the available DRAM cache capacity as well as reduce the off-chip memory bandwidth consumption. The Bi-Modal Cache improves cache hit latency despite moving the metadata to DRAM by means of a small SRAM based Way Locator. Further by leveraging the tremendous internal bandwidth and capacity that stacked DRAM organizations provide, the Bi-Modal Cache enables efficient concurrent accesses to tags and data to reduce hit time. Through detailed simulations, we demonstrate that the Bi-Modal Cache achieves overall performance improvement (in terms of Average Normalized Turnaround Time (ANTT)) of 10.8%, 13.8% and 14.0% in 4-core, 8-core and 16-core workloads respectively.

PolyMage: Automatic Optimization for Image Processing Pipelines

This paper presents the design and implementation of PolyMage, a domain-specific language and compiler for image processing pipelines. An image processing pipeline can be viewed as a graph of interconnected stages which process images successively. Each stage typically performs one of point-wise, stencil, reduction or data-dependent operations on image pixels. Individual stages in a pipeline typically exhibit abundant data parallelism that can be exploited with relative ease. However, the stages also require high memory bandwidth preventing effective utilization of parallelism available on modern architectures. For applications that demand high performance, the traditional options are to use optimized libraries like OpenCV or to optimize manually. While using libraries precludes optimization across library routines, manual optimization accounting for both parallelism and locality is very tedious. The focus of our system, PolyMage, is on automatically generating high-performance implementations of image processing pipelines expressed in a high-level declarative language. Our optimization approach primarily relies on the transformation and code generation capabilities of the polyhedral compiler framework. To the best of our knowledge, this is the first model-driven compiler for image processing pipelines that performs complex fusion, tiling, and storage optimization automatically. Experimental results on a modern multicore system show that the performance achieved by our automatic approach is up to 1.81x better than that achieved through manual tuning in Halide, a state-of-the-art language and compiler for image processing pipelines. For a camera raw image processing pipeline, our performance is comparable to that of a hand-tuned implementation.