Two-level Mapping Based Cache Index Selection for Packet Forwarding Engines

Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the placement function to reduce conflict misses. Traditional placement functions use a one-level mapping that naively partitions trie-nodes into cache sets. However, as a significant percentage of trie nodes are not useful, these schemes suffer from a non-uniform distribution of useful nodes to sets. This in turn results in increased conflict misses. Newer organizations such as variable associativity caches achieve flexibility in placement at the expense of increased hit-latency. This makes them unsuitable for L1 caches.We propose a novel two-level mapping framework that retains the hit-latency of one-level mapping yet incurs fewer conflict misses. This is achieved by introducing a secondlevel mapping which reorganizes the nodes in the naive initial partitions into refined partitions with near-uniform distribution of nodes. Further as this remapping is accomplished by simply adapting the index bits to a given routing table the hit-latency is not affected. We propose three new schemes which result in up to 16% reduction in the number of misses and 13% speedup in memory access time. In comparison, an XOR-based placement scheme known to perform extremely well for general purpose architectures, can obtain up to 2% speedup in memory access time.

Clustering Based Large Margin Classification: A Scalable Approach using SOCP Formulation

This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture distributions, where each component of the mixture has a spherical covariance, the second order statistics of the components can be estimated efficiently using clustering algorithms like BIRCH. For each cluster, the second order moments are used to derive a second order cone constraint via a Chebyshev-Cantelli inequality. This constraint ensures that any data point in the cluster is classified correctly with a high probability. This leads to a large margin SOCP formulation whose size depends on the number of clusters rather than the number of training data points. Hence, the proposed formulation scales well for large datasets when compared to the state-of-the-art classifiers, Support Vector Machines (SVMs). Experiments on real world and synthetic datasets show that the proposed algorithm outperforms SVM solvers in terms of training time and achieves similar accuracies.

Compiler Assisted Leakage Energy Optimization for Clustered VLIW Architectures

Miniaturization of devices and the ensuing decrease in the threshold voltage has led to a substantial increase in the leakage component of the total processor energy consumption. Relatively simpler issue logic and the presence of a large number of function units in the VLIW and the clustered VLIW architectures attribute a large fraction of this leakage energy consumption in the functional units. However, functional units are not fully utilized in the VLIW architectures because of the inherent variations in the ILP of the programs. This underutilization is even more pronounced in the context of clustered VLIW architectures because of the contentions for the limited number of slow intercluster communication channels which lead to many short idle cycles.In the past, some architectural schemes have been proposed to obtain leakage energy bene .ts by aggressively exploiting the idleness of functional units. However, presence of many short idle cycles cause frequent transitions from the active mode to the sleep mode and vice-versa and adversely a ffects the energy benefits of a purely hardware based scheme. In this paper, we propose and evaluate a compiler instruction scheduling algorithm that assist such a hardware based scheme in the context of VLIW and clustered VLIW architectures. The proposed scheme exploits the scheduling slacks of instructions to orchestrate the functional unit mapping with the objective of reducing the number of transitions in functional units thereby keeping them off for a longer duration. The proposed compiler-assisted scheme obtains a further 12% reduction of energy consumption of functional units with negligible performance degradation over a hardware-only scheme for a VLIW architecture. The benefits are 15% and 17% in the context of a 2-clustered and a 4-clustered VLIW architecture respectively. Our test bed uses the Trimaran compiler infrastructure.

An adaptive MAC protocol in MANETs: a democratic approach

Mobile ad-hoc networks (MANETs) have recently drawn significant research attention since they offer unique benefits and versatility with respect to bandwidth spatial reuse, intrinsic fault tolerance, and low-cost rapid deployment. This paper addresses the issue of delay sensitive realtime data transport in these type of networks. An effective QoS mechanism is thereby required for the speedy transport of the realtime data. QoS issue in MANET is an open-end problem. Various QoS measures are incorporated in the upperlayers of the network, but a few techniques addresses QoS techniques in the MAC layer. There are quite a few QoS techniques in the MAC layer for the infrastructure based wireless network. The goal and the challenge is to achieve a QoS delivery and a priority access to the real time traffic in adhoc wireless environment, while maintaining democracy in the resource allocation. We propose a MAC layer protocol called "FCP based FAMA protocol", which allocates the channel resources to the needy in a more democratic way, by examining the requirements, malicious behavior and genuineness of the request. We have simulated both the FAMA as well as FCP based FAMA and tested in various MANET conditions. Simulated results have clearly shown a performance improvement in the channel utilization and a decrease in the delay parameters in the later case. Our new protocol outperforms the other QoS aware MAC layer protocols.

