Searcharxiv⌕ Search

arXiv subjects

Parveen Kumar

Publications and source records attributed to Parveen Kumar.

39 records · Page 3Linked to original sources

A Low Overhead Minimum Process Global Snapshop Collection Algorithm for Mobile Distributed System

Coordinated checkpointing is an effective fault tolerant technique in distributed system as it avoids the domino effect and require minimum storage requirement. Most of the earlier coordinated checkpoint algorithms block their computation during checkpointing and forces minimum-process or non-blocking but forces all nodes to takes checkpoint even though many of them may not be necessary or non-blocking minimum-process but takes useless checkpoints or reduced useless checkpoint but has higher synchronization message overhead or has high checkpoint request propagation time. Hence in mobile distributed systems there is a great need of minimizing the number of communication message and checkpointing overhead as it raise new issues such as mobility, low bandwidth of wireless channels, frequently disconnections, limited battery power and lack of reliable stable storage on mobile nodes. In this paper, we propose a minimum-process coordinated checkpointing algorithm for mobile distributed system where no useless checkpoints are taken, no blocking of processes takes place and enforces a minimum-number of processes to take checkpoints. Our algorithm imposes low memory and computation overheads on MH's and low communication overheads on wireless channels. It avoids awakening of an MH if it is not required to take its checkpoint and has reduced latency time as each process involved in a global checkpoint can forward its own decision directly to the checkpoint initiator.

cs.DC↗

FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Databases

In recent years, discovery of association rules among itemsets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received considerable research attention and several algorithms for mining frequent itemsets have been developed. Many algorithms have been proposed to discover rules at single concept level. However, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. The discovery of multiple level association rules is very much useful in many applications. In most of the studies for multiple level association rule mining, the database is scanned repeatedly which affects the efficiency of mining process. In this research paper, a new method for discovering multilevel association rules is proposed. It is based on FP-tree structure and uses cooccurrence frequent item tree to find frequent items in multilevel concept hierarchy.

cs.OH↗

Ion transport study of mechanically-milled amorphous AgI-Ag2O-V2O5 fast ionic conductors

The structural and electrical characterizations of mechanically-milled (MM) amorphous fast ionic conductors (a-FICs), viz. xAgI (100-x)[0.67 Ag\_2 O-0.33V\_2O\_5] (x = 40, 50, 55 and 70) have been reported. The amorphisation is restricted only to the compositions which are well within the glass forming region and all samples are found to be highly agglomerated and X-ray amorphous in nature. The frequency dependent ac conductivity, σ'(ω), of the amorphous samples investigated in the frequency range 5Hz -13 MHz and temperature range 100- 350 K shows a dc conductivity regime at low frequencies and a dispersive regime at higher frequencies. The spectra can be described by the Jonscher power law (JPL), \simga'(ω) = σ\_dc +A(T) ω\_n. However, the values σ\_dc (T) and A(T) both show two distinct Arrhenius regions and n (< 1) is found to be temperature dependent, i.e., decreasing with increasing temperature.

cond-mat.mtrl-sci↗