Distributed Multi-Level Recovery in Main-Memory Databases

In this paper we present recovery techniques for distributed main-memory databases, specifically for client-server and shared-disk architectures. We present a recovery scheme for client-server architectures which is based on shipping log records to the server, and two recovery schemes for shared-disk architectures—one based on page shipping, and the other based on broadcasting of the log of updates. The schemes offer different tradeoffs, based on factors such as update rates.Our techniques are extensions to a distributed-memory setting of a centralized recovery scheme for main-memory databases, which has been implemented in the Dalì main-memory database system. Our centralized as well as distributed-memory recovery schemes have several attractive features—they support an explicit multi-level recovery abstraction for high concurrency, reduce disk I/O by writing only redo log records to disk during normal processing, and use per-transaction redo and undo logs to reduce contention on the system log. Further, the techniques use a fuzzy checkpointing scheme that writes only dirty pages to disk, yet minimally interferes with normal processing—all but one of our recovery schemes do not require updaters to even acquire a latch before updating a page. Our log shipping/broadcasting schemes also support concurrent updates to the same page at different sites.     

WALRUS: a similarity retrieval algorithm for image databases

Approaches for content-based image querying typically extract a single signature from each image based on color, texture, or shape features. The images returned as the query result are then the ones whose signatures are closest to the signature of the query image. While efficient for simple images, such methods do not work well for complex scenes since they fail to retrieve images that match the query only partially, that is, only certain regions of the image match. This inefficiency leads to the discarding of images that may be semantically very similar to the query image since they may contain the same objects. The problem becomes even more apparent when we consider scaled or translated versions of the similar objects. We propose WALRUS (wavelet-based retrieval of user-specified scenes), a novel similarity retrieval algorithm that is robust to scaling and translation of objects within an image. WALRUS employs a novel similarity model in which each image is first decomposed into its regions and the similarity measure between a pair of images is then defined to be the fraction of the area of the two images covered by matching regions from the images. In order to extract regions for an image, WALRUS considers sliding windows of varying sizes and then clusters them based on the proximity of their signatures. An efficient dynamic programming algorithm is used to compute wavelet-based signatures for the sliding windows. Experimental results on real-life data sets corroborate the effectiveness of WALRUS'S similarity model.     

Analysis of assembly operations’ difficulty using enhanced expert high-level colored fuzzy Petri net model

Majority of the products can be assembled in several ways that means the same final product can be realized by different sequences of assembly operations. Different degree of difficulty is associated with each sequence of assembly operation and such difficulties are caused by the different mechanical constraints forced by the different sequences of operations. In the past, few notable attempts have been made to represent and enumerate the degree of difficulty associated with an assembly sequence (in the form of triangular fuzzy number) by using the concept of assembly graph. However, such representation schemes do not possess the capabilities to model the user's reasoning and preferences. In this research, an intelligent Petri net model that combines the abilities of modelling, planning and performance evaluation for assembly operation is presented. This modelling tool can represent the issues concerning degree of difficulty associated with assembly sequences. The proposed mechanism is enhanced expert high-level colored fuzzy Petri net (EEHLCFPN) that is a hybrid of knowledge-based system and colored Petri net. An example encompassing assembly of subassemblies is considered to efficiently delineate the modelling capabilities of proposed hybrid petri net model.     

Execution History Guided Instruction Prefetching

The increasing gap in performance between processors and main memory has made effective instructions prefetching techniques more important than ever. A major deficiency of existing prefetching methods is that most of them require an extra port to I-cache. A recent study by Rivers et al. [19] shows that this factor alone explains why most modern microprocessors do not use such hardware-based I-cache prefetch schemes. The contribution of this paper is two-fold. First, we present a method that does not require an extra port to I-cache. Second, the performance improvement for our method is greater than the best competing method BHGP [23] even disregarding the improvement from not having an extra port. The three key features of our method that prevent the above deficiencies are as follows. First, late prefetching is prevented by correlating misses to dynamically preceding instructions. For example, if the I-cache miss latency is 12 cycles, then the instruction that was fetched 12 cycles prior to the miss is used as the prefetch trigger. Second, the miss history table is kept to a reasonable size by grouping contiguous cache misses together and associated them with one preceding instruction, and therefore, one table entry. Third, the extra I-cache port is avoided through efficient prefetch filtering methods. Experiments show that for our benchmarks, chosen for their poor I-cache performance, an average improvement of 9.2% in runtime is achieved versus the BHGP methods [23], while the hardware cost is also reduced. The improvement will be greater if the runtime impact of avoiding an extra port is considered. When compared to the original machine without prefetching, our method improves performance by about 35% for our benchmarks.     

On the polymeric foams: modeling and properties

