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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

220 篇 会议
57 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

236 篇 工学
- 223 篇 计算机科学与技术...
- 165 篇 软件工程
- 15 篇 控制科学与工程
- 5 篇 电气工程
- 5 篇 电子科学与技术（可...
- 5 篇 建筑学
- 4 篇 信息与通信工程
- 4 篇 土木工程
- 4 篇 生物工程
- 3 篇 化学工程与技术
- 3 篇 环境科学与工程（可...
- 2 篇 材料科学与工程（可...
- 2 篇 纺织科学与工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 交通运输工程
- 1 篇 农业工程
40 篇 理学
- 21 篇 数学
- 12 篇 系统科学
- 5 篇 生物学
- 4 篇 物理学
- 3 篇 化学
- 1 篇 地质学
29 篇 管理学
- 20 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 8 篇 工商管理
4 篇 法学
- 4 篇 社会学
- 1 篇 法学
4 篇 教育学
- 4 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

38 篇 object oriented ...
30 篇 computer systems...
25 篇 computer program...
7 篇 java programming...
6 篇 aspect oriented ...
6 篇 parallel program...
6 篇 concurrency
4 篇 computer systems...
4 篇 static analysis
4 篇 semantics
4 篇 synchronization
3 篇 message passing
3 篇 languages
3 篇 memory managemen...
3 篇 pattern matching
3 篇 logic programmin...
3 篇 computer graphic...
3 篇 specifications
2 篇 computer circuit...
2 篇 type systems

机构

3 篇 uppsala univ upp...
3 篇 university of ca...
3 篇 university of to...
3 篇 mit united state...
3 篇 university of bo...
3 篇 stockholm univer...
3 篇 purdue universit...
2 篇 univ of rocheste...
2 篇 univ bologna dis...
2 篇 univ edinburgh e...
2 篇 brown univ unite...
2 篇 school of softwa...
2 篇 columbia univ un...
2 篇 tokyo inst of te...
2 篇 univ paris vi
2 篇 carnegie mellon ...
2 篇 ibm research
2 篇 virginia tech un...
2 篇 department of co...
2 篇 department of co...

作者

7 篇 ricci alessandro
6 篇 wrigstad tobias
5 篇 agha gul
5 篇 masuhara hidehik...
4 篇 hirschfeld rober...
4 篇 yonezawa akinori
4 篇 tokoro mario
3 篇 watanabe takuo
3 篇 nystrom nathanie...
3 篇 santi andrea
3 篇 van den bos jan
3 篇 kafura dennis
3 篇 sarkar vivek
3 篇 springer matthia...
3 篇 vitek jan
2 篇 wegner peter
2 篇 meseguer josé
2 篇 ducasse stéphane
2 篇 wheelhouse mark
2 篇 lincke daniel

语言

277 篇 英文
1 篇 其他

检索条件"任意字段=Proceedings of the ACM SIGPLAN Workshop on Object-Based Concurrent Programming"

共 278 条记录，以下是11-20 订阅

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

详细简洁

排序：

Parallel programming with arrays in Kappa 5

Parallel programming with arrays in Kappa

引用

5th acm sigplan International workshop on Libraries, Languages, and Compilers for Array programming, ARRAY 2018, in conjunction with PLDI 2018

作者： Åkerblom, Beatrice Castegren, Elias Wrigstad, Tobias Stockholm University Sweden Uppsala University Sweden

ISBN: (纸本)9781450358521

Array algorithms where operations are applied to disjoint parts of an array lend themselves well to parallelism, since parallel threads can operate on the parts of the array without synchronisation. However, implementing such algorithms requires programmer diligence to verify that a thread does not accidentally access an element of the array while another thread is updating the same element. An off-by-one error can lead to data-races and non-deterministic bugs which are notoriously hard to track down. Previous work on Kappa, a capability-based type system, provides data-race freedom for concurrent, object-oriented programs, even in the presence of concurrent mutating accesses to the same object. In this paper we show how Kappa can be extended to handle concurrent programming with arrays. By defining array capabilities which grant access to (parts of) an array, we can piggy-back on the existing type system in a straightforward fashion. We illustrate how split and merge operations integrate with Kappa in practise by discussing the implementation of a divide-and-conquer quicksort algorithm. We explore the semantics of the Kappa extension by using a simple imperative calculus and sketch on how it could be implemented efficiently. © 2018 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

