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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

236 篇 期刊文献
147 篇 会议
11 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

352 篇 工学
- 303 篇 计算机科学与技术...
- 170 篇 软件工程
- 90 篇 电气工程
- 14 篇 控制科学与工程
- 13 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 材料科学与工程（可...
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
26 篇 理学
- 21 篇 数学
- 5 篇 物理学
- 1 篇 化学
13 篇 管理学
- 12 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
11 篇 教育学
- 11 篇 教育学
3 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...

主题

396 篇 concurrent progr...
26 篇 parallel program...
23 篇 synchronization
19 篇 transactional me...
16 篇 distributed prog...
14 篇 parallel process...
11 篇 threads
11 篇 verification
10 篇 java
10 篇 semantics
9 篇 message passing
9 篇 petri nets
9 篇 functional progr...
9 篇 programming lang...
8 篇 reliability
8 篇 software transac...
7 篇 performance
7 篇 actors
7 篇 mutual exclusion
7 篇 distributed syst...

机构

6 篇 purdue univ dept...
5 篇 digital equipmen...
5 篇 univ calif davis...
4 篇 univ calif santa...
3 篇 microsoft corp r...
3 篇 george mason uni...
3 篇 univ cambridge c...
3 篇 ecole polytech f...
3 篇 tula state univ ...
3 篇 kth royal inst t...
2 篇 swiss fed inst t...
2 篇 salzburg univ de...
2 篇 georgia inst tec...
2 篇 univ glasgow dep...
2 篇 univ fed pelotas...
2 篇 hebei univ sci &...
2 篇 virtuslab smolen...
2 篇 univ lisbon ines...
2 篇 univ porto fac s...
2 篇 inst super tecn ...

作者

8 篇 lamport l
7 篇 olsson ra
5 篇 gehani nh
5 篇 haller philipp
5 篇 jagannathan sure...
4 篇 ricci alessandro
4 篇 nanz sebastian
4 篇 silva josep
4 篇 ziarek lukasz
4 篇 meyer bertrand
4 篇 tamarit salvador
4 篇 hansen pb
3 篇 oliver j.
3 篇 abadi m
3 篇 silva j.
3 篇 ivutin alexey n.
3 篇 llorens marisa
3 篇 raynal michel
3 篇 morandi benjamin
3 篇 troshina anna g.

语言

363 篇 英文
30 篇 其他
2 篇 中文
1 篇 西班牙文

检索条件"主题词=Concurrent Programming"

共 396 条记录，以下是291-300 订阅

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

详细简洁

排序：

The Theory of Deadlock Avoidance via Discrete Control 09

The Theory of Deadlock Avoidance via Discrete Control

引用

36th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： Wang, Yin Lafortune, Stephane Kelly, Terence Kudlur, Manjunath Mahlke, Scott Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781605583792

Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This paper presents a theoretical foundation for dynamic deadlock avoidance in concurrent programs that employ conventional mutual exclusion and synchronization primitives (e. g., multithreaded C/Pthreads programs). Beginning with control flow graphs extracted from program source code, we construct a formal model of the program and then apply Discrete Control Theory to automatically synthesize deadlock-avoidance control logic that is implemented by program instrumentation. At run time, the control logic avoids deadlocks by postponing lock acquisitions. Discrete Control Theory guarantees that the program instrumented with our synthesized control logic cannot deadlock. Our method furthermore guarantees that the control logic is maximally permissive: it postpones lock acquisitions only when necessary to prevent deadlocks, and therefore permits maximal run-time concurrency. Our prototype for C/Pthreads scales to real software including Apache, OpenLDAP, and two kinds of benchmarks, automatically avoiding both injected and naturally occurring deadlocks while imposing modest runtime overheads.

关键词： Algorithms Languages Theory Verification Dynamic Deadlock Avoidance Discrete Control Theory concurrent programming Parallel programming Multithreaded programming Multicore Processors

来源：评论

学校读者我要写书评

暂无评论

Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures 27

Practical Progress Verification of Descriptor-Based Non-Bloc...

引用

IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Peterson, Christina Cook, Victor Dechev, Damian Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9781728149516;9781728149509

The difficulty of designing non-blocking data structures has motivated techniques to verify that progress will always be made. Existing lock-free verification techniques assume that the ability of a thread to exit a CompareAndSwap-based loop implies lock-freedom. Wait-free verification techniques prove wait-freedom by showing that all loops terminate in a fixed number of iterations despite interference from other threads. Previous progress verification techniques do not accommodate loops whose termination is dependent on complex behaviors of the interfering threads, making these approaches unsuitable. We overcome these challenges by presenting the first progress verification technique for non-blocking algorithms that are dependent on descriptor-based helping mechanisms. Many practical lock-free data structures, wait-free data structures, and algorithms to facilitate non-blocking programming all incorporate descriptor objects to ensure that an operation comprising multiple atomic steps is completed according to the progress guarantee. We define algorithms for the communication through descriptor objects with interfering threads and define a loop invariant specification to prove progress of descriptor-based non-blocking data structures. To verify that all loops in a non-blocking data structure terminate according to the specification, we implement a practical framework that enables the semi-automatic verification of concurrent programs written in the C programming language. We demonstrate the application of our methodology on practical non-blocking data structures including a lock-free transactional list and a wait-free queue.

