发布求助
文献互助 智能选刊 最新文献

2008 International Conference on Networking, Architecture, and Storage最新文献

筛选
英文 中文
Adaptive Consistency Guarantees for Large-Scale Replicated Services 大规模复制服务的自适应一致性保证
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.64
Yijun Lu, Ying Lu, Hong Jiang
{"title":"Adaptive Consistency Guarantees for Large-Scale Replicated Services","authors":"Yijun Lu, Ying Lu, Hong Jiang","doi":"10.1109/NAS.2008.64","DOIUrl":"https://doi.org/10.1109/NAS.2008.64","url":null,"abstract":"To maintain consistency, designers of replicated services have traditionally been forced to choose from either strong consistency guarantees or none at all. Realizing that a continuum between strong and optimistic consistencies is semantically meaningful for a broad range of network services, previous research has proposed a continuous consistency model for replicated services to support the tradeoff between the guaranteed consistency level, performance and availability. However, to meet changing application needs and to make the model useful for interactive users of large-scale replicated services, the adaptability and the swiftness of inconsistency resolution are important and challenging. This paper presents IDEA (an infrastructure for detection-based adaptive consistency guarantees) for adaptive consistency guarantees of large-scale, Internet-based replicated services. The main functions enabled by IDEA include quick inconsistency detection and resolution, consistency adaptation and quantified consistency level guarantees. Through experimentation on the Planet-Lab, IDEA is evaluated from two aspects: its adaptive consistency guarantees and its performance for inconsistency resolution. Results show that IDEA is able to provide consistency guarantees adaptive to userpsilas changing needs, and it achieves low delay for inconsistency resolution and incurs small communication overhead.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115335455","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
A Novel Interoperable Model of Distributed UDDI 一种新的分布式UDDI互操作模型
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.16
Libing Wu, Yanxiang He, Dan Wu, Jianqun Cui
{"title":"A Novel Interoperable Model of Distributed UDDI","authors":"Libing Wu, Yanxiang He, Dan Wu, Jianqun Cui","doi":"10.1109/NAS.2008.16","DOIUrl":"https://doi.org/10.1109/NAS.2008.16","url":null,"abstract":"UDDI acts a very important role in the web service. It can be used to publish and lookup services. Most of the current UDDI models are centralized so that the performance will decrease if there are too many services to be registered or queried. In this paper, an interoperable model of distributed UDDI is proposed. The model divides whole UDDI servers into there types: root server, super domain server and normal server. The simulation results show that the model can get better lookup performance.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116586749","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}
引用次数: 11
Hard Real-Time Communication over Multi-hop Switched Ethernet 基于多跳交换以太网的硬实时通信
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.31
Minghu Zhang, Jianguo Shi, Ting Zhang, Yang Hu
{"title":"Hard Real-Time Communication over Multi-hop Switched Ethernet","authors":"Minghu Zhang, Jianguo Shi, Ting Zhang, Yang Hu","doi":"10.1109/NAS.2008.31","DOIUrl":"https://doi.org/10.1109/NAS.2008.31","url":null,"abstract":"Currently, hard real-time communication over multi-hop switched Ethernet is still an open problem for researchers. In this paper, a novel hard real-time communication approach over multi-hop switched Ethernet is introduced without any modifications to existing Ethernet hardware. Firstly, the upper delay bounds are analyzed using the network calculus theories. Then the dual-level traffic smoothing technique is proposed, which combines the node-level traffic smoothing with the global-level traffic controlling techniques. Thorough measurements are made to demonstrate the hard real-time communication performance of this approach over multi-hop switched Ethernet.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117310749","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}
引用次数: 19
Enabling RDMA Capability of InfiniBand Network for Java Applications 为Java应用启用ib网络的RDMA功能
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.55
Wan Huang, Jizhong Han, Jin He, Lisheng Zhang, Yao Lin
{"title":"Enabling RDMA Capability of InfiniBand Network for Java Applications","authors":"Wan Huang, Jizhong Han, Jin He, Lisheng Zhang, Yao Lin","doi":"10.1109/NAS.2008.55","DOIUrl":"https://doi.org/10.1109/NAS.2008.55","url":null,"abstract":"In this paper, we propose a Java application interface on InfiniBand network, named Jdib, which provides a viable approach for Java applications to use RDMA semantics directly. Most functions in InfiniBand Verbs are implemented in Jdib, which provides the feasibility of building high-performance cluster applications in Java. Further, a JNIO-based mechanism is used to get rid of extra data copy between JVM buffers and OS buffers, and an optimized method is proposed for sharing data structures between Java code and native code. The experimental evaluation demonstrates performance improvements using Jdib.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123594008","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}
引用次数: 7
A Cluster Maintenance Algorithm Based on LEACH-DCHS Protoclol 一种基于LEACH-DCHS协议的集群维护算法
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.59
Yuhua Liu, Jingju Gao, Yongcan Jia, Longquan Zhu
{"title":"A Cluster Maintenance Algorithm Based on LEACH-DCHS Protoclol","authors":"Yuhua Liu, Jingju Gao, Yongcan Jia, Longquan Zhu","doi":"10.1109/NAS.2008.59","DOIUrl":"https://doi.org/10.1109/NAS.2008.59","url":null,"abstract":"LEACH-DCHS CM (LEACH-DCHS cluster maintenance) algorithm based on LEACH-DCHS algorithm is proposed in this paper. By prolonging the steady-state phase time and retaining the concept of round in the original algorithm, the new algorithm achieves the purpose of saving energy ultimately. Simulation results validate the energy efficiency of LEACH-DCHS CM algorithm.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478873","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}
引用次数: 27
Research on Trust Evaluation Model of Grid Services 网格服务信任评估模型研究
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.61
Xiaohua Dong, Zhongfu Wu
{"title":"Research on Trust Evaluation Model of Grid Services","authors":"Xiaohua Dong, Zhongfu Wu","doi":"10.1109/NAS.2008.61","DOIUrl":"https://doi.org/10.1109/NAS.2008.61","url":null,"abstract":"In an open grid of services architecture, to reflect service reliability is a major security problem. In this paper a trust evaluation model based on compensation is presented to enhance the reliability and credibility of grid services by evaluating the servicespsila trust value dynamically. For evaluating servicespsila trust, the trust model combines consumerspsila commendatory trust, services access frequency, servicepsilas own assigned trust and the decrease of the trust. Both theoretical analysis and emulation experiments show that the model can make the service providers and service demanders voluntarily discard the intention of cheating and other malicious behaviors, and then promote the creditability of services, simplify the calculating process and reduce the cost of communication. It is a creative solution for identifying reliability of grid services.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"24 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133204679","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}
引用次数: 3
Software Barrier Performance on Dual Quad-Core Opterons 双四核处理器的软件屏障性能
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.27
Jie Chen, W. Watson
{"title":"Software Barrier Performance on Dual Quad-Core Opterons","authors":"Jie Chen, W. Watson","doi":"10.1109/NAS.2008.27","DOIUrl":"https://doi.org/10.1109/NAS.2008.27","url":null,"abstract":"Multi-core processors based SMP servers have become building blocks for Linux clusters in recent years because they can deliver better performance for multi-threaded programs through on-chip multi-threading. However, a relative slow software barrier can hinder the performance of a data-parallel scientific application on a multi-core system. In this paper we study the performance of different software barrier algorithms on a server based on newly introduced AMD quad-core Opteron processors. We study how the memory architecture and the cache coherence protocol of the system influence the performance of barrier algorithms. We present an optimized barrier algorithm derived from the queue-based barrier algorithm. We find that the optimized barrier algorithm achieves speedup of 1.77 over the original queue-based algorithm. In addition, it has speedup of 2.39 over the software barrier generated by the Intel OpenMP compiler.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121396231","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
Characterization of Behavior Anomalies in a Representative File System 典型文件系统中行为异常的表征
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.29
Qiang Zou, D. Feng
{"title":"Characterization of Behavior Anomalies in a Representative File System","authors":"Qiang Zou, D. Feng","doi":"10.1109/NAS.2008.29","DOIUrl":"https://doi.org/10.1109/NAS.2008.29","url":null,"abstract":"As one of the workload characteristics, the anomaly behaviorsin real workload have been recognized as a critical requirement for file system design. In this paper, a set of traces collected from typically realistic file system have been analyzed. Studying the correlations of I/O request inter-arrival times shows that it is necessary to examine the self-similarity in file system workload. And then the phenomenon of self-similarity which had been initially observed in network and disk I/O workload has also been visually and statistically observed in file system workload used in this paper. Furthermore, this property is further explored and we find that the self-similarity of I/O accesses in those sets of traces studied in this paper is mainly due to reads. This study is extremely important to provide useful insight into the design and analysis of file system for performance gains, as well as to model file system I/O workloads.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123606585","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
Storage Aware Resource Allocation for Grid Data Streaming Pipelines 网格数据流管道的存储感知资源分配
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.24
Wen Zhang, Junwei Cao, Yisheng Zhong, Lianchen Liu, Cheng Wu
{"title":"Storage Aware Resource Allocation for Grid Data Streaming Pipelines","authors":"Wen Zhang, Junwei Cao, Yisheng Zhong, Lianchen Liu, Cheng Wu","doi":"10.1109/NAS.2008.24","DOIUrl":"https://doi.org/10.1109/NAS.2008.24","url":null,"abstract":"Data streaming applications, usually composed with sequential/parallel tasks in a data pipeline form, bring new challenges to task scheduling and resource allocation in grid environments. Due to high volumes of data and relatively limit storage capability, resource allocation and data streaming have to be storage aware. In this paper, genetic algorithm (GA) is adopted for task scheduling of pipelines, based on on-line measurement and prediction with gray model (GM). On-demand data streaming is introduced to avoid data overflow using repertory strategies. Experimental results show that balance among task executions with on-demand data streaming is required to improve overall performance, avoid system bottlenecks and backlogs of intermediate data, and increase data throughput of pipelines as a whole.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129602383","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 K-hop Based Clustering Algorithm in Ad Hoc Networks 一种基于K-hop的Ad Hoc网络聚类算法
2008 International Conference on Networking, Architecture, and Storage Pub Date : 2008-06-12 DOI: 10.1109/NAS.2008.15
Ge He, Shangbo Zhou, Shan Liu
{"title":"A K-hop Based Clustering Algorithm in Ad Hoc Networks","authors":"Ge He, Shangbo Zhou, Shan Liu","doi":"10.1109/NAS.2008.15","DOIUrl":"https://doi.org/10.1109/NAS.2008.15","url":null,"abstract":"In this paper, an improved k-hop cluster based algorithm in mobile ad-hoc networks (MANET) is proposed and its performance is analyzed. Experimental results show that the proposed clustering algorithm outperforms an existing algorithm.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129770865","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信