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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

3 篇 工学
- 3 篇 计算机科学与技术...
- 1 篇 软件工程

主题

4 篇 nonblocking algo...
1 篇 parallel algorit...
1 篇 performance
1 篇 parallel process...
1 篇 languages
1 篇 dual data struct...
1 篇 memory managemen...
1 篇 obstruction free...
1 篇 fine-grained con...
1 篇 algorithms
1 篇 partial methods
1 篇 compositional co...
1 篇 design
1 篇 monads
1 篇 verification
1 篇 data structures
1 篇 computer algorit...
1 篇 synchronization
1 篇 arrows
1 篇 concurrent conta...

机构

1 篇 northeastern uni...
1 篇 victoria univers...
1 篇 univ rochester d...
1 篇 univ rochester c...

作者

2 篇 izraelevitz jose...
2 篇 scott michael l.
1 篇 graichen matthew
1 篇 turon aaron
1 篇 doherty simon

语言

4 篇 英文

检索条件"主题词=nonblocking algorithms"

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

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

详细简洁

排序：

An Unbounded nonblocking Double-ended Queue 45

An Unbounded Nonblocking Double-ended Queue

引用

45th International Conference on Parallel Processing (ICPP)

作者： Graichen, Matthew Izraelevitz, Joseph Scott, Michael L. Univ Rochester Dept Comp Sci Rochester NY 14627 USA

ISBN: (纸本)9781509028238

We introduce a new algorithm for an unbounded concurrent double-ended queue (deque). Like the bounded deque of Herlihy, Luchangco, and Moir on which it is based, the new algorithm is simple and obstruction free, has no pathological long-latency scenarios, avoids interference between operations at opposite ends, and requires no special hardware support beyond the usual compare-and-swap. To the best of our knowledge, no prior concurrent deque combines these properties with unbounded capacity, or provides consistently better performance across a wide range of concurrent workloads.

关键词： parallel processing parallel algorithms nonblocking algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: A Generic Construction for nonblocking Dual Containers 14

Brief Announcement: A Generic Construction for Nonblocking D...

引用

ACM Symposium on Principles of Distributed Computing (PODC)

作者： Izraelevitz, Joseph Scott, Michael L. Univ Rochester Comp Sci Dept Rochester NY 14627 USA

ISBN: (纸本)9781450329446

A dual container has the property that when it is empty, the remove method will insert an explicit reservation ("antidata") into the container, rather than returning an error flag. This convention gives the container explicit control over the order in which pending requests will be satisfied once data becomes available. The dual pattern also allows the method's caller to spin on a thread-local flag, avoiding memory contention. In this paper we introduce a new nonblocking construction that allows any nonblocking container for data to be paired with almost any nonblocking container for antidata. This construction provides a composite ordering discipline-e.g., it can satisfy pending pops from a stack in FIFO order, or satisfy pending dequeues in order of thread priority.

关键词： nonblocking algorithms obstruction freedom partial methods synchronization concurrent containers dual data structures

来源：评论

学校读者我要写书评

暂无评论

The Design and Verification of Dynamic-sized nonblocking Data Structures

The Design and Verification of Dynamic-sized Nonblocking Dat...

引用

作者： Doherty, Simon Victoria University of Wellington

学位级别：doctor

Modern computer systems often involve multiple processes or threads of control that communicatethrough shared memory. However, the implementation of correct and efficient datastructures that can be shared by several processes is frequently challenging. This thesis is concerned with the design and verification of a class of shared memory algorithms known as nonblocking algorithms, which are implementations of shared data structures that provide strong progress guarantees. nonblocking algorithms offer an appealing alternative to traditional techniques for the implementation of shared memory data structures, but they are difficult to design, and extant algorithms can often be applied in only a limited range of systems. Furthermore, because of their subtlety, it is notoriously difficult to determine whether a given nonblocking algorithm is correct. This thesis addresses these difficulties in two ways. First, we present techniques for theverification of nonblocking algorithms that dynamically allocate memory. These techniquesallow the construction of formal and complete proofs of correctness, so that each proof maybe checked by a mechanical proof assistant. Applying techniques first developed for theverification of distributed algorithms, we use labelled-transition systems to model algorithmsand their specifications, and simulation relations to prove that an implementation meets itsspecification. nonblocking algorithms often require a particular notion of simulation, calledbackward simulation, that is rarely necessary in other contexts. This thesis contributes to therelatively limited collective experience in the use of backward simulation. The second set of contributions addresses the limitations of many extant nonblocking algorithms. While many nonblocking algorithms allocate memory dynamically, it is difficult to determine in a nonblocking context when it is safe to free memory. We present techniques to accomplish this. Furthermore, many nonblocking algorithms depend

关键词： Computer algorithms Verification Memory management nonblocking algorithms Data structures

来源：评论

学校读者我要写书评

暂无评论

Reagents: Expressing and Composing Fine-grained Concurrency 12

Reagents: Expressing and Composing Fine-grained Concurrency

引用

33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Turon, Aaron Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781450312059

Efficient communication and synchronization is crucial for fine-grained parallelism. Libraries providing such features, while indispensable, are difficult to write, and often cannot be tailored or composed to meet the needs of specific users. We introduce reagents, a set of combinators for concisely expressing concurrency algorithms. Reagents scale as well as their hand-coded counterparts, while providing the composability existing libraries lack.

关键词： Design algorithms Languages Performance fine-grained concurrency nonblocking algorithms monads arrows compositional concurrency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：