关键词： formal verification concurrent programming progress guarantees

来源：评论

学校读者我要写书评

暂无评论

A Modular Approach to Model-Based Testing of concurrent Programs

A Modular Approach to Model-Based Testing of Concurrent Prog...

引用

International Conference on Multicore Software Engineering, Performance, and Tools (MUSEPAT)

作者： Carver, Richard Lei, Yu George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

ISBN: (纸本)9783642399541;9783642399558

This paper presents a modular approach to testing concurrent programs that are modeled using labeled transition systems. Correctness is defined in terms of an implementation relation that is expected to hold between a model of the system and its implementation. The novelty of our approach is that the correctness of a concurrent software system is determined by testing the individual threads separately, without testing the system as a whole. We define a modular implementation relation on individual threads and show that modular relations can be tested separately in order to verify a (non-modular) implementation relation for the complete system. Empirical results indicate that our approach can significantly reduce the number of test sequences that are generated and executed during model-based testing.

关键词： concurrent programming Model-Based Testing

来源：评论

学校读者我要写书评

暂无评论

Optimizing Threshold for Extreme Scale Analysis

Optimizing Threshold for Extreme Scale Analysis

引用

SPIE Conference on Visualization and Data Analysis (VDA)

作者： Maynard, Robert Moreland, Kenneth Ayachit, Utkarsh Geveci, Berk Ma, Kwan-Liu Kitware Inc. (United States) Sandia National Labs. (United States) Univ. of California Davis (United States)

ISBN: (纸本)9780819494276

As the HPC community starts focusing its efforts towards exascale, it becomes clear that we are looking at machines with a billion way concurrency. Although parallel computing has been at the core of the performance gains achieved until now, scaling over 1,000 times the current concurrency can be challenging. As discussed in this paper, even the smallest memory access and synchronization overheads can cause major bottlenecks at this scale. As we develop new software and adapt existing algorithms for exascale, we need to be cognizant of such pitfalls. In this paper, we document our experience with optimizing a fairly common and parallelizable visualization algorithm, threshold of cells based on scalar values, for such highly concurrent architectures. Our experiments help us identify design patterns that can be generalized for other visualization algorithms as well. We discuss our implementation within the Dax toolkit, which is a framework for data analysis and visualization at extreme scale. The Dax toolkit employs the patterns discussed here within the framework's scaffolding to make it easier for algorithm developers to write algorithms without having to worry about such scaling issues.

关键词： Software programming Techniques concurrent programming

来源：评论

学校读者我要写书评

暂无评论

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List 18

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based ...

引用

18th International Conference on Principles of Distributed Systems (OPODIS)

作者： Nhan Nguyen Tsigas, Philippas Sundell, Hakan Chalmers Univ Technol S-41296 Gothenburg Sweden Univ Boras Boras Sweden

ISBN: (纸本)9783319144726;9783319144719

Mark-split is a garbage collection algorithm that combines advantages of both the mark-sweep and the copying collection algorithms. In this paper, we present a parallel mark-split garbage collector (GC). Our parallel design introduces and makes use of an efficient concurrency control mechanism for handling the list of free memory intervals. This mechanism is based on a lock-free skip-list design which supports an extended set of operations. Beside basic operations, it can perform a composite one that can search and remove and also insert two elements atomically. We have implemented the parallel mark-split GC in OpenJDK's HotSpot virtual machine. We experimentally evaluate our collector and compare it with the default concurrent mark-sweep GC in HotSpot, using the DaCapo benchmarks, on two contemporary multiprocessor systems;one has 12 Intel Nehalem cores with HyperThreading and the other has 48 AMD Bulldozer cores. The evaluation shows that our parallel mark-split keeps the characteristics of the sequential mark-split, that it performs better than the concurrent mark-sweep in applications that have low live/garbage ratio, and have live objects locating contiguously, therefore being marked consecutively. Our parallel mark-split performs significantly better than a trivial parallelization based on locks in terms of both collection time and scalability.

关键词： garbage collector concurrent programming mark-split mark-sweep parallel garbage collection lock-free data structures

来源：评论

学校读者我要写书评

暂无评论

Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution

Spores: A Type-Based Foundation for Closures in the Age of C...

引用

28th European Conference on Object-Oriented programming (ECOOP)

作者： Miller, Heather Haller, Philipp Odersky, Martin Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9783662442029;9783662442012

