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

11th IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2011

作者： Rojbani, Hmida Elouedi, Ines Hamouda, Atef Laboratory of Computing in Programming Algorithmic and Heuristic/Image Faculty of Sciences of Tunis Campus Universities Tunis - 1060 Tunisia

ISBN: (纸本)9781467307529

Object recognition has been a topic of research for decades, it operates by making decisions based on the values of several shape properties measured from an image of the object. In this paper, a new exploitation of the Radon Transform (RT) is proposed to extract only one projection according to a single angle. This projection is chosen in way that contains the necessary information to recognize an object (a shape descriptor). This descriptor (called Rθ-signature) provides global information of a binary shape regardless its form. After that, we use this signature in an extraction method of buildings from very high-resolution satellite imagery. © 2011 IEEE.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

LAR-CC: Large atomic regions with conditional commits 11

LAR-CC: Large atomic regions with conditional commits

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Edson Borin Youfeng Wu Mauricio Breternitz Cheng Wang Institute of Computing State University of Campinas-UNICAMP Brazil Programming Systems Laboratory INTEL Research Laboratory USA

ISBN: (纸本)9781612843568

HW/SW Co-designed systems rely on dynamic binary translation and optimizations for efficient execution of binary code. Due to memory ordering properties and other architectural constraints, most binary optimizations are applied to regions of code that are atomically executed. To ensure that the underlying hardware has enough speculative resources to execute the whole atomic region, these systems typically form short atomic regions, with only 20 to 30 instructions. However, the shorter is the atomic region the smaller is the scope for optimizations. We present LAR-CC, a novel technique that enables HW/SW co-designed systems to optimize large atomic regions and dynamically fit them into the available speculative hardware resources by means of conditional commits. The LAR-CC technique consists of two major components: 1) conditional branch instructions to conditionally skip commit operations; 2) code transformations that replace commit operations by conditional commits and enable optimizations to be applied on the large atomic regions. Our experiments show that LAR-CC can effectively achieve dynamic atomic region sizes larger than 1000 instructions, providing sufficiently large scope to apply many advanced optimizations on HW/SW co-designed systems.

关键词： Optimization Hardware Program processors Buffer storage Gears Runtime

来源：评论

学校读者我要写书评

暂无评论

Rθ-signature: A new signature based on Radon Transform and its application in buildings extraction

Rθ-signature: A new signature based on Radon Transform and ...

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Hmida Rojbani Ines Elouedi Atef Hamouda Laboratory of Computing in Programming Algorithmic and Heuristic/Image City and Environment Faculty of Sciences of Tunis Tunis Tunisia

关键词： Buildings Image segmentation Shape Transforms Satellites Image edge detection Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A HW/SW co-designed heterogeneous multi-core virtual machine for energy-efficient general purpose computing 11

A HW/SW co-designed heterogeneous multi-core virtual machine...

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Youfeng Wu Shiliang Hu Edson Borin Cheng Wang Programming Systems Laboratory INTEL Research Laboratory Santa Clara CA USA Institute of Computing State University of Campinas-UNICAMP Campinas Brazil

ISBN: (纸本)9781612843568

It is increasingly challenging to improve single thread performance because power/energy consumption becomes a major barrier to achieve significantly higher performance for general purpose cores. General purpose processors are designed to perform well in a wide variety of market segments, at the cost of having significantly lower performance-per-watt than special purpose processors targeting limited applications or market segments. In this paper, we propose a HW/SW co-designed heterogeneous multi-core virtual machine, called TwinPeaks, which integrates a set of less general but power efficient cores and uses dynamic binary optimization to schedule code regions to run on the most efficient cores. Our experiment and analysis indicate that TwinPeaks with a wide in-order core and a narrow out-of-order core may achieve 108% performance at ~71% energy of a big 4-wide out-of-order core.

关键词： Switches Multicore processing Virtual machining Optimization Out of order Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Mechanical decision for a class of integral inequalities

引用

Science China(Information Sciences) 2010年第9期53卷 1800-1815页

作者： YANG Lu1,3,YU WenSheng1,2* & YUAN RuYi2 1Shanghai Key laboratory of Trustworthy computing,Software Engineering Institute,East China Normal University,Shanghai 200062,China 2The Key laboratory of Complex Systems and Intelligence Science,Institute of Automation,Chinese Academy of Sciences,Beijing 100190,China 3laboratory for Automated Reasoning and programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China 1. Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai 200062 China3. Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu 610041 China2. The Key Laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences Beijing 100190 China

