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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

programming Smart objects: How Young Learners' programming Skills, Attitudes, and Perception Are Influenced

Programming Smart Objects: How Young Learners' Programming S...

引用

acm sigplan International Symposium on SPLASH-E (SPLASH-E)

作者： Seraj, Mazyar Rahimi, Ebrahim Merino, Mauricio Verano Venegas, Lina Ochoa Eindhoven Univ Technol Eindhoven Netherlands Open Univ Netherlands Heerlen Netherlands Vrije Univ Amsterdam Amsterdam Netherlands

ISBN: (纸本)9798400712166

programming literacy is crucial for current and future generations of young learners, irrespective of their career paths. programming education is thus essential, making teaching methods and tools to be tailored to the target audience. In this context, contemporary visual programming environments, particularly block-based programming, have become instrumental in introducing programming concepts to young learners. Educational theories such as Constructionism advocate an approach centered on the learner to deepen and motivate learning. In computer science, these theories can be applied by providing hands-on experiences that connect computer science to real-life situations through the manipulation or construction of physical and tangible computational devices. This study explores the impact of creating a smart object for a smart home using block-based programming on young learners' attitudes and perceptions toward programming and their programming skills acquisition. An introductory programming workshop involved 28 8(th) grade students from a secondary school constructing and programming a smart-lighting object in a smart home setting. Performance, attitude, and perception trajectories were assessed through repeated questionnaires. Our results indicate that constructing and programming a real-life smart object enhances learners' confidence and programming skills. This paper contributes to programming education literature by demonstrating the potential of block-based programming, specifically in the context of state-of-the-art smart technologies, to foster programming skills and develop positive attitudes and perceptions among learners.

关键词： block-based programming young learners smart home programming education internet of things

来源：评论

学校读者我要写书评

暂无评论

Are Your Epochs Too Epic? Batch Free Can Be Harmful 24

Are Your Epochs Too Epic? Batch Free Can Be Harmful

引用

29th acm sigplan Annual Symposium on Principles and Practice of Parallel programming (PPoPP)

作者： Kim, Daewoo Brown, Trevor Singh, Ajay Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9798400704352

Epoch based memory reclamation (EBR) is one of the most popular techniques for reclaiming memory in lock-free and optimistic locking data structures, due to its ease of use and good performance in practice. However, EBR is known to be sensitive to thread delays, which can result in performance degradation. Moreover, the exact mechanism for this performance degradation is not well understood. This paper illustrates this performance degradation in a popular data structure benchmark, and does a deep dive to uncover its root cause-a subtle interaction between EBR and state of the art memory allocators. In essence, modern allocators attempt to reduce the overhead of freeing by maintaining bounded thread caches of objects for local reuse, actually freeing them (a very high latency operation) only when thread caches become too large. EBR immediately bypasses these mechanisms whenever a particularly large batch of objects is freed, substantially increasing overheads and latencies. Beyond EBR, many memory reclamation algorithms, and data structures, that reclaim objects in large batches suffer similar deleterious interactions with popular allocators. We propose a simple algorithmic fix for such algorithms to amortize the freeing of large object batches over time, and apply this technique to ten existing memory reclamation algorithms, observing performance improvements for nine out of ten, and over 50% improvement for six out of ten in experiments on a high performance lock-free ABtree. We also present an extremely simple token passing variant of EBR and show that, with our fix, it performs 1.5-2.6x faster than the fastest known memory reclamation algorithm, and 1.2-1.5x faster than not reclaiming at all, on a 192 thread four socket Intel system.

关键词： safe memory reclamation memory allocator concurrent data structures memory management

来源：评论

学校读者我要写书评

暂无评论

Compressed Forwarding Tables Reconsidered 19

Compressed Forwarding Tables Reconsidered

引用

19th International Conference on Managed programming Languages and Runtimes (MPLR)

作者： Norlinder, Jonas Osterlund, Erik Wrigstad, Tobias Uppsala Univ Uppsala Sweden Oracle Stockholm Sweden

ISBN: (纸本)9781450396967

How concurrent compacting collectors store and manage forwarding information is crucial for their performance. In this paper, we propose CFW, a representation technique for forwarding information that guarantees that forwarding information for an entire heap can be stored in at most 3.14% of its size. By providing such a guarantee, we simplify the task of deploying programs with respect to memory needs. This is important given how memory is typically the dominating factor in the cost model for cloud-based deployments. We explore the design space of our technique through a prototype implementation on-top of ZGC. A rigorous performance evaluation shows promising results.

关键词： garbage collection concurrent object relocation forwarding information

来源：评论

学校读者我要写书评

暂无评论

