2013 IEEE Eighth International Conference on Networking, Architecture and Storage最新文献

筛选
英文 中文
Battery-Aware MAC Analytical Modeling for Extending Lifetime of Low Duty-Cycled Wireless Sensor Network 低占空比无线传感器网络延长寿命的电池感知MAC分析建模
Yulin Li, S. Yin, Leibo Liu, Shaojun Wei, Dong Wang
{"title":"Battery-Aware MAC Analytical Modeling for Extending Lifetime of Low Duty-Cycled Wireless Sensor Network","authors":"Yulin Li, S. Yin, Leibo Liu, Shaojun Wei, Dong Wang","doi":"10.1109/NAS.2013.47","DOIUrl":"https://doi.org/10.1109/NAS.2013.47","url":null,"abstract":"Emerging techniques and systems for Wireless Sensor Network (WSN) are developed in the last decade for various application fields. In WSN, the sensor nodes are usually distributed over a large area and are powered by batteries with limited energy, maintaining a long service lifetime for the entire network becomes a challenging task. In this paper, a novel battery aware MAC analytical model is proposed for low duty-cycled WSN. The proposed analytical model takes the characteristics of actual battery into account and targets the optimal sleep interval with a reasonable trade-offs between the energy dissipation on sending the preamble and idle listening. The simulation results demonstrate that the proposed approach can improve the energy efficiency as well as guarantee low latency and high reliability.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123073136","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}
引用次数: 6
Luminance and Chrominance Parallelization of H.264/AVC Decoding on a Multi-core Processor H.264/AVC解码在多核处理器上的亮度和色度并行化
Xiaofu Meng, Xiang Gao, Qian Yu, Shuangshuang Zhang, Xiaochun Zhang, Jing Huang
{"title":"Luminance and Chrominance Parallelization of H.264/AVC Decoding on a Multi-core Processor","authors":"Xiaofu Meng, Xiang Gao, Qian Yu, Shuangshuang Zhang, Xiaochun Zhang, Jing Huang","doi":"10.1109/NAS.2013.39","DOIUrl":"https://doi.org/10.1109/NAS.2013.39","url":null,"abstract":"This paper proposes a novel method to optimizing H.264 decoding on multi-core processors by exploiting color component level parallelism. Compared with sequential decoding and macro-block level parallelism, the proposed method achieves optimal balance between performance and scalability. The optimization scheme is mapped on a 64-bit MIPS multi-core processor, and is evaluated with standard test streams. Experimental results show that the method improves video decoding performance by 2 times on average without increasing memory consumption, and could be easily applied on other multi-core processors.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182482","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}
引用次数: 0
MCD: Overcoming the Data Download Bottleneck in Data Centers MCD:克服数据中心的数据下载瓶颈
J. Kaiser, Dirk Meister, Viktor Gottfried, A. Brinkmann
{"title":"MCD: Overcoming the Data Download Bottleneck in Data Centers","authors":"J. Kaiser, Dirk Meister, Viktor Gottfried, A. Brinkmann","doi":"10.1109/NAS.2013.18","DOIUrl":"https://doi.org/10.1109/NAS.2013.18","url":null,"abstract":"The data download problem in data centers describes the increasingly common task of coordinated loading of identical data to a large number of nodes. Data download is seen as a significant problem in exascale HPC applications. Uncoor-dinated reading from a central file server creates contention at the file server and its network interconnect. We propose and evaluation a reliable multicast based approach to solve the data download problem. The MCD system builds a logical multi-rooted tree based on the physical network topology and uses the logical view for a two-phase approach. In the first phase, the data is multicasted to all nodes. In the second phase, the logical tree is used for an efficient error-correction. We evaluate the approach against the Twitter's Murder, which is BitTorrent-based data download solution used to deploy code binaries to thousands of nodes. The evaluation features a simulation of up to 10,000 nodes and shows that MCD finishes the reliable data download significantly faster. The simulation results are finally validated using a real-world deployment of more than 100 nodes.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007849","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}
引用次数: 0
An Optimized GP-GPU Warp Scheduling Algorithm for Sparse Matrix-Vector Multiplication 稀疏矩阵向量乘法的优化GP-GPU Warp调度算法
Lifeng Liu, Meilin Liu, Chong-Jun Wang
{"title":"An Optimized GP-GPU Warp Scheduling Algorithm for Sparse Matrix-Vector Multiplication","authors":"Lifeng Liu, Meilin Liu, Chong-Jun Wang","doi":"10.1109/NAS.2013.35","DOIUrl":"https://doi.org/10.1109/NAS.2013.35","url":null,"abstract":"GP-GPUs have been used as the platform for many applications due to their powerful computation ability and massively parallel features. In this paper, we first investigate the CSR sparse matrix format, the performance of existing optimized SpMV (Sparse matrix-vector multiplication) algorithms, and analyze the memory access patterns of the SpMV algorithms. Based on the analysis of the memory access patterns, we propose a new thread scheduling technique that can take advantage of inter-warp locality and intra-warp locality simultaneously, and also can achieve memory coalescing automatically. This proposed new scheduling technique will change the memory access pattern of SpMVs significantly. The simulation results show that the performance of the SpMV using the new proposed thread scheduling technique achieves much better performance than the implementation of the SpMV optimized by other techniques.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125758779","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}
引用次数: 0
An Evolvable Locator/ID Separation Internet Architecture (ELISIA) 一种可进化的定位器/ID分离互联网架构(ELISIA)
Haitao Zhang, Xing Li, CongXiao Bao
{"title":"An Evolvable Locator/ID Separation Internet Architecture (ELISIA)","authors":"Haitao Zhang, Xing Li, CongXiao Bao","doi":"10.1109/NAS.2013.24","DOIUrl":"https://doi.org/10.1109/NAS.2013.24","url":null,"abstract":"In the current Internet, IP address system suffers from the overloading of semantics. This brings great challenge to the scalability of the routing system and the mobility of network hosts. One proposal called Locator/ID separation which separates network layer into locater layer and ID layer has been discussed within the IETF and IRTF for years. In the meantime, the Internet is going through a phase of transition from IPv4 to IPv6. One seamless approach called IVI which achieves IPv4/IPv6 inter-connection by stateless address and protocol translation is designed and has been fully tested. However, most of the existing Locator/ID separation approaches do not take IPv4/IPv6 transition into consideration and have scalability problem. In this paper, we propose an evolvable Locator/ID separation Internet architecture (ELISIA), which extends the address mapping mechanism of IVI system and NAT system as its Locator/ID mapping mechanism. In this new architecture, hosts mobility and multihoming are supported, the growth rate of routing table will slow down, both IPv4 and IPv6 applications can get access to Internet without upgrading backbone into dual stack. What's more important, we expect that through the deployment of this architecture, the current Internet would eventually evolve into pure IPv6 network while IPv4 quits from history stage.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131289858","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}
引用次数: 1
Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks 基于网格的片上网络架构在洪水拒绝服务攻击下的鲁棒性分析
D. Fang, Huikai Li, Jun Han, Xiaoyang Zeng
{"title":"Robustness Analysis of Mesh-Based Network-on-Chip Architecture under Flooding-Based Denial of Service Attacks","authors":"D. Fang, Huikai Li, Jun Han, Xiaoyang Zeng","doi":"10.1109/NAS.2013.29","DOIUrl":"https://doi.org/10.1109/NAS.2013.29","url":null,"abstract":"The attacks such as Denial of Service (DoS) violate the security of Network-on-Chip (NoC) which emerges as a promising solution for multi-core system. In this paper, we explore the robustness of mesh-based NoC architecture under various flooding-based DoS attacks. Simulation results reveal that the robustness of NoC architecture can be correlated with parameters such as routing algorithm, the number and positions of attacked nodes. It indicates that deterministic routing algorithm xy will result in less performance degradation than using other four adaptive routing algorithms studied in this paper when the attack traffic rate is lower than 0.65. However, the opposite conclusion can be made if much higher attack traffic rate is used. The performance degradation would escalate with the increasing number of at-tacked nodes. Moreover, the locations of attacked nodes will have an impact on the degree of performance degradation. Last but not least, some design guidelines for NoC against DoS attacks are proposed.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115449630","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}
引用次数: 17
Research on English Learning Strategy Usage in Web-Based and Conventional Environments 网络环境与传统环境下英语学习策略使用研究
Zhi Wen
{"title":"Research on English Learning Strategy Usage in Web-Based and Conventional Environments","authors":"Zhi Wen","doi":"10.1109/NAS.2013.56","DOIUrl":"https://doi.org/10.1109/NAS.2013.56","url":null,"abstract":"This paper presents two investigations on the use of English learning strategies in web-based and conventional environments. Through data analysis, implications drawn from the research are discussed in terms of two areas. The first is to construct a strategic learning mode in web-based environments. The second is to discuss how to develop learners' English-learning strategy awareness in web-based environments.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125967097","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}
引用次数: 0
A New Interest-Sensitive and Network-Sensitive Method for User Recommendation 一种兴趣敏感和网络敏感的用户推荐新方法
Yanmin Shang, P. Zhang, Yanan Cao
{"title":"A New Interest-Sensitive and Network-Sensitive Method for User Recommendation","authors":"Yanmin Shang, P. Zhang, Yanan Cao","doi":"10.1109/NAS.2013.38","DOIUrl":"https://doi.org/10.1109/NAS.2013.38","url":null,"abstract":"With the rapid proliferation of diverse online social network sites, user recommendation has been received unprecedented attention. At present, the methods for user recommendation are mainly divided into two categories: recommending a new friend for a target user according to similar interest, or by friendships similarity between the two users. The first category methods have high recall but low precision, the second methods have high precision but low recall. In this paper, we proposed a new hybrid approach by incorporating users' interests and users' friendships together to recommend new friends for target users. Firstly, we use latent Dirichlet allocation (LDA) to model users' interests, and Weighted-PageRank Algorithm to model users' friendship network, and then merge these two factors into a hybrid model based on PageRank algorithm. This hybrid method models users' interests and users' friendships at the same time, and we demonstrate the effectiveness of our hybrid model by using some social network datasets.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130648446","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}
引用次数: 4
A Variant-Hop Algorithm in Forming Bluetooth Sensor Networks 蓝牙传感器网络的变跳算法
Chih-Min Yu, Yih-Bin Yu
{"title":"A Variant-Hop Algorithm in Forming Bluetooth Sensor Networks","authors":"Chih-Min Yu, Yih-Bin Yu","doi":"10.1109/NAS.2013.48","DOIUrl":"https://doi.org/10.1109/NAS.2013.48","url":null,"abstract":"Blue web is a self-organizing Bluetooth-based multihop network equipped with a scatter net formation algorithm and a hybrid routing protocol. Blue web uses a designated root node to initiate scatter net formation and two mechanisms are introduced. One is the role exchange mechanism in which only slave nodes serve as the role of relay through the whole scatter net. The other one is the return connection mechanism in which we convert the scatter net from a tree-shaped to a web-shaped topology. In this paper, a variant-hop algorithm in forming Bluetooth sensor scatter net is proposed. Based on the design of Blue web, this algorithm is a tier-based method to determine new roots and each new root spontaneously generates their individual web-shaped subnets. The heuristic method describes the variant-hop algorithms. With a constant k, a counter variable v, and return variable r as parameters, the variant-hop algorithm generates appropriate roots locally and evenly configures the subnet size. Computer simulation shows that this method achieves good network scalability and generates an efficient scatter net configuration for Bluetooth-based multihop sensor networks.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132201651","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}
引用次数: 4
Spontaneous Reload Cache: Mimicking a Larger Cache with Minimal Hardware Requirement 自发重载缓存:模仿一个更大的缓存与最小的硬件要求
Lunkai Zhang, Mingzhe Zhang, Lingjun Fan, Da Wang, P. Ienne
{"title":"Spontaneous Reload Cache: Mimicking a Larger Cache with Minimal Hardware Requirement","authors":"Lunkai Zhang, Mingzhe Zhang, Lingjun Fan, Da Wang, P. Ienne","doi":"10.1109/NAS.2013.11","DOIUrl":"https://doi.org/10.1109/NAS.2013.11","url":null,"abstract":"In modern processor systems, on-chip Last Level Caches (LLCs) are used to bridge the speed gap between CPUs and off-chip memory. In recent years, the LRU policy effectiveness in low level caches has been questioned. A significant amount of recent work has explored the design space of replacement policies for CPUs' low level cache systems, and proposed a variety of replacement policies. All these pieces of work are based on the traditional idea of a conventional passive cache, which triggers memory accesses exclusively when there is a cache miss. Such passive cache systems have a theoretical performance upper bound, which is represented by Optimal Algorithm. In this work, we introduce a novel cache system called Spontaneous Reload Cache (SR-Cache). Contrary to passive caches, no matter whether a cache access is a hit or miss, an SR-Cache can actively load or reload an off-chip data block which is predicted to be used in the near future and evict the data block which has the lowest probability to be reused soon. We show that, with minimal hardware overhead, SR-Cache can achieve much better performance than conventional passive caches.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123416453","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信