检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

12 篇 会议
2 篇 期刊文献
2 篇 学位论文

馆藏范围

16 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

14 篇 工学
- 14 篇 计算机科学与技术...
- 5 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程

主题

16 篇 distributed key-...
4 篇 load balancing
3 篇 linear hashing
3 篇 skip graph
3 篇 cloud computing
2 篇 replica placemen...
2 篇 nosql database
2 篇 dissertação
2 篇 persistent memor...
1 篇 proxy
1 篇 network function...
1 篇 network load bal...
1 篇 telco industry
1 篇 consistent hashi...
1 篇 distributed sdn ...
1 篇 memory managemen...
1 篇 fault tolerance
1 篇 data summarizati...
1 篇 stateless networ...
1 篇 resource managem...

机构

3 篇 univ fukui grad ...
2 篇 universidade de ...
1 篇 fudan univ sch c...
1 篇 univ chinese aca...
1 篇 iit dept comp sc...
1 篇 iit il 60616 usa
1 篇 budapest univ te...
1 篇 univ sci & techn...
1 篇 chinese acad sci...
1 篇 google mountain ...
1 篇 argonne natl lab...
1 篇 ericsson res bud...
1 篇 ntt network serv...
1 篇 kobe univ kobe h...
1 篇 research center ...
1 篇 chinese acad sci...
1 篇 intel santa clar...
1 篇 kyung hee univ d...
1 篇 hortonworks sant...
1 篇 nagoya inst tech...

作者

3 篇 higuchi ken
3 篇 tsuji tatsuo
2 篇 raicu ioan
2 篇 li tonglin
2 篇 zhou xiaobing
2 篇 zhao dongfang
2 篇 miyamoto naoyuki
2 篇 wang ke
2 篇 sadooghi iman
2 篇 yoshida makoto
1 篇 matsuo hiroshi
1 篇 saeki toshiaki
1 篇 xiong jin
1 篇 qiao kan
1 篇 sun shangyi
1 篇 wu jie
1 篇 kamoshita masana...
1 篇 zhang zhao
1 篇 yamane yasuo
1 篇 liu ruicheng

语言

16 篇 英文

检索条件"主题词=distributed key-value store"

共 16 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Correctness of the Routing Algorithm for distributed key-value store Based on Order Preserving Linear Hashing and Skip Graph 18

Correctness of the Routing Algorithm for Distributed Key-Val...

引用

18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/distributed Computing (SNPD)

作者： Higuchi, Ken Tsuji, Tatsuo Yoshida, Makoto Miyamoto, Naoyuki Univ Fukui Grad Sch Engn Fukui Japan

ISBN: (纸本)9781509055043

In this paper, the correctness of the routing algorithm for the distributed key-value store based on order preserving linear hashing and Skip Graph is proved. In this system, data are divided by linear hashing and Skip Graph is used for overlay network. The routing table of this system is very uniform. Then, short detours can exist in the route of forwarding. By using these detours, the number of hops for the query forwarding is reduced.

关键词： distributed key-value store Skip Graph linear hashing

来源：评论

学校读者我要写书评

暂无评论

SKV: A SmartNIC-Offloaded distributed key-value store

SKV: A SmartNIC-Offloaded Distributed Key-Value Store

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Sun, Shangyi Zhang, Rui Yan, Ming Wu, Jie Fudan Univ Sch Comp Sci Shanghai Peoples R China

ISBN: (数字)9781665498562

ISBN: (纸本)9781665498562

