Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Integer Sequence window based Reconfigurable FIR filters

Conventional hardware implementation techniques for FIR filters require the computation of filter coefficients in software and have them stored in memory. This approach is static in the sense that any further fine tuning of the filter requires computation of new coefficients in software. In this paper, we propose an alternate technique for implementing FIR filters in hardware. We store a considerably large number of impulse response coefficients of the ideal filter (having box type frequency response) in memory. We then do the windowing process, on these coefficients, in hardware using integer sequences as window functions. The integer sequences are also generated in hardware. This approach offers the flexibility in fine tuning the filter, like varying the transition bandwidth around a particular cutoff frequency.

Image fusion in GRDSS for Land use Mapping

Image fusion techniques are useful to integrate the geometric detail of a high-resolution panchromatic (PAN) image and the spectral information of a low-resolution multispectral (MSS) image, particularly important for understanding land use dynamics at larger scale (1:25000 or lower), which is required by the decision makers to adopt holistic approaches for regional planning. Fused images can extract features from source images and provide more information than one scene of MSS image. High spectral resolution aids in identification of objects more distinctly while high spatial resolution allows locating the objects more clearly. The geoinformatics technologies with an ability to provide high-spatial-spectral-resolution data helps in inventorying, mapping, monitoring and sustainable management of natural resources. Fusion module in GRDSS, taking into consideration the limitations in spatial resolution of MSS data and spectral resolution of PAN data, provide high-spatial-spectral-resolution remote sensing images required for land use mapping on regional scale. GRDSS is a freeware GIS Graphic User Interface (GUI) developed in Tcl/Tk is based on command line arguments of GRASS (Geographic Resources Analysis Support System) with the functionalities for raster analysis, vector analysis, site analysis, image processing, modeling and graphics visualization. It has the capabilities to capture, store, process, analyse, prioritize and display spatial and temporal data.

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a specially designed multi-dimensional bloom filter to store the points-to information. Two key observations motivate our proposal: (i) points-to information (between pointer-object and between pointer-pointer) is sparse, and (ii) moving from an exact to an approximate representation of points-to information only leads to reduced precision without affecting correctness of the (may-points-to) analysis. By using an approximate representation a multi-dimensional bloom filter can significantly reduce the memory requirements with a probabilistic bound on loss in precision. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that with an average storage requirement of 4MB, our approach achieves almost the same precision (98.6%) as the exact implementation. By increasing the average memory to 27MB, it achieves precision upto 99.7% for these benchmarks. Using Mod/Ref analysis as the client, we find that the client analysis is not affected that often even when there is some loss of precision in the points-to representation. We find that the NoModRef percentage is within 2% of the exact analysis while requiring 4MB (maximum 15MB) memory and less than 4 minutes on average for the points-to analysis. Another major advantage of our technique is that it allows to trade off precision for memory usage of the analysis.

Streaming FFT on REDEFINE-v2: An Application-Architecture Design Space Exploration

In this paper we explore an implementation of a high-throughput, streaming application on REDEFINE-v2, which is an enhancement of REDEFINE. REDEFINE is a polymorphic ASIC combining the flexibility of a programmable solution with the execution speed of an ASIC. In REDEFINE Compute Elements are arranged in an 8x8 grid connected via a Network on Chip (NoC) called RECONNECT, to realize the various macrofunctional blocks of an equivalent ASIC. For a 1024-FFT we carry out an application-architecture design space exploration by examining the various characterizations of Compute Elements in terms of the size of the instruction store. We further study the impact by using application specific, vectorized FUs. By setting up different partitions of the FFT algorithm for persistent execution on REDEFINE-v2, we derive the benefits of setting up pipelined execution for higher performance. The impact of the REDEFINE-v2 micro-architecture for any arbitrary N-point FFT (N > 4096) FFT is also analyzed. We report the various algorithm-architecture tradeoffs in terms of area and execution speed with that of an ASIC implementation. In addition we compare the performance gain with respect to a GPP.

Setting up Multilingual Information Repository: A case Study with EPrints.org Software

Today 80 % of the content on the Web is in English, which is spoken by only 8% of the World population and 5% of Indian population. There is wealth of useful content in the various languages of the world other than English, which can be made available on the Internet. But, to date, for various reasons most of it is not yet available on the Internet. India itself has 18 officially recognized languages and scores of dialects. Although the medium of instruction for most of the higher education and research in India is English, substantial amount of literature by way of novels, textbooks, scholarly information are being generated in the other languages in the country. Many of the e-governance initiatives are in the respective state languages. In the past, support for different languages by the operating systems and the software packages were not very encouraging. However, with the advent of Unicode technology, operating systems and software packages are supporting almost all the major languages of the world that have scripts. In the work reported in this paper, we have explained the configuration changes that are needed for Eprints.org software to store multilingual content and to create a multilingual user interface.

Spatial Decision Support System for Assessing Micro, Mini and Small Hydel Potential

This study describes the design and implementation of DSS for assessment of Mini, Micro and Small Schemes. The design links a set of modelling, manipulation, spatial analyses and display tools to a structured database that has the facility to store both observed and simulated data. The main hypothesis is that this tool can be used to form a core of practical methodology that will result in more resilient in less time and can be used by decision-making bodies to assess the impacts of various scenarios (e.g.: changes in land use pattern) and to review, cost and benefits of decisions to be made. It also offers means of entering, accessing and interpreting the information for the purpose of sound decision making. Thus, the overall objective of this DSS is the development of set of tools aimed at transforming data into information and aid decisions at different scales.

