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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
158 篇 期刊文献
7 篇 学位论文

馆藏范围

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

日期分布

学科分类号

308 篇 工学
- 242 篇 计算机科学与技术...
- 160 篇 电气工程
- 97 篇 信息与通信工程
- 50 篇 软件工程
- 11 篇 电子科学与技术（可...
- 8 篇 仪器科学与技术
- 7 篇 交通运输工程
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 3 篇 网络空间安全
- 2 篇 安全科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
- 1 篇 航空宇航科学与技...
- 1 篇 核科学与技术
21 篇 理学
- 9 篇 数学
- 6 篇 化学
- 5 篇 物理学
- 4 篇 生物学
- 2 篇 系统科学
14 篇 管理学
- 14 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 心理学(可授教育学...

主题

326 篇 erasure coding
31 篇 reliability
29 篇 replication
27 篇 distributed stor...
26 篇 distributed stor...
22 篇 encoding
21 篇 fault tolerance
19 篇 redundancy
19 篇 cloud storage
13 篇 network coding
13 篇 distributed stor...
12 篇 cloud computing
10 篇 blockchain
9 篇 locally repairab...
9 篇 security
9 篇 storage
8 篇 bandwidth
8 篇 wireless sensor ...
7 篇 performance
7 篇 servers

机构

8 篇 tsinghua univ de...
7 篇 zhengzhou univ l...
7 篇 huazhong univ sc...
7 篇 chinese univ hon...
7 篇 huazhong univ sc...
6 篇 beijing informat...
6 篇 chinese univ hon...
5 篇 chuzhou univ sch...
5 篇 chinese acad sci...
5 篇 future univ hako...
4 篇 univ sci & techn...
4 篇 shanghai jiao to...
4 篇 huazhong univ sc...
4 篇 carnegie mellon ...
4 篇 chinese univ hon...
4 篇 pennstate univer...
3 篇 univ so calif de...
3 篇 chinese acad sci...
3 篇 microsoft res re...
3 篇 alibaba grp peop...

作者

19 篇 hu yuchong
16 篇 lee patrick p. c...
11 篇 feng dan
7 篇 song ying
7 篇 ardakani masoud
7 篇 jiang xiaohong
7 篇 wang bo
7 篇 xu yinlong
6 篇 shen zhirong
6 篇 arslan suayb s.
6 篇 khabbazian majid
6 篇 li jie
5 篇 yang bin
5 篇 wu chentao
5 篇 xu liangliang
5 篇 cadambe viveck r...
5 篇 zhang mi
5 篇 guo minyi
5 篇 shahabinejad mos...
5 篇 lyu min

语言

316 篇 英文
6 篇 其他
3 篇 中文
1 篇 土耳其文

检索条件"主题词=erasure coding"

共 326 条记录，以下是51-60 订阅

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

详细简洁

排序：

RE-Store: Reliable and Efficient KV-Store with erasure coding and Replication

RE-Store: Reliable and Efficient KV-Store with Erasure Codin...

引用

IEEE International Conference on Cluster Computing (IEEE CLUSTER)

作者： Li, Yuzhe Zhou, Jiang Wang, Weiping Chen, Yong Chinese Acad Sci Inst Informat Engn Beijing Peoples R China Texas Tech Univ Lubbock TX 79409 USA

ISBN: (纸本)9781728147345

In-memory key/value stores (KV-stores) are a key building block for numerous applications running on a cluster. As cluster scales have grown, efficiency and availability have become increasingly critical characteristics. Traditional replication provides redundancy, but is inefficient due to its high storage overhead. erasure coding can provide data reliability with significantly lower storage requirements, but is primarily used for long-term archival data due to the limitation of its write performance. Recent studies have attempted to combine these two techniques by using replication for frequently-updated metadata, and erasure coding for large, read-only data. In this study, we propose RE-Store, an in-memory key/value store system which utilizes a novel hybrid replication/erasure coding scheme to achieve both efficiency and reliability. RE-Store introduces replication into erasure coding by making one copy of each encoded datum and replacing partial parity with replicas for improved storage-efficiency. When failures occur, it uses these replicas to ensure data availability and thus avoids the inefficiencies of erasure coding during repair. RE-Store provides fault tolerance through fast, online recovery during different failure scenarios with little performance degradation. We have implemented RE-Store on a real key/value system and conducted extensive evaluations to validate its design and to study its performance, efficiency, and reliability. Experimental results show that RE-Store performs similarly to erasure coding and replication under normal operations while saving 18% to 34% of the memory used by replication when tolerating 2 to 4 failures.

关键词： KV-store erasure coding replication availability and reliability fault tolerance

来源：评论

学校读者我要写书评

暂无评论

EC-Fusion: An Efficient Hybrid erasure coding Framework to Improve Both Application and Recovery Performance in Cloud Storage Systems 34

EC-Fusion: An Efficient Hybrid Erasure Coding Framework to I...

引用

34th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Qiu, Han Wu, Chentao Li, Jie Guo, Minyi Liu, Tong He, Xubin Dong, Yuanyuan Zhao, Yafei Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA Alibaba Grp Hangzhou Peoples R China

ISBN: (数字)9781728168760

ISBN: (纸本)9781728168760

Nowadays erasure coding is one of the most significant techniques in cloud storage systems, which provides both quick parallel I/O processing and high capabilities of fault tolerance on massive data accesses. In these systems, triple disk failure tolerant arrays (3DFTs) is a typical configuration, which is supported by several classic erasure codes like Reed-Solomon (RS) codes, Local Reconstruction Codes (LRC), Minimum Storage Regeneration (MSR) codes, etc. For an online recovery process, the foreground application workloads and the background recovery workloads are handled simultaneously, which requires a comprehensive understanding on both two types of workload characteristics. Although several techniques have been proposed to accelerate the I/O requests of online recovery processes, they are typically unilateral due to the fact that the above two workloads are not combined together to achieve high cost-effective performance. To address this problem, we propose erasure Codes Fusion (EC-Fusion), an efficient hybrid erasure coding framework in cloud storage systems. EC-Fusion is a combination of RS and MSR codes, which dynamically selects the appropriate code based on its properties. On one hand, for write-intensive application workloads or low risk on data loss in recovery workloads, EC-Fusion uses RS code to decrease the computational overhead and storage cost concurrently. On the other hand, for read-intensive or frequent reconstruction in workloads, MSR code is a proper choice. Therefore, a better overall application and recovery performance can be achieved in a cost-effective fashion. To demonstrate the effectiveness of EC-Fusion, several experiments are conducted in hadoop systems. The results show that, compared with the traditional hybrid erasure coding techniques, EC-Fusion accelerates the response time for application by up to 1.77x, and reduces the reconstruction time by up to 69.10%.

关键词： erasure coding Storage Fusion High Reliability Reconstruction Storage Efficiency

来源：评论

学校读者我要写书评

暂无评论

Coupling Decentralized Key-Value Stores with erasure coding 10

Coupling Decentralized Key-Value Stores with Erasure Coding

引用

10th ACM Symposium on Cloud Computing (SoCC)

作者： Cheng, Liangfeng Hu, Yuchong Lee, Patrick P. C. Huazhong Univ Sci & Technol Wuhan Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450369732

Modern decentralized key-value stores often replicate and distribute data via consistent hashing for availability and scalability. Compared to replication, erasure coding is a promising redundancy approach that provides availability guarantees at much lower cost. However, when combined with consistent hashing, erasure coding incurs a lot of parity updates during scaling (i.e., adding or removing nodes) and cannot efficiently handle degraded reads caused by scaling. In this paper, we propose a novel erasure coding model called FragEC, which incurs no parity updates during scaling. We further extend consistent hashing with multiple hash rings to enable erasure coding to seamlessly address degraded reads during scaling. We realize our design as an in-memory key-value store called ECHash, and conduct testbed experiments on different scaling workloads in both local and cloud environments. We show that ECHash achieves better scaling performance (in terms of scaling throughput and degraded read latency during scaling) over the baseline erasure coding implementation, while maintaining high basic I/O and node repair performance.

关键词： erasure coding Key-value stores Scaling

来源：评论

学校读者我要写书评

暂无评论

Hardware and Software Co-Design of FPGA-based erasure coding Accelerator for Enterprise Storage 17

Hardware and Software Co-Design of FPGA-based Erasure Coding...

引用

17th International Conference on Networking, Architecture and Storage

作者： Zhang, Xueqing Meng, Xianwei Liu, Tao Li, Bole Sun, Bin Li, Hui Inspur Elect Informat Ind Co Ltd Beijing Peoples R China Inspur Elect Informat Ind Co Ltd Jinan Peoples R China

ISBN: (纸本)9798331520519;9798331520502

In distributed storage systems, erasure coding is a well-proven and effective fault-tolerant technique that is extensively employed. The escalating demands for storage performance from enterprise users have markedly intensified the bandwidth requirements associated with erasure coding. ARM-based CPUs exhibit limitations in their performance regarding erasure coding. The use of FPGA to offload erasure coding has been covered in earlier studies. However, FPGA-based offloading schemes for erasure coding is not suitable for every storage scenario. Both performance and cost become significant challenges. To address these challenges, we propose an FPGA-based storage system acceleration architecture that enables both high performance and low cost. By constructing an EC evaluation model, a quantitative analysis mechanism is used to determine the most useful scenario. We implement a co-designed prototype of hardware and software that consists of an FPGA for erasure coding offloading and a unique software acceleration layer installed in the IEIT storage cluster. It could increase throughput by up to 2.67 times.

关键词： erasure coding FPGA ARM EC scheduler

来源：评论

学校读者我要写书评

暂无评论

OpenCL-Based erasure coding on Heterogeneous Architectures 27

OpenCL-Based Erasure Coding on Heterogeneous Architectures

引用

27th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)