In data center networks, applications such as distributed key-value stores consume a lot of CPU resources. The performance of the entire system drops significantly under heavy load conditions. In order to improve the performance of key-value stores, many existing studies use RDMA (Remote Direct Memory Access) to reduce the communication overhead. However, RDMA primitives can only offload simple operations to the NIC, such as reading and writing remote memory. With the emergence of new hardware like SmartNICs, we consider whether we can offload more complex operations in distributed key-value stores to SmartNICs to reduce the load on CPU. In this paper we present SKV, a SmartNIC-offloaded distributed key-value store. In order to make full use of the offload ability of the SmartNIC, we make a detailed analysis on the characteristic and architecture of SmartNICs and distributed key-value stores. SKV offloads operations such as data replication to the SmartNIC. We design a new replication mechanism, which enables the server to separate background processing from the interaction with clients in the front. We implement SKV on the Mellanox BlueField SmartNIC. Our evaluations show that SKV improves the overall throughput by 14% and reduces latency by 21% compared with baseline.

关键词： SmartNIC distributed key-value store

来源：评论

学校读者我要写书评

暂无评论

Faststore: A High-Performance RDMA-enabled distributed key-value store with Persistent Memory 43

FastStore: A High-Performance RDMA-enabled Distributed Key-V...

引用

43rd IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Xiong, Ziwei Jiang, Dejun Xiong, Jin Chinese Acad Sci Inst Comp Technol State Key Lab Processors Beijing Peoples R China Chinese Acad Sci Inst Comp Technol Res Ctr Adv Comp Syst Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9798350339864

distributed persistent key-value store (KVS) plays an important role in today's storage infrastructure. The development of persistent memory (PM) and remote direct memory access (RDMA) allows to build distributed persistent KVS to provide fast data access. However, prior works focus on either PM-oriented or RDMA-oriented optimizations for key-value stores. We find these optimizations disallow a simple porting of RDMA-enabled KVS to PM or vice versa. This paper proposes Faststore, a high-performance distributed persistent KVS, by fully exploiting RDMA features and PM-friendly optimizations. First, Faststore utilizes RDMA-enabled PM exposure to establish direct indexing at the client side to reduce RTTs for reading values. Meanwhile, PM exposure allows PM sharing among cluster nodes, which helps to mitigate attribute-value skewness. Then, Faststore designs PM-friendly ownership transferring log and failure-atomic slotted-page allocator to achieve highly efficient PM management without PM leakage. Finally, Faststore proposes volatile search key to its B+tree indexing to reduce excessive PM accesses. We implement Faststore and the evaluation shows that Faststore outperforms the state-of-the-art ordered KVS Sherman by 2.8x higher throughput and 71.5% fewer RTTs.

关键词： distributed key-value store RDMA Persistent Memory

来源：评论

学校读者我要写书评

暂无评论

Design Considerations of A Novel distributed key-value store for New Storage 42

Design Considerations of A Novel Distributed Key-Value Store...

引用

42nd IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Liu, Ruicheng Jin, Peiquan Wang, Xiaoliang Luo, Yongping Chu, Zhaole Univ Sci & Technol China Hefei Peoples R China

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

The emergence of new storage like persistent memory (PM) and zoned namespaces SSDs (ZNS-SSDs) introduces new challenges and opportunities for distributed key-value stores. Since LSM-tree has been widely adopted in distributed key-value stores, such as RocksDB and HBase, it is necessary to revisit the LSM-tree to make it adapt to new storage. In this paper, we first analyze the challenges of adapting the LSM-tree for new storage. Then, we propose a high-level architecture for a new-storage-aware LSM-tree-based key-value store called Hybrid-LSM. We explain the key structural issues of different storage layers in Hybrid-LSM and present some preliminary design ideas.

关键词： distributed key-value store LSM-tree Persistent memory Zoned namespaces SSD New storage

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Routing Algorithms for distributed key-value store Based on Order Preserving Linear Hashing and Skip Graph 15

Performance Evaluation of Routing Algorithms for Distributed...

引用

15th IEEE/ACIS International Conference on Computer and Information Science (ICIS)

作者： Higuchi, Ken Yoshida, Makoto Miyamoto, Naoyuki Takehara, Kento Tsuji, Tatsuo Univ Fukui Grad Sch Engn Fukui Japan Univ Fukui Fac Engn Fukui Japan

ISBN: (纸本)9781509008056

