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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是91-100 订阅

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

详细简洁

排序：

Model checking unbounded concurrent lists

Model checking unbounded concurrent lists

引用

20th International SPIN Symposium on Model Checking of Software

作者： Sethi, Divjyot Talupur, Muralidhar Malik, Sharad Princeton Univ Princeton NJ 08544 USA Intel Corp Strateg CAD Labs Hillsboro OR 97124 USA

ISBN: (纸本)9783642391750

We present a model checking-based method for verifying list-based concurrent set data structures. concurrent data structures are notorious for being hard to get right and thus, their verification has received significant attention from the verification community. These data structures are unbounded in two dimensions: the list size is unbounded and an unbounded number of threads access them. Thus, their model checking requires abstraction to a model bounded in both the dimensions. We first show how the unbounded number of threads can be model checked by reduction to a finite model, while assuming a bounded number of list nodes. In particular, we leverage the CMP (CoMPositional) method which abstracts the unbounded threads by keeping one thread as is (concrete) and abstracting all the other threads to a single environment thread. Next, the method proceeds as a series of iterations where in each iteration the abstraction is model checked and, if a spurious counterexample is observed, refined. This is accomplished by the user by inspecting the returned counterexamples. If the user determines the returned counterexample to be spurious, she adds constraints to the abstraction in the form of lemmas to refine it. Upon addition, these lemmas are also verified for correctness as part of the CMP method. Thus, since these lemmas are verified as well, we show how some of the lemmas required for refinement of this abstract model can be mined automatically using an assertion mining tool, Daikon. Next, we show how the CMP method approach can be extended to the list dimension as well, to fully verify the data structures in both the dimensions. While it is possible to show correctness of these data structures for an unbounded number of threads by keeping one concrete thread and abstracting others, this is not directly possible in the list dimension as the nodes pointed to by the threads change during list traversal. Our method addresses this challenge by constructing an abstraction f

关键词： Model checking Linearizability concurrent data structures Compositional reasoning Abstractions

来源：评论

学校读者我要写书评

暂无评论

RCU-HTM: Combining RCU with HTM to Implement Highly Efficient concurrent Binary Search Trees 26

RCU-HTM: Combining RCU with HTM to Implement Highly Efficien...

引用

26th International Conference on Parallel Architectures and Compilation Techniques (PACT)

作者： Siakavaras, Dimitrios Nikas, Konstantinos Goumas, Georgios Koziris, Nectarios Natl Tech Univ Athens Sch Elect & Comp Engn Comp Syst Lab Athens Greece

ISBN: (纸本)9781509067640

In this paper we introduce RCU-HTM, a technique that combines Read-Copy-Update (RCU) with Hardware Transactional Memory (HTM) to implement highly efficient concurrent Binary Search Trees (BSTs). Similarly to RCU-based algorithms, we perform the modifications of the tree structure in private copies of the affected parts of the tree rather than in-place. This allows threads that traverse the tree to proceed without any synchronization and without being affected by concurrent modifications. The novelty of RCU-HTM lies at leveraging HTM to permit multiple updating threads to execute concurrently. After appropriately modifying the private copy, we execute an HTM transaction, which atomically validates that all the affected parts of the tree have remained unchanged since they've been read and, only if this validation is successful, installs the copy in the tree structure. We apply RCU-HTM on AVL and Red-Black balanced BSTs and compare their performance to state-of-the-art lock-based, non-blocking, RCU-and HTM-based BSTs. Our experimental evaluation reveals that BSTs implemented with RCU-HTM achieve high performance, not only for read-only operations, but also for update operations. More specifically, our evaluation includes a diverse range of tree sizes and operation workloads and reveals that BSTs based on RCU-HTM outperform other alternatives by more than 18%, on average, on a multi-core server with 44 hardware threads.

关键词： concurrent data structures Binary Search Trees HTM RCU

来源：评论

学校读者我要写书评

暂无评论

CAA: A concurrent AA Tree via Logical ordering 23

CAA: A Concurrent AA Tree via Logical ordering

引用

23rd International Symposium on Parallel and Distributed Computing (ISPDC)

作者： Attinagaramu, Kapil Kumar Alapati, Praveen Mahindra Univ Ecole Cent Sch Engn Super Comp Lab Comp Sci Engn Dept Hyderabad India

ISBN: (纸本)9798350369205;9798350369199

