Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Trichy | Coimbatore | Kollam| SingaporeWebsite: elysiumtechnologies.com, elysiumtechnologies.infoEmail: firstname.lastname@example.org
IEEE Final Year Project List 2011-2012
Elysium Technologies Private Limited230, Church Road, Annanagar,Madurai , Tamilnadu – 625 020.Contact : 91452 4390702, 4392702, 4394702.eMail: email@example.com
Elysium Technologies Private Limited3
Floor,SI Towers,15 ,Melapudur , Trichy,Tamilnadu – 620 001.Contact : 91431 - 4002234.eMail: firstname.lastname@example.org
Elysium Technologies Private LimitedSurya Complex,Vendor junction,kollam,Kerala – 691 010.Contact : 91474 2723622.eMail: email@example.com
A Privacy Preserving Repository for Securing Data across the Cloud
Popularity of cloud computing is increasing day by day in distributed computing environment. There is a growing trend of using cloud environments for storage and data processing needs. Cloud computing is an Internet-based computing,whereby shared resources, software, and information are provided to computers and other devices on demand. However,adopting a cloud computing paradigm may have positive as well as negative effects on the data security of serviceconsumers. This paper primarily highlights some major security issues existing in current cloud computing environments.The primary issue that has to be dealt with when talking about data security in a cloud is protection of the data. The idea isto construct a privacy preserving repository where data sharing services can update and control the access and limit theusage of their shared data, instead of submitting data to central authorities, and, hence, the repository will promote datasharing and privacy of data. This paper aims at simultaneously achieving data confidentiality while still keeping theharmonizing relations intact in the cloud. Our proposed scheme enables the data owner to delegate most of computationintensive tasks to cloud servers without disclosing data contents or user access privilege information.
A Scalable Method for Signalling Dynamic Reconfiguration Events with OpenSM
Rerouting around faulty components, on-the-fly policy changes, and migration of jobs all require reconfiguration of datastructures in the Queue Pairs residing in the hosts on an InfiniBand cluster. In addition to a proper implementation at thehost, the subnet manager needs to implement a scalable method for signaling reconfiguration events to the hosts. In thispaper we propose and evaluate three different implementations for signalling dynamic reconfiguration events with OpenSM.Through our evaluation we demonstrate a scalable solution for signalling host-side reconfiguration events in an InfiniBandnetwork based on an example where dynamic network reconfiguration combined with a topology-agnostic routing functionis used to avoid malfunctioning components. Through measurements on our test-cluster and an analytical study we showthat our best proposal reduces reconfiguration latency by more than 90%and in certain situations eliminates it completely.Furthermore, the processing overhead in the subnet manager is shown to be minimal.
A Segment-Level Adaptive Data Layout Scheme for Improved Load Balance in Parallel File Systems
Parallel file systems are designed to mask the everincreasing gap between CPU and disk speeds via parallel I/O processing.While they have become an indispensable component of modern high-end computing systems, their inadequateperformance is a critical issue facing the HPC community today. Conventionally, a parallel file system stripes a file acrossmultiple file servers with a fixed stripe size. The stripe size is a vital performance parameter, but the optimal value for it isoften application dependent. How to determine the optimal stripe size is a difficult research problem. Based on theobservation that many applications have different data-access clusters in one file, with each cluster having a distinguisheddata access pattern, we propose in this paper a segmented data layout scheme for parallel file systems. The basic ideabehind the segmented approach is to divide a file logically into segments such that an optimal stripe size can be identifiedfor each segment. A five-step method is introduced to conduct the segmentation, to identify the appropriate stripe size for each segment, and to carry out the segmented data layout scheme automatically. Experimental results show that theproposed layout scheme is feasible and effective, and it improves performance up to 163% for writing and 132% for readingon the widely used IOR and IOzone benchmarks
A Sketch-based Architecture for Mining Frequent Items and Itemsets from Distributed Data Streams