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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

212 篇 会议
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

144 篇 工学
- 88 篇 计算机科学与技术...
- 67 篇 软件工程
- 47 篇 电气工程
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 10 篇 动力工程及工程热...
- 9 篇 石油与天然气工程
- 8 篇 电子科学与技术（可...
- 6 篇 化学工程与技术
- 6 篇 航空宇航科学与技...
- 5 篇 材料科学与工程（可...
- 4 篇 力学（可授工学、理...
- 4 篇 机械工程
- 4 篇 交通运输工程
- 4 篇 核科学与技术
- 3 篇 土木工程
- 3 篇 安全科学与工程
- 2 篇 仪器科学与技术
- 2 篇 冶金工程
- 2 篇 建筑学
41 篇 理学
- 30 篇 数学
- 10 篇 物理学
- 4 篇 系统科学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 地球物理学
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
1 篇 军事学

主题

32 篇 optimization
9 篇 program processo...
9 篇 code generation
8 篇 hardware
8 篇 testing
7 篇 power generation
5 篇 design optimizat...
5 篇 computer archite...
5 篇 energy storage
5 篇 optimization met...
4 篇 computer science
4 篇 compilers
4 篇 parallel process...
4 篇 embedded systems
4 篇 java
4 篇 wind power gener...
4 篇 decoding
4 篇 costs
4 篇 genetic algorith...
4 篇 generators

机构

3 篇 imec leuven
3 篇 tu dortmund univ...
2 篇 inria
2 篇 technion israel ...
2 篇 school of engine...
2 篇 penn state univ ...
2 篇 bell laboratorie...
2 篇 school of engine...
2 篇 penn state univ ...
2 篇 school of electr...
1 篇 cnr ist motori n...
1 篇 xian univ sci & ...
1 篇 katholieke univ ...
1 篇 tohoku univ grad...
1 篇 information tech...
1 篇 queens univ dept...
1 篇 univ waterloo wa...
1 篇 department of au...
1 篇 5gic&6gic instit...
1 篇 piment laborator...

作者

3 篇 naujokat stefan
2 篇 rani chinnappa n...
2 篇 chee yen leow
2 篇 brenchley je
2 篇 h. de man
2 篇 yang lei
2 篇 steffen bernhard
2 篇 gutshall kr
2 篇 margaria tiziana
2 篇 sheintuch moshe
2 篇 maranas cd
2 篇 simakov david s....
2 篇 moore gl
2 篇 g. goossens
2 篇 rajeshkumar muth...
2 篇 t. nageswara pra...
1 篇 guo panhua
1 篇 natoli jy
1 篇 zheng xiaoping
1 篇 karras aristeidi...

语言

216 篇 英文
4 篇 其他

检索条件"任意字段=7th International Symposium on Code Generation and Optimization"

共 220 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of the 2009 CGO - 7th international symposium on code generation and optimization

Proceedings of the 2009 CGO - 7th International Symposium on...

引用

7th international symposium on code generation and optimization, CGO 2009

ISBN: (纸本)9780769535760

the proceedings contain 26 papers. the topics discussed include: an evolution of general purpose processing: reconfigurable logic computing;the next generation of compilers;communication-sensitive static dataflow for parallel message passing applications;reducing memory ordering overheads in software transactional memory;detecting and eliminating potential violations of sequential consistency for concurrent C/C++ programs;ESoftCheck: removal of non-vital checks for fault tolerance;alchemist: a transparent dependence distance profiling infrastructure;workload reduction for multi-input feedback-directed optimization;profiling k-iteration paths: a generalization of the Ball-Larus profiling algorithm;automatic feature generation for machine learning based optimizing compilation;revisiting out-of-SSA translation for correctness, code quality and efficiency;wave propagation and deep propagation for pointer analysis;and a fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-Input Learning and Discriminative Prediction in Evolvable Virtual Machines 09

Cross-Input Learning and Discriminative Prediction in Evolva...

引用

7th international symposium on code generation and optimization

