J. L. Laredo, B. Dorronsoro, Johnatan E. Pecero, P. Bouvry, J. Durillo, C. Fernandes
{"title":"Designing a Self-Organized Approach for Scheduling Bag-of-Tasks","authors":"J. L. Laredo, B. Dorronsoro, Johnatan E. Pecero, P. Bouvry, J. Durillo, C. Fernandes","doi":"10.1109/3PGCIC.2012.28","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.28","url":null,"abstract":"This paper proposes a decentralized and self-organized agent system for dynamically load-balancing tasks arriving in the form of Bags-of-Tasks (BoTs) in large-scale decentralized systems. the approach is inspired by the emergent behavior of the sand pile model, a cellular automaton behaving at the edge of chaos. Depending on the state of the cellular automaton, rather different responses may occur when a new task is assigned to a resource. It may change nothing or generate avalanches that reconfigure the state of the system. the proportion between the abundance of avalanches and their sizes shows a power-law relation, a scale-invariant behavior that does not need to be tuned. That means that large - catastrophic - avalanches are very rare but small ones occur very often. Such a smart and emergent behavior fits well with the idea of non-clairvoyant scheduling, where tasks are load balanced into computing resources trying to maximize the performance but without assuming any knowledge on the tasks features. In order to study the viability of the approach, we have conducted an empirical experimentation which shows that the sand pile is able to find near-optimal schedules by reacting differently to different conditions of workloads and architectures.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125338735","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":"Case-Based Reasoning in Parallel Environments","authors":"Juan Carlos Saborío-Morales, A. Ossa","doi":"10.1109/3PGCIC.2012.16","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.16","url":null,"abstract":"Case-Based Reasoning may help address problems with difficult mathematical formalizations in artificial intelligence, such as decision making. While these models usually carry a series of structural and functional dependencies that may affect parallel speedup and efficiency, there are other performance features that justify parallel implementations. This paper presents a reworking of the classical structures and methods of Case-Based Reasoning, redefined for parallel environments, alongside performance analysis techniques suitable for symbolic representations.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"400 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115205835","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":"Evaluation of 2D Color Code Reading Characteristics for User Attestation System","authors":"Noriyasu Yamamoto, T. Wakahara","doi":"10.1109/3PGCIC.2012.33","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.33","url":null,"abstract":"In order to provide a low-cost and simple user attestation method, in our previous work, we proposed a method with strong authentication by using digital camera of cellular phone. However, this method by using 2D color code has some process costs such as create and decode 2D color code. For this reason, we presented an improved version of the attestation system using a cellular phone and 2D color code. In this paper, we present a reading method and the improved 2D color code for our attestation system. The efficiency of the proposed reading method of 2D color code is confirmed by some experimental results.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133084301","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":"Distributed Computing with RESTful Web Services","authors":"F. Orellana, Marko Niinimäki","doi":"10.1109/3PGCIC.2012.30","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.30","url":null,"abstract":"High performance applications such as gene sequence alignment searching, data mining, graphics rendering and Monte Carlo simulations in finance and science are putting ever-increasing load on computing infrastructure. Traditionally, such pleasingly parallel workloads are parallelized using standard batch scheduling or, on a larger scale, web-service-based grid middleware, which is traditionally based on SOAP web services. It is argued that Restful web services provide a natural framework for such asynchronous distributed computing and allow an architecture more suited for on-demand computing. Concretely, the services of the Grid Factory distributed computing system are described. These services are implemented as Apache modules, leveraging Apache APIs for access control and database access. Moreover, the standard Apache modules mod_dav and mod_ssl are used for file serving, authentication and and encryption. The characteristics of the system are described and the performance of this direct use of Apache as hosting platform is evaluated. The system has been subjected to initial testing, demonstrating the feasibility of the approach.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133182898","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 Parallel Evolutionary Algorithm for Multilayered Robust Network Design","authors":"C. Risso, Sergio Nesmachnow, F. Robledo","doi":"10.1109/3PGCIC.2012.4","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.4","url":null,"abstract":"Over the last decades multilayered networks have been a key design component for telecommunications infrastructure. Although some works have addressed the optimization of multi-overlay networks, just a few of them are contextualized for the current technological environment. This article focuses on solving the problem of designing a minimum-cost fault-tolerant multi-overlay network. the problem is NP-hard, and exact techniques are not appropriate to compute accurate solutions efficiently, so the application of sequential and parallel genetic algorithm to solve the problem is explored. the experimental analysis is performed on real-world scenarios, built from an IP/MPLS data network mounted over a DWDM optical network. the analysis shows that the studied genetic algorithms are able to obtain promising results, while the parallel model significantly speeds up the problem resolution.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122270073","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}
M. Anas, N. Javaid, A. Mahmood, S. Raza, U. Qasim, Z. Khan
{"title":"Minimizing Electricity Theft Using Smart Meters in AMI","authors":"M. Anas, N. Javaid, A. Mahmood, S. Raza, U. Qasim, Z. Khan","doi":"10.1109/3PGCIC.2012.42","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.42","url":null,"abstract":"Global energy crises are increasing every moment. Every one has the attention towards more and more energy production and also trying to save it. Electricity can be produced through many ways which is then synchronized on a main grid for usage. The main issue for which we have written this survey paper is losses in electrical system. Weather these losses are technical or non-technical. Technical losses can be calculated easily, as we discussed in section of mathematical modeling that how to calculate technical losses. Where as nontechnical losses can be evaluated if technical losses are known. Theft in electricity produce non-technical losses. To reduce or control theft one can save his economic resources. Smart meter can be the best option to minimize electricity theft, because of its high security, best efficiency, and excellent resistance towards many of theft ideas in electromechanical meters. So in this paper we have mostly concentrated on theft issues.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235118","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 Parallel Bidirectional Sieve Based on SMP Cluster","authors":"Gang Liao, Lianjie Luo, N. Che","doi":"10.1109/3PGCIC.2012.36","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.36","url":null,"abstract":"This paper examines a new measure of bidirectional sieve in hybrid parallelism based on SMP Cluster, which is the individual computational units joined together by the communication network, are usually shared-memory systems with one or more multicore processors. to high-efficiency optimization, we propose average allocate data into nodes and generate double-ended queues (deque) in order to Intra-Node simultaneously sifting out primes from deque's head and tail. Each node also create a FIFO queue as dynamic data buffer to ache temporary sieve from another nodes and Each node can exploit queue and deque to optimize sieve. Algorithms to combine these estimates and produce a huge speedup and efficiency are presented and justified. Our proposed model is verified through experimental study.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126686479","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":"Analysis of HnH Model for Live Streaming Channels with a Small Number of Viewers","authors":"I. Shahriar, D. Qiu, B. Jaumard","doi":"10.1109/3PGCIC.2012.9","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.9","url":null,"abstract":"Current trends show an increasing number of Dedicated Channels having a Small number of Viewers (DCSV for short) in multi-channel live streaming systems. Usually, DCSV channels are either user generated or dedicated channels and they suffer adversely from poor channel performance, mainly, due to having a small number of participants. As a result, when a viewer explicitly requests for a block of streaming content, the probability that the requested block of data will be available among the existing viewers is less than what is required in order to offer a continuous service. We propose HnH (short for Hand in Hand), a novel scheme of cross-channel resource sharing, in order to solve the performance problem of DCSV channels due to their small number of viewers. We next develop a discrete-time stochastic model in order to analyze the performance issues of the proposed HnH scheme and provide insight into it. Numerical experiments were conducted in order to first validate the stochastic model, and then to evaluate the performance of the HnH scheme. Experiments showed that the HnH scheme allows an improvement of the quality of service for the viewers of DCSV channels.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114723966","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}