Ad hoc networks are promising but are vulnerable to selfish and malicious attacks. One kind of malicious attack, hidden wormhole attacks, can be mounted easily and be immune to cryptographic techniques. Wormholes distort network topology, and degrade the performance of applications such as localization and data collection. A wormhole attack is one of the most severe threats to an ad hoc network. Unfortunately, most state-of-the-art wormhole detection algorithms are not practicable. We observe and prove that, nodes attacked by the same wormhole are either 1-hopneighbors or 2-hop neighbors, and with a high probability, there are 3 nodes, which are non-1-hop neighbors, in the intersection of the two neighbor. However, such phenomena will not be present in normal topology. Thus a novel distributed algorithm is designed for wormhole detection and isolation with polynomial complexity. The detection probability is discussed. Simulation results show that the algorithm performs well regarding detection probability, as well as network overhead, false node alarms and miss detection.
{"title":"A Distributed Approach for Hidden Wormhole Detection with Neighborhood Information","authors":"Yun Wang, Zhongke Zhang, Jie Wu","doi":"10.1109/NAS.2010.22","DOIUrl":"https://doi.org/10.1109/NAS.2010.22","url":null,"abstract":"Ad hoc networks are promising but are vulnerable to selfish and malicious attacks. One kind of malicious attack, hidden wormhole attacks, can be mounted easily and be immune to cryptographic techniques. Wormholes distort network topology, and degrade the performance of applications such as localization and data collection. A wormhole attack is one of the most severe threats to an ad hoc network. Unfortunately, most state-of-the-art wormhole detection algorithms are not practicable. We observe and prove that, nodes attacked by the same wormhole are either 1-hopneighbors or 2-hop neighbors, and with a high probability, there are 3 nodes, which are non-1-hop neighbors, in the intersection of the two neighbor. However, such phenomena will not be present in normal topology. Thus a novel distributed algorithm is designed for wormhole detection and isolation with polynomial complexity. The detection probability is discussed. Simulation results show that the algorithm performs well regarding detection probability, as well as network overhead, false node alarms and miss detection.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127291249","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-Core architecture is the development trend of microprocessor architecture, and the “Memory Wall” is the chief obstacle to promote the processor performance. This paper analyzes the key factors affecting performance of memory system in shared L2 cache multi-core on a chip architecture, and believes that cache pollution caused by the speculative execution of memory reference instructions in predictive path may affect the performance of processor seriously. This paper proposes a cache pollution filtration technique based on confidence estimation, called FCPC. FCPC proceeds the dynamic appraisal using the confidence estimation mechanism to condition branch, and adds two tag bits CET (confidence estimation tag) and AHT(accessing hint tag) for each cache data line. According to the appraisal result, the memory accessing instructions in predictive path and their returned data in L2 cache are marked as high or low confidence separately. Then, when cache replacing operations are processed, the pollution data in shared L2 cache can be swept out preferentially according to CET and AHT tag. So, the efficiency of cache space is increased. Simulation result indicates that, in dual-core configuration, the FCPC strategy can promote the IPC performance effectively, ranges from 0.18%-4.86%, 1.91% averagely. Simultaneously, the miss rate of L2 Cache can be reduced, ranges from 0.65%-5.76%, average 2.57%.
{"title":"Filtering Cache Pollution by Using Replacement Operation Based on Confidence Estimation","authors":"Jun Zhang, K. Mei, Jizhong Zhao","doi":"10.1109/NAS.2010.16","DOIUrl":"https://doi.org/10.1109/NAS.2010.16","url":null,"abstract":"Multi-Core architecture is the development trend of microprocessor architecture, and the “Memory Wall” is the chief obstacle to promote the processor performance. This paper analyzes the key factors affecting performance of memory system in shared L2 cache multi-core on a chip architecture, and believes that cache pollution caused by the speculative execution of memory reference instructions in predictive path may affect the performance of processor seriously. This paper proposes a cache pollution filtration technique based on confidence estimation, called FCPC. FCPC proceeds the dynamic appraisal using the confidence estimation mechanism to condition branch, and adds two tag bits CET (confidence estimation tag) and AHT(accessing hint tag) for each cache data line. According to the appraisal result, the memory accessing instructions in predictive path and their returned data in L2 cache are marked as high or low confidence separately. Then, when cache replacing operations are processed, the pollution data in shared L2 cache can be swept out preferentially according to CET and AHT tag. So, the efficiency of cache space is increased. Simulation result indicates that, in dual-core configuration, the FCPC strategy can promote the IPC performance effectively, ranges from 0.18%-4.86%, 1.91% averagely. Simultaneously, the miss rate of L2 Cache can be reduced, ranges from 0.65%-5.76%, average 2.57%.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984716","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}
Yongqing Zhu, Yang Yu, Wilson Yonghong Wang, Sophia Sufui Tan, T. Low
In parallel I/O systems, fast response to disk access and load balancing are two important performance objectives pursued by end users and applications. These performances are largely determined by the data allocation strategies, or file assignment algorithms. However, most existing algorithms can only obtain one of the performance objectives, including the well-known algorithms like Greedy, Sort Partition (SP) and Hybrid Partition (HP). New algorithms that can achieve both objectives are very necessary for parallel I/O systems. In this paper, we have proposed two new allocation algorithms for file assignment in parallel I/O systems: an offline Balanced Allocation with Sort (BAS) algorithm and an online Balanced Allocation with Sort for Batch (BASB) algorithm. Both algorithms aim to achieve the optimal mean response time and load balancing at the same time. The experiment results have shown that the BAS algorithm can get the optimal performance on response time among all compared algorithms and better performance on load balancing than SP. For online BASB algorithm, it can achieve the optimal performances on both response time and load balancing among all algorithms for comparison.
{"title":"A Balanced Allocation Strategy for File Assignment in Parallel I/O Systems","authors":"Yongqing Zhu, Yang Yu, Wilson Yonghong Wang, Sophia Sufui Tan, T. Low","doi":"10.1109/NAS.2010.10","DOIUrl":"https://doi.org/10.1109/NAS.2010.10","url":null,"abstract":"In parallel I/O systems, fast response to disk access and load balancing are two important performance objectives pursued by end users and applications. These performances are largely determined by the data allocation strategies, or file assignment algorithms. However, most existing algorithms can only obtain one of the performance objectives, including the well-known algorithms like Greedy, Sort Partition (SP) and Hybrid Partition (HP). New algorithms that can achieve both objectives are very necessary for parallel I/O systems. In this paper, we have proposed two new allocation algorithms for file assignment in parallel I/O systems: an offline Balanced Allocation with Sort (BAS) algorithm and an online Balanced Allocation with Sort for Batch (BASB) algorithm. Both algorithms aim to achieve the optimal mean response time and load balancing at the same time. The experiment results have shown that the BAS algorithm can get the optimal performance on response time among all compared algorithms and better performance on load balancing than SP. For online BASB algorithm, it can achieve the optimal performances on both response time and load balancing among all algorithms for comparison.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129068452","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 past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in their application environment, sensors with different capacities, power, and so on are deployed. Data routing in such heterogeneous sensor networks is a challenging task. On one hand, the heterogeneous features bring about the diversity in their transmission ranges, which subsequently lead to asymmetric links in the communication graph. As a result, conventional routing strategies based on undirected graphs become unsuitable. On the other hand, sensors communicate with each other through intermittent asymmetric links. It is important to provide assurable delivery rate for mission critical applications. In this paper, we propose ProHet: a Probabilistic routing protocol for Heterogeneous sensor networks, which can deal with asymmetric links well and work in a distributed manner with low overhead and assurable delivery rate. The ProHet protocol first produces a bidirectional routing abstraction by finding a reverse routing path for every asymmetric link. Then, it uses a probabilistic strategy to choose forwarding nodes based on historical statistics, which is shown to achieve assurable delivery rate by theoretical analysis. Extensive simulations are conducted to verify the efficiency of the proposed protocol.
{"title":"A Probabilistic Routing Protocol for Heterogeneous Sensor Networks","authors":"Yuefei Hu, Wenzhong Li, Xiao Chen, Xin Chen, Sanglu Lu, Jie Wu","doi":"10.1109/NAS.2010.42","DOIUrl":"https://doi.org/10.1109/NAS.2010.42","url":null,"abstract":"The past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in their application environment, sensors with different capacities, power, and so on are deployed. Data routing in such heterogeneous sensor networks is a challenging task. On one hand, the heterogeneous features bring about the diversity in their transmission ranges, which subsequently lead to asymmetric links in the communication graph. As a result, conventional routing strategies based on undirected graphs become unsuitable. On the other hand, sensors communicate with each other through intermittent asymmetric links. It is important to provide assurable delivery rate for mission critical applications. In this paper, we propose ProHet: a Probabilistic routing protocol for Heterogeneous sensor networks, which can deal with asymmetric links well and work in a distributed manner with low overhead and assurable delivery rate. The ProHet protocol first produces a bidirectional routing abstraction by finding a reverse routing path for every asymmetric link. Then, it uses a probabilistic strategy to choose forwarding nodes based on historical statistics, which is shown to achieve assurable delivery rate by theoretical analysis. Extensive simulations are conducted to verify the efficiency of the proposed protocol.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127815367","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}
Inter-vehicular communication is an important research area that is rapidly growing due to considerable advances in mobile and wireless communication technologies, as well as the growth of microprocessing capabilities inside today’s cars, and other moving vehicles. A good amount of research has been done to exploit the different services that can be provided to enhance the safety and comfort of the driver. Additional functions provide the car electronics and the passengers with access to the Internet and other core network resources. This paper provides a survey of the latest advances in the area of inter-vehicular communication (IVC) including vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) functions and services. In addition, the paper presents the most important projects and protocols that are involved in IVC systems as well as the different issues and challenges that exist at each layer of the networking model.
{"title":"Inter-vehicular Communication Systems, Protocols and Middleware","authors":"I. Jawhar, N. Mohamed, Liren Zhang","doi":"10.1109/NAS.2010.49","DOIUrl":"https://doi.org/10.1109/NAS.2010.49","url":null,"abstract":"Inter-vehicular communication is an important research area that is rapidly growing due to considerable advances in mobile and wireless communication technologies, as well as the growth of microprocessing capabilities inside today’s cars, and other moving vehicles. A good amount of research has been done to exploit the different services that can be provided to enhance the safety and comfort of the driver. Additional functions provide the car electronics and the passengers with access to the Internet and other core network resources. This paper provides a survey of the latest advances in the area of inter-vehicular communication (IVC) including vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) functions and services. In addition, the paper presents the most important projects and protocols that are involved in IVC systems as well as the different issues and challenges that exist at each layer of the networking model.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130096418","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}
Wireless mesh networks (WMNs) have recently emerged as a promising broadband access infrastructure for next-generation wireless networking. Several approaches that exploit directional antennas have been proposed in the literature to increase the performance of WMNs. In this paper, we study the interference optimization multicast problem in WMNs where nodes are equipped with directional antennas. Interference can make a significant impact on the performance of multi-hop wireless networks. Directional transmissions can greatly reduce radio interference, increase spatial reuse, and enable more efficient MAC designs. We first present the definition of interference with directional transmissions that are suitable for designing multicast algorithms, and formulate minimum interference multicast problems using a linear programming model. We then propose a heuristic algorithm to solve the problem. Our model and algorithm are good for both single multicast session and multiple multicast sessions. Multicast routing found by our interference-aware algorithm tends to have less channel collisions.
{"title":"Interference-Aware Multicast in Wireless Mesh Networks with Directional Antennas","authors":"Jun Wang, Min Song, Yanxiao Zhao","doi":"10.1109/NAS.2010.19","DOIUrl":"https://doi.org/10.1109/NAS.2010.19","url":null,"abstract":"Wireless mesh networks (WMNs) have recently emerged as a promising broadband access infrastructure for next-generation wireless networking. Several approaches that exploit directional antennas have been proposed in the literature to increase the performance of WMNs. In this paper, we study the interference optimization multicast problem in WMNs where nodes are equipped with directional antennas. Interference can make a significant impact on the performance of multi-hop wireless networks. Directional transmissions can greatly reduce radio interference, increase spatial reuse, and enable more efficient MAC designs. We first present the definition of interference with directional transmissions that are suitable for designing multicast algorithms, and formulate minimum interference multicast problems using a linear programming model. We then propose a heuristic algorithm to solve the problem. Our model and algorithm are good for both single multicast session and multiple multicast sessions. Multicast routing found by our interference-aware algorithm tends to have less channel collisions.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130664726","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 Lin, Xiaoyi Lu, Lingjing Yu, Yongqiang Zou, L. Zha
In a virtual cluster based Cloud Computing environment, the sharing of infrastructure introduces two problems on user management: usability and security. Meanwhile, we observe that most conventional user management frameworks in the network environment are not fit for the scale expansion and interconnection of dynamic virtualization environment. In this paper, we propose VegaWarden, a uniform user management system to solve these problems. VegaWarden supplies a global user space for different virtual infrastructures and application services in one Cloud, and allows user system interconnection among homogeneous Cloud instances. A uniform authentication model enables the security isolation of different administrative domains, and a decentralized architecture ensures its scalability. We have implemented VegaWarden in an experimental Cloud-oriented infrastructure and a production Grid Computing environment. The functionality and performance of VegaWarden have been demonstrated.
{"title":"VegaWarden: A Uniform User Management System for Cloud Applications","authors":"Jian Lin, Xiaoyi Lu, Lingjing Yu, Yongqiang Zou, L. Zha","doi":"10.1109/NAS.2010.34","DOIUrl":"https://doi.org/10.1109/NAS.2010.34","url":null,"abstract":"In a virtual cluster based Cloud Computing environment, the sharing of infrastructure introduces two problems on user management: usability and security. Meanwhile, we observe that most conventional user management frameworks in the network environment are not fit for the scale expansion and interconnection of dynamic virtualization environment. In this paper, we propose VegaWarden, a uniform user management system to solve these problems. VegaWarden supplies a global user space for different virtual infrastructures and application services in one Cloud, and allows user system interconnection among homogeneous Cloud instances. A uniform authentication model enables the security isolation of different administrative domains, and a decentralized architecture ensures its scalability. We have implemented VegaWarden in an experimental Cloud-oriented infrastructure and a production Grid Computing environment. The functionality and performance of VegaWarden have been demonstrated.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309988","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}
Matrix multiplication is one of the most common numerical operations in the field of scientific computing, which is the kernel routine of Level 3 BLAS. The STI CELL processor is a heterogeneous multiprocessor with a unique design to achieve high peak floating point performance. As matrix multiplication operation is essential for a wide range of numerical algorithms, so performance improvements to the GEMM routine immediately can benefit the entire algorithm. In this paper, we provide a new way to utilize the hardware features of Cell to achieve better performance on the Single Precision General Matrix Multiplication (SGEMM), through both heterogeneous PPEs and SPEs parallelization, our method gains speedup over the Cell SDK (2.5%). An extra speedup about 30% of performance is achieved via interleaved memory allocation, which improves memory access.
{"title":"Heterogeneous Multi-core Parallel SGEMM Performance Testing and Analysis on Cell/B.E Processor","authors":"Yan Li, Yunquan Zhang, Ke Wang, Wenhua Guan","doi":"10.1109/NAS.2010.48","DOIUrl":"https://doi.org/10.1109/NAS.2010.48","url":null,"abstract":"Matrix multiplication is one of the most common numerical operations in the field of scientific computing, which is the kernel routine of Level 3 BLAS. The STI CELL processor is a heterogeneous multiprocessor with a unique design to achieve high peak floating point performance. As matrix multiplication operation is essential for a wide range of numerical algorithms, so performance improvements to the GEMM routine immediately can benefit the entire algorithm. In this paper, we provide a new way to utilize the hardware features of Cell to achieve better performance on the Single Precision General Matrix Multiplication (SGEMM), through both heterogeneous PPEs and SPEs parallelization, our method gains speedup over the Cell SDK (2.5%). An extra speedup about 30% of performance is achieved via interleaved memory allocation, which improves memory access.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114650838","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}
Delay tolerant networks (DTNs) are envisioned to provide promising applications and services. One critical issue in DTNs is efficiently forwarding the messages within the delay requirements while avoiding the cost associated with blind flooding. To guide the forwarding process, nodes can evaluate their relationships with each other, in terms of ``closeness'', which summarizes both temporal and spacial information, based on contact history. However, due to the uncertainty in nodal mobility, the contact history usually contains fuzziness and incomplete information. In this paper, we first define and utilize a fuzzy trust evaluation system for nodes to summarize their relationships to other nodes, in terms of closeness. We then propose the fuzzy clustering to organize nodes into overlapped fuzzy communities based on nodes' evaluations of closeness. On top of the fuzzy communities, a novel fuzzy-weight-based delegation forwarding scheme is proposed to propagate the messages into all communities while avoiding repeated forwarding in the same community. Extensive simulation results based on real traces are presented to support the effectiveness of our scheme.
{"title":"Fuzzy Closeness-Based Delegation Forwarding in Delay Tolerant Networks","authors":"Feng Li, Yinying Yang, Jie Wu, X. Zou","doi":"10.1109/NAS.2010.65","DOIUrl":"https://doi.org/10.1109/NAS.2010.65","url":null,"abstract":"Delay tolerant networks (DTNs) are envisioned to provide promising applications and services. One critical issue in DTNs is efficiently forwarding the messages within the delay requirements while avoiding the cost associated with blind flooding. To guide the forwarding process, nodes can evaluate their relationships with each other, in terms of ``closeness'', which summarizes both temporal and spacial information, based on contact history. However, due to the uncertainty in nodal mobility, the contact history usually contains fuzziness and incomplete information. In this paper, we first define and utilize a fuzzy trust evaluation system for nodes to summarize their relationships to other nodes, in terms of closeness. We then propose the fuzzy clustering to organize nodes into overlapped fuzzy communities based on nodes' evaluations of closeness. On top of the fuzzy communities, a novel fuzzy-weight-based delegation forwarding scheme is proposed to propagate the messages into all communities while avoiding repeated forwarding in the same community. Extensive simulation results based on real traces are presented to support the effectiveness of our scheme.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122443981","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 data amount growing at an ever increasing rate, file system, as the basis of data management, its functionality and content are becoming more and more complex. Thus the file system is forced to be upgraded constantly, in order to satisfy the growing demands. However, the reinvention of new file systems is always a high-cost task. Although there are frameworks such as User-space File System that may help speeding up the development process, ease the pain of deploying new functions, they also bring in significant overhead, especially when file operation frequency is fairly high. We designed and implemented a lightweight file system management framework based on LD_PRELOAD in user-space referred to as User-Space Preload (USP), and tested several management tasks with it. According to the comparison with FUSE, USP-based file system management achieved an obvious performance improvement.
{"title":"USP: A Lightweight File System Management Framework","authors":"Zhan Shi, D. Feng, Heng Zhao, Lingfang Zeng","doi":"10.1109/NAS.2010.47","DOIUrl":"https://doi.org/10.1109/NAS.2010.47","url":null,"abstract":"With data amount growing at an ever increasing rate, file system, as the basis of data management, its functionality and content are becoming more and more complex. Thus the file system is forced to be upgraded constantly, in order to satisfy the growing demands. However, the reinvention of new file systems is always a high-cost task. Although there are frameworks such as User-space File System that may help speeding up the development process, ease the pain of deploying new functions, they also bring in significant overhead, especially when file operation frequency is fairly high. We designed and implemented a lightweight file system management framework based on LD_PRELOAD in user-space referred to as User-Space Preload (USP), and tested several management tasks with it. According to the comparison with FUSE, USP-based file system management achieved an obvious performance improvement.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132408705","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
扫码关注我们
求助内容：
应助结果提醒方式：