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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

119 篇 会议
51 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

161 篇 工学
- 132 篇 计算机科学与技术...
- 75 篇 软件工程
- 27 篇 电气工程
- 8 篇 信息与通信工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
17 篇 理学
- 16 篇 数学
- 1 篇 物理学
- 1 篇 化学
1 篇 农学
- 1 篇 作物学
- 1 篇 农业资源与环境

主题

173 篇 concurrent data ...
23 篇 lock-free
22 篇 linearizability
18 篇 synchronization
12 篇 lock-freedom
12 篇 non-blocking
10 篇 performance
10 篇 algorithms
9 篇 concurrency
8 篇 memory managemen...
8 篇 hazard pointers
7 篇 non-volatile mem...
6 篇 parallel algorit...
6 篇 memory reclamati...
6 篇 verification
6 篇 wait-freedom
6 篇 transactional me...
5 篇 fifo queue
5 篇 trees
5 篇 theory

机构

12 篇 technion haifa
7 篇 ist austria klos...
6 篇 univ waterloo wa...
6 篇 lehigh univ beth...
6 篇 brown univ provi...
5 篇 univ crete dept ...
4 篇 technion israel ...
4 篇 tel aviv univ sc...
4 篇 carnegie mellon ...
3 篇 oracle labs burl...
3 篇 forth ics irakli...
3 篇 swiss fed inst t...
3 篇 inria rocquencou...
3 篇 natl tech univ a...
3 篇 koc univ istanbu...
3 篇 univ penn philad...
2 篇 univ toronto on
2 篇 uppsala univ upp...
2 篇 nyu ny 10003 usa
2 篇 univ chinese aca...

作者

17 篇 petrank erez
10 篇 brown trevor
10 篇 alistarh dan
8 篇 herlihy maurice
7 篇 hassan ahmed
7 篇 fatourou panagio...
6 篇 cohen nachshon
6 篇 tsigas philippas
6 篇 kogan alex
5 篇 spear michael
5 篇 alapati praveen
5 篇 palmieri roberto
5 篇 shavit nir
4 篇 mutyam madhu
4 篇 friedman michal
4 篇 kallimanis nikol...
3 篇 koziris nectario...
3 篇 nikas konstantin...
3 篇 blelloch guy e.
3 篇 sagonas konstant...

语言

164 篇 英文
8 篇 其他
1 篇 德文

检索条件"主题词=Concurrent Data Structures"

共 173 条记录，以下是101-110 订阅

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

详细简洁

排序：

Contention Adapting Search Trees 14

Contention Adapting Search Trees

引用

IEEE 14th International Symposium on Parallel and Distributed Computing (ISPDC)

作者： Sagonas, Konstantinos Winblad, Kjell Uppsala Univ Dept Informat Technol Uppsala Sweden Natl Tech Univ Athens Sch ECE GR-10682 Athens Greece

ISBN: (纸本)9781467371483

With multicores being ubiquitous, concurrent data structures are becoming increasingly important. This paper proposes a novel approach to concurrent data structure design where the data structure collects statistics about contention and adapts dynamically according to this statistics. We use this approach to create a contention adapting binary search tree (CA tree) that can be used to implement concurrent ordered sets and maps. Our experimental evaluation shows that CA trees scale similar to recently proposed algorithms on a big multicore machine on various scenarios with a larger set size, and outperform the same data structures in more contended scenarios and in sequential performance. We also show that CA trees are well suited for optimization with hardware lock elision. In short, we propose a practically useful and easy to implement and show correct concurrent search tree that naturally adapts to the level of contention.

关键词： concurrent data structures multicore search trees

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Lock-free Learned Search data Structure 24

Brief Announcement: Lock-free Learned Search Data Structure

引用

36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Bhardwaj, Gaurav Chatterjee, Bapi Sharma, Abhinav Peri, Sathya Nayak, Siddharth IIT Hyderabad Hyderabad India IIIT Delhi Delhi India

ISBN: (纸本)9798400704161

This paper introduces a lock-free linearizable search structure that supports concurrent updates, membership, and range queries accelerated by a shallow hierarchy of lightweight machine learning (ML) models. The proposed approach significantly outperforms the current state-of-the-art lock-free data structures in many workload and data distribution settings.

关键词： lock-free concurrent data structures learned index non-blocking

来源：评论

学校读者我要写书评

暂无评论

FliT: A Library for Simple and Efficient Persistent Algorithms 22

FliT: A Library for Simple and Efficient Persistent Algorith...

引用

27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Wei, Yuanhao Ben-David, Naama Friedman, Michal Blelloch, Guy E. Petrank, Erez Carnegie Mellon Univ Pittsburgh PA USA VMware Res Palo Alto CA USA Techn Haifa Israel

ISBN: (纸本)9781450392044

