Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. A self-stabilizing protocol, regardless of the initial system state, automatically converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing protocols are adapted to highly dynamic networks as ad hoc or sensors networks. In this paper, we propose a self-stabilizing clustering protocol. Our protocol guarantees a threshold (size bound) on the number of nodes that a clusterhead handle. Therefore, none of the clusterheads are overloaded at anytime. The criterion of the clusterheads election is based on their weight value, a general parameter that can be computed according to several node parameters as transmission power, battery power, ... .
{"title":"Self-Stabilizing Construction of Bounded Size Clusters","authors":"C. Johnen, L. Nguyen","doi":"10.1109/ISPA.2008.43","DOIUrl":"https://doi.org/10.1109/ISPA.2008.43","url":null,"abstract":"Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. A self-stabilizing protocol, regardless of the initial system state, automatically converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing protocols are adapted to highly dynamic networks as ad hoc or sensors networks. In this paper, we propose a self-stabilizing clustering protocol. Our protocol guarantees a threshold (size bound) on the number of nodes that a clusterhead handle. Therefore, none of the clusterheads are overloaded at anytime. The criterion of the clusterheads election is based on their weight value, a general parameter that can be computed according to several node parameters as transmission power, battery power, ... .","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"89 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":"114217801","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 order to obtain maximum energetic efficiency, wireless sensor networks must be able to tailor their mode of operation at every level of the software infrastructure. At the MAC level, adaptability can greatly improve the performance of the system by tuning the parameters of operation of the protocol on the base of the communication pattern of the application. This paper presents an adaptive, contention-based MAC protocol where the duty cycle of the transceiver is dynamically changed to match the traffic rate. Adaptation is achieved by using local information and without generating additional messages. Coordination among nodes is based on passive dissemination of nodes' low power listening modes.
{"title":"Adaptability in the B-MAC+ Protocol","authors":"M. Avvenuti, Alessio Vecchio","doi":"10.1109/ISPA.2008.82","DOIUrl":"https://doi.org/10.1109/ISPA.2008.82","url":null,"abstract":"In order to obtain maximum energetic efficiency, wireless sensor networks must be able to tailor their mode of operation at every level of the software infrastructure. At the MAC level, adaptability can greatly improve the performance of the system by tuning the parameters of operation of the protocol on the base of the communication pattern of the application. This paper presents an adaptive, contention-based MAC protocol where the duty cycle of the transceiver is dynamically changed to match the traffic rate. Adaptation is achieved by using local information and without generating additional messages. Coordination among nodes is based on passive dissemination of nodes' low power listening modes.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"349 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":"124304310","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 study six different mode switching techniques (i.e. timeout mode switching, non-preferred hand mode switching, barrel button mode switching, pressure mode switching, tilt mode switching and azimuth mode switching) based on multiple parameters pen input are proposed. The results indicate that the techniques utilizing tilt angle and azimuth offer faster performance than the others.
{"title":"A Comparative Evaluation of Mode Switching Techniques","authors":"Chuanyi Liu, Xiangshi Ren, Dawei Li","doi":"10.1109/ISPA.2008.115","DOIUrl":"https://doi.org/10.1109/ISPA.2008.115","url":null,"abstract":"In this study six different mode switching techniques (i.e. timeout mode switching, non-preferred hand mode switching, barrel button mode switching, pressure mode switching, tilt mode switching and azimuth mode switching) based on multiple parameters pen input are proposed. The results indicate that the techniques utilizing tilt angle and azimuth offer faster performance than the others.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"95 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":"124080390","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}
Gongwei Zhang, M. Dong, Long Zheng, Deze Zeng, M. Guo
Recently, pervasive computing has become a very hot research field. Future Creation Lab., Olympus Corp. and the University of Aizu are working on this future technology to facilitate people¿s everyday life. The system we have proposed is named UMP-Percomp, a ubiquitous multiprocessor-based pipeline processing architecture to support high performance pervasive application development. Until now, we have implemented a prototype system to evaluate the performance of the architecture. However, the structure of the prototype system has some limitations: lack of scalability, inefficient pipeline algorithm, and do not do anything if there is lack of available PEs. So we modify the design to change these disadvantages. We add a UDP server to each component to support scalability and component substitution. We design a parallel algorithm to maximum the usage of PEs, and we also consider the situation of lacking suitable PEs. Finally, we do an experiment on the new system to compare with the old system.
近年来，普适计算已成为一个非常热门的研究领域。未来创造实验室。美国奥林巴斯公司(Olympus Corp.)和日本会津大学(University of Aizu)正在研究这种未来技术，以方便人们的日常生活。我们提出的系统被命名为UMP-Percomp，这是一种无处不在的基于多处理器的流水线处理体系结构，用于支持高性能的普适应用程序开发。到目前为止，我们已经实现了一个原型系统来评估架构的性能。然而，原型系统的结构存在一些局限性:缺乏可扩展性，管道算法效率低下，如果缺乏可用的pe，则不做任何事情。所以我们修改设计来改变这些缺点。我们为每个组件添加一个UDP服务器，以支持可伸缩性和组件替换。为了最大限度地利用pe，我们设计了一种并行算法，并考虑了缺乏合适pe的情况。最后，对新系统进行了实验，并与旧系统进行了比较。
{"title":"An Improved Design for UMP (Ubiquitous Multi-processor) System","authors":"Gongwei Zhang, M. Dong, Long Zheng, Deze Zeng, M. Guo","doi":"10.1109/ISPA.2008.53","DOIUrl":"https://doi.org/10.1109/ISPA.2008.53","url":null,"abstract":"Recently, pervasive computing has become a very hot research field. Future Creation Lab., Olympus Corp. and the University of Aizu are working on this future technology to facilitate people¿s everyday life. The system we have proposed is named UMP-Percomp, a ubiquitous multiprocessor-based pipeline processing architecture to support high performance pervasive application development. Until now, we have implemented a prototype system to evaluate the performance of the architecture. However, the structure of the prototype system has some limitations: lack of scalability, inefficient pipeline algorithm, and do not do anything if there is lack of available PEs. So we modify the design to change these disadvantages. We add a UDP server to each component to support scalability and component substitution. We design a parallel algorithm to maximum the usage of PEs, and we also consider the situation of lacking suitable PEs. Finally, we do an experiment on the new system to compare with the old system.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"44 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":"128123723","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}
Recent studies have revealed that on-chip interconnects neither is wire plentiful nor is bandwidth cheap. Based on the results of these studies, in physical design of multiprocessor system-on-chip (MPSoCs), both the wiring density constraint and routing of wires are controversial issues, and there is a trade-off between the network bandwidth and wiring limitations. Therefore, in this paper, we introduce a new topology, named mesh connected crossbars (MCC), to enhance the communication bandwidth between processing elements; the proposed topology, also, has significant topological advantages over traditional torus- and mesh-based NoCs. Furthermore, we study the topological properties of MCCs and propose deterministic and fully adaptive deadlock-free routing algorithms in an attempt to evaluate the performance of MCC in different working conditions. The simulation results show that under constant wiring conditions, MCC exhibits higher performance and consumes lower energy in comparison with equivalent torus or mesh networks.
{"title":"Mesh Connected Crossbars: A Novel NoC Topology with Scalable Communication Bandwidth","authors":"Arash Tavakkol, R. Moraveji, H. Sarbazi-Azad","doi":"10.1109/ISPA.2008.123","DOIUrl":"https://doi.org/10.1109/ISPA.2008.123","url":null,"abstract":"Recent studies have revealed that on-chip interconnects neither is wire plentiful nor is bandwidth cheap. Based on the results of these studies, in physical design of multiprocessor system-on-chip (MPSoCs), both the wiring density constraint and routing of wires are controversial issues, and there is a trade-off between the network bandwidth and wiring limitations. Therefore, in this paper, we introduce a new topology, named mesh connected crossbars (MCC), to enhance the communication bandwidth between processing elements; the proposed topology, also, has significant topological advantages over traditional torus- and mesh-based NoCs. Furthermore, we study the topological properties of MCCs and propose deterministic and fully adaptive deadlock-free routing algorithms in an attempt to evaluate the performance of MCC in different working conditions. The simulation results show that under constant wiring conditions, MCC exhibits higher performance and consumes lower energy in comparison with equivalent torus or mesh networks.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"26 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":"125703463","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}
This article presents a new approach for privacy preserving access control based on RBAC. The separation of authorization of access purpose from access decision improves the flexibility of private data control. A key feature of this approach is dynamic. The access purpose is determined in a dynamic manner, based on subject attributes, context attributes and authorization policies. Intended purposes are dynamically associated with the requested data object during the access decision. Finally, we give the algorithm to achieve the compliance computation between the access purpose and intended purposes.
{"title":"Dynamic Purpose-Based Access Control","authors":"Huanchun Peng, Jun Gu, Xiaojun Ye","doi":"10.1109/ISPA.2008.80","DOIUrl":"https://doi.org/10.1109/ISPA.2008.80","url":null,"abstract":"This article presents a new approach for privacy preserving access control based on RBAC. The separation of authorization of access purpose from access decision improves the flexibility of private data control. A key feature of this approach is dynamic. The access purpose is determined in a dynamic manner, based on subject attributes, context attributes and authorization policies. Intended purposes are dynamically associated with the requested data object during the access decision. Finally, we give the algorithm to achieve the compliance computation between the access purpose and intended purposes.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"2 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":"126001008","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, we proposed a fast Intra prediction method for MPEG-2 to H.264/AVC transcoding. To reduce the computational complexity, we utilized the information of DCT coefficients in MPEG-2 decoder to measure the Intra macroblock (MB) energy trend. Base on the relationship between the energy trend and the intra prediction direction, we can pre-determine the Intra prediction for both luminance (luma) and chrominance (chroma) components. The numbers of the Intra prediction candidates of luma Intra16x16 and chroma Intra8x8 can be reduced from original four to one or two, and the numbers of prediction candidates of luma Intra 4x4 can be reduced from nine to four. With our proposed algorithm, the computational complexity of Intra prediction for MPEG-2 to H.264/AVC transcoding can be reduced about 60% compared with the conventional cascaded transcoding method at the negligible quality loss.
本文提出了一种快速预测MPEG-2到H.264/AVC转码的方法。为了降低计算复杂度，我们利用MPEG-2解码器中的DCT系数信息来测量内部宏块(MB)的能量趋势。基于能量趋势与intra预测方向之间的关系，我们可以预先确定亮度(luma)和色度(chroma)分量的intra预测。luma Intra16x16和chroma Intra8x8的预测候选数可以从原来的4个减少到1个或2个，luma Intra 4x4的预测候选数可以从9个减少到4个。与传统的级联转码方法相比，MPEG-2转码到H.264/AVC的Intra预测计算复杂度可降低约60%，且质量损失可忽略。
{"title":"MB Energy Trend-Based Intra Prediction Algorithm for MPEG-2 to H.264/AVC Transcoding","authors":"Xingang Liu, Wei Zhu, Kook-Yeol Yoo","doi":"10.1109/ISPA.2008.74","DOIUrl":"https://doi.org/10.1109/ISPA.2008.74","url":null,"abstract":"In this paper, we proposed a fast Intra prediction method for MPEG-2 to H.264/AVC transcoding. To reduce the computational complexity, we utilized the information of DCT coefficients in MPEG-2 decoder to measure the Intra macroblock (MB) energy trend. Base on the relationship between the energy trend and the intra prediction direction, we can pre-determine the Intra prediction for both luminance (luma) and chrominance (chroma) components. The numbers of the Intra prediction candidates of luma Intra16x16 and chroma Intra8x8 can be reduced from original four to one or two, and the numbers of prediction candidates of luma Intra 4x4 can be reduced from nine to four. With our proposed algorithm, the computational complexity of Intra prediction for MPEG-2 to H.264/AVC transcoding can be reduced about 60% compared with the conventional cascaded transcoding method at the negligible quality loss.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"4 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":"132080290","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}
This paper presents an improved tool called FITVS (Fault Injection Tool for Validating SEE) using the FPGA-based emulation system for fault grading. A novel library-replace-modeling technique that can quickly and easily perform SEE by injecting faults into the circuit nodes is proposed. It helps IC designers to enhance the quality of their design by providing the sensitivity information of all nodes. Also the fault injection effectiveness is improved with relative to the traditional methods by utilizing C# program and FPGA emulation, and the speed of injection can reach the order of lus/fault.
{"title":"FITVS: A FPGA-Based Emulation Tool For High-Efficiency Hardness Evaluation","authors":"Hongchao Zheng, L. Fan, S. Yue","doi":"10.1109/ISPA.2008.46","DOIUrl":"https://doi.org/10.1109/ISPA.2008.46","url":null,"abstract":"This paper presents an improved tool called FITVS (Fault Injection Tool for Validating SEE) using the FPGA-based emulation system for fault grading. A novel library-replace-modeling technique that can quickly and easily perform SEE by injecting faults into the circuit nodes is proposed. It helps IC designers to enhance the quality of their design by providing the sensitivity information of all nodes. Also the fault injection effectiveness is improved with relative to the traditional methods by utilizing C# program and FPGA emulation, and the speed of injection can reach the order of lus/fault.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 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":"131096743","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}
Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific computing problems, has failed to benefit from the improvements in computing performance brought about by multi-processor systems, due to the lack of suitable scheme to manage partitioning and dependencies. A scheme for parallel implementation of the dynamic programming multiple sequence alignment is presented, based on a peer to peer design and a multidimensional array indexing method. This design results in up to 5-fold improvement compared to a previously described master/slave design, and scales favourably with the number of processors used. This study demonstrates an approach for parallelising multi-dimensional dynamic programming and similar algorithms utilizing multi-processor architectures.
{"title":"Parallelizing Optimal Multiple Sequence Alignment by Dynamic Programming","authors":"M. Helal, H. ElGindy, L. Mullin, B. Gaëta","doi":"10.1109/ISPA.2008.93","DOIUrl":"https://doi.org/10.1109/ISPA.2008.93","url":null,"abstract":"Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific computing problems, has failed to benefit from the improvements in computing performance brought about by multi-processor systems, due to the lack of suitable scheme to manage partitioning and dependencies. A scheme for parallel implementation of the dynamic programming multiple sequence alignment is presented, based on a peer to peer design and a multidimensional array indexing method. This design results in up to 5-fold improvement compared to a previously described master/slave design, and scales favourably with the number of processors used. This study demonstrates an approach for parallelising multi-dimensional dynamic programming and similar algorithms utilizing multi-processor architectures.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"34 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":"133388708","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}
OTIS-based architectures appear to have the potential to be an interesting option for future generations of multiprocessing systems. In this paper, we propose a new adaptive unicast routing algorithm and four software-based (unicast-based) broadcast algorithms for the wormhole switched OTIS-hypercube. We then present an empirical performance evaluation of these algorithms in OTIS-hypercube for different topologies, message length and traffic loads.
{"title":"Broadcast Algorithms on OTIS-Cubes","authors":"Hamid Ebrahimi-Kahaki, H. Sarbazi-Azad","doi":"10.1109/ISPA.2008.108","DOIUrl":"https://doi.org/10.1109/ISPA.2008.108","url":null,"abstract":"OTIS-based architectures appear to have the potential to be an interesting option for future generations of multiprocessing systems. In this paper, we propose a new adaptive unicast routing algorithm and four software-based (unicast-based) broadcast algorithms for the wormhole switched OTIS-hypercube. We then present an empirical performance evaluation of these algorithms in OTIS-hypercube for different topologies, message length and traffic loads.","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":"133508351","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
扫码关注我们
求助内容：
应助结果提醒方式：