{"title":"Forum-Oriented Research on Water Army Detection for Bursty Topics","authors":"Huijie Xu, Wandong Cai, Guirong Chen","doi":"10.1109/NAS.2014.18","DOIUrl":"https://doi.org/10.1109/NAS.2014.18","url":null,"abstract":"Water army means a special group of online users who get paid for posting comments and new threads or articles on different online communities and websites for some hidden purposes. Due to the fact that the nature of the posting behavior of water army is not fully and understood, the driving force detection of the bursty topic for web forum is still a difficult problem to solve. According to the analysis of bursty topics evolution and the posting behavior of water army, it is found that the topics driven by water army exhibit the characteristics different from general topics in their latency stage. Based on this discovery, the paper proposes a novel bursty topic classification algorithm, based on SVM active learning, which transforms the water army detection issue to a SVM-based classification decision issue. The experimental results show that the proposed algorithm has higher detection accuracy and detection efficiency.","PeriodicalId":186621,"journal":{"name":"2014 9th IEEE International Conference on Networking, Architecture, and Storage","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025906","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}
Hua Nie, Xue Zhou, Yalu Ni, Xiaojun Yang, Keping Long
{"title":"Design and Implementation of a Virtualized Storage Fabric for Cloud Server","authors":"Hua Nie, Xue Zhou, Yalu Ni, Xiaojun Yang, Keping Long","doi":"10.1109/NAS.2014.23","DOIUrl":"https://doi.org/10.1109/NAS.2014.23","url":null,"abstract":"High concurrent Cloud Server needs high-density CPUs and each CPU needs its own dedicated local disk. In order to save disk space, a virtualized storage fabric is designed to share multiple CPUs attached to one storage device. This paper presents a new storage virtualization strategy based on a Shared Storage Controller (SSC). SSC is a bridge between multiple CPUs and one disk. It is implemented in hardware level using FPGA. It virtualizes disk resource into volumes and provides private and public volumes for each CPU according to their requirements. With SSC, Cloud Server can be more scalable and storage fabric can be safer. In this paper, the architecture of SSC is demonstrated and some preliminary results are presented.","PeriodicalId":186621,"journal":{"name":"2014 9th IEEE International Conference on Networking, Architecture, and Storage","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452546","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}
Guoliang Liu, Liuying Ma, Pengfei Yan, Shuai Zhang, L. Liu
{"title":"Design and Implementation of GeoFS: A Wide-Area File System","authors":"Guoliang Liu, Liuying Ma, Pengfei Yan, Shuai Zhang, L. Liu","doi":"10.1109/NAS.2014.24","DOIUrl":"https://doi.org/10.1109/NAS.2014.24","url":null,"abstract":"We propose GeoFS, a POSIX-compliant, wide-area distributed file system, which is used for sharing files between sites. GeoFS uses FUSE to provide standard file system interfaces to applications, it allows users to control over consistency and replication via extended attributes. In the era of big data, traditional file systems do not adapt well to update a large directory (i.e. Huge number of files in one directory), if there is a small fraction of changes in a directory, the whole cache of the directory metadata must be discarded, and a new copy will be obtained from remote server, resulting in poor performance. We address this issue by partitioning metadata into blocks, and only transferring modified block(s) over the network. GeoFS also supports client caching, prefetching, parallel read and compression to make it suitable for use in networks with high latency and low bandwidth characteristics. Performance tests demonstrate that Geo FS outperforms NFS in a wide-area environment.","PeriodicalId":186621,"journal":{"name":"2014 9th IEEE International Conference on Networking, Architecture, and Storage","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121993615","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":"Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor","authors":"Jing Chen, W. Watson, Mayee F. Chen","doi":"10.1109/NAS.2014.25","DOIUrl":"https://doi.org/10.1109/NAS.2014.25","url":null,"abstract":"Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor. This algorithm is capable of computing GCDs efficiently on many pairs of big integers in parallel by utilizing all cores on a Xeon Phi coprocessor as well as taking advantage of all vector processing units of the coprocessor to speed up critical integer operations within the algorithm. Using 240 threads on a Xeon Phi coprocessor to carry out GCD calculations for a large amount of 2048-bit integers, the implementation achieves the speedup of 30 times over a sequential binary GCD algorithm implementation on a single CPU core, and it delivers twice amount of performance in comparison to the same sequential binary GCD implementation running on 240 threads of the Xeon Phi.","PeriodicalId":186621,"journal":{"name":"2014 9th IEEE International Conference on Networking, Architecture, and Storage","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133179857","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}
Jian Sun, Xiaoshe Dong, Xingjun Zhang, Yinfeng Wang
{"title":"An Availability Approached Task Scheduling Algorithm in Heterogeneous Fault-Tolerant System","authors":"Jian Sun, Xiaoshe Dong, Xingjun Zhang, Yinfeng Wang","doi":"10.1109/NAS.2014.47","DOIUrl":"https://doi.org/10.1109/NAS.2014.47","url":null,"abstract":"In heterogeneous fault-tolerant system, especially high performance computer system, the issue of providing system with high availability assurance for real-time applications which have availability requirements has been widespread concerned. While, few research concentrates on combining real-time application availability requirement with scheduling algorithm. In this paper, an availability approached task scheduling algorithm is proposed. On the basis of heterogeneous fault-tolerant system scheduler and scheduling algorithm designation, we can improve the system availability without increasing additional hardware costs, and shorten task average response time, in addition, schedule task with high efficiency and reliability. Experiment results show that, such availability approached task scheduling algorithm has a system performance advantage over the traditional system task scheduling algorithms, it achieves the goal of balancing availability and task response time in heterogeneous fault-tolerant system, thus improve the system availability.","PeriodicalId":186621,"journal":{"name":"2014 9th IEEE International Conference on Networking, Architecture, and Storage","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569467","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}