Non-volatile random access memory (NVRAM) offers byte-addressable persistence at speeds comparable to DRAM. However, with caches remaining volatile, automatic cache evictions can reorder updates to memory, potentially leaving persistent memory in an inconsistent state upon a system crash. Flush and fence instructions can be used to force ordering among updates, but are expensive. This has motivated significant work studying how to write correct and efficient persistent programs for NVRAM. In this paper, we present FliT, a C++ library that facilitates writing efficient persistent code. Using the library's default mode makes any linearizable data structure durable with minimal changes to the code. FliT avoids many redundant flush instructions by using a novel algorithm to track dirty cache lines. It also allows for extra optimizations, but achieves good performance even in its default setting. To describe the FliT library's capabilities and guarantees, we define a persistent programming interface, called the P-V Interface, which FliT implements. The P-V Interface captures the expected behavior of code in which some instructions' effects are persisted and some are not. We show that the interface captures the desired semantics of many practical algorithms in the literature. We apply the FliT library to four different persistent data structures, and show that across several workloads, persistence implementations, and data structure sizes, the FliT library always improves operation throughput, by at least 2.1x over a naive implementation in all but one workload.

关键词： Non-volatile Memory concurrent data structures Recoverability

来源：评论

学校读者我要写书评

暂无评论

Practical Hardware Transactional vEB Trees 24

Practical Hardware Transactional vEB Trees

引用

29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Khalaji, Mohammad Brown, Trevor Daudjee, Khuzaima Aksenov, Vitaly Univ Waterloo Waterloo ON Canada City Univ London London England

ISBN: (纸本)9798400704352

van Emde Boas (vEB) trees are sequential data structures optimized for extremely fast predecessor and successor queries. Such queries are an important incentive to use ordered sets or maps such as vEB trees. All operations in a vEB tree are doubly logarithmic in the universe size. Attempts to implement concurrent vEB trees have either simplified their structure in a way that eliminated their ability to perform fast predecessor and successor queries, or have otherwise compromised on doubly logarithmic complexity. In this work, we leverage Hardware Transactional Memory (HTM) to implement vEB tree-based sets and maps in which operations are doubly logarithmic in the absence of contention. Our proposed concurrent vEB tree is the first to implement recursive summaries, the key algorithmic component of fast predecessor and successor operations. Through extensive experiments, we demonstrate that our algorithm outperforms state-of-theart concurrent maps by an average of 5x in a moderately skewed workload, and the single-threaded C++ standard ordered map and its unordered map by 70% and 14%, respectively. And, it does so while using two orders of magnitude less memory than traditional vEB trees.

关键词： concurrent data structures vEB Trees van Emde Boas Trees Transactional Memory Lock Elision

来源：评论

学校读者我要写书评

暂无评论

Using Skip Graphs for Increased NUMA Locality 32

Using Skip Graphs for Increased NUMA Locality

引用

32nd IEEE International Symposium on Computer Architecture and High-Performance Computing (SBAC-PAD) / 11th Workshop on Applications for Multi-Core Architectures (WAMCA)

作者： Thomas, Samuel Hayne, Roxana Pulaj, Jonad Mendes, Hammurabi Davidson Coll Math & Comp Sci Davidson NC 28036 USA

ISBN: (纸本)9781728199245

High-performance simulations and parallel frameworks often rely on highly scalable, concurrent data structures for system scalability. With an increased availability of NUMA architectures, we present a technique to promote NUMA-aware data parallelism inside a concurrent data structure, bringing significant quantitative and qualitative improvements on NUMA locality, as well as reduced contention for synchronized memory accesses. Our architecture is based on a data-partitioned, concurrent skip graph indexed by thread -local sequential maps. We implemented maps and relaxed priority queues using such technique. Maps show up to 6x higher CAS locality, up to a 68.6% reduction on the number of remote CAS operations, and an increase from 88.3% to 99% on the CAS success rate compared to a control implementation (subject to the same optimizations, and implementation practices). Remote memory accesses are not only reduced in number, but the larger the NUMA distance between threads, the larger the reduction is. Relaxed priority queues implemented using our technique show similar scalability improvements, with provable reduction in contention and decrease in relaxation in one of our implementations.

关键词： NUMA concurrent data structures skip graphs locality

来源：评论

学校读者我要写书评

暂无评论

Detectable Recovery of Lock-Free data structures 22

Detectable Recovery of Lock-Free Data Structures

引用

27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Attiya, Hagit Ben-Baruch, Ohad Fatourou, Panagiota Hendler, Danny Kosmas, Eleftherios Technion Haifa Israel Ben Gurion Univ Negev Beer Sheva Israel Univ Paris LIPADE F-75006 Paris France FORTH Iraklion Greece Univ Crete Iraklion Greece Univ Crete Dept Comp Sci Iraklion Greece

ISBN: (纸本)9781450392044