AGERE 2018 - proceedings of the 8th acm sigplan International workshop on programming based on Actors, Agents, and Decentralized Control, co-located with SPLASH 2018

AGERE 2018 - Proceedings of the 8th ACM SIGPLAN Internationa...

引用

8th International workshop on programming based on Actors, Agents, and Decentralized Control, AGERE! 2018, co-located with SPLASH 2018

ISBN: (纸本)9781450360661

The proceedings contain 7 papers. The topics discussed include: a configurable transport layer for CAF;distributed functional reactive programming on actor-based runtime;observable atomic consistency for CvRDTs;Chocola: integrating futures, actors, and transactions;concurrent garbage collection in the actor model;attached and detached closures in actors;and a scripting language for practical agent-oriented programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

concurrent Garbage Collection in the Actor Model 8

Concurrent Garbage Collection in the Actor Model

引用

8th acm sigplan International workshop on programming based on Actors, Agents, and Decentralized Control (AGERE)

作者： Plyukhin, Dan Agha, Gul Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9781450360661

In programming languages where memory may be allocated dynamically, automatic garbage collection (GC) can improve the efficiency of program execution while preventing program errors caused by incorrectly removed memory locations. In actor systems, GC poses some challenges that make it much costlier than in the sequential setting: Besides references from reachable actors, we have to consider inverse references from potentially active actors to reachable actors. One proposal, adopted in the runtime for the actor programming language Pony, uses causal message delivery and a centralized detection algorithm. While this is efficient in a multicore setting, the solution is too expensive for a distributed actor runtime. In this work, we show how the causal order message delivery requirement may be removed. Specifically, we describe a tracing collector of distributed actor garbage with centralized and decentralized variants. Both are guaranteed not to collect any non-garbage actors (safety) and to eventually collect all garbage actors (liveness).

关键词： garbage collection distributed systems

来源：评论

学校读者我要写书评

暂无评论

Efficient VM-Independent Runtime Checks for Parallel programming 10

Efficient VM-Independent Runtime Checks for Parallel Program...

引用

10th acm sigplan International workshop on Virtual Machines and Language Implementations (VMIL)

作者： Faes, Michael Gross, Thomas R. Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781450360715

Many concurrent or parallel programming languages rely on runtime checking to ensure safety. To implement such a language on a virtual machine (VM), such runtime checks are often implemented in a VM-independent way, using source-to-source translation or bytecode instrumentation. This approach avoids modifying complex VM components like the just-in-time (JIT) compiler and offers great portability. However, obtaining good performance is challenging, as the approach cannot profit from custom JIT optimizations to eliminate redundant checks. In this paper, we present and evaluate two techniques to make the VM-independent approach efficient, using the example of a parallel programming language called Rolez. To guarantee that concurrent threads do not interfere, Rolez relies heavily on runtime checks: for every field access, the runtime system checks that the state of the target object currently permits this operation (unless the check is optimized away). The Rolez compiler we present here generates standard Java source code and the runtime system is implemented as a Java library. Nevertheless, many Rolez programs deliver performance roughly on par with manually synchronized Java implementations, which is achieved using these two techniques: 1) code-managed runtime data, which improves runtime check efficiency by passing performance-critical information from method to method, and 2) an interprocedural but modular concurrency analysis, which eliminates many runtime checks that are actually redundant.

关键词： runtime checking vm-independent concurrency analysis interprocedural analysis roles

来源：评论

学校读者我要写书评

暂无评论

Attached and Detached Closures in Actors 8

Attached and Detached Closures in Actors

引用

8th acm sigplan International workshop on programming based on Actors, Agents, and Decentralized Control (AGERE)

作者： Castegren, Elias Clarke, Dave Fernandez-Reyes, Kiko Wrigstad, Tobias Yang, Albert Mingkun KTH Royal Inst Technol Stockholm Sweden Uppsala Univ Informat Technol Uppsala Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781450360661

