This work presents the application of a parallel micro-CHC evolutionary algorithm to the scheduling problem in heterogeneous computing environments, to minimize the make span and weighted response ratio objectives. The studied problem is NP-hard, and significant effort has been made to develop efficient methods to compute accurate schedules in reduced execution times. Efficient numerical results are reported in the experimental analysis performed on both well-known and new large problem instances that model medium-sized grid environments. The parallel micro-CHC achieves a high problem solving efficacy and shows a good scalability behavior when facing high dimension instances.
{"title":"Multiobjective Scheduling on Distributed Heterogeneous Computing and Grid Environments Using a Parallel Micro-CHC Evolutionary Algorithm","authors":"Sergio Nesmachnow, S. Iturriaga","doi":"10.1109/3PGCIC.2011.29","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.29","url":null,"abstract":"This work presents the application of a parallel micro-CHC evolutionary algorithm to the scheduling problem in heterogeneous computing environments, to minimize the make span and weighted response ratio objectives. The studied problem is NP-hard, and significant effort has been made to develop efficient methods to compute accurate schedules in reduced execution times. Efficient numerical results are reported in the experimental analysis performed on both well-known and new large problem instances that model medium-sized grid environments. The parallel micro-CHC achieves a high problem solving efficacy and shows a good scalability behavior when facing high dimension instances.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"16 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":"133784105","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}
J. Dondo, Jesús Barba, Fernando Rincón Calle, Francisco Sánchez, D. Fuente, J. C. López
Lately, the use of GPUs is dominant in the field of high performance computing systems for computer graphics. However, since there is "not good for everything" solution, GPUs have also some drawbacks that make them not the best choice in certain scenarios: poor performance per watt ratio, difficulty to rewrite code to explode the parallelism and synchronization issues between computing cores, for example. In this work, we present the R-GRID approach based on the grid computing paradigm, with the purpose of integrating heterogenous reconfigurable devices under the umbrella of the distributed object paradigm. With R-GRID the aim is to offer an easy way to non experience hardware developers for building image processing applications using a component model. Deployment, communication, resource sharing, data access and replication of the processing cores is handled in an automatic and transparent manner, so coarse grained parallelism can be exploited effortless in R-GRID, accelerating image processing operations.
{"title":"Distributed Reconfigurable Hardware for Image Processing Acceleration","authors":"J. Dondo, Jesús Barba, Fernando Rincón Calle, Francisco Sánchez, D. Fuente, J. C. López","doi":"10.1109/3PGCIC.2011.42","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.42","url":null,"abstract":"Lately, the use of GPUs is dominant in the field of high performance computing systems for computer graphics. However, since there is \"not good for everything\" solution, GPUs have also some drawbacks that make them not the best choice in certain scenarios: poor performance per watt ratio, difficulty to rewrite code to explode the parallelism and synchronization issues between computing cores, for example. In this work, we present the R-GRID approach based on the grid computing paradigm, with the purpose of integrating heterogenous reconfigurable devices under the umbrella of the distributed object paradigm. With R-GRID the aim is to offer an easy way to non experience hardware developers for building image processing applications using a component model. Deployment, communication, resource sharing, data access and replication of the processing cores is handled in an automatic and transparent manner, so coarse grained parallelism can be exploited effortless in R-GRID, accelerating image processing operations.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"26 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":"129395585","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}
Android is a complete and innovative Open Source platform for mobile devices. FB-aodv is an extension of the existing AODV protocol. This work propose creation of a Mobile Ad-hoc Network with Android smart phones. We used FB-aodv to manage the networks and some bash script to share informations within the networks. MANET was tested by simple applications to view local neighbors, to send sms and voice over the networks.
{"title":"How to Work with Android within a (FB-)Aodv Network","authors":"N. Corriero, A. Mottola, Eustrat Zhupa","doi":"10.1109/3PGCIC.2011.16","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.16","url":null,"abstract":"Android is a complete and innovative Open Source platform for mobile devices. FB-aodv is an extension of the existing AODV protocol. This work propose creation of a Mobile Ad-hoc Network with Android smart phones. We used FB-aodv to manage the networks and some bash script to share informations within the networks. MANET was tested by simple applications to view local neighbors, to send sms and voice over the networks.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1994 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":"113966371","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}
Recently, with the variety of contents in video streaming services, the demand for system assisting users' content selection is increasing. P2P live streaming distribution is one of the solutions to reduce load of distributors. In P2P live streaming, users select desired contents with the help of content catalog. Users join content network and then, play back some contents. In traditional streaming system, special servers need to collect information for content recommendation in order to assist interesting content selection from multiple contents. This method is unsuitable for P2P live streaming. This paper proposes new P2P live streaming system that can select and distribute recommended contents on time based on users' similarity derived by access log of contents in an autonomous and decentralized manner.
{"title":"P2P Live Streaming System with Content Recommendation Based on Users' Preference","authors":"Y. Hirota, Takayuki Hisada, H. Tode, K. Murakami","doi":"10.1109/3PGCIC.2011.68","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.68","url":null,"abstract":"Recently, with the variety of contents in video streaming services, the demand for system assisting users' content selection is increasing. P2P live streaming distribution is one of the solutions to reduce load of distributors. In P2P live streaming, users select desired contents with the help of content catalog. Users join content network and then, play back some contents. In traditional streaming system, special servers need to collect information for content recommendation in order to assist interesting content selection from multiple contents. This method is unsuitable for P2P live streaming. This paper proposes new P2P live streaming system that can select and distribute recommended contents on time based on users' similarity derived by access log of contents in an autonomous and decentralized manner.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"417 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":"116182664","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}
Peer-to-peer systems are subject to frequent changes, fact which makes the resource management a very complex task. With the aim of reaching extreme scalability, centralized models no longer represent feasible solutions. Thus, we need to build flexible, adaptive, robust, and self-organizing systems, able to overcome all these challenges. We propose the design of a peer-to-peer overlay inspired from the layout of a honeycomb. In contrast with the common 2-dimensional grid, this structure reduces the number of neighbors that each node is connected to. Therefore, reorganizing the system in case of failures is done faster and with lower overhead. To generate and maintain the hexagonal overlay, the nodes rely on specific mechanisms explained and analyzed in this work.
{"title":"Using Bio-inspired Models to Design Peer-to-Peer Overlays","authors":"Bogdan Ghit, Florin Pop, V. Cristea","doi":"10.1109/3PGCIC.2011.45","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.45","url":null,"abstract":"Peer-to-peer systems are subject to frequent changes, fact which makes the resource management a very complex task. With the aim of reaching extreme scalability, centralized models no longer represent feasible solutions. Thus, we need to build flexible, adaptive, robust, and self-organizing systems, able to overcome all these challenges. We propose the design of a peer-to-peer overlay inspired from the layout of a honeycomb. In contrast with the common 2-dimensional grid, this structure reduces the number of neighbors that each node is connected to. Therefore, reorganizing the system in case of failures is done faster and with lower overhead. To generate and maintain the hexagonal overlay, the nodes rely on specific mechanisms explained and analyzed in this work.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"40 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":"123374564","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}
Because of its sheer size, Computational Grids (CGs) require advanced methodologies and strategies to efficiently schedule users tasks and applications to resources. Scheduling becomes even more challenging when energy efficiency, classical make span criterion and user perceived Quality of Service (QoS) are treated as first-class objectives in CG resource allocation methodologies. In this paper we approach the independent batch scheduling in CG as a biobjective minimization problem with make span and energy consumption as the scheduling criteria. We use the Dynamic Voltage Scaling (DVS) methodology for reducing the cumulative power energy utilized by the system resources. We develop two Genetic Algorithms (GAs) with elitist and struggle replacement mechanisms as energy-aware schedulers. The proposed algorithms were experimentally evaluated for four CG size scenarios in static and dynamic modes. The simulation results showed that our proposed GA-based schedulers fairly reduce the energy usage to a level that is sufficient to maintain the desired quality level(-s)
{"title":"Genetic Algorithms for Energy-Aware Scheduling in Computational Grids","authors":"J. Kolodziej, S. Khan, F. Xhafa","doi":"10.1109/3PGCIC.2011.13","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.13","url":null,"abstract":"Because of its sheer size, Computational Grids (CGs) require advanced methodologies and strategies to efficiently schedule users tasks and applications to resources. Scheduling becomes even more challenging when energy efficiency, classical make span criterion and user perceived Quality of Service (QoS) are treated as first-class objectives in CG resource allocation methodologies. In this paper we approach the independent batch scheduling in CG as a biobjective minimization problem with make span and energy consumption as the scheduling criteria. We use the Dynamic Voltage Scaling (DVS) methodology for reducing the cumulative power energy utilized by the system resources. We develop two Genetic Algorithms (GAs) with elitist and struggle replacement mechanisms as energy-aware schedulers. The proposed algorithms were experimentally evaluated for four CG size scenarios in static and dynamic modes. The simulation results showed that our proposed GA-based schedulers fairly reduce the energy usage to a level that is sufficient to maintain the desired quality level(-s)","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"20 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":"114317231","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}
Today smart phones integrate many sensors and provide large computing capacities. They enable the shift towards massive quantities of real-time information becoming access push rather than demand pull on a global case. In this we describe CAPIM, a platform to support such a paradigm. It integrates services to monitor and a context for adapt with the user's context using sensors and capabilities of smart phones, together with online social data. It integrates context-aware services that are dynamically configurable and use the user's location, identity, preferences, profile, and relations with individuals, as well as capabilities of the mobile devices to manifest themselves in many different ways and re-invent themselves over and over again. Such services aggregate and semantically organize the context data. They react based on dynamically defined context-oriented workflows, and the platform includes an execution engine that supports context-aware actions for orientation, information, and recommendation. We describe the architectural decisions of our platform, together with implementations details, and present several case study scenarios which show its potential to handle a variety of context-aware situations.
{"title":"CAPIM: A Platform for Context-Aware Computing","authors":"C. Dobre","doi":"10.1109/3PGCIC.2011.48","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.48","url":null,"abstract":"Today smart phones integrate many sensors and provide large computing capacities. They enable the shift towards massive quantities of real-time information becoming access push rather than demand pull on a global case. In this we describe CAPIM, a platform to support such a paradigm. It integrates services to monitor and a context for adapt with the user's context using sensors and capabilities of smart phones, together with online social data. It integrates context-aware services that are dynamically configurable and use the user's location, identity, preferences, profile, and relations with individuals, as well as capabilities of the mobile devices to manifest themselves in many different ways and re-invent themselves over and over again. Such services aggregate and semantically organize the context data. They react based on dynamically defined context-oriented workflows, and the platform includes an execution engine that supports context-aware actions for orientation, information, and recommendation. We describe the architectural decisions of our platform, together with implementations details, and present several case study scenarios which show its potential to handle a variety of context-aware situations.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"31 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":"115820649","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}
Eliana-Dina Tirsa, M. Andreica, V. Cristea, N. Tapus
In this paper we argue our view for providing a set of configurable building blocks for the development of distributed services and discuss in detail the architecture of two such blocks: a fault-tolerant, fully decentralized resource selection component to be used in virtual Cloud-like environments (not necessarily restricted to clusters) and a Python-based framework for developing point-to-point communication protocols. The resource selection component is based on a multidimensional P2P object storage architecture where a set of peers manage a large number of objects.
{"title":"Towards Configurable Building Blocks for the Development of Distributed Services: Resource Selection and Communication Protocols","authors":"Eliana-Dina Tirsa, M. Andreica, V. Cristea, N. Tapus","doi":"10.1109/3PGCIC.2011.50","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.50","url":null,"abstract":"In this paper we argue our view for providing a set of configurable building blocks for the development of distributed services and discuss in detail the architecture of two such blocks: a fault-tolerant, fully decentralized resource selection component to be used in virtual Cloud-like environments (not necessarily restricted to clusters) and a Python-based framework for developing point-to-point communication protocols. The resource selection component is based on a multidimensional P2P object storage architecture where a set of peers manage a large number of objects.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"8 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":"127763913","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}
Network coding is a new technique in the field of information theory and coding theory. This emerging technique offers great benefits in the communication networks such as increased throughput and energy savings. In this paper, we evaluate a multi-source scheme using network coding for video multicast scenarios. In this scheme, the source nodes encode the video packets, while the intermediate nodes implement network coding before forwarding the encoded packets to the end nodes. Finally, the end nodes decode the received packets in order to recovery the original video. H.264/MPEG-4 AVC is used as the video compression standard in this work. We have used the network simulator (NS-2) for our simulations. Our results show that network coding improves the system throughput, reduces the packet loss and improves the video quality in the end nodes.
{"title":"Video Transmission in Multicast Networks Using Network Coding","authors":"C. Cabrera-Medina, F. A. López-Fuentes","doi":"10.1109/3PGCIC.2011.66","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.66","url":null,"abstract":"Network coding is a new technique in the field of information theory and coding theory. This emerging technique offers great benefits in the communication networks such as increased throughput and energy savings. In this paper, we evaluate a multi-source scheme using network coding for video multicast scenarios. In this scheme, the source nodes encode the video packets, while the intermediate nodes implement network coding before forwarding the encoded packets to the end nodes. Finally, the end nodes decode the received packets in order to recovery the original video. H.264/MPEG-4 AVC is used as the video compression standard in this work. We have used the network simulator (NS-2) for our simulations. Our results show that network coding improves the system throughput, reduces the packet loss and improves the video quality in the end nodes.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1 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":"130423800","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}
Vehicular ad-hoc networks (VANETs) have a great potential to improve road safety, traffic jams, fuel consumption, and to increase passenger convenience in vehicles. However, VANETs use an open medium for communication and, therefore, are exposed to security threats that influence their reliability. We propose a data-trust security model designed for VANETs based on social network theories. Drivers receiving data about traffic congestion or safety warnings can use the model to evaluate the trust in the received information. The model computes a trust index for each message based on the relevance of the event. It also uses a gossiping approach to disseminate data-trust indexes between vehicles, increasing the accuracy in the trustworthiness of an event and assuring the privacy by hiding the original event sources. The approach is evaluated through modeling and simulation, and we present results that proof its validity.
{"title":"Securing Vehicular Networks Based on Data-Trust Computation","authors":"Sinziana Mazilu, Mihaela Teler, C. Dobre","doi":"10.1109/3PGCIC.2011.18","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.18","url":null,"abstract":"Vehicular ad-hoc networks (VANETs) have a great potential to improve road safety, traffic jams, fuel consumption, and to increase passenger convenience in vehicles. However, VANETs use an open medium for communication and, therefore, are exposed to security threats that influence their reliability. We propose a data-trust security model designed for VANETs based on social network theories. Drivers receiving data about traffic congestion or safety warnings can use the model to evaluate the trust in the received information. The model computes a trust index for each message based on the relevance of the event. It also uses a gossiping approach to disseminate data-trust indexes between vehicles, increasing the accuracy in the trustworthiness of an event and assuring the privacy by hiding the original event sources. The approach is evaluated through modeling and simulation, and we present results that proof its validity.","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":"127190306","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：