Efficient implementation of concurrent data structures is crucial for ensuring safe and efficient access to data in shared-memory environments. Maintaining height balance within these concurrent structures in a multi-core setting is vital to prevent performance degradation or structural imbalances. Self-balancing trees play a key role in achieving consistent performance across various workloads, ensuring operations have logarithmic time complexity. This paper presents a concurrent implementation of the AA Tree using logical ordering, employing lazy synchronization to harmonize threads that perform concurrent operations on the shared AA tree. The paper discusses concurrent algorithm design for basic operations (insert(), remove(), and contains()) on the AA tree. We extensively analyze the CAA tree's performance compared to state-of-the-art implementations across various workloads. Our CAA Tree implementation scales well with the number of threads and achieves an average speedup of 46.4x over the sequential implementation when using 96 threads. Compared to concurrent implementations of AVL trees [2], Red-Black trees [3], Treaps [4], and Contention Adapting Search trees trees [5], the speedup is 2.1x, 1.6x, 1.6x, and 1.1x, respectively.

关键词： concurrent data structures synchronization shared memory concurrent self balancing trees

来源：评论

学校读者我要写书评

暂无评论

A Contention-Friendly Binary Search Tree

A Contention-Friendly Binary Search Tree

引用

19th International Conference on Euro-Par

作者： Crain, Tyler Gramoli, Vincent Raynal, Michel Univ Rennes 1 IRISA F-35014 Rennes France Univ Sydney NICTA Sydney NSW Australia Inst Univ France Paris France

ISBN: (纸本)9783642400476

This paper proposes a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. This methodology limits the high contention induced by today's multicore environments to come up with efficient alternatives to the most widely used search structures. data structures are generally constrained to guarantee a big-oh step complexity even in the presence of concurrency. By contrast our methodology guarantees the big-oh complexity only in the absence of contention and limits the contention when concurrency appears. The key concept lies in dividing update operations within an eager abstract access that returns rapidly for efficiency reason and a lazy structural adaptation that may be postponed to diminish contention. Our evaluation clearly shows that our lock-based tree is up to 2.2x faster than the most recent lock-based tree algorithm we are aware of.

关键词： Binary tree concurrent data structures Efficient implementation

来源：评论

学校读者我要写书评

暂无评论

Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs 23

Releasing Memory with Optimistic Access: A Hybrid Approach t...

引用

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

作者： Moreno, Pedro Rocha, Ricardo Univ Porto CRACS INESC TEC Rua Campo Alegre S-N P-4169007 Porto Portugal Univ Porto Fac Sci Dept Comp Sci Rua Campo Alegre S-N P-4169007 Porto Portugal

ISBN: (纸本)9781450395458

Lock-free data structures are an important tool for the development of concurrent programs as they provide scalability, low latency and avoid deadlocks, livelocks and priority inversion. However, they require some sort of additional support to guarantee memory reclamation. The Optimistic Access (OA) method has most of the desired properties for memory reclamation, but since it allows memory to be accessed after being reclaimed, it is incompatible with the traditional memory management model. This renders it unable to release memory to the memory allocator/operating system, and, as such, it requires a complex memory recycling mechanism. In this paper, we extend the lock-free general purpose memory allocator LRMalloc to support the OA method. By doing so, we are able to simplify the memory reclamation method implementation and also allow memory to be reused by other parts of the same process. We further exploit the virtual memory system provided by the operating system and hardware in order to make it possible to release reclaimed memory to the operating system.

关键词： concurrent data structures Memory Reclamation Lock-freedom Optimistic Access Hazard Pointers

来源：评论

学校读者我要写书评

暂无评论

A scalable unified model for dynamic data structures in message passing (clusters) and shared memory (multicore CPUs) computing environments 18

A scalable unified model for dynamic data structures in mess...

引用

18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Laccetti, Giuliano Lapegna, Marco Montella, Raffaele Univ Napoli Federico II Dept Math & Applicat Naples Italy Univ Napoli Parthenope Dept Sci & Technol Naples Italy

ISBN: (纸本)9781538658154