Expressive actor models combine aspects of functional programming into the pure actor model enriched with futures. Such functional features include first-class closures which can be passed between actors and chained on futures. Combined with mutable objects, this opens the door to race conditions. In some situations, closures may not be evaluated by the actor that created them yet may access fields or objects owned by that actor. In other situations, closures may be safely fired off to run as a separate task. This paper discusses the problem of who can safely evaluate a closure to avoid race conditions, and presents the current solution to the problem adopted by the Encore language. The solution integrates with Encore's capability type system, which influences whether a closure is attached and must be evaluated by the creating actor, or whether it can be detached and evaluated independently of its creator. Encore's current solution to this problem is not final or optimal. We conclude by discussing a number of open problems related to dealing with closures in the actor model.

关键词： closures parallel programming concurrent programming type systems

来源：评论

学校读者我要写书评

暂无评论

Inner array inlining for structure of arrays layout 5

Inner array inlining for structure of arrays layout

引用

5th acm sigplan International workshop on Libraries, Languages, and Compilers for Array programming, ARRAY 2018, in conjunction with PLDI 2018

作者： Springer, Matthias Sun, Yaozhu Masuhara, Hidehiko Tokyo Institute of Technology Japan

ISBN: (纸本)9781450358521

Previous work has shown how the well-studied and SIMD-friendly Structure of Arrays (SOA) data layout strategy can speed up applications in high-performance computing compared to a traditional Array of Structures (AOS) data layout. However, a standard SOA layout cannot handle structures with inner arrays;such structures appear frequently in graph-based applications and object-oriented designs with associations of high multiplicity. This work extends the SOA data layout to structures with array-typed fields. We present different techniques for inlining (embedding) inner arrays into an AOS or SOA layout, as well as the design and implementation of an embedded C++/CUDA DSL that lets programmers write such layouts in a notation close to standard C++. We evaluate several layout strategies with a traffic flow simulation, an important real-world application in transport planning. © 2018 acm.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 10th International workshop on Context-Oriented programming: Advanced Modularity for Run-time Composition, COP 2018 - Co-located with the European Conference on object-Oriented programming

Proceedings of the 10th International Workshop on Context-Or...

引用

10th International workshop on Context-Oriented programming: Advanced Modularity for Run-time Composition, COP 2018 - Co-located with the European Conference on object-Oriented programming

ISBN: (纸本)9781450357227

The proceedings contain 6 papers. The topics discussed include: declarative language for context activation;a context-oriented programming approach to dependency hell;feature visualizer: an inspection tool for context-oriented programmers;a simple context-oriented programming extension to an FRP language for small-scale embedded systems;activity contexts: improving modularity in blockchain-based smart contracts using context-oriented programming;and cross-cutting commentary: narratives for multi-party mechanisms and concerns.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed memory futures for compile-time, deterministic-by-default concurrency in distributed C plus plus applications 4

Distributed memory futures for compile-time, deterministic-b...

引用

IEEE/acm 4th International workshop on Extreme Scale programming Models and Middleware (ESPM2)

作者： Wilke, Jeremiah J. Hollman, David S. Lewis, Cannada Markosyan, Aram Morals, Nicolas Sandia Natl Labs Scalable Modeling & Anal Livermore CA 94550 USA

ISBN: (纸本)9781728101781

Futures are a widely-used abstraction for enabling deferred execution in imperative programs. Deferred execution enqueues tasks rather than explicitly blocking and waiting for them to execute. Many task-based programming models with some form of deferred execution rely on explicit parallelism that is the responsibility of the programmer. Deterministic-by-default (implicitly parallel) models instead use data effects to derive concurrency automatically, alleviating the burden of concurrency management. Both implicitly and explicitly parallel models are particularly challenging for imperative object-oriented programming. Fine-granularity parallelism across member functions or amongst data members may exist, but is often ignored. In this work, we define a general permissions model that leverages the C++ type system and move semantics to define an asynchronous programming model embedded in the C++ type system. Although a default distributed memory semantic is provided, the concurrent semantics are entirely configurable through C++ constexpr integers. Correct use of the defined semantic is verified at compile-time, allowing deterministic-by-default concurrency to be safely added to applications. Here we demonstrate the use of these "extended futures" for distributed memory asynchronous communication and load balancing. An MPI particle-in-cell application is modified with the wrapper class using this task model, with results presented for a Haswell system up to 64 nodes.