作者： Mao, Feng Shen, Xipeng Coll William & Mary Dept Comp Sci Williamsburg VA 23185 USA

ISBN: (纸本)9780769535760

Modern languages like Java and C# rely on dynamic optimizations in virtual machines for better performance. Current dynamic optimizations are reactive. their performance is constrained by the dependence on runtime sampling and the partial knowledge of the execution. this work tackles the problems by developing a set of techniques that make a virtual machine evolve across production runs. the virtual machine incrementally learns the relation between program inputs and optimization strategies so that it proactively predicts the optimizations suitable for a new run. the prediction is discriminative, guarded by confidence measurement through dynamic self-evaluation. We employ an enriched extensible specification language to resolve the complexities in program inputs. these techniques, implemented in Jikes RVM, produce significant performance improvement on a set of Java applications.

关键词： Cross-Input Learning Java Virtual Machine Evolvable Computing Adaptive optimization Input-Centric optimization Discriminative Prediction

来源：评论

学校读者我要写书评

暂无评论

Transparent Debugging of Dynamically Optimized code 09

Transparent Debugging of Dynamically Optimized Code

引用

7th international symposium on code generation and optimization

作者： Kumar, Naveen Childers, Bruce R. Soffa, Mary Lou Univ Pittsburgh Pittsburgh PA 15260 USA Univ Virginia Charlottesville VA USA

ISBN: (纸本)9780769535760

Debugging programs at the source level is essential in the software development cycle. With the growing importance of dynamic optimization, there is a clear need,for debugging support in the presence of runtime code transformation. this paper presents a framework, called DeDoc, and lightweight techniques that allow debugging at the source level for programs that have been transformed by a trace-based binary dynamic optimizer: Our techniques provide full transparency and hide from the user the effect of dynamic optimizations on code statements and data values. We describe and evaluate an implementation of DeDoc and its techniques that interface a dynamic optimizer with a native debugger. Our experimental results indicate that DeDoc is able to report over 96% of values, that are otherwise not reportable due to code transformations, and incurs less than 1% performance overhead.

关键词： Dynamic optimization

来源：评论

学校读者我要写书评

暂无评论

Two-Level Dictionary code Compression: a New Scheme to Improve Instruction code Density of Embedded Applications 09

Two-Level Dictionary Code Compression: a New Scheme to Impro...

引用

7th international symposium on code generation and optimization

作者： Collin, Mikael Brorsson, Mats Royal Inst Technol KTH Sch Informat & Commun Technol Stockholm Sweden

ISBN: (纸本)9780769535760

Dictionary code compression is a technique which has been studied as a method to reduce the energy consumed in the instruction fetch path of processors. Instructions or instruction sequences in the code are replaced with short code words. these code words are later used to index a dictionary which contains the original uncompressed instruction or an entire sequence. In this paper, we present a new method which improves on code density compared to previously published dictionary methods. It uses a two-level dictionary design and is capable of handling compression of both individual instructions and code sequences of 2-16 instructions. the two dictionaries are in separate pipeline stages and work together to decompress sequences and instructions. the impact on storage size for the dictionaries is rather small as the sequences in the dictionary are stored as individually compressed instructions, instead of normal instructions. Compared to previous dictionary code compression methods we achieve improved dynamic compression rate, potential for better performance with reasonable static compression rate and with still small dictionary size suitable for context switching.

关键词： Dictionary code compression code density-optimization code generation

来源：评论

学校读者我要写书评

暂无评论

OptiScope: Performance Accountability for Optimizing Compilers 09

OptiScope: Performance Accountability for Optimizing Compile...

引用

7th international symposium on code generation and optimization

作者： Moseley, Tipp Grunwald, Dirk Peri, Ramesh Univ Colorado Dept Comp Sci Boulder CO 80309 USA Intel Corp Hillsboro OR 97124 USA

ISBN: (纸本)9780769535760

