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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Measuring CS1 Perceptions of Parallelism

Measuring CS1 Perceptions of Parallelism

引用

41st Annual Frontiers in Education Conference (FIE)

作者： Rague, Brian Weber State Univ Ogden UT 84408 USA

ISBN: (纸本)9781612844695

Educators in Computer Science (CS) generally agree that teaching concurrency can be difficult. CS programs typically offer parallel and distributed computing topics as advanced courses. A potential alternative approach is to provide instruction on parallelism early in the undergraduate curriculum, emphasizing conceptual design rather than implementation issues. This introduction of "parallel-thinking" to beginning CS undergraduates represents an innovation and significant extension to existing standard Computer Science curricula. The research described in this paper investigated the feasibility of integrating parallel computing concepts into a first-year CS course. To quantitatively assess student comprehension of parallel computing, an experimental two-factor mixed group design educational study was conducted to evaluate a control group and two instructional interventions: (1) lecture only, and (2) lecture with laboratory work using a software visualization Parallel Analysis Tool (PAT) specifically designed for this project. The Perceptions of Parallelism Survey (PoPS), a new evaluation instrument developed for this study and modeled after the Force Concept Inventory (FCI), was used to measure student learning. The results from this educational study show a statistically significant main effect among the repeated measures. PoPS results measured during the ninth week of the course reveal that performance levels remained high compared to pre-course performance scores.

关键词： Assessment concurrent programming Content Inventory Parallelism

来源：评论

学校读者我要写书评

暂无评论

Extensible Software Transactional Memory

Extensible Software Transactional Memory

引用

3rd C* Conference on Computer Science and Software Engineering (C3S2E)

作者： Noel, Cyprien Argilsoft LLC Los Altos CA 94024 USA

ISBN: (纸本)9781605589015

XSTM is a software transactional memory that can be extended by pluggable components. Extensions can access transactions read and write sets through an API, and process them e.g., for logging, change notification, state persistence or replication. This project explores ways to make memory transactions useful beyond thread synchronization. We describe in particular an application architecture enabled by extensions which aims to combine some of the strengths of shared state and of the Actor model. Shared state offers developers the modeling power of object orientation, and avoids the overhead of copying memory between components. The Actor model offers safety and composability when writing parallel and distributed applications. Our second design goal is to make memory transactions easy to reason about and safe to use. Opacity is achieved using a Multi Version Concurrency Control design where transactions are view-isolated, i.e., run in stable and consistent snapshots of the full memory. Transactions never encounter inconsistent data, do not abort while partially executed, and global progress is guaranteed. The programming model is further simplified by enforcing strong atomicity at the type system level, as transactional objects accessors require an ambient transaction. Finally, our design offers interesting performance characteristics by avoiding mutable shared state. Data is either mutable but private to a thread, or shared but immutable. This allows transactions to run without synchronization (no memory fence) between start and commit, which are themselves implemented in a lock-free way using O(1) memory fences and compare-and-swaps. We describe working implementations on the JVM and CLR for the STM and some extensions.

关键词： concurrent programming Synchronization Transactional Memory Object Replication Composability Software Architecture

来源：评论

学校读者我要写书评

暂无评论

A concurrent Architecture Proposal for Information Visualization Pipeline 19

A Concurrent Architecture Proposal for Information Visualiza...

引用

19th International Conference on Information Visualisation IV 2015

作者： Carneiro, Nikolas Teixeira, Ranieri Araujo, Tiago Santos, Carlos Junior, Jairo Meiguins, Bianchi Univ Fed Para UFPA Belem Para Brazil

ISBN: (纸本)9781467375689

This paper identifies an opportunity to reduce the latency in information visualization (InfoVis) systems, exploring the parallelization of the visualization pipeline architecture. We propose a concurrent architecture where the visualization pipeline stages are modified to execute as producers and consumers threads. The threads synchronization is done by memory barriers and the data flow pass the pipeline through a unique data structure, called ring buffer, which reuses a contiguous space preallocated in memory. Two InfoVis prototypes were developed in java, the first one using sequential pipeline and the other using concurrent pipeline. The results obtained with concurrent architecture in comparison with sequential pipeline presented less execution time and memory allocation for data visualization renderization.

关键词： Information Visualization Visualization Pipeline Software Architecture concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Barrier Synchronization: Simplified, Generalized, and Solved without Mutual Exclusion 32

Barrier Synchronization: Simplified, Generalized, and Solved...

引用

32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Aravind, Alex Univ Northern British Columbia Dept Comp Sci Prince George BC Canada

ISBN: (纸本)9781538655559