In this paper, routing algorithms for the distributed key-value store based on order preserving linear hashing and Skip Graph are evaluated. In this system, data are divided by linear hashing and Skip Graph is used for overlay network. The routing table of this system is very uniform. Then, short detours can exist in the route of forwarding. In this paper, by comparison with an exact shortest route, it proved that the routing algorithm using detour is effective.

关键词： distributed key-value store Skip Graph linear hashing

来源：评论

学校读者我要写书评

暂无评论

Accurate Aggregation Query-Result Estimation and Its Efficient Processing on distributed key-value store 21st

Accurate Aggregation Query-Result Estimation and Its Efficie...

引用

21st International Conference on Big Data Analytics and Knowledge Discovery (DaWaK)

作者： Yuki, Kosuke keyaki, Atsushi Miyazaki, Jun Nakamura, Masahide Tokyo Inst Technol Sch Comp Tokyo Japan Kobe Univ Kobe Hyogo Japan

ISBN: (纸本)9783030275204;9783030275198

We propose four methods for improving the accuracy of aggregation query-result estimation using histograms and/or kernel density estimation and the efficiency of query processing on a distributed key-value store (D-KVS). Recently, aggregation queries have played a key role in analyzing a large amount of multidimensional data generated from sensors, Internet-of-Things devices, etc. A D-KVS is a platform to manage and process such large-scale multidimensional data. However, querying large-scale multidimensional data on a D-KVS sometimes requires a costly data scan owing to its insufficient support for indexes. Since aggregation-query results do not always need to be accurate, our four methods are not only for estimating accurate query results rather than obtaining accurate results by scanning all data, but also improving query-processing performance. We first propose two kernel density estimation-based methods. To further improve query-result estimation accuracy, we combined each of these two methods with a histogram-based scheme so that we can dynamically select an optimal estimation method based on the relationship between a query and the data distribution. We evaluated the efficiency and accuracy of the proposed methods by comparing them with a current method and showed that the proposed methods perform better.

关键词： Query-result estimation Data summarization Histogram kernel density estimation distributed key-value store

来源：评论

学校读者我要写书评

暂无评论

A Load Balancing Method for distributed key-value store Based on Order Preserving Linear Hashing and Skip Graph 20

A Load Balancing Method for Distributed Key-Value Store Base...

引用

20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/distributed Computing (SNPD 2019)

作者： Higuchi, Ken Murayama, Jin Tsuji, Tatsuo Univ Fukui Grad Sch Engn Fukui Japan Univ Fukui Fukui Japan

ISBN: (纸本)9781728116518

In this paper, a load balancing method for the distributed key-value store based on order preserving linear hashing and Skip Graph is proposed. In this system, data are divided by order preserving linear hashing and Skip Graph is used for overlay network. The routing table of this system is very uniform. Then, short detours can exist in the route of forwarding. By using these detours, the number of hops for the query forwarding is reduced. But since data is partitioned by linear hash, load balancing among nodes is difficult. In the proposed method, by dividing a physical node and a Skip Graph node, load balancing can be done. Furthermore, the maximum number of hops for message forwarding become smaller by this load balancing method.

关键词： distributed key-value store Skip Graph linear hashing load balancing

来源：评论

学校读者我要写书评

暂无评论

A Proxy-based Query Aggregation Method for distributed key-value stores 6

A Proxy-based Query Aggregation Method for Distributed Key-V...

引用

6th IEEE Int Conf on Future Internet of Things and Cloud (W-FiCloud) / 15th Int Conf on Mobile Web and Intelligent Information Systems (MobiWis) / 4th Int Conf on Big Data Innovations and Applications (Innovate-Data)

作者： Kawaname, Daichi Kamoshita, Masanari Kawashima, Ryota Matsuo, Hiroshi Nagoya Inst Technol Nagoya Aichi 4668555 Japan

ISBN: (纸本)9781538678107