Functional programming (FP) is regularly touted as the way forward for bringing parallel, concurrent, and distributed programming to the mainstream. The popularity of the rationale behind this viewpoint has even led to a number of object-oriented (OO) programming languages outside the Smalltalk tradition adopting functional features such as lambdas and thereby function closures. However, despite this established viewpoint of FP as an enabler, reliably distributing function closures over a network, or using them in concurrent environments nonetheless remains a challenge across FP and OO languages. This paper takes a step towards more principled distributed and concurrent programming by introducing a new closure-like abstraction and type system, called spores, that can guarantee closures to be serializable, thread-safe, or even have custom user-defined properties. Crucially, our system is based on the principle of encoding type information corresponding to captured variables in the type of a spore. We prove our type system sound, implement our approach for Scala, evaluate its practicality through a small empirical study, and show the power of these guarantees through a case analysis of real-world distributed and concurrent frameworks that this safe foundation for closures facilitates.

关键词： closures functions distributed programming concurrent programming type systems

来源：评论

学校读者我要写书评

暂无评论

Actor Model of a New Functional Language - Anemone 12th

Actor Model of a New Functional Language - Anemone

引用

12th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Batko, Pawel Kuta, Marcin VirtusLab Smolensk 21-15 PL-31108 Krakow Poland AGH Univ Sci & Technol Dept Comp Sci Al Mickiewicza 30 PL-059 Krakow Poland

This paper describes actor system of a new functional language called Anemone and compares it with actor systems of Scala and Erlang. Implementation details of the actor system are described. Performance evaluation is... 详细信息

ISBN: (纸本)9783319780542;9783319780535

关键词： Compiler construction concurrent programming Actors Threads Message passing

来源：评论

学校读者我要写书评

暂无评论

Proving That Non-Blocking Algorithms Don't Block 09

Proving That Non-Blocking Algorithms Don't Block

引用

36th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： Gotsman, Alexey Cook, Byron Parkinson, Matthew Vafeiadis, Viktor Univ Cambridge Cambridge CB2 1TN England

ISBN: (纸本)9781605583792

A concurrent data-structure implementation is considered non-blocking if it meets one of three following liveness criteria: wait-freedom, lock-freedom, or obstruction-freedom. Developers of non-blocking algorithms aim to meet these criteria. However, to date their proofs for non-trivial algorithms have been only manual pencil-and-paper semi-formal proofs. This paper proposes the first fully automatic tool that allows developers to ensure that their algorithms are indeed non-blocking. Our tool uses rely-guarantee reasoning while overcoming the technical challenge of sound reasoning in the presence of interdependent liveness properties.

关键词： Languages Theory Verification Formal Verification concurrent programming Liveness Termination

来源：评论

学校读者我要写书评

暂无评论

Towards a Testing Framework with Visual Feedback for Actor-based Systems 18

Towards a Testing Framework with Visual Feedback for Actor-b...

引用

18th IEEE International Conference on Software Quality, Reliability, and Security (QRS)

作者： Sozer, Hasan Gurler, Ozan Yilmaz, Orhan Ozyegin Univ Istanbul Turkey EPIAS Istanbul Turkey

ISBN: (纸本)9781538677575

We introduce a prototype testing framework as an extension of JUnit for testing actor-based systems. Our framework runs a given JUnit test in various schedules and records the execution trace for each run. In case a failure is observed during one of the test runs, the corresponding execution trace is compared with those traces associated with passed test runs. The sequence of exchanged messages that are different with respect to these runs are extracted. A UML sequence diagram is automatically generated to depict this sequence. Hence, the developer can observe the interleaving of messages that caused the failure. We illustrated the application of our framework on two sample actor-based software systems.

关键词： actor model test automation concurrent programming program debugging scheduling

来源：评论

学校读者我要写书评

暂无评论

Cooperative Exceptions for concurrent Objects 21

Cooperative Exceptions for Concurrent Objects

引用

IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC 2015)

作者： Cabral, Bruno Fonseca, Alcides Marques, Paulo Aldrich, Jonathan Univ Coimbra Coimbra Portugal Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9781467393768

The advent of multi-core systems set off a race to get concurrent programming to the masses. One of the challenging aspects of this type of system is how to deal with exceptional situations, since it is very difficult to assert the precise state of a concurrent program when an exception arises. In this paper we propose an exception-handling model for concurrent systems. Its main quality attributes are simplicity and expressiveness, allowing programmers to deal with exceptional situations in a concurrent setting in a familiar way. The proposal is centered on a new kind of exception type that defines new paths for exception propagation among concurrent threads of execution. In our model, beyond being able to control where exceptions are raised, the developer can define in which thread, and when during its execution, a particular exception will be handled. The proposed model has been implemented in Scala, and we show its application to the construction of concurrent software.

关键词： exception handling concurrent programming multi-core threads processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共40页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：