Compilers employ many aggressive code transformations to achieve highly optimized code. However, because of complex target architectures and unpredictable optimization interactions, these transformations may not always be beneficial. Current analysis methods measure performance at the application level and ignore optimization effects at the function and loop level. To better measure and understand these effects, we present OptiScope, a compiler independent tool to identify performance opportunities by comparing programs built with different compilers or optimization fags. the analysis includes hundreds of different metrics and uses a novel loop correlation technique for binary programs (produced from the same source by different compilers) to isolate measurements to specific regions. We present several case studies using OptiScope to identify key differences between different compiler suites, versions, and target architectures. the examples demonstrate performance improvement opportunities between 32.5% to 893% on select regions of SPEC 2006 benchmarks.

关键词： Optimizing compilers Program processors Testing Hardware Computer science Computer architecture Performance analysis Current measurement optimization methods Out of order

来源：评论

学校读者我要写书评

暂无评论

Computer generation of General Size Linear Transform Libraries 09

Computer Generation of General Size Linear Transform Librari...

引用

7th international symposium on code generation and optimization

作者： Voronenko, Yevgen de Mesmay, Frederic Pueschel, Markus Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9780769535760

the development of high-performance libraries has become extraordinarily difficult due to multiple processor cores, vector instruction sets, and deep memory hierarchies. Often, the library has to be reimplemented and reoptimized, when a new platform is released. In this paper we show how to automatically generate general input-size libraries for the domain of linear transforms. the input to our generator is a formal specification of the transform and the recursive algorithms the library should use;the output is a library that supports general input size, is vectorized and multithreaded, provides an adaptation mechanism for the memory hierarchy, and has excellent performance, comparable to or better than the best human-written libraries. Further, we show that our library generator enables various customizations;one example is the generation of Java libraries.

关键词： SIMD vector instructions multithreading automatic performance tuning Linear transform domain-specific language program generation DFT discrete Fourier transform

来源：评论

学校读者我要写书评

暂无评论

Fast Track: A Software System for Speculative Program optimization 09

Fast Track: A Software System for Speculative Program Optimi...

引用

7th international symposium on code generation and optimization

作者： Kelsey, Kirk Bai, Tongxin Ding, Chen Hang, Chengliang Univ Rochester Dept Comp Sci Rochester NY 14627 USA Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9780769535760

Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the correctness of the speculative code by running the original program on multiple processors. We present the interface design and system implementation for Fast Track. It lets a programmer or a profiling tool mark fast-track code regions and uses a run-time system to manage the parallel execution of the speculative process and its checking processes and ensures the correct display of program outputs. the core of the run-time system is a novel concurrent algorithm that balances exploitable parallelism and available processors when the fast track is too slow or too fast. the programming interface closely affects the run-time support. Our system permits both explicit and implicit end markers for speculatively optimized code regions as well as extensions that allow the use of multiple tracks and user defined correctness checking. We discuss the possible uses of speculative optimization and demonstrate the effectiveness of our prototype system by examples of unsafe semantic optimization and a general system for fast memory-safety checking, which is able to reduce the checking time by factors between 2 and 7 for large sequential code on a 8-CPU system.

关键词： Software systems Tracking loops Programming profession Runtime Hardware Kirk field collapse effect Computer science Displays Parallel processing Prototypes

来源：评论

学校读者我要写书评

暂无评论

Workload Reduction for Multi-Input Feedback-Directed optimization 09

Workload Reduction for Multi-Input Feedback-Directed Optimiz...

引用

7th international symposium on code generation and optimization

作者： Berube, Paul Amaral, Jose Nelson Ho, Rayson Silvera, Raul Univ Alberta Dept Comp Sci Edmonton AB Canada IBM Corp Sofware Lab Toronto ON Canada

ISBN: (纸本)9780769535760