Barrier synchronization is a fundamental concurrency issue encountered in a large number of concurrent and parallel applications that involve parallel processes cooperatively solving complex problems. Barrier synchronization essentially forces these parallel processes to wait until each one of them has reached a certain point in execution. Therefore, barrier synchronization has been considered as an inevitable synchronization construct for most parallel applications. Hence barrier synchronization or its variant has become an integral component of the most widely used parallel programming models such as OpenMP, MPI, MapReduce, and the bulk synchronous parallel (BSP) models. In [2], the authors stated that the performance of BSP model depends on 4 parameters the number of nodes, the speed of each node, the communication cost, and the synchronization cost. Among these, the synchronization cost is considered critical in improving the performance of any BSP implementation [2]. From parallel algorithm design and implementation perspective, we consider that the synchronization component is the most important one and its cost is the most critical performance factor for almost all the parallel programming models including BSP. This paper presents a class of simple barrier synchronization algorithms for shared memory systems. It includes general, efficient, and universal algorithms that are appealing from both practical and theoretical point of view. The correctness of the algorithms are proved. The algorithms are briefly analyzed to expose their strengths and weaknesses.

关键词： Barrier synchronization Mapreduce BSP Parallel and distributed computational models concurrent programming Parallel processing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Separation Logic for Refining concurrent Objects 11

A Separation Logic for Refining Concurrent Objects

引用

38th Symposium on Principles of programming Languages

作者： Turon, Aaron Wand, Mitchell Northeastern Univ Boston MA USA

ISBN: (纸本)9781450304900

Fine-grained concurrent data structures are crucial for gaining performance from multiprocessing, but their design is a subtle art. Recent literature has made large strides in verifying these data structures, using either atomicity refinement or separation logic with rely-guarantee reasoning. In this paper we show how the ownership discipline of separation logic can be used to enable atomicity refinement, and we develop a new rely-guarantee method that is localized to the definition a a data structure. We present the first semantics of separation logic that is sensitive to atomicity, and show how to control this sensitivity through ownership. The result is a logic that enables compositional reasoning about atomicity and interference, even for programs that use fine-grained synchronization and dynamic memory allocation.

关键词： rely-guarantee formal verification concurrent programming refinement atomicity shared-memory concurrency

来源：评论

学校读者我要写书评

暂无评论

Partial Memoization of Concurrency and Communication

Partial Memoization of Concurrency and Communication

引用

14th ACM SIGPLAN International Conference on Functional programming

作者： Ziarek, Lukasz Sivararnakrishnan, K. C. Jagannathan, Suresh Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781605583327

Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument 1, yields result r, a subsequent call to f with v can be immediately reduced to r without the need to re-evaluate f's body. Understanding memoization in the presence of concurrency and communication is significantly more challenging. For example, if f communicates with other threads, it is not sufficient to simply record its input/output behavior;we must also track inter-thread dependencies induced by these communication actions. Subsequent calls to f can be elided only if we can identify an interleaving of actions from these call-sites that lead to states in which these dependencies are satisfied. Similar issues arise if f spawns additional threads. In this paper, we consider the memoization problem for a higher-order concurrent language whose threads may communicate through synchronous message-based communication. To avoid the need to perform unbounded state space search that may be necessary to determine if all communication dependencies manifest in an earlier call can be satisfied in a later one, we introduce a weaker notion of memoization called partial memoization that gives implementations the freedom to avoid performing some part, if not all, of a previously memoized call. To validate the effectiveness of our ideas, we consider the benefits of memoization for reducing the overhead of recomputation for streaming, server-based, and transactional applications executed on a multi-core machine. We show that on a variety of workloads, memoization can lead to substantial performance improvements without incurring high memory costs.

关键词： concurrent programming Partial Memoization Software Transactions concurrent ML Multicore Systems

来源：评论

学校读者我要写书评

暂无评论

A Theory-Oriented Introduction to Wait-free Synchronization Based on the Adaptive Renaming Problem

A Theory-Oriented Introduction to Wait-free Synchronization ...

引用

25th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Rajsbaum, Sergio Raynal, Michel Univ Nacl Autonoma Mexico Inst Matemat Mexico City 04510 DF Mexico IRISA IUF F-35042 Rennes France

ISBN: (纸本)9780769543376

The recent deployment of multiprocessors (such as multicores) as the mainstream computing platform has given rise to a new concurrent programming impetus. In such a context it becomes extremely important to be able to design shared objects that can cope with the net effect of asynchrony and process crashes. This paper is a theory-oriented introduction to wait-free synchronization for such systems. It uses the adaptive renaming problem as a paradigm to explain the difficulties and subtleties of synchronization in presence of process crashes. Renaming is one of the most famous coordination problems studied in distributed computability. It consists in assigning new names to processes in such a way that no two processes obtain the same new name and the new name space be as small as possible. The paper visits the problem by presenting three solutions. This paper, that has a strong survey/short tutorial flavor, can consequently be considered as an introduction to both the renaming problem and progress conditions for synchronization in presence of process crashes in the context of multiprocessor systems.