A design methodology for selecting and placement of sensors in multimedia surveillance systems

This paper addresses the problem of how to select the optimal number of sensors and how to determine their placement in a given monitored area for multimedia surveillance systems. We propose to solve this problem by obtaining a novel performance metric in terms of a probability measure for accomplishing the task as a function of set of sensors and their placement. This measure is then used to find the optimal set. The same measure can be used to analyze the degradation in system 's performance with respect to the failure of various sensors. We also build a surveillance system using the optimal set of sensors obtained based on the proposed design methodology. Experimental results show the effectiveness of the proposed design methodology in selecting the optimal set of sensors and their placement.

Some recent developments in solid state galvanic sensors

A critical revi<:w of the possibilities of measuring the ~artlal pressure of sulfur using solid state galvanic cells )'n;;cd on AgI, C" , B-alumina, CaO-Zr02' Na2S04-I and doped ;:":;, ,,,Ilil "Iltl ,,11: auxiliary "jectrodes are presentlOu. SOIll..., df tllc!iL' sYHtcmH h,}vu inherent limltntlol1$ when <:xl'o" ...d to environments contilining both oxygen and sulfur. Electrode polarization due to electronic conduction in the solid electrolyte is a significant factor limiting the ;lC'e,"'acy of isotlwrm:l1 cell",. The electrochemical flux of{lit' !'\)ndlwl Ill}: Ion LhnHO',h tht' ('!('ctrojyt(~ C:Ul },(,! llIinlnliz(,{j pfUjJL!f cell. dL:~) i.t',11. Noni!:iot.herm~ll cells \.Jlth temperaLure compensated reference electrodes have a number of advantages over thC'ir isothermal counterparts.

Energy-efficient redundant execution for chip multiprocessors

Relentless CMOS scaling coupled with lower design tolerances is making ICs increasingly susceptible to wear-out related permanent faults and transient faults, necessitating on-chip fault tolerance in future chip microprocessors (CMPs). In this paper, we describe a power-efficient architecture for redundant execution on chip multiprocessors (CMPs) which when coupled with our per-core dynamic voltage and frequency scaling (DVFS) algorithm significantly reduces the energy overhead of redundant execution without sacrificing performance. Our evaluation shows that this architecture has a performance overhead of only 0.3% and consumes only 1.48 times the energy of a non-fault-tolerant baseline.

Activity of TiO2 in the System ZrO2-TiO2 and Gibbs Energy of Formation of ZrTiO4

The activity of Ti02 in single and two··phase regions of ihe system ZrOrTi02 has heen measured lIsing solid state cells based on yttria··doped tho ria (YDT) as the solid electrolyte at 1373 K. The cells used can be represented as: Pt, Tio.07PtO.Y3 + Zrj.,Tix0 2 / YDT / Ti02 + Tio.07Pto.93, Pt Pt, Tio.07Pto.93 + ZrJ.xTix02 + ZrTi04 / YDT / Ti02+ Tio.07PtO.93, Pt In each cell the composition of Pt-Ti alloy was identical at hoth electrodes. The emf of the cell is therefore directly related to the activity of Ti02 in oxide phase or oxide phase mixture: aTiO~ :;: cxp (-4FE/RT). The activity coefficient of Ti02 in th~ zirconia-rich solid solution with monoclinic structure (CUl2 2" XTi02 2" 0) can be expressed as:In the zirconia-rich solid solution with tetragonal structure (0.085 2" X ri02 2" 0.03), the activity coefficient is given by:In YTi02 (± 0.012) = 2.354 (1-XTiO? )2 +0.064 The standard Gibbs energy of formation of ZrTi04 is -5650 (± 200) J/mol at 1373 K .

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

