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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

738 篇 会议
127 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

777 篇 工学
- 742 篇 软件工程
- 568 篇 计算机科学与技术...
- 35 篇 控制科学与工程
- 19 篇 电气工程
- 19 篇 信息与通信工程
- 16 篇 生物工程
- 8 篇 土木工程
- 6 篇 建筑学
- 4 篇 化学工程与技术
- 3 篇 材料科学与工程（可...
- 3 篇 电子科学与技术（可...
- 3 篇 环境科学与工程（可...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 农业工程
59 篇 理学
- 33 篇 数学
- 18 篇 生物学
- 6 篇 物理学
- 6 篇 化学
- 6 篇 系统科学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 统计学（可授理学、...
58 篇 管理学
- 34 篇 图书情报与档案管...
- 26 篇 管理科学与工程(可...
- 8 篇 工商管理
12 篇 法学
- 12 篇 社会学
- 1 篇 法学
6 篇 教育学
- 6 篇 教育学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

250 篇 languages
111 篇 object oriented ...
83 篇 performance
83 篇 design
52 篇 algorithms
46 篇 verification
43 篇 java
41 篇 experimentation
38 篇 reliability
36 篇 computer program...
34 篇 theory
19 篇 human factors
17 篇 concurrency
16 篇 parallel program...
16 篇 object-oriented ...
15 篇 measurement
14 篇 scala
13 篇 aspect oriented ...
13 篇 javascript
12 篇 type systems

机构

18 篇 univ washington ...
13 篇 ecole polytech f...
12 篇 tech univ darmst...
11 篇 microsoft res re...
9 篇 mit csail cambri...
8 篇 univ texas austi...
7 篇 princeton univ p...
7 篇 univ marburg d-3...
7 篇 univ texas austi...
7 篇 aarhus univ dk-8...
6 篇 johannes kepler ...
6 篇 suny binghamton ...
6 篇 harvard univ cam...
6 篇 purdue univ w la...
6 篇 univ calif berke...
5 篇 univ duisburg es...
5 篇 microsoft res ca...
5 篇 ecole polytech f...
5 篇 mcgill univ mont...
5 篇 univ hong kong p...

作者

12 篇 rajan hridesh
12 篇 odersky martin
11 篇 mezini mira
10 篇 hirschfeld rober...
10 篇 binder walter
9 篇 salvaneschi guid...
9 篇 aldrich jonathan
9 篇 ostermann klaus
8 篇 mckinley kathryn...
8 篇 marr stefan
8 篇 rompf tiark
7 篇 oliveira bruno c...
7 篇 noble james
7 篇 liu yu david
7 篇 kuncak viktor
7 篇 gulwani sumit
6 篇 bond michael d.
6 篇 ceze luis
6 篇 van der storm ti...
6 篇 coad peter

语言

747 篇 英文
116 篇 其他
2 篇 中文
1 篇 俄文

检索条件"任意字段=2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages"

共 866 条记录，以下是361-370 订阅

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

详细简洁

排序：

Automating object Transformations for Dynamic Software Updating 12

Automating Object Transformations for Dynamic Software Updat...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Magill, Stephen Hicks, Michael Subramanian, Suriya McKinley, Kathryn S. IDA Ctr Comp Sci Baltimore MD USA Univ Maryland College Pk MD 20742 USA Intel Corp Santa Clara CA 95051 USA Microsoft Res Redmond WA USA Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450315616

Dynamic software updating (DSU) systems eliminate costly downtime by dynamically fixing bugs and adding features to executing programs. Given a static code patch, most DSU systems construct runtime code changes automatically. However, a dynamic update must also specify how to change the running program's execution state, e. g., the stack and heap, to make it compatible with the new code. Constructing such state transformations correctly and automatically remains an open problem. This paper presents a solution called Targeted object Synthesis (TOS). TOS first executes the same tests on the old and new program versions separately, observing the program heap state at a few corresponding points. Given two corresponding heap states, TOS matches objects in the two versions using key fields that uniquely identify objects and correlate old and new-version objects. Given example object pairs, TOS then synthesizes the simplest-possible function that transforms an old-version object to its new-version counterpart. We show that TOS is effective on updates to four open-source server programs for which it generates non-trivial transformation functions that use conditionals, operate on collections, and fix memory leaks. These transformations help programmers understand their changes and apply dynamic software updates.

关键词： Algorithms languages Theory Dynamic Software Update DSU Hot-Swapping Program Synthesis State Transformation object Correlation object Matching

来源：评论

学校读者我要写书评

暂无评论

Exploring Multi-Threaded Java Application Performance on Multicore Hardware 12

Exploring Multi-Threaded Java Application Performance on Mul...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Sartor, Jennifer B. Eeckhout, Lieven Univ Ghent Ghent Belgium

ISBN: (纸本)9781450315616

While there have been many studies of how to schedule applications to take advantage of increasing numbers of cores in modern-day multicore processors, few have focused on multi-threaded managed language applications which are prevalent from the embedded to the server domain. Managed languages complicate performance studies because they have additional virtual machine threads that collect garbage and dynamically compile, closely interacting with application threads. Further complexity is introduced as modern multicore machines have multiple sockets and dynamic frequency scaling options, broadening opportunities to reduce both power and running time. In this paper, we explore the performance of Java applications, studying how best to map application and virtual machine (JVM) threads to a multicore, multi-socket environment. We explore both the cost of separating JVM threads from application threads, and the opportunity to speed up or slow down the clock frequency of isolated threads. We perform experiments with the multi-threaded DaCapo benchmarks and pseudojbb2005 running on the Jikes Research Virtual Machine, on a dual-socket, 8-core Intel Nehalem machine to reveal several novel, and sometimes counter-intuitive, findings. We believe these insights are a first but important step towards understanding and optimizing managed language performance on modern hardware.

关键词： Performance Measurement Performance Analysis Multicore Managed languages Java

来源：评论

学校读者我要写书评

暂无评论

Exploiting Inter-Sequence Correlations for Program Behavior Prediction 12

Exploiting Inter-Sequence Correlations for Program Behavior ...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Wu, Bo Zhao, Zhijia Shen, Xipeng Jiang, Yunlian Gao, Yaoqing Silvera, Raul Coll William & Mary Williamsburg VA USA Google Mountain View CA USA IBM Toronto Lab Toronto ON Canada

ISBN: (纸本)9781450315616

Prediction of program dynamic behaviors is fundamental to program optimizations, resource management, and architecture reconfigurations. Most existing predictors are based on locality of program behaviors, subject to some inherent limitations. In this paper, we revisit the design philosophy and systematically explore a second source of clues: statistical correlations between the behavior sequences of different program entities. Concentrated on loops, we examine the correlations' existence, strength, and values in enhancing the design of program behavior predictors. We create the first taxonomy of program behavior sequence patterns. We develop a new form of predictors, named sequence predictors, to effectively translate the correlations into large-scope, proactive predictions of program behavior sequences. We demonstrate the usefulness of the prediction in dynamic version selection and loop importance estimation, showing 19% average speedup on a number of real-world utility applications. By taking scope and timing of behavior prediction as the first-order design objectives, the new approach overcomes limitations of existing program behavior predictors, opening up many new opportunities for runtime optimizations at various layers of computing.

关键词： languages Performance Program behavior prediction Dynamic optimizations Dynamic version selection Just-In-Time Compilation Sequence prediction Correlation

来源：评论

学校读者我要写书评

暂无评论

Automatically Enhancing Locality for Tree Traversals with Traversal Splicing 12

Automatically Enhancing Locality for Tree Traversals with Tr...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Jo, Youngjoon Kulkarni, Milind Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781450315616

Generally applicable techniques for improving temporal locality in irregular programs, which operate over pointerbased data structures such as trees and graphs, are scarce. Focusing on a subset of irregular programs, namely, tree traversal algorithms like Barnes-Hut and nearest neighbor, previous work has proposed point blocking, a technique analogous to loop tiling in regular programs, to improve locality. However point blocking is highly dependent on point sorting, a technique to reorder points so that consecutive points will have similar traversals. Performing this a priori sort requires an understanding of the semantics of the algorithm and hence highly application specific techniques. In this work, we propose traversal splicing, a new, general, automatic locality optimization for irregular tree traversal codes, that is less sensitive to point order, and hence can deliver substantially better performance, even in the absence of semantic information. For six benchmark algorithms, we show that traversal splicing can deliver single-thread speedups of up to 9.147 (geometric mean: 3.095) over baseline implementations, and up to 4.752 (geometric mean: 2.079) over point-blocked implementations. Further, we show that in many cases, automatically applying traversal splicing to a baseline implementation yields performance that is better than carefully hand-optimized implementations.

关键词： languages Algorithms Performance locality transformations temporal locality cache irregular programs tree traversals

来源：评论

学校读者我要写书评

暂无评论

AUTOMAN: A Platform for Integrating Human-Based and Digital Computation 12

AUTOMAN: A Platform for Integrating Human-Based and Digital ...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Barowy, Daniel W. Curtsinger, Charlie Berger, Emery D. McGregor, Andrew Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781450315616

Humans can perform many tasks with ease that remain difficult or impossible for computers. Crowdsourcing platforms like Amazon's Mechanical Turk make it possible to harness human-based computational power at an unprecedented scale. However, their utility as a general-purpose computational platform remains limited. The lack of complete automation makes it difficult to orchestrate complex or interrelated tasks. Scheduling more human workers to reduce latency costs real money, and jobs must be monitored and rescheduled when workers fail to complete their tasks. Furthermore, it is often difficult to predict the length of time and payment that should be budgeted for a given task. Finally, the results of human-based computations are not necessarily reliable, both because human skills and accuracy vary widely, and because workers have a financial incentive to minimize their effort. This paper introduces AUTOMAN, the first fully automatic crowdprogramming system. AUTOMAN integrates human-based computations into a standard programming language as ordinary function calls, which can be intermixed freely with traditional functions. This abstraction lets AUTOMAN programmers focus on their programming logic. An AUTOMAN program specifies a confidence level for the overall computation and a budget. The AUTOMAN runtime system then transparently manages all details necessary for scheduling, pricing, and quality control. AUTOMAN automatically schedules human tasks for each computation until it achieves the desired confidence level;monitors, reprices, and restarts human tasks as necessary;and maximizes parallelism across human workers while staying under budget.

关键词： languages Algorithms Human Factors Crowdsourcing programming languages Quality Control

来源：评论

学校读者我要写书评

暂无评论

Work-Stealing Without The Baggage 12

Work-Stealing Without The Baggage

引用

acm international conference on object oriented programming systems languages and Applications

作者： Kumar, Vivek Frampton, Daniel Blackburn, Stephen M. Grove, David Tardieu, Olivier Australian Natl Univ Canberra ACT 0200 Australia Microsoft Redmond WA USA IBM TJ Watson Res Yorktown Hts NY USA

ISBN: (纸本)9781450315616

Work-stealing is a promising approach for effectively exploiting software parallelism on parallel hardware. A programmer who uses work-stealing explicitly identifies potential parallelism and the runtime then schedules work, keeping otherwise idle hardware busy while relieving overloaded hardware of its burden. Prior work has demonstrated that work-stealing is very effective in practice. However, work-stealing comes with a substantial overhead: as much as 2x to 12x slowdown over orthodox sequential code. In this paper we identify the key sources of overhead in work-stealing schedulers and present two significant refinements to their implementation. We evaluate our work-stealing designs using a range of benchmarks, four different work-stealing implementations, including the popular fork-join framework, and a range of architectures. On these benchmarks, compared to orthodox sequential Java, our fastest design has an overhead of just 15%. By contrast, fork-join has a 2.3x overhead and the previous implementation of the system we use has an overhead of 4.1x. These results and our insight into the sources of overhead for work-stealing implementations give further hope to an already promising technique for exploiting increasingly available hardware parallelism.

关键词： Design languages Performance Scheduling Task Parallelism Work-Stealing X10 Managed languages

来源：评论

学校读者我要写书评

暂无评论

Elixir: A System for Synthesizing Concurrent Graph Programs 12

Elixir: A System for Synthesizing Concurrent Graph Programs

引用

acm international conference on object oriented programming systems languages and Applications

作者： Prountzos, Dimitrios Manevich, Roman Pingali, Keshav Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450315616

Algorithms in new application areas like machine learning and network analysis use "irregular" data structures such as graphs, trees and sets. Writing efficient parallel code in these problem domains is very challenging because it requires the programmer to make many choices: a given problem can usually be solved by several algorithms, each algorithm may have many implementations, and the best choice of algorithm and implementation can depend not only on the characteristics of the parallel platform but also on properties of the input data such as the structure of the graph. One solution is to permit the application programmer to experiment with different algorithms and implementations without writing every variant from scratch. Auto-tuning to find the best variant is a more ambitious solution. These solutions require a system for automatically producing efficient parallel implementations from high-level specifications. Elixir, the system described in this paper, is the first step towards this ambitious goal. Application programmers write specifications that consist of an operator, which describes the computations to be performed, and a schedule for performing these computations. Elixir uses sophisticated inference techniques to produce efficient parallel code from such specifications. We used Elixir to automatically generate many parallel implementations for three irregular problems: breadth-first search, single source shortest path, and betweenness-centrality computation. Our experiments show that the best generated variants can be competitive with handwritten code for these problems from other research groups;for some inputs, they even outperform the handwritten versions.

关键词： Algorithms languages Performance Verification Synthesis Compiler Optimization Concurrency Parallelism Amorphous Data-parallelism Irregular Programs Optimistic Parallelization

来源：评论

学校读者我要写书评

暂无评论

Uniting global and local context behavior with context petri nets

Uniting global and local context behavior with context petri...

引用

4th international Workshop on Context-oriented programming, COP'12 - Co-located with the 26th European conference on object-oriented programming, ECOOP'12

作者： Cardozo, Nicolás González, Sebastián Mens, Kim D'Hondt, Theo ICTEAM Université Catholique de Louvain Place Sainte-Barbe 2 1348 Louvain-la-Neuve Belgium Software Languages Lab. Vrije Universiteit Brussel Pleinlaan 2 1050 Brussels Belgium

ISBN: (纸本)9781450312769

Context-oriented programming enables adaptation of systems to their execution environment. Behavioral adaptations are defined in the system and then associated to a context. Such adaptations are made available at runtime when their context is deemed more appropriate by the execution environment. Context activation is reified using two techniques. Global to all running threads in the system, or local to a particular thread of execution. Providing one technique or the other may hinder the adaptable capabilities of the system. This paper extends the context Petri nets model to unify global and local context behavior. Global and local context behavior are represented as multicolored tokens in context Petri nets, by assigning a color to each thread in the system. By means of context Petri nets, context-oriented systems can unambiguously adapt their behavior globally, or to a particular thread of execution. Copyright © 2012 acm.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Scoping changes in self-supporting development environments using context-oriented programming

Scoping changes in self-supporting development environments ...

引用

4th international Workshop on Context-oriented programming, COP'12 - Co-located with the 26th European conference on object-oriented programming, ECOOP'12

作者： Lincke, Jens Hirschfeld, Robert Hasso-Plattner-Institut Universität Potsdam Germany

ISBN: (纸本)9781450312769

Interactive development in self-supporting systems like Smalltalk or the Lively Kernel allows for an explorative and direct development workflow. Because of the immediate and direct feedback loops, changes to core behavior can lead to accidentally breaking the programming tools themselves. By separating the tools from the objects they work on, this fatal self referentiality can be avoided, but at the expense of interactive development. In this paper we show how contextoriented programming (COP) can be used to separate tools from the objects under development. Instead of directly modifying meta-structures, changes should go into layers on top of these structures. Since layers can be scoped at run-time, changes do not affect the programming tools. We demonstrate this approach by showing examples of adapting core behavior in our self-supporting development environment Webwerkstatt with ContextJS, our COP extension for JavaScript. Copyright © 2012 acm.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

IFRit: Interference-Free Regions for Dynamic Data-Race Detection 12

IFRit: Interference-Free Regions for Dynamic Data-Race Detec...

引用

acm international conference on object oriented programming systems languages and Applications

作者： Effinger-Dean, Laura Lucia, Brandon Ceze, Luis Grossman, Dan Boehm, Hans-J Univ Washington Seattle WA 98195 USA HP Labs Palo Alto CA USA

ISBN: (纸本)9781450315616

We propose a new algorithm for dynamic data-race detection. Our algorithm reports no false positives and runs on arbitrary C and C++ code. Unlike previous algorithms, we do not have to instrument every memory access or track a full happens-before relation. Our data-race detector, which we call IFRit, is based on a run-time abstraction called an interference-free region (IFR). An IFR is an interval of one thread's execution during which any write to a specific variable by a different thread is a data race. We insert instrumentation at compile time to monitor active IFRs at run-time. If the runtime observes overlapping IFRs for conflicting accesses to the same variable in two different threads, it reports a race. The static analysis aggregates information for multiple accesses to the same variable, avoiding the expense of having to instrument every memory access in the program. We directly compare IFRit to FastTrack [10] and Thread-Sanitizer [25], two state-of-the-art fully-precise data-race detectors. We show that IFRit imposes a fraction of the overhead of these detectors. We show that for the PARSEC benchmarks, and several real-world applications, IFRit finds many of the races detected by a fully-precise detector. We also demonstrate that sampling can further reduce IFRit's performance overhead without completely forfeiting precision.

关键词： languages Algorithms Reliability data-race detection concurrency interference-free regions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共87页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：