关键词： task-based runtimes template metaprogramming parallel computing programming models execution models

来源：评论

学校读者我要写书评

暂无评论

Activity contexts : Improving modularity in blockchain-based smart contracts using context-oriented programming 10

Activity contexts : Improving modularity in blockchain-based...

引用

10th International workshop on Context-Oriented programming: Advanced Modularity for Run-time Composition, COP 2018 - Co-located with the European Conference on object-Oriented programming

作者： Mattis, Toni Hirschfeld, Robert Software Architecture Group Hasso Plattner Institute University of Potsdam Potsdam Germany

ISBN: (纸本)9781450357227

Smart contracts formalize and automate interactions among and between individuals and systems in an executable and decentralized way. They are analogous to objects in object-oriented programming, but their behavior and state is replicated across multiple participants in a network and messages sent to the "object" are relayed to all network participants, allowing everyone to keep its replica up-todate. Originally introduced in the mid-1990s, their recent surge in popularity is linked to a rising interest in blockchain-backed, general-purpose smart contract platforms. Manging contract-specific state and behavior associated with the interacting parties and shared objects is a modularity challenge in smart contracts. Each contract has individual requirements for the (non-contract) objects it interacts with. We observed that smart contracts tend to manage object-specific state and behavior itself, often leading to a single monolithic mediator. We aim at improving encapsulation and separation of concerns by allowing programmers to modularly express instance-specific state and behavior within the scope of a so called Activity Context. Activity Contexts are an extension to objects that collect these modular adaptations and jointly overlay them over instances that participate in the activity modeled by the smart contract. We demonstrate the benefits of Activity Contexts by refactoring an exemplary smart contract and discuss their trade-offs compared to traditional object-oriented decomposition and their integration into an existing layer-based context-oriented ecosystem. © 2018 Copyright held by the owner/author(s).

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Cross-cutting commentary : Narratives for multi-party mechanisms and concerns 10

Cross-cutting commentary : Narratives for multi-party mechan...

引用

10th International workshop on Context-Oriented programming: Advanced Modularity for Run-time Composition, COP 2018 - Co-located with the European Conference on object-Oriented programming

作者： Hirschfeld, Robert Dürschmid, Tobias Rein, Patrick Taeumel, Marcel Hasso Plattner Institute University of Potsdam Potsdam Germany

ISBN: (纸本)9781450357227

Cross-cutting concerns are an inherent property of the implementation of non-trivial software systems. Their study led to the development of advanced modularity constructs, usually supported by meta-level frameworks and programming language constructs, to improve comprehensibility. Because of their invasive nature, systems need to be refactored or rewritten to take advantage of these constructs. However, practical considerations such as organizational or economical constraints often do not allow for such reengineering efforts, leaving those systems without explicit representations of their cross-cutting concerns. We propose a lightweight, non-invasive approach to explicate and document cross-cutting, multi-party concerns called Crosscutting Commentary, or Commentary for short. Our proposal is based on the observation that comments are co-located with the individual semantic units they are about and with that scattered and tangled in the absence of advanced modularity constructs for crosscutting concerns and the assumption that well-crafted, informal explanations of system properties (their intents and the mechanisms they provide) improve comprehensibility. Commentaries are to help communicate narratives about system properties that involve multiple participants, both co-located in a single module or crosscutting several of them, and allow for navigating to, from, and between them to explore the implementation artifacts involved. Commentary was inspired by layers introduced with Contextoriented programming to associate and manage partial definitions of system elements. While layers contribute to system comprehension during development and software composition at run-time, Commentary focuses on narratives for system exploration. We present our first attempt to provide Commentaries in Squeak/Smalltalk. We explain implementation details and discuss several application scenarios considering the documentation of basic mechanisms of this programming and runtime environment

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：