distributed key-value stores (D-KVS) are critical backbone for SNS and cloud services. Some D-KVS are based on a ring architecture with multiple database nodes to handle large amount of data. Any of them can receive queries from clients, and the node forwards queries to an adequate node if necessary. Therefore, this architecture causes heavy overhead of packet processing for each node. Some D-KVS have adopted fast packet processing frameworks like DPDK, but this is not enough to handle huge amount of requests. We introduce a query aggregation method to D-KVS to reduce the network traffic. In our approach, client queries are aggregated into a few large-sized query packets by a centralized proxy. The proxy receives every query from the clients, and it routes aggregated queries to the destination nodes. The proxy is built on top of DPDK-based network stack and can deal with the growing of the clients by increasing the number of CPU cores for packet handling. We evaluated with the environment of three Cassandra nodes linked with 10 Gbps network. Our approach improved throughput by 19% compared with the non-proxy Cassandra.

关键词： distributed key-value store Aggregation Query Routing Proxy DPDK Many-core

来源：评论

学校读者我要写书评

暂无评论

引用

作者： Cavalcante, Denis Morais Universidade de Lisboa

distributed key-value stores (KVS) are a well-established approach for cloud data-intensive applications, but they were not designed to consider workloads with data access skew, mainly caused by popular data. In this work, we analyze the problem of replica placement on KVS for workloads with data access skew. We formally define our problem as a multi-objective optimization problem because not only load imbalance cost, but replica maintenance and reconfiguration costs affect system performance as well. To solve the replica placement problem, we present the PopRing replica placement component based on Genetic algorithms to find new replica placements efficiently. Next, we extend PopRing framework with a hyper-parameter optimization component based on Bayesian optimization in order to efficiently find the proper importance of load imbalance, replica maintenance, and reconfiguration objectives according to the system latency. To validate our PopRing engine in practice, we implemented a full prototype of PopRing to generate new replica placement schemes in the format of the distributed hash table (DHT) interface of the popular object store OpenStack-Swift. Then, in our lab environment, we deployed a distributed cluster of the OpenStack-Swift, a benchmark node and the PopRing prototype to run some experiments. From results evaluation, we verified that our solution was able to reduce system latency for different levels of data access skew without human intervention, i.e., PopRing auto-tuned its parameters to find a proper replica placement scheme to a given scenario.

关键词： distributed key-value store Replica placement Load balancing Genetic algorithm Bayesian optimization Dissertação

来源：评论

学校读者我要写书评

暂无评论

An adaptive replica placement approach for distributed key-value stores

An adaptive replica placement approach for distributed key-v...

引用

作者： Costa Filho, José Serafim da Universidade de Lisboa

The use of distributed key-value stores (KVS) has experienced fast adoption by various types of applications in recent years due to key advantages such as HTTP-based RESTful APIs, high availability and elasticity. Due to great scalability characteristics, KVS systems commonly use consistent hashing as data placement mechanism. Although KVS systems offer many advantages, they were not designed to dynamically adapt to changing workloads which often include data access skew. Furthermore, the underlying physical storage nodes may be heterogeneous and do not expose their performance capabilities to higher level data placement layers. In this dissertation, those issues are addressed and it is proposed an essential step towards a dynamic autonomous solution by leveraging deep reinforcement learning. A self-learning approach is designed which incrementally changes the placement of data replicas, improving the load balancing among storage nodes. The proposed approach is dynamic in the sense that is capable of avoiding hot spots, i.e. overloaded storage nodes when facing different workloads including uneven data popularity situations. Also, the solution developed is intended to be pluggable. It assumes no previous knowledge of the storage nodes capabilities, thus different KVS deployments may make use of it. The experiments show that the proposed strategy performs well on changing workloads including data access skew aspects. In addition, an evaluation of the proposed approach is done on scenarios when storage nodes heterogeneity changes. The results demonstrate that the proposed approach can adapt, building up on the knowledge about the storage node’s performance it has already acquired.

关键词： distributed key-value store Replica placement Load balancing Dissertação

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共2页 << < 1 2 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：