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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Run-Time Data Analysis to Drive Compiler optimizations

Run-Time Data Analysis to Drive Compiler Optimizations

引用

International Conference on Systems, programming, Languages, and Applications: Software for Humanity (SPLASH)

作者： Kloibhofer, Sebastian Johannes Kepler Univ Linz Linz Austria

ISBN: (纸本)9781450390880

Dynamic compilers collect a variety of information to optimize programs and achieve peak performance. Nevertheless, particularly in data-heavy applications, analysis of the processed data-data structures, metrics, relations-could enable additional optimizations in terms of access patterns and data locality. Query planning in database systems is one source of inspiration, but due to the required overhead to collect such information, it is infeasible in dynamic compilers. With this project, we propose integrating data analysis into a dynamic runtime to speed up big data applications. The goal is to use the detailed run-time information for speculative compiler optimizations based on the shape and complexion of the data to improve performance.

关键词： Dynamic compilation Compiler optimization Data analysis program optimization

来源：评论

学校读者我要写书评

暂无评论

Implementation of the sound classification module on the platform with limited resources

Implementation of the sound classification module on the pla...

引用

Zooming Innovation in Consumer Technologies Conference (ZINC)

作者： Kaprocki, Nives Pekez, Nenad Kovacevic, Jelena RT RK Inst Comp Based Syst LLC Novi Sad Serbia Fac Tech Sci Elect & Comp Engn Dept Novi Sad Serbia

ISBN: (纸本)9781538649275

There is a growing trend of using algorithms based on deep and machine learning in consumer devices, which imposes a challenge to the system's development because of the limited amount of resources in an embedded device. This paper presents integration of the sound classification module based on machine learning into a home audio system. The additional module enables dynamic change of processing controls according to the resulting confidence scores which indicate whether the current audio is speech, music or background noise. Main challenge of this paper is overcoming real-time processing constraints and embedded system's resource limitations. Results show that the sound classification module has been successfully integrated and produces the correct output.

关键词： home audio system digital signal processing program optimization sound classification

来源：评论

学校读者我要写书评

暂无评论

Equivalences in Answer-Set programming by Countermodels in the Logic of Here-and-There

Equivalences in Answer-Set Programming by Countermodels in t...

引用

24th International Conference on Logic programming (ICLP)

作者： Fink, Michael Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783540899815

In Answer-Set programming different notions of equivalence, Such as the prominent notions of strong and uniform equivalence, have been studied and characterized by various selections of models in the logic of Here-and-There (HT). For uniform equivalence however, Correct characterizations in terms of HT-models can only be obtained for finite theories, respectively programs. In this paper, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. This result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HT-models and countermodels (so-called equivalence interpretations), which are lifted to first-order theories Under a very general semantics given in terms of a quantified version of HT. We show that countermodels exhibit expedient properties like I simplified treatment of extended signatures, and provide further results for non-ground logic programs. In particular, uniform equivalence coincides under open and ordinary answer-set semantics, and for finite non-ground programs Under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HT-models of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.

关键词： answer-set programming uniform equivalence knowledge representation program optimization

来源：评论

学校读者我要写书评

暂无评论

Liveness-Driven Random program Generation 27th

Liveness-Driven Random Program Generation

引用

27th International Symposium on Logic-Based program Synthesis and Transformation (LOPSTR)

作者： Barany, Gergo INRIA Paris France

ISBN: (纸本)9783319944609;9783319944593

Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing. However, existing random program generators may generate large amounts of dead code (computations whose result is never used). This leaves relatively little code to exercise a target compiler's more complex optimizations. To address this shortcoming, we introduce liveness-driven random program generation. In this approach the random program is constructed bottom-up, guided by a simultaneous structural data-flow analysis to ensure that the generator never generates dead code. The algorithm is implemented as a plugin for the Frama-C framework. We evaluate it in comparison to Csmith, the standard random C program generator. Our tool generates programs that compile to more machine code with a more complex instruction mix.

关键词： Code generation Random testing Data-flow analysis program optimization

来源：评论

学校读者我要写书评

暂无评论

On the Transformational Implementation approach to programming 2

On the Transformational Implementation approach to programmi...

引用

2nd International Conference on Software Engineering, ICSE 1976