This paper presents a generic approach for deriving detectably recoverable implementations of many widely-used concurrent data structures. Such implementations are appealing for emerging systems featuring byte-addressable non-volatile main memory (NVMM), whose persistence allows to efficiently resurrect failed threads after crashes. Detectable recovery ensures that after a crash, every executed operation is able to recover and return a correct response, and that the state of the data structure is not corrupted. Our approach, called Tracking, amends descriptor objects used in existing lock-free helping schemes with additional fields that track an operation's progress towards completion and persists these fields in order to ensure detectable recovery. Tracking avoids full-fledged logging and tracks the progress of concurrent operations in a per-thread manner, thus reducing the cost of ensuring detectable recovery. We have applied Tracking to derive detectably recoverable implementations of a linked list, a binary search tree, and an exchanger. Our experimental analysis introduces a new way of analyzing the cost of persistence instructions, not by simply counting them but by separating them into categories based on the impact they have on the performance. The analysis reveals that understanding the actual persistence cost of an algorithm in machines with real NVMM, is more complicated than previously thought, and requires a thorough evaluation, since the impact of different persistence instructions on performance may greatly vary. We consider this analysis to be one of the major contributions of the paper.

关键词： non-volatile memory NVM-based computing persistence recoverable algorithms and data structures concurrent data structures linked-list tree exchanger synchronization lock-freedom persistence cost analysis

来源：评论

学校读者我要写书评

暂无评论

A Scalable Linearizable Multi-Index Table 38

A Scalable Linearizable Multi-Index Table

引用

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

作者： Sheffi, Gali Golan-Gueta, Guy Petrank, Erez Oath Yahoo Res Haifa Israel VMWare Res Herzliyya Israel Technion Haifa Israel

ISBN: (纸本)9781538668719

concurrent data structures typically index data using a single primary key and provide fast atomic access to data associated with a given key value. However, it is often required to atomically access information via multiple primary and secondary keys, and even through additional properties that do not naturally represent keys for the given data. We present lock-free and lock-based algorithms of a table with multiple indexing, supporting linearizable inserts, deletes, and retrieve operations. We have implemented Java versions of our algorithms and evaluated their performance on a multi-core machine. The results show that the proposed table implementations are scalable and more efficient than any existing available alternative for in-memory realizations of a multi-index table.

关键词： Parallel Algorithms concurrent data structures Progress Guarantees Lock-Freedom

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Linearizability: A Typo 21

Brief Announcement: Linearizability: A Typo

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Sela, Gal Herlihy, Maurice Petrank, Erez Technion Haifa Israel Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781450385480

Linearizability [4] is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions as correct if operations on shared objects appear to take effect instantaneously during the operation execution time. This paper calls attention to a somewhat-neglected aspect of linearizability: restrictions on how pending invocations are handled, an issue that has become increasingly important for software running on systems with non-volatile main memory. Interestingly, the original published definition of linearizability includes a typo (a symbol is missing a prime) that concerns exactly this issue. In this paper we point out the typo and provide an amendment to make the definition complete. We believe that pointing this typo out rigorously and proposing a fix is important and timely.

关键词： Linearizability Correctness Verification concurrent Algorithms concurrent data structures

来源：评论

学校读者我要写书评

暂无评论

Transactional Interference-Less Balanced Tree 29th

Transactional Interference-Less Balanced Tree

引用

29th International Symposium on Distributed Computing (DISC)

作者： Hassan, Ahmed Palmieri, Roberto Ravindran, Binoy Virginia Tech Blacksburg VA USA

ISBN: (纸本)9783662486535;9783662486528

In this paper, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree's operations are: providing a traversal phase that does not use any lock and/or speculation, and deferring the lock acquisition or physical modification to the transaction's commit phase;isolating the structural operations (such as re-balancing) in an interference-less housekeeping thread;and minimizing the interference between structural operations and the critical path of semantic operations (i.e., additions and removals on the tree). We evaluated TxCF-Tree against the state-of-the-art general methodologies for designing transactional trees and we show that TxCF-Tree's design pays off in most of workloads.

关键词： Balanced trees Transactional memory Semantic synchronization concurrent data structures

来源：评论

学校读者我要写书评

暂无评论

Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global data structures 2015

Fast, Multicore-Scalable, Low-Fragmentation Memory Allocatio...

引用

ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)

作者： Aigner, Martin Kirsch, Christoph M. Lippautz, Michael Sokolova, Ana Salzburg Univ A-5020 Salzburg Austria

ISBN: (纸本)9781450336895

We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For this purpose, we have designed and implemented scalloc, a concurrent allocator that generally performs and scales in our experiments better than other allocators while using less memory, and is still competitive otherwise. The main ideas behind the design of scalloc are: uniform treatment of small and big objects through so-called virtual spans, efficiently and effectively reclaiming free memory through fast and scalable global data structures, and constant-time (modulo synchronization) allocation and deallocation operations that trade off memory reuse and spatial locality without being subject to false sharing.

关键词： Memory allocator virtual memory concurrent data structures multicore scalability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：