COP 2021 - proceedings of the 13th acm International workshop on Context-Oriented programming and Advanced Modularity, co-located with ECOOP/ISSTA 2021

COP 2021 - Proceedings of the 13th ACM International Worksho...

引用

13th acm International workshop on Context-Oriented programming and Advanced Modularity, COP 2021, co-located with the 35th European Conference on object-Oriented programming, ECOOP 2021 and the 30th acm SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2021

ISBN: (纸本)9781450385428

The proceedings contain 3 papers. The topics discussed include: resolving synchronization conflicts in role-based multimodel-synchronization environments;first-class concepts: reifying architectural knowledge beyond the dominant decomposition;and towards a framework for analyzing context-oriented programming languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resolving synchronization conflicts in role-based multimodel-synchronization environments 13

Resolving synchronization conflicts in role-based multimodel...

引用

作者： Ebert, Sebastian Kluge, Tim Götz, Sebastian Software Technology Group Technische Universität Dresden Dresden Germany

ISBN: (纸本)9781450385428

The ability to collaboratively edit data in distributed environments is essential in our information-based industry. Typically users or systems concurrently access and modify data from different locations for different purposes. Each purpose might require its own representation and subset of the shared data (i.e., a model), for the editor to be productive. Consequently, a multi-model system results, which requires multi-directional synchronization. Although some approaches exist to realize such systems, none of these supports concurrent modifications. To overcome this limitation, we extend previous work on role-oriented model synchronization with a novel conflict detection and resolution approach. Role-oriented programming has been shown to be an adequate paradigm to realize multi-model systems, as it offers separation of concerns at the level of object collaborations and allows to express context-dependent behavior. We evaluate our approach using an employee data management case study and assess the introduced performance overhead. © 2021 acm.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures 2021

Snapshot-Free, Transparent, and Robust Memory Reclamation fo...

引用

42nd acm sigplan International Conference on programming Language Design and Implementation (PLDI)

作者： Nikolaev, Ruslan Ravindran, Binoy Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA

ISBN: (纸本)9781450383912

We present a family of safe memory reclamation schemes, Hyaline, which are fast, scalable, and transparent to the underlying lock-free data structures. Hyaline is based on reference counting - considered impractical for memory reclamation in the past due to high overheads. Hyaline uses reference counters only during reclamation, but not while accessing individual objects, which reduces overheads for object accesses. Since with reference counters, an arbitrary thread ends up freeing memory, Hyaline's reclamation workload is (almost) balanced across all threads, unlike most prior reclamation schemes such as epoch-based reclamation (EBR) or hazard pointers (HP). Hyaline often yields (excellent) EBR-grade performance with (good) HP-grade memory efficiency, which is a challenging trade-off with all existing schemes. Hyaline schemes offer: (i) high performance;(ii) good memory efficiency;(iii) robustness: bounding memory usage even in the presence of stalled threads, a well-known problem with EBR;(iv) transparency: supporting virtually unbounded number of threads (or concurrent entities) that can be created and deleted dynamically, and effortlessly join existent workload;(v) autonomy: avoiding special OS mechanisms and being non-intrusive to runtime or compiler environments;(vi) simplicity: enabling easy integration into unmanaged C/C++ code;and (vii) generality: supporting many data structures. All existing schemes lack one or more properties. We have implemented and tested Hyaline on x86(-64), ARM32/64, PowerPC, and MIPS. The general approach requires LL/SC or double-width CAS, while a specialized version also works with single-width CAS. Our evaluation reveals that Hyaline's throughput is very high - it steadily outperforms EBR by 10% in one test and yields 2x gains in oversubscribed scenarios. Hyaline's superior memory efficiency is especially evident in read-dominated workloads.

关键词： lock-free non-blocking memory reclamation hazard pointers epoch-based reclamation

来源：评论

学校读者我要写书评

暂无评论

Oak: A Scalable Off-Heap Allocated Key-Value Map 20

Oak: A Scalable Off-Heap Allocated Key-Value Map

引用

25th acm sigplan Symposium on Principles and Practice of Parallel programming (PPoPP)

作者： Meir, Hagar Basin, Dmitry Bortnikov, Edward Braginsky, Anastasia Gottesman, Yonatan Keidar, Idit Meir, Eran Sheffi, Gali Zuriel, Yoav IBM Res Haifa Israel Yahoo Res Haifa Israel Technion Haifa Israel

ISBN: (纸本)9781450368186