Feedback-directed optimization is an effective technique to improve program performance, but it may result in program performance and compiler behavior that is sensitive to both the selection of inputs used for training and the actual input in each run of the program. Cross-validation over a workload of inputs can address the input-sensitivity problem, but introduces the need to select a representative workload of minimal size from the population of available inputs. We present a compiler-centric clustering methodology to group similar inputs so that redundant inputs can be eliminated from the training workload. Input similarity is determined based on the compile-time code transformations made by the compiler after training separately on each input. Differences between inputs are weighted by a performance metric based on cross-validation in order to account for code transformation differences that have little impact on performance. We introduce the CrossError metric that allows the exploration of correlations between transformations based on the results of clustering. the methodology is applied to several SPEC [1] benchmark programs, and illustrated using selected case studies.

关键词： clustering compilers feedback-directed optimization workload reduction

来源：评论

学校读者我要写书评

暂无评论

Scenario Based optimization: A Framework for Statically Enabling Online optimizations 09

Scenario Based Optimization: A Framework for Statically Enab...

引用

7th international symposium on code generation and optimization

作者： Mars, Jason Hundt, Robert Univ Virginia Charlottesville VA 22903 USA Google Platforms Div Mountain View CA 94043 USA

ISBN: (纸本)9780769535760

Online optimization allows the continuous restructuring and adaptation of an executing application using live information about its execution environment. the further advancement of performance monitoring hardware presents new opportunities for online optimization techniques. While managed runtime environments lend themselves nicely to online and dynamic optimizations, such techniques remain difficult to successfully achieve at the binary level. Binary level Dynamic optimizers introduce virtual layers which at the binary level produces overhead that is often prohibitive. Another challenge comes from the lack of source level information that can significantly aid optimization. In this paper we present a new static/dynamic collaborative approach to online optimization that takes advantage of the strength of static optimization and the adaptive nature of dynamic optimization techniques. We call this hybrid optimization framework Scenario Based optimization (SBO). Statically we multiversion and specialize functions for different dynamic scenarios that can be identified by monitoring micro-architectural events. Using these events to infer the current scenario, we dynamically reroute execution to the relevant code tuned to that scenario. We have implemented our static SBO infrastructure in GCC 4.3.1 and designed our Dynamic Introspection Engine using the Perfmon2 infrastructure. To demonstrate the effectiveness of our Scenario Based optimization framework we have designed an SBO optimization we call the Online Aiding and Abetting of Aggressive optimizations (OAAAO). Using SPEC2006 this optimization shows a speedup of 7% to 10% for a number of benchmarks and in our best case (h264ref) a 17% speedup over native execution compiled at the -O2 optimization level.

关键词： compilation techniques dynamic optimization Scenario based optimization online optimization

来源：评论

学校读者我要写书评

暂无评论

Revisiting Out-of-SSA Translation for Correctness, code Quality, and Efficiency 09

Revisiting Out-of-SSA Translation for Correctness, Code Qual...

引用

7th international symposium on code generation and optimization

作者： Boissinot, Benoit Darte, Alain Rastello, Fabrice de Dinechin, Benoit Dupont Guillon, Christophe UCB Lyon Inria ENS Lyon CNRS UMR 5668LIPCompsys Team Lyon France STMicroelect CEC Comp Grp Grenoble France

ISBN: (纸本)9780769535760

Static single assignment (SSA) form is an intermediate program representation in which many code optimizations can be performed with fast and easy-to-implement algorithms. However, some of these optimizations create situations where the SSA variables arising from the same original variable now have overlapping live ranges. this complicates the translation out of SSA code into standard code. there are three issues to consider: correctness, code quality (elimination of copies), and algorithm efficiency (speed and memory footprint). Briggs et al. proposed patches to correct the initial approach of Cytron et al. A cleaner and more general approach was proposed by Sreedhar et al., along with techniques to reduce the number of generated copies. We propose a new approach based on coalescing and a precise view of interferences, in which correctness and optimizations are separated. Our approach is provably correct and simpler to implement, with no patches or particular cases as in previous solutions, while reducing the number of generated copies. Also, experiments with SPEC CINT2000 show that it is 2x faster and 10x less memory-consuming than the Method III of Sreedhar et al., which makes it suitable for just-in-time compilation.

关键词： Compilers SSA form JIT-compilation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：