作者： Balzer, Robert Goldman, Neil Wile, David USC/Information Sciences Institute 4676 Admiralty Way Marina del ReyCA United States

This paper discusses various approaches to programming, defining and highlighting Transformational Implementation;it then examines the basic causes of the software problem and their resolution with Transformational Implementation. Finally, an example illustrating the approach is given. © 1976 IEEE Computer Society. All rights reserved.

关键词： Abstract programming Generators Implementation techniques program optimization program transformations Transformational implementation

来源：评论

学校读者我要写书评

暂无评论

Stacked borrows: An aliasing model for rust

Stacked borrows: An aliasing model for rust

引用

Proceedings of the ACM on programming Languages

作者： Jung, Ralf Dang, Hoang-Hai Kang, Jeehoon Dreyer, Derek Mozilla United States MPI-SWS Saarland Informatics Campus Germany KAIST Korea Republic of

Type systems are useful not just for the safety guarantees they provide, but also for helping compilers generate more efficient code by simplifying important program analyses. In Rust, the type system imposes a strict discipline on pointer aliasing, and it is an express goal of the Rust compiler developers to make use of that alias information for the purpose of program optimizations that reorder memory accesses. The problem is that Rust also supports unsafe code, and programmers can write unsafe code that bypasses the usual compiler checks to violate the aliasing discipline. To strike a balance between optimizations and unsafe code, the language needs to provide a set of rules such that unsafe code authors can be sure, if they are following these rules, that the compiler will preserve the semantics of their code despite all the optimizations it is doing. In this work, we propose Stacked Borrows, an operational semantics for memory accesses in Rust. Stacked Borrows defines an aliasing discipline and declares programs violating it to have undefined behavior, meaning the compiler does not have to consider such programs when performing optimizations. We give formal proofs (mechanized in Coq) showing that this rules out enough programs to enable optimizations that reorder memory accesses around unknown code and function calls, based solely on intraprocedural reasoning. We also implemented this operational model in an interpreter for Rust and ran large parts of the Rust standard library test suite in the interpreter to validate that the model permits enough real-world unsafe Rust code. © 2020 Copyright held by the owner/author(s).

关键词： program compilers Computer programming languages Semantics Theorem proving Alias analysis Operational model Operational semantics program optimization program transformations Rust Safety guarantees Standard libraries

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Emulator for Shuffle Synthesis on the NVIDIA PTX Code 2023

A Symbolic Emulator for Shuffle Synthesis on the NVIDIA PTX ...

引用

32nd ACM SIGPLAN International Conference on Compiler Construction (CC)

作者： Matsumura, Kazuaki De Gonzalo, Simon Garcia Pena, Antonio J. Barcelona Supercomp Ctr Barcelona Spain Sandia Natl Labs Atlanta GA USA

ISBN: (纸本)9798400700880

Various kinds of applications take advantage of GPUs through automation tools that attempt to automatically exploit the available performance of the GPU's parallel architecture. Directive-based programming models, such as OpenACC, are one such method that easily enables parallel computing by just adhering code annotations to code loops. Such abstract models, however, often prevent programmers from making additional low-level optimizations to take advantage of the advanced architectural features of GPUs because the actual generated computation is hidden from the application developer. This paper describes and implements a novel flexible optimization technique that operates by inserting a code emulator phase to the tail-end of the compilation pipeline. Our tool emulates the generated code using symbolic analysis by substituting dynamic information and thus allowing for further low-level code optimizations to be applied. We implement our tool to support both CUDA and OpenACC directives as the frontend of the compilation pipeline, thus enabling low-level GPU optimizations for OpenACC that were not previously possible. We demonstrate the capabilities of our tool by automating warp-level shuffle instructions that are difficult to use by even advanced GPU programmers. Lastly, evaluating our tool with a benchmark suite and complex application code, we provide a detailed study to assess the benefits of shuffle instructions across four generations of GPU architectures.

关键词： Compiler Symbolic Analysis Code Generation GPUs NVIDIA PTX program optimization

来源：评论

学校读者我要写书评

暂无评论

TO COPY OR NOT TO COPY - A COMPILE-TIME TECHNIQUE FOR ASSESSING WHEN DATA COPYING SHOULD BE USED TO ELIMINATE CACHE CONFLICTS 93

