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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

FatCBST: concurrent Binary Search Tree with Fatnodes 19

FatCBST: Concurrent Binary Search Tree with Fatnodes

引用

19th IEEE International Conference on High Performance Computing and Communications (HPCC) / 15th IEEE International Conference on Smart City (SmartCity) / 3rd IEEE International Conference on data Science and Systems (DSS)

作者： Alapati, Praveen Tavva, Venkata Kalyan Mutyam, Madhu Indian Inst Technol Madras Dept Comp Sci & Engn Madras 600036 Tamil Nadu India IBM India Pvt Ltd STG Labs Bengaluru India

ISBN: (纸本)9781538625880

Effective design of concurrent tree implementation plays a major role in improving the scalability of applications in a multicore environment. We introduce a concurrent binary search tree with fatnodes (FatCBST) and present algorithms to perform basic operations on it. Unlike a simple node with single value, a fatnode consists of a set of values. FatCBST concept allows a thread to perform update operations on an existing fatnode without changing the tree structure, making it less disruptive to other threads' operations. Fatnodes help to take advantage of the spatial locality in the cache hierarchy and also reduce the height of the concurrent binary search tree. Our FatCBST implementation allows multiple threads to perform update operations on the same existing fatnode at the same time. Experimental results show that the FatCBST implementations that have small fatnode sizes provide better throughput for high and medium contention workloads;and large fatnode sizes provide better throughput for low contention workloads, as compared to the current state-of-the-art implementations.

关键词： concurrent data structures trees concurrent binary search trees

来源：评论

学校读者我要写书评

暂无评论

On Building Modular and Elastic data structures with Bulk Operations 21

On Building Modular and Elastic Data Structures with Bulk Op...

引用

22nd International Conference on Distributed Computing and Networking (ICDCN)

作者： Williams, Kevin Foster, Joe Srivirote, Athicha Hassan, Ahmed Tassarotti, Joseph Tseng, Lewis Palmieri, Roberto Lehigh Univ Bethlehem PA 18015 USA Boston Coll Chestnut Hill MA 02167 USA