作者： Chen, Guoyang Zhou, Huiyang Shen, Xipeng Gahm, Josh Venkat, Narayan Booth, Skip Marshall, John North Carolina State Univ Raleigh NC 27695 USA Cisco Syst Res Triangle Pk NC 27709 USA

ISBN: (纸本)9781509015030

erasure coding, Reed-Solomon coding in particular, is a key technique to deal with failures in scale-out storage systems. However, due to the algorithmic complexity, the performance overhead of erasure coding can become a significant bottleneck in storage systems attempting to meet service level agreements (SLAs). Previous work has mainly leveraged SIMD (single-instruction multiple-data) instruction extensions in general purpose processors to improve the processing throughput. In this work, we exploit state-of-art heterogeneous architectures, including GPUs, APUs, and FPGAs, to accelerate erasure coding. We leverage the OpenCL framework for our target heterogeneous architectures and propose code optimizations for each target architecture. Given their different hardware characteristics, we highlight the different optimization strategies for each of the target architectures. Using the throughput metric as the ratio of the input file size over the processing latency, we achieve 2.84 GB/s on a 28-core Xeon CPU, 3.90 GB/s on an NVIDIA K40m GPU, 0.56 GB/s on an AMD Carrizo APU, and 1.19 GB/s (5.35 GB/s if only considering the kernel execution latency) on an Altera Stratix V FPGA, when processing a 836.9MB zipped file with a 30x33 encoding matrix. In comparison, the single-thread code using the Intel's ISA-L library running on the Xeon CPU has the throughput of 0.13 GB/s.

