{"title":"Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology","authors":"G. Sachdeva, Abhishek Patel, Henry Kasim, S. See","doi":"10.1109/3PGCIC.2011.33","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.33","url":null,"abstract":"In this paper, we have proposed efficient algorithms for simulating Infiniband networks using a non-blocking fully populated Fat-Tree topology. These algorithms successfully model Fat-Tree Infiniband networks and introduce an efficient routing scheme for multi-source multi-destination routing. Our aim is to use maximum/minimum portion of the topology for each instance of routing and calculate efficiency of network used. Initially we find all possible routes for each source-destination pair. Then, one path is selected per pair such that the constraint of minimum/maximum network usage is satisfied. After final paths have been obtained for all pairs, the network efficiency is calculated. We have considered only latency of links assuming that switches in the network do not have any latency. Hence, this paper includes our algorithms for modelling, routing and performance evaluation of Infiniband networks for a Fat-Tree topology.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Xhafa, J. Kolodziej, L. Barolli, Vladi Koliçi, Rozeta Miho, M. Takizawa
{"title":"Evaluation of Hybridization of GA and TS Algorithms for Independent Batch Scheduling in Computational Grids","authors":"F. Xhafa, J. Kolodziej, L. Barolli, Vladi Koliçi, Rozeta Miho, M. Takizawa","doi":"10.1109/3PGCIC.2011.31","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.31","url":null,"abstract":"Computing efficiently a planning of incoming jobs to available machines in the Grid system is a main requirement for optimized system performance. One version of the problem is that of independent batch scheduling in which jobs are assumed independent and are scheduled in batches aiming to minimize the make span and flow time. Given the hardness of the problem, heuristics are used to find high quality solutions for practical purposes of designing efficient Grid schedulers. In this paper we present a study on the performance of two algorithms for the problem: Genetic Algorithms (GAs) and Tabu Search (TS), and two hybridizations of them, namely, the GA(TS) and GA-TS which differ in the way the main control and cooperation among GA and TS are implemented. The hierarchic and simultaneous optimization modes are considered for the bi-objective scheduling problem. The evaluation is done using different grid scenarios generated by a grid simulator. The computational results showed that the hybrid algorithms outperforms both the GA and TS for make span parameter but not for the flow time parameter.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132605343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enabling Business Rules for Concurrent Transactions","authors":"H. Decker, R. D. Juan-Marín","doi":"10.1109/3PGCIC.2011.38","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.38","url":null,"abstract":"Business rules (a.k.a. integrity constraints) are crucial for maintaining the consistency of business intelligence data. However, business rule enforcement may easily be derailed by concurrent transactions. The problem is further aggravated by the usual insistence on two requirements: the total integrity premise and the isolated integrity premise. In order to limit the accumulation of integrity violations, while avoiding the stringency of the two premises, we propose a metric-based inconsistency-tolerant approach to the maintenance of business rules.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115122106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Video Manager for Relational Stream Processing Systems","authors":"Tsubasa Takahashi, H. Kawashima, H. Kitagawa","doi":"10.1109/3PGCIC.2011.64","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.64","url":null,"abstract":"Video streams are increasing by the development of network environments and price reduction of camera devices. Therefore needs of applications for querying video streams such as surveillance systems are on the increase. Meanwhile, relational stream processing systems have been researched for querying tuple streams. It is hard to deal with video streams by relational stream processing systems because video streams have time dependency which tuple streams do not have. In this paper, we propose a video manager for relational stream processing systems to integrate video streams and tuple streams. It can be used to query video streams using relational operators by relational stream processing systems and we can obtain resulting video data using RTSP. A video manager manages video data as MPEG-4 files so that they can be played easily by common media players. Finally we implemented a prototype system and evaluated its performance.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125056725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Energy Saving Scheme on Storage Systems for Video Delivery Services","authors":"Yousuke Watanabe, H. Yokota","doi":"10.1109/3PGCIC.2011.67","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.67","url":null,"abstract":"In recent years, large scale computational resources are required to manage huge volume of data. However, their energy consumption is increasing year by year, thus performance of energy saving is paid much attention today. Storage systems are energy consuming devices in computers, so energy saving in storage systems is important. In this paper, we propose an energy saving scheme on storage systems for video delivery services. A conventional approach to reduce energy consumption is stopping rotation of disks while HDDs are not accessed. But, it brings increase of access delays, because restarting disk rotation needs 10 -- 30 seconds. To solve this problem, we consider both data placement based on data popularity and prefix caching. Popular video files are located on HDDs never stopped, and unpopular video files are located on stoppable HDDs. Instead of unpopular video files, we locate prefix caches, which contain initial frames of the video files, on non-stop HDDs. When a video file in a stopped HDD is requested, prefix cache is used instead of the original video file until disk rotation restarts. We show efficiency of our scheme in our simulation experiment.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122703957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Min Peng, Xiaoxiao Ma, Ye Tian, Mingyi Yang, Hua Long, Quanchen Lin, X. Xia
{"title":"The Web Information Extraction for Update Summarization Based on Shallow Parsing","authors":"Min Peng, Xiaoxiao Ma, Ye Tian, Mingyi Yang, Hua Long, Quanchen Lin, X. Xia","doi":"10.1109/3PGCIC.2011.26","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.26","url":null,"abstract":"Traditional text information extraction methods mainly act on static documents and are difficult to reflect the dynamic evolvement of information update on the web. To address this challenge, this work proposes a new method based on shallow parsing with rules. The rules are generated according to the syntactic features of English texts, such as the tense of verbs, the usages of modal verbs and so on. The latest novel information in English news texts is extracted correctly, to meet the needs of users for accessing to updated information of the developing events quickly and effectively. Performance results show the improvement of the proposed scheme in this work.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129283034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid Architecture for Intensive Data Analysis","authors":"O. Terzo, L. Mossucca, P. Ruiu, G. Caragnano","doi":"10.1109/3PGCIC.2011.23","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.23","url":null,"abstract":"The new Italian GPS receiver for Radio Occultation has been launched from Satish Dhawan Space Center (Sriharikota, India) on board of the Indian Remote Sensing OCEANSAT-2 satellite. The Italian Space Agency has established a set of Italian universities and research centers to develop an infrastructure based on hybrid architecture, that is implemented for the overall processing Radio Occultation chain. The algorithms adopted can be used to characterize the temperature, pressure and humidity. In consideration of great deal of data to process, in case of saturation of physical resources, the system is able to start virtual machines on demand in order to solve temporary peak processing due saturation grid system.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122361762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Dynamic Replication Algorithm for Hierarchy Networks in Data Grid","authors":"N. Mansouri, G. Dastghaibyfard","doi":"10.1109/3PGCIC.2011.36","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.36","url":null,"abstract":"Data grid provides massive aggregated computing resources and distributed storage space to deal with data-intensive applications. Due to limitation of available resources in grid as well as production the large number of workloads, efficient use of the grid resources becomes important challenge. Replication provides decreased bandwidth consumption, improved fault tolerance, and enhanced scalability. Although replication is a key technique, but the problem of selecting proper locations for placing replicas i.e. best replica placement in Data Grid has not been widely studied, yet. In this paper a modified 3-layer hierarchical replication algorithm is proposed for dynamic creation of replicas, replica selection and especially replica placement which selects best location. The simulation and experiment results show the proposed replication strategy outperforms over current strategies about 14%.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127179329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Angabini, N. Yazdani, T. Mundt, Fatemeh Hassani
{"title":"Suitability of Cloud Computing for Scientific Data Analyzing Applications; An Empirical Study","authors":"A. Angabini, N. Yazdani, T. Mundt, Fatemeh Hassani","doi":"10.1109/3PGCIC.2011.37","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.37","url":null,"abstract":"Increasing amount of data and demand to process and analyze them induces enterprises to employ alternative computing paradigms to overcome computing capacity shortages. Cloud Computing is a new emerged computing approach that promises scalability of resources, on-demand availability and pay-as-you-go economic model instead of heavy investment on IT resources. However, to decide on choosing Cloud as computing platform, all aspects such as cost and performance trade-offs should be considered. In this paper, we conduct an experimental research to discover empirical challenges of developing a data-intensive application and compare realistic costs of Cloud development versus using local servers. We also discuss our method of calculating Cloud and local resources costs, analyze obtained experimental results and different issues of exploiting Cloud for different types of applications in two major interactive and batch categories.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130684977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Anjum, N. Bessis, Richard Hill, R. McClatchey, I. Habib, K. Soomro, P. Bloodsworth, A. Branson
{"title":"Provenance Management for Neuroimaging Workflows in neuGrid","authors":"A. Anjum, N. Bessis, Richard Hill, R. McClatchey, I. Habib, K. Soomro, P. Bloodsworth, A. Branson","doi":"10.1109/3PGCIC.2011.20","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.20","url":null,"abstract":"An increased amount of large scale, collaborative biomedical research has recently been conducted on e-Science infrastructures. Such research typically involves conducting comparative analysis on large amounts of data to search for biomarkers for diseases. Running these analysis manually can often be quite cumbersome, labour-intensive and error-prone. Significant work has been invested into automating such analysis with appropriately configured workflows. It is also important for biomedical researchers to validate analysis outcomes, to ensure the reproducibility of the results and to ascertain the ownership of specific scientific results. The detailed, traceable information required for this is often referred to as provenance data. Developing suitable methods and approaches to managing provenance data in large-scale distributed e-Science environments is another important area of research currently being investigated. We present an approach that has been adopted in the neu GRID project, which aims to develop an infrastructure to facilitate research into neurodegenerative disease studies such as Alzheimer's. To facilitate the automation of complex, large-scale analysis in neu GRID, we have adapted CRISTAL, a workflow and provenance tracking solution. The use of CRISTAL has provided a rich environment for neuroscientists to track and manage the evolution of both data and workflows in the neu GRID infrastructure.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}