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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

92 篇 期刊文献
74 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

150 篇 工学
- 117 篇 计算机科学与技术...
- 89 篇 软件工程
- 33 篇 电气工程
- 13 篇 信息与通信工程
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 网络空间安全
14 篇 理学
- 11 篇 数学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
4 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...
- 1 篇 药学(可授医学、理...
1 篇 文学
1 篇 军事学
- 1 篇 军事装备学

主题

169 篇 program optimiza...
17 篇 program transfor...
12 篇 program analysis
10 篇 performance
10 篇 partial evaluati...
9 篇 languages
8 篇 compilers
8 篇 code generation
7 篇 theory
6 篇 algorithms
6 篇 code motion
6 篇 data flow analys...
4 篇 theorem proving
4 篇 program synthesi...
4 篇 computational co...
4 篇 compiler
4 篇 java
4 篇 design
4 篇 functional progr...
4 篇 dynamic compilat...

机构

4 篇 johannes kepler ...
4 篇 suny stony brook...
2 篇 malardalen univ ...
2 篇 univ melbourne d...
2 篇 leiden univ leid...
2 篇 oracle labs linz...
2 篇 department of co...
2 篇 lawrence berkele...
2 篇 cornell univ dep...
2 篇 jiangnan univ sc...
2 篇 purdue univ sch ...
2 篇 mit csail cambri...
2 篇 oracle labs
2 篇 univ washington ...
2 篇 natl univ def te...
2 篇 univ dortmund d-...
2 篇 univ illinois de...
2 篇 univ paris est c...
2 篇 university of ca...
1 篇 samara state tec...

作者

6 篇 knoop j
3 篇 pingali k
3 篇 liu yanhong a.
3 篇 leopoldseder dav...
3 篇 shen xipeng
3 篇 steffen b
3 篇 kloibhofer sebas...
2 篇 jason cong
2 篇 rubio-gonzalez c...
2 篇 lu pingjing
2 篇 wang dengfeng
2 篇 glück r
2 篇 pereira rui
2 篇 hough david
2 篇 bilardi g
2 篇 bonetta daniele
2 篇 saraiva joao
2 篇 hu zhenjiang
2 篇 kahan william
2 篇 de gonzalo simon...

语言

162 篇 英文
6 篇 其他
1 篇 中文

检索条件"主题词=Program Optimization"

共 169 条记录，以下是81-90 订阅

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

详细简洁

排序：

Automatic Array Transformation to Columnar Storage at Run Time 19

Automatic Array Transformation to Columnar Storage at Run Ti...

引用

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

作者： Makor, Lukas Kloibhofer, Sebastian Leopoldseder, David Bonetta, Daniele Stadler, Lukas Mossenbock, Hanspeter Johannes Kepler Univ Linz Linz Austria Oracle Labs Linz Austria Oracle Labs Amsterdam Netherlands

ISBN: (纸本)9781450396967

Today's huge memories make it possible to store and process large data structures in memory instead of in a database. Hence, accesses to this data should be optimized, which is normally relegated either to the runtimes and compilers or is left to the developers, who often lack the knowledge about optimization strategies. As arrays are often part of the language, developers frequently use them as an underlying storage mechanism. Thus, optimization of arrays may be vital to improve performance of data-intensive applications. While compilers can apply numerous optimizations to speed up accesses, it would also be beneficial to adapt the actual layout of the data in memory to improve cache utilization. However, runtimes and compilers typically do not perform such memory layout optimizations. In this work, we present an approach to dynamically perform memory layout optimizations on arrays of objects to transform them into a columnar memory layout, a storage layout frequently used in analytical applications that enables faster processing of read-intensive workloads. By integration into a state-of-the-art JavaScript runtime, our approach can speed up queries for large workloads by up to 9x, where the initial transformation overhead is amortized over time.

关键词： Columnar Storage Array Storage program optimization Dynamic Language Dynamic Compilation

来源：评论

学校读者我要写书评

暂无评论

Method Bundles 17

Method Bundles

引用

17th ACM SIGPLAN International Conference on Software Language Engineering (SLE)

作者： Racordon, Dimi Abrahams, Dave Ecole Polytech Fed Lausanne Lausanne Switzerland Adobe Atlanta GA USA

ISBN: (纸本)9798400711800

Performance-critical systems commonly optimize memory use and locality by selecting among multiple variants of a single logical operation. Algorithm developers then typically rely on ad-hoc API patterns or naming conventions to distinguish the variants. Unfortunately, this practice suffers from poor ergonomics. Users are compelled to understand the conventions and carefully consider the signatures and documentation of different variants, which creates drag on development and maintenance. Instead, we propose a language construct bundling algorithm variants having well-defined semantic relationships under a single name. This approach eliminates boilerplate, reduces cognitive overhead by consolidating APIs, and unlocks compiler optimizations.

关键词： program optimization overloading user experience

来源：评论

学校读者我要写书评

暂无评论

Optimizing Data Plane programs for the Network

Optimizing Data Plane Programs for the Network

引用

ACM SIGCOMM Workshop on Networking and programming Languages (NetPL)

作者： Krude, Johannes Eichholz, Matthias Winck, Maximilian Wehrle, Klaus Mezini, Mira Rhein Westfal TH Aachen Aachen Germany Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781450368773

With the move of Software-defined networking from fixed to programmable data planes, network functions are written with P4 or eBPF for targets such as programmable switches, CPU based flow processors [5] and commodity CPUs [7]. These data plane programs are, however, limited in per-packet time budget [3] (e.g., 67.2 ns at 10GbE) and program size, making program optimization imperative [6]. Existing approaches focus on optimizing the distribution of flow rules in fixed data planes [4] or they are limited to a single switch [2]. We see great potential in integrating the network topology into program optimization.

关键词： programmable switches eBPF program optimization

来源：评论

学校读者我要写书评

暂无评论

From DFA-frameworks to DFA-generators: A unifying multiparadigm approach 5th

引用

Joint European Conference on Theory and Practice of Software (ETAPS 99)

作者： Knoop, J Univ Dortmund D-44221 Dortmund Germany

ISBN: (纸本)3540657037

program analysis is still characterized by paradigm-specific approaches, which ate developed to accommodate to the diversities of the different programming paradigms as e.g. the imperative, object-oriented, of parallel one. Switching between paradigms or transferring analyses across paradigm boundaries requires usually detailed knowledge of the peculiarities of the various approaches. This complicates both the reuse of analyses and the proofs of their correctness. On the other hand, abstract interpretation provides a unifying access to program analysis. In this article we exploit this for the construction of program analysis generators based on a uniform design principle. Basically, we proceed by extracting the abstract kernel from the standard analysis framework, which we then consider under a generic perspective. We show that there are concrete instances in such different paradigms as those above. As a by-product their decomposition into a "theoretical" and "practical" part which are specificational and computational in nature, reveals the aforementioned design principle. The frameworks and their respective generators, which can be fed by concise specifications, can thereby be considered black-boxes: analysis designers only need to know of the (quite similar) interfaces. The proof of correctness or even precision of a generated algorithm with respect to a specific property reduces to checking the premises of a few theorems. This considerably eases the construction of analyses within a specific paradigm as well as the snitch between and the transfer of analyses to other paradigms.

关键词： program optimization abstract interpretation data-flow analysis (DFA) DFA-frameworks DFA-generators coincidence theorems intraprocedural interprocedural parallel object-oriented conditional DFA

来源：评论

学校读者我要写书评

暂无评论

Uniform equivalence of logic programs under the stable model semantics

引用

19th International Conference on Logic programming

作者： Eiter, T Fink, M Vienna Univ Technol Inst Informat Syst Abt Wissensbasierte Syst A-1040 Vienna Austria

ISBN: (纸本)3540206426

In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P boolean OR R and Q boolean OR R have the same stable models for any other program R. This property strengthens equivalence of P and Q with respect to stable models (which is the particular case for R = 0), and has an application in program optimization. In this paper, we consider the more liberal notion of uniform equivalence, in which R ranges only over the sets of facts rather than all sets of rules. This notion, which is well-known, is particularly useful for assessing whether programs P and Q are equivalent as components in a logic program which is modularly structured. We provide semantical characterizations of uniform equivalence for disjunctive logic programs and some restricted classes, and analyze the computational cost of uniform equivalence in the propositional (ground) case. Our results, which naturally extend to answer set semantics, complement the results on strong equivalence of logic programs and pave the way for optimizations in answer set solvers as a tool for input-based problem solving.

关键词： uniform equivalence strong equivalence stable models answer set semantics computational complexity program optimization

来源：评论

学校读者我要写书评

暂无评论

Exploration of Spatial Pipeline Computation for Heuristic Access Coarse-Grained Reconfigurable Cells

引用

International Conference on Mechanical Engineering and Technology (ICMET 2011)

作者： Liu, Xinning Ge, Wei Du, Yue Southeast Univ Natl ASIC Syst Engn Res Ctr Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9783642273285;9783642273292

Spatial pipelined approach can be an effective technique for efficient improvement of coarse-grained reconfigurable cells. Take advantage of the characteristics, data-driven and "shadow variable", of Dynamic Giant Reconfigurable Cells (DGRC). This paper shows the exploration of spatial computation approach. Experimental results show that the proposed spatial pipeline approach can achieve the highest 5x times improvement in performance and reduce the configuration resources.

关键词： spatial pipeline computation heuristic access coarse-grained reconfigurable program optimization

来源：评论

学校读者我要写书评

暂无评论

Helping programmers Improve the Energy Efficiency of Source Code 17

Helping Programmers Improve the Energy Efficiency of Source ...

引用

IEEE/ACM 39th International Conference on Software Engineering Companion (ICSE-C)

作者： Pereira, Rui Carcao, Tiago Couto, Marco Cunha, Jacome Fernandes, Joao Paulo Saraiva, Joao Univ Minho HASLab INESC TEC Braga Portugal Univ Nova Lisboa NOVA LINCS DI FCT Lisbon Portugal Univ Coimbra CISUC Release LISP Coimbra Portugal

ISBN: (纸本)9781538615898

This paper briefly proposes a technique to detect energy inefficient fragments in the source code of a software system. Test cases are executed to obtain energy consumption measurements, and a statistical method, based on spectrum-based fault localization, is introduced to relate energy consumption to the system's source code. The result of our technique is an energy ranking of source code fragments pointing developers to possible energy leaks in their code.

关键词： Green Computing program optimization Fault Localization

来源：评论

学校读者我要写书评

暂无评论

Autobahn 2.0: Minimizing Bangs while Maintaining Performance (System Demonstration) 11

Autobahn 2.0: Minimizing Bangs while Maintaining Performance...

引用

Haskell Conference

作者： Sun, Marilyn Fisher, Kathleen Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781450358354

Lazy evaluation has many advantages, but it can cause bad performance. Consequently, Haskell allows users to force eager evaluation at certain program points by inserting strictness annotations, known and written as bangs (!). Unfortunately, manual bang placement is difficult. Autobahn 1.0 uses a genetic algorithm to infer bang annotations that improve performance. However, Autobahn 1.0 often generates large numbers of superfluous bangs, which is problematic because users must inspect each such bang to determine whether it is safe. We introduce Autobahn 2.0, which uses GHC profiling information to reduce the number of superfluous bangs. When evaluated on the NoFib benchmark suite, Autobahn 2.0 reduced the number of inferred bangs by 90.2% on average, while only degrading program performance by 15.7% compared with the performance produced by Autobahn 1.0. In a case study on a garbage collection simulator, Autobahn 2.0 eliminated 81.8% of the recommended bangs, with the same 15.7% optimization degradation.

关键词： program optimization Lazy Evaluation Bang Patterns Genetic Algorithms

来源：评论

学校读者我要写书评

暂无评论

Compile-Time optimization of the Energy Consumption of Numerical Computations 21

Compile-Time Optimization of the Energy Consumption of Numer...

引用

21st ACM International Conference on Computing Frontiers (CF)

作者： Ben Khalifa, Dorra Martel, Matthieu Univ Toulouse Federat ENAC ISAE SUPAERO ONERA Toulouse France Univ Perpignan LAMPS Lab Perpignan France Numalis Montpellier France

ISBN: (纸本)9798400704925

Over the past decade, precision tuning has become one of the key techniques for achieving significant gains in performance and energy efficiency. This process consists of substituting smaller data types to the original data types assigned to floating-point variables in numerical programs in such a way that accuracy requirements remain fulfilled. In this article, we discuss the time and energy savings achieved using our precision tuning tool, POPiX. We validate our results on a set of numerical benchmarks covering various fields.

关键词： Mixed Precision Computer Arithmetic program optimization Numerical Accuracy

来源：评论

学校读者我要写书评

暂无评论

Exocompilation for Productive programming of Hardware Accelerators 2022

Exocompilation for Productive Programming of Hardware Accele...

引用

43rd ACM SIGPLAN International Conference on programming Language Design and Implementation (PLDI)

作者： Ikarashi, Yuka Bernstein, Gilbert Louis Reinking, Alex Genc, Hasan Ragan-Kelley, Jonathan MIT CSAIL Cambridge MA 02139 USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450392655

High-performance kernel libraries are critical to exploiting accelerators and specialized instructions in many applications. Because compilers are difficult to extend to support diverse and rapidly-evolving hardware targets, and automatic optimization is often insufficient to guarantee state-of-the-art performance, these libraries are commonly still coded and optimized by hand, at great expense, in low-level C and assembly. To better support development of high-performance libraries for specialized hardware, we propose a new programming language, Exo, based on the principle of exocompilation: externalizing target-specific code generation support and optimization policies to user-level code. Exo allows custom hardware instructions, specialized memories, and accelerator configuration state to be defined in user libraries. It builds on the idea of user scheduling to externalize hardware mapping and optimization decisions. Schedules are defined as composable rewrites within the language, and we develop a set of effect analyses which guarantee program equivalence and memory safety through these transformations. We show that Exo enables rapid development of state-of-the-art matrix-matrix multiply and convolutional neural network kernels, for both an embedded neural accelerator and x86 with AVX-512 extensions, in a few dozen lines of code each.

关键词： program optimization hardware accelerators user-schedulable languages instruction abstraction scheduling user-extensible backend & scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：