关键词： erasure coding heterogeneous architecture OpenCL GPU CPU APU FPGA

来源：评论

学校读者我要写书评

暂无评论

MEC: Network Optimized Multi-stage erasure coding for Scalable Storage Systems 22

MEC: Network Optimized Multi-stage Erasure Coding for Scalab...

引用

IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Akutsu, Hiroaki Yamamoto, Takahiro Ueda, Kazunori Saito, Hideo Hitachi Ltd Res & Dev Grp 292 Yoshida Cho Yokohama Kanagawa 2440817 Japan Waseda Univ Dept Comp Sci & Engn Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan Hitachi Amer Ltd IT Platform Syst Lab 3315 Scott Blvd4th Floor Santa Clara CA 95054 USA

ISBN: (纸本)9781509056521

In scalable storage systems, there are two kinds of methods for data redundancy: mirroring and parity. Each has its pros and cons. Mirroring creates a large amount of redundancy data, resulting in less usable space. Write performance degrades proportionally to the redundancy level due to an increase in communication. Parity-based methods partition data into multiple pieces, add parity information, and distribute the pieces of data and parity information. Parity-based methods are not often used with memory class media that are faster than the network, because distributing the data across servers results in low read performance. This research aims to establish an efficient data protection method that can be applied to fast, memory class media. We propose a new parity-based method called Multi-stage erasure coding (MEC), which creates two different erasure codes: one at the data transmission source server, and the other at the destination server. We show that our method reduces the space required to achieve redundancy while achieving high performance by making the amount of write communication independent of the redundancy level. We built a prototype program using MEC on a commodity cluster server. We show that compared with conventional parity-based methods with redundancy level 2, read I/O throughput is over one order of magnitude higher thanks to local reads and that write I/O throughput is almost the same due to network bottleneck.

关键词： erasure coding storage systems high performance computing rebuild scalablility

来源：评论

学校读者我要写书评

暂无评论

Have a Seat on the erasureBench: Easy Evaluation of erasure coding Libraries for Distributed Storage Systems 35

Have a Seat on the ErasureBench: Easy Evaluation of Erasure ...

引用

IEEE 35th International Symposium on Reliable Distributed Systems Workshops (SRDSW)

作者： Vaucher, Sebastien Mercier, Hugues Schiavoni, Valerio Univ Neuchatel CH-2000 Neuchatel Switzerland

ISBN: (纸本)9781509052592