TO COPY OR NOT TO COPY - A COMPILE-TIME TECHNIQUE FOR ASSESS...

引用

Supercomputing 93 Conference

作者： TEMAM, O GRANSTON, ED JALBY, W LEIDEN UNIV DEPT COMP SCIDIV HIGH PERFORMANCE COMP2333 CA LEIDENNETHERLANDS

来源：评论

学校读者我要写书评

暂无评论

Elimination of redundant polymorphism queries in object-oriented design patterns

Elimination of redundant polymorphism queries in object-orie...

引用

作者： Brown, Rhodes Hart Fraser University of Victoria

学位级别：master

This thesis presents an investigation of two new techniques for eliminating redundancy inherent in uses of dynamic polymorphism operations such as virtual dispatches and type tests. The novelty of both approaches derives from taking a subject-oriented perspective which considers multiple applications to the same run-time values, as opposed to previous site-oriented reductions which treat each operation independently. The first optimization (redundant polymorphism elimination ?– RPE) targets reuse over intraprocedural contexts, while the second (instance-specializing polymorphism elimination ?– ISPE) considers repeated uses of the same fields over the lifetime of individual object and class instances. In both cases, the specific formulations of the techniques are guided by a study of intentionally polymorphic constructions as seen in applications of common object-oriented design patterns. The techniques are implemented in Jikes RVM for the dynamic polymorphism operations supported by the Java programming language, namely virtual and interface dispatching, type tests, and type casts. In studying the complexities of Jikes RVM''s adaptive optimization system and run-time environment, an improved evaluation methodology is derived for characterizing the performance of adaptive just-in-time compilation strategies. This methodology is applied to demonstrate that the proposed optimization techniques yield several significant improvements when applied to the DaCapo benchmarks. Moreover, dramatic improvements are observed for two programs designed to highlight the costs of redundant polymorphism. In the case of the intraprocedural RPE technique, a speed up of 14% is obtained for a program designed to focus on the costs of polymorphism in applications of the Iterator pattern. For the instance-specific technique, an improvement of 29% is obtained for a program designed to focus on the costs inherent in constructions similar to the Decorator pattern. Further analyses also point

关键词： design patterns virtual dispatch program optimization polymorphism object-oriented redundancy elimination UVic Subject Index Sciences and Engineering Applied Sciences Computer science

来源：评论

学校读者我要写书评

暂无评论

Towards Automatic Block Size Tuning for Image Processing Algorithms on CUDA

Towards Automatic Block Size Tuning for Image Processing Alg...

引用

17th International Conference on Software Technologies (ICSOFT)

作者： Guerfi, Imene Kriaa, Lobna Saidane, Leila Azouz Univ Manouba Natl Sch Comp Sci ENSI CRISTAL Lab RAMSIS Pole Manouba Tunisia

ISBN: (纸本)9789897585883

With the growing amount of data, computational power has became highly required in all fields. To satisfy these requirements, the use of GPUs seems to be the appropriate solution. But one of their major setbacks is their varying architectures making writing efficient parallel code very challenging, due to the necessity to master the GPU's low-level design. CUDA offers more flexibility for the programmer to exploit the GPU's power with ease. However, tuning the launch parameters of its kernels such as block size remains a daunting task. This parameter requires a deep understanding of the architecture and the execution model to be well-tuned. Particularly, in the Viola-Jones algorithm, the block size is an important factor that improves the execution time, but this optimization aspect is not well explored. This paper aims to offer the first steps toward automatically tuning the block size for any input without having a deep knowledge of the hardware architecture, which ensures the automatic portability of the performance over different GPUs architectures. The main idea is to define techniques on how to get the optimum block size to achieve the best performance. We pointed out the impact of using static block size for all input sizes on the overall performance. In light of the findings, we presented two dynamic approaches to select the best block size suitable to the input size. The first one is based on an empirical search;this approach provides the optimal performance;however, it is tough for the programmer, and its deployment is time-consuming. In order to overcome this issue, we proposed a second approach, which is a model that automatically selects a block size. Experimental results show that this model can improve the execution time by up to 2.5x over the static approach.

关键词： GPU Computing Parallel programming program optimization Auto-tuning and Face Detection

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：