关键词： Adaptive distributed algorithm Asynchronous shared memory system concurrent programming Crash failures Obstruction-freedom Multicore systems Read/write atomic register Recursion Renaming problem Shared object Wait-freedom

来源：评论

学校读者我要写书评

暂无评论

Wait-free Trees with Asymptotically-Efficient Range Queries 38

Wait-free Trees with Asymptotically-Efficient Range Queries

引用

International Parallel and Distributed Processing Symposium (IPDPS)

作者： Kokorin, Ilya Yudov, Victor Aksenov, Vitaly Alistarh, Dan ITMO Univ VK com St Petersburg Russia ITMO Univ St Petersburg Russia City Univ London London England IST Austria Vienna Austria

ISBN: (纸本)9798350387117;9798350387124

Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive, efficient, and scalable versions of practical tree data structures. We are interested in concurrent trees supporting range queries, i.e., queries that involve multiple consecutive data items. Existing implementations with this capability can list keys in a specific range, but do not support aggregate range queries: for instance, if we want to calculate the number of keys in a range, the only choice is to retrieve a whole list and return its size. This is suboptimal: in the sequential setting, one can augment a balanced search tree with counters and, consequently, perform these aggregate requests in logarithmic rather than linear time. In this paper, we propose a generic approach to implement a broad class of range queries on concurrent trees in a way that is wait-free, asymptotically efficient, and practically scalable. The key idea is a new mechanism for maintaining metadata concurrently at tree nodes, which can be seen as a wait-free variant of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary implementation of the wait-free binary search tree and preliminary experiments have indicated the soundness of our approach.

关键词： Data structures concurrent programming Range queries

来源：评论

学校读者我要写书评

暂无评论

Framework for Development of Real-Time Applications on Embedded Systems 22

Framework for Development of Real-Time Applications on Embed...

引用

22nd Symposium on Image, Signal Processing and Artificial Vision (STSIVA)

作者： Restrepo Alvarado, Juan C. Benjumea Mazo, Miguel A. Lopez Parrado, Alexander Univ Quindio Fac Ingn Programa Ingn Elect Carrera 15 Calle 12 Norte Armenia Quindio Colombia

ISBN: (纸本)9781728114910

In this paper we describe RTX, a framework for development of real-time applications on embedded systems. RTX facilitates programming and structuring of source code when building this kind of applications. Also, RTX seeks to improve user-computer interaction in real-time applications development and helps to exploit the capabilities of multicore processors in modern embedded systems. In addition, RTX allows the programmer to build and execute real-time applications from a Graphical User Interface (GUI) inspired in the Arduino environment, in the same way, an Application programming Interface (API) is provided through a functions library for the C ++ programming language. For RTX validation, a real-time concurrent control system was implemented on a Raspberry Pi board by using designed API and GUI.

关键词： Framework real time embedded systems GUI API concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Empirical Assessment of Languages for Teaching Concurrency: Methodology and Application

Empirical Assessment of Languages for Teaching Concurrency: ...

引用

24th IEEE-CS Conference on Software Engineering Education and Training (CSEEandT)/33rd International Conference on Software Engineering (ICSE)

作者： Nanz, Sebastian Torshizi, Faraz Pedroni, Michela Meyer, Bertrand Swiss Fed Inst Technol Zurich Switzerland Univ Toronto Toronto ON M5S 1A1 Canada

ISBN: (纸本)9781457703485

Concurrency has been rapidly gaining importance in computing, and correspondingly in computing curricula. concurrent programming is, however, notoriously hard even for expert programmers. New language designs promise to make it easier, but such claims call for empirical validation. We present a methodology for comparing concurrent languages for teaching purposes. A critical challenge is to avoid bias, especially when (as in our example application) the experimenters are also the designers of one of the approaches under comparison. For a study performed as part of a course, it is also essential to make sure that no student is penalized. The methodology addresses these concerns by using self-study material and applying an evaluation scheme that minimizes opportunities for subjective decisions. The example application compares two object-oriented concurrent languages: multithreaded Java and SCOOP. The results show an advantage for SCOOP even though the study participants had previous training in writing multithreaded Java programs. The lessons should be of use to educators interested in teaching concurrency, to researchers looking for objective ways of assessing teaching techniques, and to researchers who want to avoid bias in assessing an approach or tool that they have themselves designed.

关键词： concurrent computing Instruction sets Java Java Materials SCOOP Synchronization Training computer science education concurrent engineering concurrent programming educational courses expert programmer formal languages language design multi-threading multithreaded Java program object oriented concurrent language selfstudy material teaching teaching concurrency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共40页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：