Polymeric foams are now widely used and researched. The physical properties of polymeric foam can be related to a set of independent structural parameters or variables of the foam. Study of these variables and correlation with commercial FE packages is essential for reliable and faster product development. Some aspects of foam behavior are widely studied while some are little less, like correlation of physical unloading behavior. For example, a lot of work in the area of phenomenological constitutive modeling of uniaxial loading was done, though research in areas of unloading–reloading and their correlation still demands more attention. Increasing number of OEMs and suppliers are moving to computer simulations in the design phase to assess their future products. Hence, different parameters within FE packages play a significant role and also affect the results. Appropriate use of these parameters will narrow down error band and automatically reduce the cycle time and development cost. This brief review is expected to set the perspective for major research work done so far in terms of FE modeling correlation and constitutive modeling of polymeric foam vis-a-vis to its properties.     

Congestion detection technique for multipath routing and load balancing in WSN

In WSN, nodes collect the information from the surrounding environment and transferring to base station. Multiple data transmission in a WSN causes the nodes near the base station to get congested. Here we propose to develop a congestion avoidance and mitigation technique. For that, we select routes based on the distance between sender and receiver, relative success rate (RSR) value of node and buffer occupancy of a node. Based on these three parameters, we define a utility function to be applied to each neighbor of a transmitter node. Hence the transmitter node chooses the highest U-valued node as its next hop node among its neighbors in packet forwarding. Thus we avoid congestion by choosing non-congested nodes as its next hop node and then we mitigate congestion based on RSR values.     

Self generating square/triangular wave and pulse width modulator using a single MO-CCCDTA

A self-generating square/triangular wave and pulse width modulator (PWM) using multiple output current controlled current differencing transconductance amplifier (MO-CCCDTA) is presented. To obtain all the three functions simultaneously from the same topology, the MO-CCCDTA is modified a little bit. The characterisation of the modified MO-CCCDTA structure shows that the parasitic resistances at input terminals (n and p) can be varied via bias current. The maximum useful frequency range is found to be 635 MHz, which is higher than the available literature. The waveform generator and PWM circuit use only one MO-CCCDTA, one grounded capacitor and no resistor; hence suitable for IC implementation. The duty cycle of proposed pulse width modulation can be tuned by bias current of MO-CCCDTA over a wide range. The performances of the proposed block and its applications (square/triangular/PWM) are verified by PSPICE simulation using TSMC 0.35 µm technology. The power consumption is about 1.12 mW. To verify experimentally, a prototype of MO-CCCDTA has been made using commercially available ICs (AD844AN and CA3080) on printed circuit board. The simulation and experimental results verify theoretical proposition well. Monte carlo simulation is carried out, which proves satisfactory performance of the proposed circuit against mismatches. The performance of the proposed circuit is also verified through pre-layout and post-layout simulation results. The required chip area is only 22.415 × 14.6 µm².     

2011 CAV award announcement

The 2011 CAV (Computer-Aided Verification) Award was presented on July 17, 2011 at the 23rd annual CAV conference in Snowbird, Utah to Thomas Ball and Sriram Rajamani of Microsoft Research for their contributions to software model checking, specifically the development of the SLAM/SDV software model checker, which successfully demonstrated computer-aided verification techniques on real programs.     

Novel organic–inorganic composite material as a cation exchanger from a triterpenoidal system of dammar gum: synthesis,characterization and application

A pioneer study has been conducted to synthesize novel hydrogel starting from a non-cellulosic raw material, gum dammar-a triterpenoidal system, and then converting this hydrogel into an organic–inorganic composite zirconium-based ion exchanger. Gum dammar was cross-linked with polyacrylamide zirconium (IV) iodo-oxalate [Gd-cl-poly(AAm)-Zr (IV) iodo-oxalate] by incorporating inorganic precipitates into the polymeric mixture. The polymeric mixture was synthesized using gum dammar (Gd), acrylamide (AAm), N, N′-methylene-bis-acrylamide (MBA) and potassium persulphate (KPS). The reaction conditions for synthesis of hydrogel and ion exchanger such as time (120 min), temperature (70 °C), solvent (4 mL), concentration of monomer (12.97 × 10^?3 mol/L), initiator (1.48 × 10^?4 mol/L), cross-linker (4.22 × 10^?4 mol/L) and ratio of zirconium oxychloride (0.1 M), potassium iodate (0.1 M) and oxalic acid (0.1 M) in ratio 2:3:2 were optimized to obtain maximum ion exchange capacity (2.02 meq/g). The morphology and structure of hydrogel and ion exchanger were studied using FTIR, SEM, XRD and TGA/DTA/DTG. The SEM study was followed by energy dispersive spectroscopy for elemental analysis. The ion exchanger was quite stable in various acids and bases at low concentration but it completely dissolved in acids and bases at high concentrations. Distribution studies showed that the synthesized ion exchanger had high selectivity for Pb²⁺ ions. Thus, the polymeric-inorganic hybrid material showed integration of both inorganic and organic characteristics within the composite material.