Efficient ordered in-memory key-value (KV-)maps are paramount for the scalability of modern data platforms. In managed languages like Java, KV-maps face unique challenges due to the high overhead of garbage collection (GC). We present Oak, a scalable concurrent KV-map for environments with managed memory. Oak offloads data from the managed heap, thereby reducing GC overheads and improving memory utilization. An important consideration in this context is the programming model since a standard object-based API entails moving data between the on- and off-heap spaces. In order to avoid the cost associated with such movement, we introduce a novel zero-copy (ZC) API. It provides atomic get, put, remove, and various conditional put operations such as compute (in-situ update). We have released an open-source Java version of Oak. We further present a prototype Oak-based implementation of the internal multidimensional index in Apache Druid. Our experiments show that Oak is often 2x faster than Java's state-of-the-art concurrent skiplist.

关键词： memory management concurrent data structures key-value maps

来源：评论

学校读者我要写书评

暂无评论

SIMD-based exact parallel fuzzy dilation operator for fast computing of fuzzy spatial relations 6

SIMD-based exact parallel fuzzy dilation operator for fast c...

引用

6th workshop on programming Models for SIMD/Vector Processing, WPMVP 2020, co-located with PPoPP 2020

作者： Pierrard, Régis Cabaret, Laurent Poli, Jean-Philippe Hudelot, Céline CEA LIST Gif-sur-Yvette cedex91191 France Paris-Saclay University CentraleSupélec Mathematics Interacting with Computer Science Gif-sur-Yvette91190 France

ISBN: (纸本)9781450375207

For decades, fuzzy spatial relations have demonstrated their utility and effectiveness for visual reasoning, including semantic annotation and object recognition. However, a major issue is that they often involve fuzzy morphological operators that are compute-intensive leading to long latency in the relation evaluation. As a result, approximate methods have been proposed to compute some relations in an acceptable time, but they are not as generic as the fuzzy dilation or do not make the most of modern computing architectures. In this paper, we introduce the Reverse and the Parallel Reverse (PR) algorithms. Reverse is an exact and efficient algorithm for the fuzzy dilation operator and PR combines the Reverse algorithm exactness with efficient usage of modern-processor multiple cores using OpenMP. Using SIMD extensions to enhance Parallel Reverse, PR128 (AVX), PR256 (AVX2), and PR512 (AVX512) are faster than the state-of-the-art approximate methods while remaining generic and exact. To demonstrate the performance of PR and highlight the contribution of the SIMD instructions, an extensive benchmark was carried out on two datasets of natural and artificial images. © 2020 Association for Computing Machinery.

关键词： object recognition

来源：评论

学校读者我要写书评

暂无评论

Run, Actor, Run Towards Cross-Actor Language Benchmarking 9

Run, Actor, Run Towards Cross-Actor Language Benchmarking

引用

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

作者： Blessing, Sebastian Fernandez-Reyes, Kiko Yang, Albert Mingkun Drossopoulou, Sophia Wrigstad, Tobias Imperial Coll London London England Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781450369824

The actor paradigm supports the natural expression of concurrency. It has inspired the development of several actor-based languages, whose adoption depends, to a large extent, on the runtime characteristics (i.e., the performance and scaling behaviour) of programs written in these languages. This paper investigates the relative runtime characteristics of Akka, CAF and Pony, based on the Savina benchmarks. We observe that the scaling of many of the Savina benchmarks does not reflect their categorization (into essentially sequential, concurrent and parallel), that many programs have similar runtime characteristics, and that their runtime behaviour may drastically change nature (e.g., go from essentially sequential to parallel) by tweaking some parameters. These observations lead to our proposal of a single benchmark program which we designed so that through tweaking of some knobs (we hope) we can simulate most of the programs of the Savina suite.

关键词： actor programming benchmarks

来源：评论

学校读者我要写书评

暂无评论

Implementation of a Feature-based Context-Oriented programming Language 11

Implementation of a Feature-Based Context-Oriented Programmi...

引用

11th International workshop on Context-Oriented programming (COP)

作者： Duhoux, Benoit Mens, Kim Dumas, Bruno Catholic Univ Louvain Louvain Belgium Univ Namur Namur Belgium

ISBN: (纸本)9781450368636

We implemented a feature-based context-oriented programming language, which clearly separates the notion of contexts from the notion of features. Contexts reify particular situations occurring in the surrounding environment, to which a software system can adapt. Features reify the system's behaviour;they are the language components that describe the system's functionality at a fine-grained level. Contexts are mapped to features, such that, when certain contexts become active at run-time, the corresponding features get selected and activated, thus adapting the system's functionality to those particular contexts. In this paper we show the object-oriented architecture, design and implementation issues of such a feature-based context-oriented programming language, which we implemented on top of the Ruby programming language as an application framework for context-oriented programmers. An important part of our language design is the explicit representation of contexts and features in terms of hierarchical tree structures that capture the structural constraints to be maintained at runtime. We illustrate our language design with a small example of a feature-based context-oriented program written in this language.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：