Atomic layer deposition of ZrO2 thin films: Study of growth kinetics and dielectric behaviour

Thin films of ZrO2 have been deposited by ALD on Si(100) and SIMOX using two different metalorganic complexes of Zr as precursors. These films are characterized by X-ray diffraction, transmission and scanning electron microscopies, infrared spectroscopy, and electrical measurements. These show that amorphous ZrO2 films of high dielectric quality may be grown on Si(100) starting about 400degreesC. As the growth temperature is raised, the films become crystalline, the phase formed and the microstructure depending on precursor molecular structure. The phase of ZrO2 formed depends also on the relative duration of the precursor and oxygen pulses. XPS and IR spectroscopy show that films grown at low temperatures contain chemically unbound carbon, its extent depending on the precursor. C-V measurements show that films grown on Si(100) have low interface state density, low leakage current, a hysteresis width of only 10-250 mV and a dielectric constant of similar to16-25.

Determinant: Old algorithms, new insights (Extended Abstract)

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.

Network Reconstruction from dynamic data

Over the past decade, many powerful data mining techniques have been developed to analyze temporal and sequential data. The time is now fertile for addressing problems of larger scope under the purview of temporal data mining. The fourth SIGKDD workshop on temporal data mining focused on the question: What can we infer about the structure of a complex dynamical system from observed temporal data? The goals of the workshop were to critically evaluate the need in this area by bringing together leading researchers from industry and academia, and to identify promising technologies and methodologies for doing the same. We provide a brief summary of the workshop proceedings and ideas arising out of the discussions.

Mass Distribution Studies in Effervescent Sprays

An experimental study on liquid mass distribution in effervescent sprays using water and air as working fluids is presented in this paper. Optical patternation and techniques of image processing are employed for analyzing the spray. The flow regime inside the effervescent atomizer largely dictates the mass distribution patterns. The patterns are seen to vary from concentrated, poorly atomized liquid lumps to uniformly distributed, fine droplets as the flow regime changes from bubbly flow to annular flow. A large variety of instantaneous spray patterns are observed in bubbly flow regime indicating a highly unsteady atomization process. However, relatively better consistency in spray patterns is observed at higher gas flow rates. Thus, the degree of unsteadiness gradually diminishes as gas flow rate is increased. The axial evolution of the spray in annular mode shows good mixing of liquid and gas across the interface.

Improved algorithm for optimum reactive power allocation

An improvised algorithm is presented for optimal VAr allocation in a large power system using a linear programming technique. The proposed method requires less computer memory than those algorithms currently available.

Infrared Spectroscopic Studies to Understand the Effect of Drugs at Molecular Level

In the recent past, there have been enormous efforts to understand effect of drugs on human body. Prior to understand the effect of drugs on human body most of the experiments are carried out on cells or model organisms. Here we present our study on the effect of chemotherapeutic drugs on cancer cells and the acetaminophen (APAP) induced hepatotoxicity in mouse model. Histone deacetylase inhibitors (HDIs) have attracted attention as potential drug molecules for the treatment of cancer. These are the chemotherapeutic drugs which have indirect mechanistic action against cancer cells via acting against histone deacetylases (HDAC). It has been known that different HDAC enzymes are over-expressed in various types of cancers for example; HDAC1 is over expressed in prostate, gastric and breast carcinomas. Therefore, in order to optimise chemotherapy, it is important to determine the efficacy of various classes of HDAC inhibitor drugs against variety of over-expressed HDAC enzymes. In the present study, FTIR microspectroscopy has been employed to predict the acetylation and propionylation brought in by HDIs. The liver plays an important role in cellular metabolism and is highly susceptible to drug toxicity. APAP which is an analgesic and antipyretic drug is extensively used for therapeutic purposes and has become the most common cause of acute liver failure (ALF). In the current study, we have focused to understand APAP induced hepatotoxicity using FTIR microspectroscopy. In the IR spectrum the bands corresponding to glycogen, ester group and were found to be suitable markers to predict liver injury at early time point (0.5hr) due to APAP both in tissue and serum in comparison to standard biochemical assays. Our studies show the potential of FTIR spectroscopy as a rapid, sensitive and non invasive detection technique for future clinical diagnosis.