This paper introduces MEDS, a modular and elastic framework that simplifies the development of high-performance concurrent data structures that support linearizable primitive (i.e., add, remove, contains) and bulk (e.... 详细信息

ISBN: (纸本)9781450389334

关键词： concurrent data structures Concurrency Range Queries

来源：评论

学校读者我要写书评

暂无评论

Hardware Transactional Memory Optimization Guidelines, Applied to Ordered Maps 14

Hardware Transactional Memory Optimization Guidelines, Appli...

引用

13th IEEE International Symposium on Parallel and Distributed Processing with Applications

作者： Bonnichsen, Lars F. Probst, Christian W. Karlsson, Sven Tech Univ Denmark Lyngby Denmark

ISBN: (纸本)9781467379526

Synchronization of concurrent data structures is difficult to get right. Fine-grained synchronization locks small data chunks, but requires too high an overhead per chunk;traditional coarse-grained synchronization locks big data chunks, and thereby makes them unavailable to other threads. Neither synchronization method scales well. Recently, hardware transactional memory was introduced, which allows threads to use transactions instead of locks. So far, applying hardware transactional memory has shown mixed results. We believe this is because transactions are different from locks, and using them efficiently requires reasoning about those differences. In this paper we present 5 guidelines for applying hardware transactional memory efficiently, and apply the guidelines to BT-trees, a concurrent ordered map. Evaluating BT-trees on standard benchmarks shows that they are up to 5.3 times faster than traditional maps using hardware transactional memory, and up to 3.9 times faster than state of the art concurrent ordered maps.

关键词： concurrent data structures Dictionary Hardware Transactional Memory Map

来源：评论

学校读者我要写书评

暂无评论

A Wait-free Queue with Polylogarithmic Step Complexity 23

A Wait-free Queue with Polylogarithmic Step Complexity

引用

42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Naderibeni, Hossein Ruppert, Eric York Univ Toronto ON Canada

ISBN: (纸本)9798400701214

We present a novel linearizable wait-free queue implementation using single-word CAS instructions. Previous lock-free queue implementations from CAS all have amortized step complexity of Omega(p) per operation in worst-case executions, where p is the number of processes that access the queue. Our new wait-free queue takes O(log p) steps per enqueue and O (log(2) p + log q) steps per dequeue, where.. is the size of the queue. A bounded-space version of the implementation has O (log p log(p +q)) amortized step complexity per operation.

关键词： concurrent data structures wait-free queues

来源：评论

学校读者我要写书评

暂无评论

Checking Linearizability Using Hitting Families 19

Checking Linearizability Using Hitting Families

引用

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

作者： Ozkan, Burcu Kulahcioglu Majumdar, Rupak Niksic, Filip MPI SWS Kaiserslautern Germany Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450362252

Linearizability is a key correctness property for concurrent data types. Linearizability requires that the behavior of concurrently invoked operations of the data type be equivalent to the behavior in an execution where each operation takes effect at an instantaneous point of time between its invocation and return. Given an execution trace of operations, the problem of verifying its linearizability is NP-complete, and current exhaustive search tools scale poorly. In this work, we empirically show that linearizability of an execution trace is often witnessed by a schedule that orders only a small number of operations (the "linearizability depth") in a specific way, independently of other operations. Accordingly, one can structure the search for linearizability witnesses by exploring schedules of low linearizability depth first. We provide such an algorithm. Key to our algorithm is a procedure to generate a strong d-hitting family of schedules, which is guaranteed to cover all linearizability witnesses of depth d. A strong d-hitting family of schedules of an execution trace consists of a set of schedules, such that for each tuple of d operations in the trace, there is a schedule in the family that (i) executes these operations in the order they appear in the tuple, and (ii) as late as possible in the execution. We show that most linearizable execution traces from existing benchmarks can be witnessed by strongly d-hitting schedules for d <= 5. Our result suggests a practical and automated method for showing linearizability of a trace based on a prioritization of schedules parameterized by the linearizability depth.

关键词： linearizability concurrent data structures scheduling hitting families

来源：评论

学校读者我要写书评

暂无评论

Adaptive Lock-Free Maps: Purely-Functional to Scalable 2015

Adaptive Lock-Free Maps: Purely-Functional to Scalable

引用

20th ACM SIGPLAN International Conference on Functional Programming (ICFP)

作者： Newton, Ryan R. Fogg, Peter P. Varamesh, Ali Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450336697

Purely functional data structures stored inside a mutable variable provide an excellent concurrent data structure-obviously correct, cheap to create, and supporting snapshots. They are not, however, scalable. We provide a way to retain the benefits of these pure-in-a-box data structures while dynamically converting to a more scalable lock-free data structure under contention. Our solution scales to any pair of pure and lock-free container types with key/value set semantics, while retaining lock-freedom. We demonstrate the principle in action on two very different platforms: first in the Glasgow Haskell Compiler and second in Java. To this end we extend GHC to support lock-free data structures and introduce a new approach for safe CAS in a lazy language.

关键词： Languages Performance Lock-free algorithms concurrent data structures

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Hyaline: Fast and Transparent Lock-Free Memory Reclamation 38

Brief Announcement: Hyaline: Fast and Transparent Lock-Free ...

引用

38th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Nikolaev, Ruslan Ravindran, Binoy Virginia Tech Blacksburg VA 24061 USA

ISBN: (纸本)9781450362177

We present a new lock-free safe memory reclamation algorithm, Hyaline, which is fast, scalable, and transparent to the underlying data structures. Hyaline easily handles virtually unbounded number of threads that can be created and deleted dynamically, while retaining O(1) reclamation cost. We also extend Hyaline to avoid situations where stalled threads prevent others from reclaiming newly allocated objects, a common problem with epoch-based reclamation. Our evaluation reveals that Hyaline's throughput is high - it steadily outperformed other reclamation schemes by > 10% in one test and yielded even higher gains in oversubscribed scenarios.

关键词： lock-free memory reclamation concurrent data structures

来源：评论

学校读者我要写书评

暂无评论

Efficient Memory Management for Lock-Free data structures with Optimistic Access 15

Efficient Memory Management for Lock-Free Data Structures wi...

引用

27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Cohen, Nachshon Petrank, Erez Technion Israel Inst Technol Haifa Israel

ISBN: (纸本)9781450335881

Lock-free data structures achieve high responsiveness, aid scalability, and avoid deadlocks and livelocks. But providing memory management support for such data structures without foiling their progress guarantees is difficult. Often, designers employ the hazard pointers technique, which may impose a high performance overhead. In this work we propose a novel memory management scheme for lock-free data structures called optimistic access. This scheme provides efficient support for lock-free data structures that can be presented in the normalized form of [24]. Our novel memory manager breaks the traditional memory management invariant which never lets a program touch reclaimed memory. In other words, it allows the memory manager to reclaim objects that may still be accessed later by concurrently running threads. This broken invariant provides an opportunity to obtain high parallelism with excellent performance, but it also requires a careful design. The optimistic access memory management scheme is easy to employ and we implemented it for a linked list, a hash table, and a skip list. Measurements show that it dramatically outperforms known memory reclamation methods.

关键词： Memory Management concurrent data structures Non-blocking Lock-free Hazard Pointers

来源：评论

学校读者我要写书评

暂无评论

Mindicators: A Scalable Approach to Quiescence

Mindicators: A Scalable Approach to Quiescence

引用

33rd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Liu, Yujie Luchangco, Victor Spear, Michael Lehigh Univ Bethlehem PA 18015 USA Oracle Labs Redwood City 94065 CA USA

ISBN: (纸本)9780769550008

We introduce the Mindicator, a new shared object that is optimized for querying the minimum value of a set of values proposed by several processes. A mindicator may hold at most one value per process. This interface is designed for use in shared memory runtime systems, such as garbage collectors, software transactional memory (TM), and operating system kernels. We introduce linearizable and relaxed mindicator implementations, both of which are lock-free. Our algorithms employ a tree structure, where querying the minimum element takes constant time, and adding and removing elements from the set does not hinder scalability. In microbenchmarks and a synthetic TM workload, we show that both provide good scalability on the x86 and SPARC platforms.

关键词： concurrent data structures synchronization lock-freedom linearizability

来源：评论

学校读者我要写书评

暂无评论

Modeling Energy Consumption of Lock-Free Queue Implementations 29

Modeling Energy Consumption of Lock-Free Queue Implementatio...

引用

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

作者： Atalar, Aras Gidenstam, Anders Renaud-Goud, Paul Tsigas, Philippas Chalmers Univ Technol S-41258 Gothenburg Sweden Univ Boras S-50190 Boras Sweden

ISBN: (纸本)9781479986484

This paper considers the problem of modeling the energy behavior of lock-free concurrent queue data structures. Our main contribution is a way to model the energy behavior of lock-free queue implementations and parallel applications that use them. Focusing on steady state behavior we decompose energy behavior into throughput and power dissipation which can be modeled separately and later recombined into several useful metrics, such as energy per operation. Based on our models, instantiated from synthetic benchmark data, and using only a small amount of additional application specific information, energy and throughput predictions can be made for parallel applications that use the respective data structure implementation. To model throughput we propose a generic model for lock-free queue throughput behavior, based on a combination of the dequeuers' throughput and enqueuers' throughput. To model power dissipation we commonly split the contributions from the various computer components into static, activation and dynamic parts, where only the dynamic part depends on the actual instructions being executed. To instantiate the models a synthetic benchmark explores each queue implementation over the dimensions of processor frequency and number of threads. Finally, we show how to make predictions of application throughput and power dissipation for a parallel application using a lock-free queue requiring only a limited amount of information about the application work done between queue operations. Our case study on a Mandelbrot application shows convincing prediction results.

关键词： lock-free analysis modeling energy power throughput queue concurrent data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：