concurrent data structures are widely used in many software stack levels, ranging from high level parallel scientific applications to low level operating systems. The key issue of these objects is their concurrent use by several computing units (threads or process) so that the design of these structures is much more difficult compared to their sequential counterpart, because of their extremely dynamic nature requiring protocols to ensure data consistency, with a significant cost overhead. At this regard, several studies emphasize a tension between the needs of sequential correctness of the concurrent data structures and scalability of the algorithms, and in many cases it is evident the need to rethink the data structure design, using approaches based on randomization and/or redistribution techniques in order to fully exploit the computational power of the recent computing environments. The problem is grown in importance with the new generation High Performance Computing systems aimed to achieve extreme performance. It is easy to observe that such systems are based on heterogeneous architectures integrating several independent nodes in the form of clusters or MPP systems, where each node is composed by powerful computing elements (CPU core, GPUs or other acceleration devices) sharing resources in a single node. These systems therefore make massive use of communication libraries to exchange data among the nodes, as well as other tools for the management of the shared resources inside a single node. For such a reason, the development of algorithms and scientific software for dynamic data structures on these heterogeneous systems implies a suitable combination of several methodologies and tools to deal with the different kinds of parallelism corresponding to each specific device, so that to be aware of the underlying platform. The present work is aimed to introduce a scalable model to manage a special class of dynamic data structure known as heap based priority queue (o

关键词： HPC heterogeneous systems concurrent data structures programming models

来源：评论

学校读者我要写书评

暂无评论

Kanva: A Lock-free Learned Search data Structure 24

Kanva: A Lock-free Learned Search Data Structure

引用

53rd International Conference on Parallel Processing (ICPP)

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

ISBN: (纸本)9798400717932

Lock-free concurrent data structures offer throughput with scalability and guarantees for the completion of operations on multicore computers. Recently, queries using machine learning models trained to predict the data distribution have gained remarkable attention. Yet, to our knowledge, no existing lock-free data structure employs them. This paper introduces a lock-free search structure that supports concurrent updates, membership, and range queries accelerated by a shallow hierarchy of lightweight machine learning models. The proposed approach significantly outperforms the current state-of-the-art lock-free data structures in many workload and data distribution settings. Ours is the first provably linearizable learned lock-free concurrent range search index.

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

来源：评论

学校读者我要写书评

暂无评论

Practical concurrent Self-organizing Lists 23

Practical Concurrent Self-organizing Lists

引用

23rd IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Fu, Jing Zhang, Kunlong Tianjin Univ Sch Comp Sci & Technol Tianjin Peoples R China

ISBN: (纸本)9781538621295

Lists are one of the most fundamental and ubiquitous data structures. A self-organizing list can adjust the structure according to the request sequence to improve average access time. However, it is a challenge to obtain a practical concurrent self-organizing linked-list with lock-free property, which guarantees that some operation finishes when any thread executes a finite number of steps. This paper implements a novel lock-free self-organizing list whose items are moved to the front when being requested. The implementation uses a new log method and a new help mechanism. The log consists of operation nodes which record the execution history. Friend chains are formed during list traversal to help related operations. This paper also introduces a speed-up variation which is more pragmatic. Furthermore, this paper presents a comprehensive evaluation in experiments on non-uniform data set. Experiments demonstrate the advantages of the new linked-lists among other algorithms in throughput and scalability. On requests derived from real workloads, it achieves 22% to 184% speedup than the existing concurrent lists.

关键词： concurrent data structures nonblocking linearizability lock-freedom self-organizing lists

来源：评论

学校读者我要写书评

暂无评论

Pure: Evolving Message Passing To Better Leverage Shared Memory Within Nodes 24

Pure: Evolving Message Passing To Better Leverage Shared Mem...

引用

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

作者： Psota, James Solar-Lezama, Armando MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9798400704352

Pure is a new programming model and runtime system explicitly designed to take advantage of shared memory within nodes in the context of a mostly message passing interface enhanced with the ability to use tasks to make use of idle cores. Pure leverages shared memory in two ways: (a) by allowing cores to steal work from each other while waiting on messages to arrive, and, (b) by leveraging *** lock-free data structures in shared memory to achieve highperformance messaging and collective operations between the ranks within nodes. We use microbenchmarks to evaluate Pure's key messaging and collective features and also show application speedups up to 2.1 Chi on the CoMD molecular dynamics and the miniAMR adaptive mesh *** applications scaling up to 4,096 cores.

关键词： parallel programming models distributed runtime systems task-based parallelism concurrent data structures lock-free data structures

来源：评论

学校读者我要写书评

暂无评论

The Baskets Queue

The Baskets Queue

引用

11th International Conference on Principles of Distributed Systems

作者： Hoffman, Moshe Shalev, Ori Shavit, Nir Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Sun Microsyst Labs Menlo Pk CA USA

ISBN: (纸本)9783540770954

FIFO Queues have over the years been the subject of significant research. Such queues are used as buffers both in a variety of applications, and in recent years as a key tool in buffering data in high speed communication networks. Overall, the most popular dynamic-memory lock-free FIFO queue algorithm in the literature remains the MS-queue algorithm of Michael and Scott. Unfortunately, this algorithm, as well as many others, offers no more parallelism than that provided by allowing concurrent accesses to the head and tail. In this paper we present the Baskets Queue - a new, highly concurrent lock-free linearizable dynamic memory FIFO queue. The Baskets Queue introduces a new form of parallelism among enqueue operations that creates baskets of mixed-order items instead of the standard totally ordered list. The operations in different baskets can be executed in parallel. Surprisingly however, the end result is a linearizable FIFO queue, and in fact, we show that a basket queue based on the MS-queue outperforms the original MS-queue algorithm in various benchmarks.

关键词： CAS compare and swap concurrent data structures FIFO queue lock-free non-blocking synchronization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：