Hydrogen generation fromammonia borane using nanocatalysts

The rapidly depleting petroleum feed stocks and increasing green house gas emissions around the world has necessitated a search for alternative renewable energy sources. Hydrogen with molecular weight of 2.016 g/mol and high chemical energy per mass equal to 142 MJ/kg has clearly emerged as an alternative to hydrocarbon fuels. Means for safe and cost effective storage are needed for widespread usage of hydrogen as a fuel.Chemical storage is the one of the safer ways to store hydrogen compared to compressed and liquefied hydrogen. It involves storing hydrogen in chemical bonds in molecules and materials where an on-board reaction is used to release hydrogen. Ammonia–borane, (AB,H3N·BH3) with a potential capacity of 19.6 wt% is considered a very promising solid state hydrogen storage material. It is thermally stable at ambient temperatures. There are two major routes for the generation of H2 from AB: catalytic hydrolysis/alcoholysis and catalytic thermal decomposition. There has been a flurry of research activity on the generation of H2 from AB recently. The present review deals with an overview of our efforts in developing cost-effective nanocatalysts for hydrogen generation from ammonia borane in protic solvents.

Aquatic Ecosystems: Conservation, Restoration and Management

Aquatic Ecosystems perform numerous valuable environmental functions. They recycle nutrients, purify water, recharge ground water, augment and maintain stream flow, and provide habitat for a wide variety of flora and fauna and recreation for people. A rapid population increase accompanied by unplanned developmental works has led to the pollution of surface waters due to residential, agricultural, commercial and industrial wastes/effluents and decline in the number of water bodies. Increased demands for drainage of wetlands have been accommodated by channelisation, resulting in further loss of stream habitat, which has led to aquatic organisms becoming extinct or imperiled in increasing numbers and to the impairment of many beneficial uses of water, including drinking, swimming and fishing. Various anthropogenic activities have altered the physical, chemical and biological processes within aquatic ecosystems. An integrated and accelerated effort toward environmental restoration and preservation is needed to stop further degradation of these fragile ecosystems. Failure to restore these ecosystems will result in sharply increased environmental costs later, in the extinction of species or ecosystem types, and in permanent ecological damage.

mRegistry: a registry representation for fault diagnosis

Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

Arithmetic coding based lossless compression schemes for power system steady state operational data

Introduction of processor based instruments in power systems is resulting in the rapid growth of the measured data volume. The present practice in most of the utilities is to store only some of the important data in a retrievable fashion for a limited period. Subsequently even this data is either deleted or stored in some back up devices. The investigations presented here explore the application of lossless data compression techniques for the purpose of archiving all the operational data - so that they can be put to more effective use. Four arithmetic coding methods suitably modified for handling power system steady state operational data are proposed here. The performance of the proposed methods are evaluated using actual data pertaining to the Southern Regional Grid of India. (C) 2012 Elsevier Ltd. All rights reserved.

Seismic Stability and Liquefaction Analysis of Tailings Dam

Proper analysis for safe design of tailings earthen dam is necessary under static loading and more so under earthquake conditions to reduce damages of important geotechnical structure. This paper presents both static and seismic analyses of a typical section of tailings earthen dam constructed by downstream method and located at a site in eastern part India to store non-radioactive nuclear waste material. The entire analysis is performed using geotechnical softwares FLAC(3D) and TALREN 4. Results are obtained for various possible conditions of the reservoir to investigate the stability under both static and seismic loading condition using 1989 Loma Prieta earthquake acceleration-time history. FLAC(3D) analyses indicate the critical maximum displacement at crest of the proposed tailings dam section is 5.5 cm under the static loading but it increases to about 16.24 cm under seismic loading. The slope stability analyses provide the minimum value of factor of safety for seismic loading as 1.5 as compared to 2.31 for static loading. Amplification of base seismic acceleration is also observed. The liquefaction potential analysis in FLAC(3D) indicates considerable loss of shear strength in the tailings portion of the proposed earthen dam section with significantly high values of pore pressure ratio.

Characterization and iodide adsorption behaviour of HDPY+ modified bentonite

Owing to its favourable physical, chemical and rheological properties, densely compacted bentonite or bentonite-sand mix is considered as a suitable buffer material in deep geological repositories to store high level nuclear waste. Iodine-129 is one of the significant nuclides in the high level waste owing to its long half life and poor sorption onto most geologic media. Bentonite by virtue of negatively charged surface has negligible affinity to retain iodide ions. As organo-bentonites are known to retain iodide ions, the present study characterizes hexadecylpyridinium chloride (HDPyCl.H2O) treated bentonite from Barmer India (referred as HDPy+B) for physico-chemical properties, engineering properties and the iodide adsorption behavior of the organo clay. Batch experiments revealed that HDPy+ ions are largely retained (94 % retention) via cation exchange; the ion-exchange process neutralizes the negative surface charge and bridges clay particles leading to reduction in Atterberg limits, clay content and sediment volume. The organo clay retains iodide by Coulombic attraction (at primary sites) and anion exchange (at secondary sites). The free-energy change (Delta G (o) = -25.5 kJ/mol) value indicated that iodide retention by organo clay is favored physical adsorption process. Iodide adsorption capacity of organo clay decreased significantly (85-100 %) on dilution with 50-80 % bentonite. On the other hand, dilution of bentonite with 50 % organo clay caused 58 % reduction in swell potential and 21 % reduction in swell pressure.