{"title":"Improving the Task Stealing in Intel Threading Building Blocks","authors":"Shiyi Lu, Qing Li","doi":"10.1109/CyberC.2011.61","DOIUrl":"https://doi.org/10.1109/CyberC.2011.61","url":null,"abstract":"The Intel Threading Building Blocks (TBB)is a run-time library[1] for parallel programming based on C++. The TBB programming environment facilitates programmers to express concurrency in terms of parallel tasks rather than parallel threads. TBB provide programmers with parallel algorithms and concurrent containers, thus programmers can parallel a program without considering how to map the tasks on to the physical threads. In fact, all the paralleling task work is based on the task scheduler. When stealing a task, the task scheduler select the victim thread randomly. In this paper, we first study and characterize the TBB's random stealing. Then we provide two method to predicate the threads' criticality, using the methods to improve the performance of TBB's task stealing. We did some experiments to validate the achievement in improving the performance of TBB's task stealing.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702105","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}
Yung-Wei Kao, Guo-Heng Luo, H. Lin, Yu-Kai Huang, S. Yuan
{"title":"Physical Access Control Based on QR Code","authors":"Yung-Wei Kao, Guo-Heng Luo, H. Lin, Yu-Kai Huang, S. Yuan","doi":"10.1109/CyberC.2011.55","DOIUrl":"https://doi.org/10.1109/CyberC.2011.55","url":null,"abstract":"Nowadays, the authentication methods of physical access control such as key, smart card, and OTP (One Time Password) card require extra hardware, and it is not easy to be aware of if they are lost because of the low using rate. Nowadays, mobile phone is one of the most common used and carry-on device. It would be detected in a shorter time when a mobile phone is lost because it was frequently used in daily time. One of the advantage of OTP is that it is only used once and it is securer compared to the fixed password. QR code is a kind of two-dimension matrix code, which has high encryption and decryption speed; it can not only store large information but also has the error-correction ability. In this paper, we try to develop a safe and efficient authentication way by using mobile phone and implement it for access control system. We take the advantage of one-time usage by using OTP, and store the secret information into QR code. Therefore, the proposed system enhances the security of physical access control systems.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Achieving Robustness and Fairness in Call Admission Control for Voice Services within NGN Environment","authors":"Chin-ling Chen, Jia-Chun Wu","doi":"10.1109/CyberC.2011.25","DOIUrl":"https://doi.org/10.1109/CyberC.2011.25","url":null,"abstract":"Call admission control plays an important role in International Telecommunication Union-Telecommunication Standardization Sector (ITU-T) Quality of Services (QoS) architecture of next generation network (NGN). We extend both BPC and BPC-IF call admission control [23] to exploit their capability of robustness and fairness in response to the variation of network status. Simulation results show that the modified BPC and BPCIF algorithm is effective in supporting robustness in terms of utilization, while achieving good fairness of network resources.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126629572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QoS and Traffic Management for CDMA Network","authors":"Fengyi Yang, Xiaodong Lu","doi":"10.1109/CyberC.2011.36","DOIUrl":"https://doi.org/10.1109/CyberC.2011.36","url":null,"abstract":"Unlimited data package plan and the peer to peer (P2P) services make the network load unbalance and the network resources exhaust. According to the statistical results, 3%-5% subscribers have consumed about 40% traffic volume, and occupied 50% online time. P2P services consumed most of the resources and made the network low value. In this paper, we have discussed the services property and subscriber behaviors in CDMA2000-1x EVDO Rev. A network of China Telecom. And the different quality of service (QoS) and traffic management solutions was given to solve the related problem. Some test results was presented at the same time.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Is Fuzzy Vault Scheme Very Effective for Key Binding in Biometric Cryptosystems?","authors":"Hailun Liu, Dongmei Sun, Ke Xiong, Z. Qiu","doi":"10.1109/CyberC.2011.54","DOIUrl":"https://doi.org/10.1109/CyberC.2011.54","url":null,"abstract":"Fuzzy vault scheme is one of the most popular secret sharing mechanisms. In the scheme two people could share the secret concealed in the vault as long as two data sets A and B overlap with each other substantially. Because the two sets A and B are not required to be identical, many researchers consider the fuzzy vault scheme as one of biometric cryptosystems and try to implement it based on biometric feature data. However, the fuzzy vault scheme is not applicable to biometric feature data, because the scheme is designed based on set differences metric while in biometric systems Euclidean distance metric is often used to measure the similarity between two feature vectors. To improve the traditional fuzzy vault scheme to be applicable to biometric feature data, we propose a multidimensional fuzzy vault scheme, in which data matching could be performed the same as in biometric systems. A simple implementation of proposed multidimensional fuzzy vault scheme is given in this paper. Experimental results based on HA-BJTU palmprint database show the feasibility of proposed multidimensional fuzzy vault scheme.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121962339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Task Migration for Energy Conservation in Real-Time Multi-processor Embedded Systems","authors":"Hwang-Cheng Wang, Cheng-Wen Yao","doi":"10.1109/CyberC.2011.69","DOIUrl":"https://doi.org/10.1109/CyberC.2011.69","url":null,"abstract":"In recent years, portable devices and tablet PCs grow fast and become more convenient and mobile. Applications like multimedia, SIP, and 3D movies become more diverse than before. However, the complex architecture and heavy computing demands increase energy consumption. Therefore, how to extend the standby and usage time of the devices has become an important issue. In this paper we propose a task scheduling algorithm in a real-time multi-processor system. We reduce the workload in high speed processors with the aid of task migration so that the entire system can switch to low speed as soon as it can in order to reduce energy consumption. A distinctive feature is that actual execution time is used in the decision instead of worst-case execution time, which allows for more effective task migration. Performance results based on realistic processor power consumption models are promising. Effects of parameter values on the performance are also examined.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126834184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Cross-Platform Runtime Environment for Mobile Widget-Based Application","authors":"Yung-Wei Kao, C. Lin, Kuei-An Yang, S. Yuan","doi":"10.1109/CyberC.2011.20","DOIUrl":"https://doi.org/10.1109/CyberC.2011.20","url":null,"abstract":"In recent years, the market of mobile device keeps growing dramatically. Apple iPhone and Google Android are the two representatives of this kind of devices. However, the mobile applications of these platforms can only be executed on some specific platforms; these applications are not portable to other platforms. Another kind of application is Web-based widget, such as Yahoo! Mobile Widget. This kind of application can be executed on different mobile platforms if there are local runtime environments installed on them. However, Yahoo has to provide a different runtime environment for each different mobile platform; if there is any platform which is not supported by Yahoo, Yahoo! Mobile Widget cannot be executed. Most of the Web applications can be executed on mobile devices because more and more Web-related standards are supported by mobile Web browsers. However, the drawback of Web application is that it cannot be executed without Internet connection. In this paper, we propose a Web-based widget execution runtime environment and adopt the Google Gears technology for offline execution. In this way, mobile users can enjoy Web applications via their mobile Web browsers even if their phones are under offline mode.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129566753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Router: A Message Passing Model for Large-Scale Graph Mining","authors":"Zengfeng Zeng, Bin Wu","doi":"10.1109/CyberC.2011.19","DOIUrl":"https://doi.org/10.1109/CyberC.2011.19","url":null,"abstract":"many parallel computational models have been employed in many papers to process the large-scale graph. In this paper, we propose a message passing model Router which could be invoked by most of current parallel computational models to process the large graph. The model is good at solving the multi-source traversal problem which often occurs in many complex graph algorithms. As the model can traverse the graph from different source at the same time, the multi-source traversal will finish in much less iteration than before. In this way, the total time of the algorithm involves multi-source traversal will be reduced in a large scale. Besides, the Router model is flexible enough to express a broad set of algorithms by implementing the Router's abstract method. Finally, the experiment shows the efficiency and scalability of the model.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130295667","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}
Jianbo Lu, Guanzhong Dai, Dejun Mu, Jiang Yu, Haipeng Li
{"title":"QoS Guarantee in Tomcat Web Server: A Feedback Control Approach","authors":"Jianbo Lu, Guanzhong Dai, Dejun Mu, Jiang Yu, Haipeng Li","doi":"10.1109/CyberC.2011.39","DOIUrl":"https://doi.org/10.1109/CyberC.2011.39","url":null,"abstract":"In this paper, classical feedback control theory is used to contribute two types of QoS guarantees, relative delay guarantee ( RDG) and absolute delay guarantee (ADG). RDG aims to maintain the average queuing delay ratio between different classes of requests according to pre-specified parameters, and ADG aims to ensure the average queuing delay for requests with high priority is no more than the threshold configured. All components of the closed-loop of QoS guarantee is implemented for HTTP dynamic requests in the database connection pool (DBCP) in Tomcat Web Server. Through off-line system identification, the approximate linear time-invariant model of the DBCP was established; RDG and ADG controllers were designed to use the Root Locus method. The controller was invoked periodically to calculate and adjust the probabilities for different classes of requests to use a limited number of database connections, according to the error between the measured queuing delay and the reference value. The experiments were conducted to evaluate the performance of the closed-loop systems. Experiment results demonstrated that, the controllers designed were capable of handling fluctuating workloads, and achieved RDG and ADG effectively in Tomcat web server.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128989573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mitigating Interference for MIMO Communication System","authors":"Qinghua Ren, Yi Zhang, Zhenyong Chu","doi":"10.1109/CyberC.2011.89","DOIUrl":"https://doi.org/10.1109/CyberC.2011.89","url":null,"abstract":"This With the excellent ability of improving channel capacity, the conventional Multiple input and Multiple output (MIMO) is conditioned in its anti-interference ability between the transmitter and the receiver. Based on the Vertical Bell Laboratories Layered Space-Time (V-BLAST) architecture, we propose an enhanced MIMO architecture by utilizing a novel scheme: transform domain communication system (TDCS). It is the approach which offers better bit error rate (BER) performance compared to other conventional interference mitigation techniques that process the signal at the receiver only. This paper introduces the scheme and function model of the proposed MIMO system as well, and analyzes its interference mitigation approach concisely. The analysis and simulation results show that the anti-interference ability of the proposed system is stronger than that of conventional systems. By the virtue of its flexibility and adaptivity, the proposed system is one potential candidate for a reliable communication system or the cognitive radio technology.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122567067","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}