Reputation systems are becoming vital in peer-to-peer networks due to the risks that threaten such networks. One of the vital component that contributes to the success of a reputation system is recommendation retrieval. In this paper, we discuss the effectiveness and cost metrics in recommendation retrieval by evaluating various recommendation retrieval mechanisms such as flooding, recommendation tree, and storage peer. Simulation results show that the performance of recommendation retrieval is significantly affected by the overlay network construction.
{"title":"Performance Evaluation of Recommendation Retrieval in Peer-to-Peer Networks","authors":"Farag Azzedin, Ahmad Ridha","doi":"10.1109/ISPA.2008.79","DOIUrl":"https://doi.org/10.1109/ISPA.2008.79","url":null,"abstract":"Reputation systems are becoming vital in peer-to-peer networks due to the risks that threaten such networks. One of the vital component that contributes to the success of a reputation system is recommendation retrieval. In this paper, we discuss the effectiveness and cost metrics in recommendation retrieval by evaluating various recommendation retrieval mechanisms such as flooding, recommendation tree, and storage peer. Simulation results show that the performance of recommendation retrieval is significantly affected by the overlay network construction.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423819","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}
Cluster management software has faced more increased scalability challenge with ever enlarged cluster scale. Its good scalability rests with feasible design techniques focusing on hybrid software topologies with partitioning policy, non-blocking I/O multiplexing and message on demand. Design patterns are generic solutions to recurring software design problems, and above three important techniques are abstracted the design pattern of scalable cluster management software in this paper. According to this design pattern, some cluster management tools, such as job scheduling, MPI job launcher and so on, have been designed and applied on Dawning supercomputers. Some results of performance evaluation have shown that good scalability of cluster management software on Dawning supercomputers has benefited from this design pattern.
{"title":"Design Techniques for the Scalability of Cluster Management Software on Dawning Supercomputers","authors":"Bibo Tu, Ming Zou, Jianfeng Zhan, Jianping Fan","doi":"10.1109/ISPA.2008.12","DOIUrl":"https://doi.org/10.1109/ISPA.2008.12","url":null,"abstract":"Cluster management software has faced more increased scalability challenge with ever enlarged cluster scale. Its good scalability rests with feasible design techniques focusing on hybrid software topologies with partitioning policy, non-blocking I/O multiplexing and message on demand. Design patterns are generic solutions to recurring software design problems, and above three important techniques are abstracted the design pattern of scalable cluster management software in this paper. According to this design pattern, some cluster management tools, such as job scheduling, MPI job launcher and so on, have been designed and applied on Dawning supercomputers. Some results of performance evaluation have shown that good scalability of cluster management software on Dawning supercomputers has benefited from this design pattern.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122653719","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}
Hyunmee Shin, Yongsung Kim, Sangheon Pack, C. Kang
Relay transmission is a promising technology for improving the throughput and energy efficiency in multi-rate wireless personal area networks (WPANs). In this paper, we propose a distributed relay MAC (DR-MAC) protocol in Wi-Media WPANs. DR-MAC extends a distributed reservation protocol (DRP) in WiMedia MAC and neighbor information for relay transmission can be collected during the beacon period. Therefore, DR-MAC can minimize control overhead for relay transmission and is compatible to the standard WiMedia MAC protocol. We also introduce a medium access slot (MAS) allocation procedure for maximizing the efficiency in DR-MAC. Compared with direct transmission, extensive simulation results demonstrate that DR-MAC can improve the throughput by 10% and reduce the energy consumption by 26% when the number of devices is 20.
{"title":"A Distributed Relay MAC Protocol in WiMedia Wireless Personal Area","authors":"Hyunmee Shin, Yongsung Kim, Sangheon Pack, C. Kang","doi":"10.1109/ISPA.2008.135","DOIUrl":"https://doi.org/10.1109/ISPA.2008.135","url":null,"abstract":"Relay transmission is a promising technology for improving the throughput and energy efficiency in multi-rate wireless personal area networks (WPANs). In this paper, we propose a distributed relay MAC (DR-MAC) protocol in Wi-Media WPANs. DR-MAC extends a distributed reservation protocol (DRP) in WiMedia MAC and neighbor information for relay transmission can be collected during the beacon period. Therefore, DR-MAC can minimize control overhead for relay transmission and is compatible to the standard WiMedia MAC protocol. We also introduce a medium access slot (MAS) allocation procedure for maximizing the efficiency in DR-MAC. Compared with direct transmission, extensive simulation results demonstrate that DR-MAC can improve the throughput by 10% and reduce the energy consumption by 26% when the number of devices is 20.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123356029","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}
Tracking moving targets in sequence images is an essential key technology and one of the hot research topics in Computer Vision. This system is based on an embedded system platform named Embedded Star and makes full use of the OpenCV (Intel® open-source computer vision library)to implement and optimize the Mean Shift tracking algorithm. At last, it achieves the objective of real-time tracking and shooting of moving targets, and can be used in sports photography, real-time monitoring and so on. The test data has indicated that it can direct the camera through controlling the cloud terrace to track both rigid and non-rigid targets.
{"title":"Intelligent Target Tracking and Shooting System with Mean Shift","authors":"Xiang Xiang, Wenhui Chen, Du Zeng","doi":"10.1109/ISPA.2008.167","DOIUrl":"https://doi.org/10.1109/ISPA.2008.167","url":null,"abstract":"Tracking moving targets in sequence images is an essential key technology and one of the hot research topics in Computer Vision. This system is based on an embedded system platform named Embedded Star and makes full use of the OpenCV (Intel® open-source computer vision library)to implement and optimize the Mean Shift tracking algorithm. At last, it achieves the objective of real-time tracking and shooting of moving targets, and can be used in sports photography, real-time monitoring and so on. The test data has indicated that it can direct the camera through controlling the cloud terrace to track both rigid and non-rigid targets.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127062278","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}
Signcryption has clear advantage over traditional sign-then-encrypt schemes. However, the computational overhead for signcryption is still too heavy when it is applied to resource-constraint systems. In this paper, we propose a generic construction of the identity-based online/offline signcryption, where most of computations are carried out when the associated message is still unavailable and the online part of our scheme does not require any exponent computations and therefore is very efficient. Our scheme isgeneric and identity-based, in the sense it is independent of the selection of signature and encryption algorithms. Our scheme possesses the properties of ciphertext indistinguishability (IND-gCCA2) and existentially unforgeability (UF-CMA).
{"title":"A Generic Construction of Identity-Based Online/Offline Signcryption","authors":"Dongdong Sun, Y. Mu, W. Susilo","doi":"10.1109/ISPA.2008.16","DOIUrl":"https://doi.org/10.1109/ISPA.2008.16","url":null,"abstract":"Signcryption has clear advantage over traditional sign-then-encrypt schemes. However, the computational overhead for signcryption is still too heavy when it is applied to resource-constraint systems. In this paper, we propose a generic construction of the identity-based online/offline signcryption, where most of computations are carried out when the associated message is still unavailable and the online part of our scheme does not require any exponent computations and therefore is very efficient. Our scheme isgeneric and identity-based, in the sense it is independent of the selection of signature and encryption algorithms. Our scheme possesses the properties of ciphertext indistinguishability (IND-gCCA2) and existentially unforgeability (UF-CMA).","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983744","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}
We show that the problem of finding an energy minimal schedule for execution of a collection of jobs on a multiprocessor with job migration allowed has polynomial complexity. Each job is specified by a release time, a deadline, and an amount of work to be performed. All of the processors have the same, convex power-speed trade-off of the form P = phi(s), where P is power, s is speed, and phi is convex. Unlike previous work on multiprocessor scheduling, we place no restriction on the release times, deadlines, or amount of work to be done. We show that the scheduling problem is convex, and give an algorithm based on linear programming. We show that the optimal schedule is the same for any convex power-speed trade-off function.
{"title":"Energy Optimal Scheduling on Multiprocessors with Migration","authors":"B. Bingham, M. Greenstreet","doi":"10.1109/ISPA.2008.128","DOIUrl":"https://doi.org/10.1109/ISPA.2008.128","url":null,"abstract":"We show that the problem of finding an energy minimal schedule for execution of a collection of jobs on a multiprocessor with job migration allowed has polynomial complexity. Each job is specified by a release time, a deadline, and an amount of work to be performed. All of the processors have the same, convex power-speed trade-off of the form P = phi(s), where P is power, s is speed, and phi is convex. Unlike previous work on multiprocessor scheduling, we place no restriction on the release times, deadlines, or amount of work to be done. We show that the scheduling problem is convex, and give an algorithm based on linear programming. We show that the optimal schedule is the same for any convex power-speed trade-off function.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115538163","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}
In this paper the classification of discrete events, computed on tiny wireless sensor nodes, is investigated. Three different classifiers are evaluated: a Bayesian classifier, a fuzzy logic controller (FLC), and a neural network approach. The target applications pose several requirements on the classifiers. No a priori knowledge about the event classes is available. Events are only observable as collections of raw sensor data. Accordingly, event classes need to be learned from that raw (training) data. As a consequence, pre-labeling of the events is not possible either. In our work, event classes are learned by a k-means clustering algorithm. Any subsequent classifier training is based on these extracted event classes. Thus, the resulting classifiers are completely self-learning. Event classes are learned from emitted signal strength estimations, which are collected and processed by dynamically established tracking groups. The resulting event estimates are reported to a base station, where the classifiers are trained. The learned classifier parameters are then downloaded onto the sensor nodes, where any subsequent classification and filtering is performed.
{"title":"Event Classification and Filtering of False Alarms in Wireless Sensor Networks","authors":"M. Wälchli, T. Braun","doi":"10.1109/ISPA.2008.26","DOIUrl":"https://doi.org/10.1109/ISPA.2008.26","url":null,"abstract":"In this paper the classification of discrete events, computed on tiny wireless sensor nodes, is investigated. Three different classifiers are evaluated: a Bayesian classifier, a fuzzy logic controller (FLC), and a neural network approach. The target applications pose several requirements on the classifiers. No a priori knowledge about the event classes is available. Events are only observable as collections of raw sensor data. Accordingly, event classes need to be learned from that raw (training) data. As a consequence, pre-labeling of the events is not possible either. In our work, event classes are learned by a k-means clustering algorithm. Any subsequent classifier training is based on these extracted event classes. Thus, the resulting classifiers are completely self-learning. Event classes are learned from emitted signal strength estimations, which are collected and processed by dynamically established tracking groups. The resulting event estimates are reported to a base station, where the classifiers are trained. The learned classifier parameters are then downloaded onto the sensor nodes, where any subsequent classification and filtering is performed.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122523072","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}
Transaction processing in mobile ad hoc networks must take network problems like node disconnection, message loss, and network partitioning into consideration. We present a distributed cross-layer atomic commit protocol called CLCP that uses multiple coordinators and makes use of acknowledgement messages to piggyback information. We evaluated transaction processing in mobile ad hoc networks by using two mobility models (i.e. Attraction Point and Manhattan Geometry), and compared CLCP with both atomic commit protocols, 2PC and Paxos Commit, each implemented in 3 versions, i.e. without acknowledgements, with relay routing, and with nearest forward progress routing. Special to our simulation environment is the use of the quasi-unit-disc model, which assumes a non-binary message reception probability that captures real-world behavior much better than the classical unit-disc-model, often used in theory. Using the quasi-unit-disc model, our evaluation shows the following results. CLCP and "2PC without acknowledement messages" have a significantly lower energy consumption than the other protocols, and CLCP is able to commit significantly more distributed transactions than all the other atomic commit protocols for each of the mobility models.
{"title":"CLCP – A Distributed Cross-Layer Commit Protocol for Mobile Ad Hoc Networks","authors":"S. Obermeier, S. Böttcher, Dominik Kleine","doi":"10.1109/ISPA.2008.31","DOIUrl":"https://doi.org/10.1109/ISPA.2008.31","url":null,"abstract":"Transaction processing in mobile ad hoc networks must take network problems like node disconnection, message loss, and network partitioning into consideration. We present a distributed cross-layer atomic commit protocol called CLCP that uses multiple coordinators and makes use of acknowledgement messages to piggyback information. We evaluated transaction processing in mobile ad hoc networks by using two mobility models (i.e. Attraction Point and Manhattan Geometry), and compared CLCP with both atomic commit protocols, 2PC and Paxos Commit, each implemented in 3 versions, i.e. without acknowledgements, with relay routing, and with nearest forward progress routing. Special to our simulation environment is the use of the quasi-unit-disc model, which assumes a non-binary message reception probability that captures real-world behavior much better than the classical unit-disc-model, often used in theory. Using the quasi-unit-disc model, our evaluation shows the following results. CLCP and \"2PC without acknowledement messages\" have a significantly lower energy consumption than the other protocols, and CLCP is able to commit significantly more distributed transactions than all the other atomic commit protocols for each of the mobility models.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123380697","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}
D. Wegener, T. Sengstag, S. Sfakianakis, S. Rüping
In this paper, we describe an extension to the ACGT GridR environment which allows the parallelization of loops in R scripts in view of their distributed execution on a computational grid. The ACGT GridR service is extended by a component that uses a set of preprocessor-like directives to organize and distribute calculations. The use of parallelization directives as special R comments provides users with the potential to accelerate lengthy calculations with changes to preexisting code. The GridR service and its extension are developed as components of the ACGT platform, one aim of which is to facilitate the data mining of clinical trials involving large datasets. In ACGT, GridR scripts are executed in the framework of a specifically developed workflow environment, which is also briefly outlined in the present article.
{"title":"Supporting Parallel R Code in Clinical Trials: A Grid-Based Approach","authors":"D. Wegener, T. Sengstag, S. Sfakianakis, S. Rüping","doi":"10.1109/ISPA.2008.29","DOIUrl":"https://doi.org/10.1109/ISPA.2008.29","url":null,"abstract":"In this paper, we describe an extension to the ACGT GridR environment which allows the parallelization of loops in R scripts in view of their distributed execution on a computational grid. The ACGT GridR service is extended by a component that uses a set of preprocessor-like directives to organize and distribute calculations. The use of parallelization directives as special R comments provides users with the potential to accelerate lengthy calculations with changes to preexisting code. The GridR service and its extension are developed as components of the ACGT platform, one aim of which is to facilitate the data mining of clinical trials involving large datasets. In ACGT, GridR scripts are executed in the framework of a specifically developed workflow environment, which is also briefly outlined in the present article.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128820661","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}
Application server clusters are often used to service high-throughput web applications. In order to host more than a single application, an organisation will usually procure a separate cluster for each application. Over time the utilisation of the clusters will vary, leading to variation in the response times experienced by users of the applications. Techniques that statically assign servers to each application prevent the system from adapting to changes in the workload, and are thus susceptible to providing unacceptable levels of service. This paper investigates a system for allocating server resources to applications dynamically, thus allowing applications to automatically adapt to variable workloads. Such a scheme requires meticulous system monitoring, a method for switching application servers between text it {server pools} and a means of calculating when a server switch should be made (balancing switching cost against perceived benefits). Experimentation is performed using such a switching system on a Web application testbed hosting two applications across eight application servers. The testbed is used to compare several theoretically derived switching policies under a variety of workloads. Recommendations are made as to the suitability of different policies under different workload conditions.
{"title":"A System for Dynamic Server Allocation in Application Server Clusters","authors":"Adam P. Chester, J. Xue, Ligang He, S. Jarvis","doi":"10.1109/ISPA.2008.88","DOIUrl":"https://doi.org/10.1109/ISPA.2008.88","url":null,"abstract":"Application server clusters are often used to service high-throughput web applications. In order to host more than a single application, an organisation will usually procure a separate cluster for each application. Over time the utilisation of the clusters will vary, leading to variation in the response times experienced by users of the applications. Techniques that statically assign servers to each application prevent the system from adapting to changes in the workload, and are thus susceptible to providing unacceptable levels of service. This paper investigates a system for allocating server resources to applications dynamically, thus allowing applications to automatically adapt to variable workloads. Such a scheme requires meticulous system monitoring, a method for switching application servers between text it {server pools} and a means of calculating when a server switch should be made (balancing switching cost against perceived benefits). Experimentation is performed using such a switching system on a Web application testbed hosting two applications across eight application servers. The testbed is used to compare several theoretically derived switching policies under a variety of workloads. Recommendations are made as to the suitability of different policies under different workload conditions.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130264858","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
扫码关注我们
求助内容：
应助结果提醒方式：