We present erasureBench, an open-source framework to test and benchmark erasure coding implementations for distributed storage systems under realistic conditions. erasureBench automatically instantiates and scales a cluster of storage nodes, and can seamlessly leverage existing failure traces. As a first example, we use erasureBench to compare three coding implementations: a (10, 4) Reed-Solomon (RS) code, a (10, 6, 5) locally repairable code (LRC), and a partition of the data source in ten pieces without error-correction. Our experiments show that LRC and RS codes require the same repair throughput when used with small storage nodes, since cluster and network management traffic dominate at this regime. With large storage nodes, read and write traffic increases and our experiments confirm the theoretical and practical tradeoffs between the storage overhead and repair bandwidth of RS and LRC codes.

关键词： Distributed storage erasure coding erasurebench Locally-repairalable codes

来源：评论

学校读者我要写书评

暂无评论

REC²: Restoration Method Using Combination of Replication and erasure coding 5

REC<SUP>2</SUP>: Restoration Method Using Combination of Rep...

引用

5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)

作者： Kamei, Hitoshi Matsumoto, Shinya Nakamura, Takaki Muraoka, Hiroaki Hitachi Ltd Res & Dev Grp Yokohama Kanagawa Japan Elect Commun Res Inst Sendai Miyagi Japan

ISBN: (纸本)9781467389853

When large-scale disasters occur, such as the Great East Earthquake Japan occurred in March 2011, servers located in the affected area are sometimes disrupted. If the servers has important information, such as medical information, it is crucial to restore the servers because the information is utilized by medical activities. Therefore, the servers must be restored as soon as possible. We propose a restoration method using the combination of replication method and erasure coding method, called REstoration method using Combination of Replication and erasure coding (REC2.) REC2 applies the replication method to the meta data of a file, and it also applies the erasure coding method to the user-data of the file. The combination achieves the both the high restoration throughput with the amount of the backup data reduced. In this paper, we describe the implementation details of REC2 and evaluation results. In the evaluation, we compare REC2 with the conventional restoration method about the amount of backup data and the restoration throughput. From the results, we found out that REC2 provides higher restoration throughput than the conventional restoration method while REC2 reduces the amount of backup data.

关键词： Restoration method Replication erasure coding

来源：评论

学校读者我要写书评

暂无评论

An In-network Aggregation Scheme for erasure coding Storage Systems in Data Centers 6

An In-network Aggregation Scheme for Erasure Coding Storage ...

引用

6th International Conference on Advanced Cloud and BigData (CBD)

作者： Xia, Junxu Yao, Chendie Li, Jiangfan Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781538680346

In the erasure coding storage system, when a storage node fails, it is necessary to extract data blocks from other remaining storage nodes to a new node and repair. This would lead to the incast problem at the new node. Up to now, the incast problem during the repair process has been solved relying on the path planning and resource allocation. Although these solutions improve the performance at some extent, they are still very resource-consuming. In this work, we show that the incast problem can be resolved economically via the in-network aggregation. Specifically, we assume that switches in data centers have certain data processing capabilities and can aggregate data flows. Taking the fat-tree data center as an example, we propose a set of in-network repair methods for erasure coding storage systems. The incast problem caused by repairing data blocks is solved naturally during the data transmission. Compared with prior methods, our approach not only avoids the overhead of extra path computing, but also significantly reduces the link cost of repairing data blocks while ensuring similar or faster repair speed.

关键词： Data center erasure coding Fat-tree In-network aggregation Distributed storage

来源：评论

学校读者我要写书评

暂无评论

Distributed Fault Tolerant Linear System Solvers based on erasure coding 37

Distributed Fault Tolerant Linear System Solvers based on Er...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Kang, Xuejiao Gleich, David F. Sameh, Ahmed Grama, Ananth Purdue Univ West Lafaytte Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781538617915

We present efficient coding schemes and distributed implementations of erasure coded linear system solvers. erasure coded computations belong to the class of algorithmic fault tolerance schemes. They are based on augmenting an input dataset, executing the algorithm on the augmented dataset, and in the event of a fault, recovering the solution from the corresponding augmented solution. This process can be viewed as the computational analog of erasure coded storage schemes. The proposed technique has a number of important benefits: (i) as the hardware platform scales in size and number of faults, our scheme yields increasing improvement in resource utilization, compared to traditional schemes;(ii) the proposed scheme is easy to code the core algorithms remain the same;and (iii) the general scheme is flexible accommodating a range of computation and communication tradeoffs. We present new coding schemes for augmenting the input matrix that satisfy the recovery equations of erasure coding with high probability in the event of random failures. These coding schemes also minimize fill (non-zero elements introduced by the coding block), while being amenable to efficient partitioning across processing nodes. We demonstrate experimentally that our scheme adds minimal overhead for fault tolerance, yields excellent parallel efficiency and scalability, and is robust to different fault arrival models.

关键词： Fault Tolerance erasure coding Linear System Solvers Kruskal rank

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：