A class of integral inequalities is transformed into homogeneous symmetric polynomial inequalities beyond Tarski model,where the number of elements of the polynomial,say n,is also a variable and the coefficients are functions of *** is closely associated with some open problems formulated recently by Yang et *** Timofte's dimension-decreasing method for symmetric polynomial inequalities,combined with the inequality-proving package BOTTEMA and a program of implementing the method known as successive difference substitution,we provide a procedure for deciding the nonnegativity of the corresponding polynomial inequality such that the original integral inequality is mechanically decidable;otherwise,a counterexample will be *** effectiveness of the algorithm is illustrated by some more examples.

关键词： integral inequality symmetric polynomial inequality Timofte’s dimension-decreasing method successive difference substitution mechanical decision inequality-proving package BOTTEMA

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the Timestamps of Concurrent Events in Traces of Hybrid MPI/OpenMP Applications

Synchronizing the Timestamps of Concurrent Events in Traces ...

引用

IEEE International Conference on Cluster computing

作者： Daniel Becker Markus Geimer Rolf Rabenseifner Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre Jülich Germany University of Stuttgart High Performance Computing-Center Stuttgart Germany

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the in-depth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics.

关键词： Clocks Message systems Semantics Synchronization Algorithm design and analysis Interpolation

来源：评论

学校读者我要写书评

暂无评论

PARBLO:Page-Allocation-Based DRAM Row Buffer Locality Optimization

引用

Journal of Computer Science & Technology 2009年第6期24卷 1086-1097页

作者：米伟冯晓兵贾耀仓陈莉薛京灵 Key Laboratory of Computer System and Architecture Institution of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizations to eliminate significantly more row buffer conflicts. Validation in simulation using a set of selected scientific and engineering benchmarks against a few representative memory controller optimizations shows that our method can reduce row buffer miss rates by up to 76% （with an average of 37.4%）. This reduction in row buffer miss rates will be translated into performance speedups by up to 15% （with an average of 5%）.

关键词： DRAM row buffer page allocation locality optimization

来源：评论

学校读者我要写书评

暂无评论

Using cellular automata for parallel simulation of laser dynamics with dynamic load balancing

引用

International Journal of High Performance Systems Architecture 2008年第4期1卷 251-259页

作者： Guisado, J.L. de Vega, F. Fernández Jiménez-Morales, F.J. Iskra, K.A. Sloot, P.M.A. Departamento de Arquitectura y Tecnología de Computadores Universidad de Sevilla ETS Ingeniería Informática Avda. Reina Mercedes s/n. 41012 Sevilla Spain Centro Universitario de Mérida Universidad de Extremadura Sta. Teresa Jornet 38 06800 Mérida Badajoz Spain Departamento de Física de la Materia Condensada Universidad de Sevilla P.O. Box 1065 41080 Sevilla Spain Argonne National Laboratory Mathematics and Computer Science Division 9700 South Cass Avenue Argonne IL 60439 United States Section Computational Science Laboratory for Computing Systems Architecture and Programming University of Amsterdam Kruislaan 403 1098 SJ Amsterdam Netherlands

We present an analysis of the feasibility of executing a parallel bioinspired model of laser dynamics, based on cellular automata (CA), on the usual target platform of this kind of applications: a heterogeneous non-dedicated cluster. As this model employs a synchronous CA, using the single program, multiple data (SPMD) paradigm, it is not clear in advance if an appropriate efficiency can be obtained on this kind of platform. We have evaluated its performance including artificial load to simulate other tasks or jobs submitted by other users. A dynamic load balancing strategy with two main differences from most previous implementations of CA based models has been used. First, it is possible to migrate load to cluster nodes initially not belonging to the pool. Second, a modular approach is taken in which the model is executed on top of a dynamic load balancing tool - the Dynamite system - gaining flexibility. Very satisfactory results have been obtained, with performance increases from 60% to 80%. Copyright © 2008, Inderscience Publishers.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

A class of mechanically decidable problems beyond Tarski's model

引用

Science China Mathematics 2007年第11期50卷 1611-1620页

作者： Lu YANG~(1,2) Yong FENG~(1+) Yong YAO~1 1 laboratory for Automated Reasoning and programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China 2 Institute of Theoretical computing,East China Normal University,Shanghai 200062,China Laboratory for Automated Reasoning Programming Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu 610041 China Institute of Theoretical Computing East China Normal University Shanghai 200062 China

By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are *** is a class of mechanically decidable problems beyond Tarski *** implement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly.

关键词： symmetric polynomial inequality cell-decomposition Tarski's sentence Tarski's model mechanically decidable problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：