In mobile cloud computing environments, it's regarded as a good solution to augment the capability of the resource-constrained devices by offloading some of their computation-intensive applications to other more powerful surrogate devices to execute. However, because the nodes are usually connected via certain wireless technology and the nodes may change their locations from time to time, the connections between devices are usually unstable and the applications offloaded may fail. In order to guarantee the users to be able to continue the applications offloaded seamlessly regardless of the mobility of the nodes, in this paper, the extended versions of the traditional Minimum Execution Time heuristic and the Minimum Completion Time heuristic, and a mobility prediction based offloading heuristic, were proposed to solve the mobility problem in mobile device clouds. Their performances were investigated via simulation. It's shown that, with the help of mobility prediction, the Dyn Predict heuristic can lead to lower average reschedule time, lower average failure rate and shorter response time.
{"title":"Mobility Prediction Based Opportunistic Computational Offloading for Mobile Device Cloud","authors":"Bo Li, Zhi Liu, Yijian Pei, Hao Wu","doi":"10.1109/CSE.2014.161","DOIUrl":"https://doi.org/10.1109/CSE.2014.161","url":null,"abstract":"In mobile cloud computing environments, it's regarded as a good solution to augment the capability of the resource-constrained devices by offloading some of their computation-intensive applications to other more powerful surrogate devices to execute. However, because the nodes are usually connected via certain wireless technology and the nodes may change their locations from time to time, the connections between devices are usually unstable and the applications offloaded may fail. In order to guarantee the users to be able to continue the applications offloaded seamlessly regardless of the mobility of the nodes, in this paper, the extended versions of the traditional Minimum Execution Time heuristic and the Minimum Completion Time heuristic, and a mobility prediction based offloading heuristic, were proposed to solve the mobility problem in mobile device clouds. Their performances were investigated via simulation. It's shown that, with the help of mobility prediction, the Dyn Predict heuristic can lead to lower average reschedule time, lower average failure rate and shorter response time.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132374093","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}
With the increasing complexity of various communications and applications, Network-On-Chip (NoC) is one of the most efficient communication structures. Multi-FPGA platforms are considered as the most appropriate experimental solutions to emulate a large size of MPSoCs (Multi-Processor System-on-Chip) based on a NoC. The deployment of the NoC into several FPGAs requires the use of inter-FPGA communication links. The number and performance of external links restrict the bandwidth of communication. Currently, the number of inter-FPGA signals is considered as a substantial problem in NoC implemented on Multi-FPGA architectures. In this paper, we propose the integration of the collision management architecture connected to the NoC. Two collision avoidance algorithms are proposed in the structure to balance the load injected between all routers connected with one external link. This architecture leads to high timing performances in multi-FPGA system communications. The results demonstrate the efficiency of the collision management structure connected to the NoC. The collision management algorithm is chosen according to the type of inter-FPGA communication requirements.
{"title":"A Novel Architecture for Inter-FPGA Traffic Collision Management","authors":"Atef Dorai, V. Fresse, E. Bourennane, A. Mtibaa","doi":"10.1109/CSE.2014.116","DOIUrl":"https://doi.org/10.1109/CSE.2014.116","url":null,"abstract":"With the increasing complexity of various communications and applications, Network-On-Chip (NoC) is one of the most efficient communication structures. Multi-FPGA platforms are considered as the most appropriate experimental solutions to emulate a large size of MPSoCs (Multi-Processor System-on-Chip) based on a NoC. The deployment of the NoC into several FPGAs requires the use of inter-FPGA communication links. The number and performance of external links restrict the bandwidth of communication. Currently, the number of inter-FPGA signals is considered as a substantial problem in NoC implemented on Multi-FPGA architectures. In this paper, we propose the integration of the collision management architecture connected to the NoC. Two collision avoidance algorithms are proposed in the structure to balance the load injected between all routers connected with one external link. This architecture leads to high timing performances in multi-FPGA system communications. The results demonstrate the efficiency of the collision management structure connected to the NoC. The collision management algorithm is chosen according to the type of inter-FPGA communication requirements.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293103","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}
Yunong Zhang, Y. Wang, Yonghua Yin, Hongzhou Tan, Qingkai Zeng
The conventional controller for output tracking of a class of nonlinear system is not valid when encountering the singularity (i.e., Division-by-zero) problem. To conquer the singularity problem, Zhang et al. Have proposed a simple yet effective controller design method, i.e., Aiding the conventional controller with gradient dynamics (GD), yielding a z0g1 controller in the framework of Zhang-gradient (ZG) method. As an in-depth research, this paper provides the theory and proof on the performance of this z0g1 controller, which is exploited to conquer the singularity problem while fulfilling the tracking-control task. Besides, simulations and experiments substantiate and complement the theoretical analyses of such a z0g1 controller.
{"title":"Theory and Substantiation of z0g1 Controller Conquering Singularity Problem of Output Tracking for a Class of Nonlinear System","authors":"Yunong Zhang, Y. Wang, Yonghua Yin, Hongzhou Tan, Qingkai Zeng","doi":"10.1109/CSE.2014.49","DOIUrl":"https://doi.org/10.1109/CSE.2014.49","url":null,"abstract":"The conventional controller for output tracking of a class of nonlinear system is not valid when encountering the singularity (i.e., Division-by-zero) problem. To conquer the singularity problem, Zhang et al. Have proposed a simple yet effective controller design method, i.e., Aiding the conventional controller with gradient dynamics (GD), yielding a z0g1 controller in the framework of Zhang-gradient (ZG) method. As an in-depth research, this paper provides the theory and proof on the performance of this z0g1 controller, which is exploited to conquer the singularity problem while fulfilling the tracking-control task. Besides, simulations and experiments substantiate and complement the theoretical analyses of such a z0g1 controller.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131827658","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}
Reconfigurable computing (RC) is a compromise of General-propose processor (GPP) computing and Application Specific Integrated Circuit (ASIC) computing with both hardware efficiency and software flexibility. An efficient algorithm to tackle the scheduling and placement problem for the dynamically reconfigurable Field-Programmable Gate Arrays (FPGAs) with real time decisions is highly concerned for the performance of RC. By exploring 2-dimensonal (2-D) reconfigurable hardware resource model and hardware task scale information, we propose an efficient task scheduling and placement algorithm by cooperating Tasks' Aspect Ratio (TAR) with 2-D reconfigurable resource model. Simulations show that our method improves the success ratio up to 9.7% compared with Horizon algorithm and DATS algorithm. TAR algorithm also achieves better resource utilization.
{"title":"A Task Scheduling and Placement Strategy Based on Tasks' Aspect Ratio","authors":"Weiguo Wu, Tao Wang, Chaohui Wang, Qing Zhang","doi":"10.1109/CSE.2014.114","DOIUrl":"https://doi.org/10.1109/CSE.2014.114","url":null,"abstract":"Reconfigurable computing (RC) is a compromise of General-propose processor (GPP) computing and Application Specific Integrated Circuit (ASIC) computing with both hardware efficiency and software flexibility. An efficient algorithm to tackle the scheduling and placement problem for the dynamically reconfigurable Field-Programmable Gate Arrays (FPGAs) with real time decisions is highly concerned for the performance of RC. By exploring 2-dimensonal (2-D) reconfigurable hardware resource model and hardware task scale information, we propose an efficient task scheduling and placement algorithm by cooperating Tasks' Aspect Ratio (TAR) with 2-D reconfigurable resource model. Simulations show that our method improves the success ratio up to 9.7% compared with Horizon algorithm and DATS algorithm. TAR algorithm also achieves better resource utilization.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132320781","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}
Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of the propagation. We present the first polynomial time self-stabilizing algorithm for minimal weighted positive influence dominating set in an arbitrary social network. Starting from an arbitrary initial state, the algorithm terminates in O(n3) steps using a distributed scheduler, where n is the number of nodes in the graph. Space requirement at each node is O(log n) bits. Experiments are conducted to verify the correctness and efficiency of the proposed algorithm.
{"title":"Self-Stabilizing Selection of Influential Users in Social Networks","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.1109/CSE.2014.288","DOIUrl":"https://doi.org/10.1109/CSE.2014.288","url":null,"abstract":"Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of the propagation. We present the first polynomial time self-stabilizing algorithm for minimal weighted positive influence dominating set in an arbitrary social network. Starting from an arbitrary initial state, the algorithm terminates in O(n3) steps using a distributed scheduler, where n is the number of nodes in the graph. Space requirement at each node is O(log n) bits. Experiments are conducted to verify the correctness and efficiency of the proposed algorithm.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133736163","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}
The Internet of Things (IoT) paradigm connects everyday objects to the Internet and enables a multitude of applications with the real world data collected from those objects. In the city environment, real world data sources include fixed installations of sensor networks by city authorities as well as mobile sources, such as citizens' smartphones, taxis and buses equipped with sensors. This kind of data varies not only along the temporal but also the spatial axis. For handling such frequently updated, time-stamped and structured data from a large number of heterogeneous sources, this paper presents a data-centric framework that offers a structured substrate for abstracting heterogeneous sensing sources. More importantly, it enables the collection, storage and discovery of observation and measurement data from both static and mobile sensing sources.
{"title":"Enabling Query of Frequently Updated Data from Mobile Sensing Sources","authors":"Yuchao Zhou, Suparna De, Wei Wang, K. Moessner","doi":"10.1109/CSE.2014.190","DOIUrl":"https://doi.org/10.1109/CSE.2014.190","url":null,"abstract":"The Internet of Things (IoT) paradigm connects everyday objects to the Internet and enables a multitude of applications with the real world data collected from those objects. In the city environment, real world data sources include fixed installations of sensor networks by city authorities as well as mobile sources, such as citizens' smartphones, taxis and buses equipped with sensors. This kind of data varies not only along the temporal but also the spatial axis. For handling such frequently updated, time-stamped and structured data from a large number of heterogeneous sources, this paper presents a data-centric framework that offers a structured substrate for abstracting heterogeneous sensing sources. More importantly, it enables the collection, storage and discovery of observation and measurement data from both static and mobile sensing sources.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133697245","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 organic view of prototyping for managing dynamic factors involved in evolutionary design of information systems (IS). Those dynamic factors can be caused by, for example, continuing suggestions from users, changes in the technologies, and users-designers learning related stepwise progresses. Expanding the evolutionary prototyping to 'start small and grow', the organic view of prototyping proposes two prerequisites to do so, namely 1) a sustainable and adaptive 'embryo' -- an organic structure of the future system, and 2) an embedded learning and feedback management that the actors of the system (users, designers, decision makers, administrators) can communicate with each other. An example of eHealth system design demonstrates how the prerequisites can be implemented.
{"title":"An Organic View of Prototyping in Information System Development","authors":"G. Bai","doi":"10.1109/CSE.2014.333","DOIUrl":"https://doi.org/10.1109/CSE.2014.333","url":null,"abstract":"This paper presents an organic view of prototyping for managing dynamic factors involved in evolutionary design of information systems (IS). Those dynamic factors can be caused by, for example, continuing suggestions from users, changes in the technologies, and users-designers learning related stepwise progresses. Expanding the evolutionary prototyping to 'start small and grow', the organic view of prototyping proposes two prerequisites to do so, namely 1) a sustainable and adaptive 'embryo' -- an organic structure of the future system, and 2) an embedded learning and feedback management that the actors of the system (users, designers, decision makers, administrators) can communicate with each other. An example of eHealth system design demonstrates how the prerequisites can be implemented.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133763694","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. Yazidi, B. Oommen, Ole-Christoffer Granmo, M. G. Olsen
This paper deals with the extremely pertinent problem of web crawling, which is far from trivial considering the magnitude and all-pervasive nature of the World-Wide Web. While numerous AI tools can be used to deal with this task, in this paper we map the problem onto the combinatorially-hard stochastic non-linear fractional knapsack problem, which, in turn, is then solved using Learning Automata (LA). Such LA-based solutions have been recently shown to outperform previous state-of-the-art approaches to resource allocation in Web monitoring. However, the ever growing deployment of distributed systems raises the need for solutions that cope with a distributed setting. In this paper, we present a novel scheme for solving the non-linear fractional bin packing problem. Furthermore, we demonstrate that our scheme has applications to Web crawling, i.e., Distributed resource allocation, and in particular, to distributed Web monitoring. Comprehensive experimental results demonstrate the superiority of our scheme when compared to other classical approaches.
{"title":"On Utilizing Stochastic Non-linear Fractional Bin Packing to Resolve Distributed Web Crawling","authors":"A. Yazidi, B. Oommen, Ole-Christoffer Granmo, M. G. Olsen","doi":"10.1109/CSE.2014.40","DOIUrl":"https://doi.org/10.1109/CSE.2014.40","url":null,"abstract":"This paper deals with the extremely pertinent problem of web crawling, which is far from trivial considering the magnitude and all-pervasive nature of the World-Wide Web. While numerous AI tools can be used to deal with this task, in this paper we map the problem onto the combinatorially-hard stochastic non-linear fractional knapsack problem, which, in turn, is then solved using Learning Automata (LA). Such LA-based solutions have been recently shown to outperform previous state-of-the-art approaches to resource allocation in Web monitoring. However, the ever growing deployment of distributed systems raises the need for solutions that cope with a distributed setting. In this paper, we present a novel scheme for solving the non-linear fractional bin packing problem. Furthermore, we demonstrate that our scheme has applications to Web crawling, i.e., Distributed resource allocation, and in particular, to distributed Web monitoring. Comprehensive experimental results demonstrate the superiority of our scheme when compared to other classical approaches.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121944119","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}
An adaptive sliding mode tracking control scheme with double closed loop is proposed for the spacecraft attitude tracking near the irregular small body in the presence of uncertainties and external disturbances. Firstly, the general formulation of the spacecraft equations of attitude motion near irregular small body is derived considering the irregular gravity gradient torque. Then sliding mode laws are established both in an inner control loop and an outer control loop based on Lyapunov stability theory. The unknown upper bounds of the uncertainties and external disturbances are estimated through adaptive technique. The integral switch control is employed in the outer loop to track the attitude angles and resist the disturbances, and a dynamical sliding mode control approach is proposed in the inner loop to resist the disturbances and vibration. Finally, spacecraft Maneuvers near one small body are adopted for numerical simulation, and the results demonstrate the effectiveness of the proposed scheme.
{"title":"Attitude Tracking Control Based on Adaptive Sliding Mode Technique with Double Closed Loop for Spacecraft Near Small Body","authors":"Chunhui Liang, Yuan-chun Li","doi":"10.1109/CSE.2014.48","DOIUrl":"https://doi.org/10.1109/CSE.2014.48","url":null,"abstract":"An adaptive sliding mode tracking control scheme with double closed loop is proposed for the spacecraft attitude tracking near the irregular small body in the presence of uncertainties and external disturbances. Firstly, the general formulation of the spacecraft equations of attitude motion near irregular small body is derived considering the irregular gravity gradient torque. Then sliding mode laws are established both in an inner control loop and an outer control loop based on Lyapunov stability theory. The unknown upper bounds of the uncertainties and external disturbances are estimated through adaptive technique. The integral switch control is employed in the outer loop to track the attitude angles and resist the disturbances, and a dynamical sliding mode control approach is proposed in the inner loop to resist the disturbances and vibration. Finally, spacecraft Maneuvers near one small body are adopted for numerical simulation, and the results demonstrate the effectiveness of the proposed scheme.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120957749","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}
Multi-antenna blind signal separation (BSS) provides a useful method for co-channel mixed signal processing. But the performance of BSS is limited by the condition number of channel matrix in the presence of noise. To overcome this problem, a new BSS algorithm with the aid of lattice reduction (LR) is proposed for synchronous communication systems. Simulation results show that the proposed algorithm improves the symbol error rate (SER) performance in noise environment while keeping the same complexity level.
{"title":"Lattice Reduction Aided Blind Signal Separation Algorithm","authors":"Kun Zhang, Yourong Lu, Wei Wang","doi":"10.1109/CSE.2014.181","DOIUrl":"https://doi.org/10.1109/CSE.2014.181","url":null,"abstract":"Multi-antenna blind signal separation (BSS) provides a useful method for co-channel mixed signal processing. But the performance of BSS is limited by the condition number of channel matrix in the presence of noise. To overcome this problem, a new BSS algorithm with the aid of lattice reduction (LR) is proposed for synchronous communication systems. Simulation results show that the proposed algorithm improves the symbol error rate (SER) performance in noise environment while keeping the same complexity level.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116874274","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
扫码关注我们
求助内容：
应助结果提醒方式：