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

2010 International computer Symposium, ICS 2010

作者： Chen, Wen Ren Yang, Wuu Hsu, Wei Chung Programming Language and System Lab Institute of Computer Science and Engineering National Chiao Tung University Hsinchu 30013 Taiwan System Lab. Institute of Computer Science and Engineering National Chiao Tung University Hsinchu 30013 Taiwan

ISBN: (纸本)9781424476404

Multicore has become a trend on server and client computers in recent years. Parallelization is one way to fully utilize the computing power provided by multicore architectures. Most applications of interest have complex data and control dependency, which make traditional parallelization techniques, such as DOALL and DOACROSS, inapplicable. Decoupled Software Pipelining (DSWP), a new parallelization technique, shows its potential on parallelizing general applications. However, its success relies on fast inter-core synchronization and communication. On commodity multicore platforms, the performance of current DSWP disappoints us since the overhead involving lock-based, cache dishonored software approach offsets the benefit from DSWP. We present a lock-free, cache-friendly software queue designed for DSWP. A lock-free, cache-friendly solution need take two different aspects of memory system, memory coherence and memory consistency, into *** show how inattention to these two aspects leads to incorrect or inefficient solutions. We also present our approach to providing a correct and efficient solution with detailed explanation. Due to the nondeterministic nature of parallel programs, traditional testing techniques cannot be used to fully verify the correctness of the implementation. We also discuss the correctness of our implementation both in informal and formal ways. ©2010 IEEE.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs

Scratchpad memory allocation for data aggregates via interva...

引用

作者： Li, Lian Xue, Jingling Knoop, Jens University of New South Wales School of Computer Science and Engineering Programming Languages and Compilers Group Sydney NSW 2052 Australia Technische Universität Wien Institut für Computersprachen Argentinierstraße 8 1040 Wien Austria

Existing methods place data or code in scratchpad memory (SPM) by relying on heuristics or resorting to integer programming or mapping it to a graph-coloring problem. In this article, the SPM allocation problem for arrays is formulated as an interval coloring problem. The key observation is that in many embedded C programs, two arrays can bemodeled such that either their live ranges do not interfere or one contains the other (with good accuracy). As a result, array interference graphs often form a special class of superperfect graphs (known as comparability graphs), and their optimal interval colorings become efficiently solvable. This insight has led to the development of an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its maximal cliques. If the SPM is no smaller than the clique number of an interference graph, then all arrays in the graph can be placed in SPM optimally. Otherwise, we rely on containment-motivated heuristics to split or spill array live ranges until the resulting graph is optimally colorable. We have implemented our algorithm in SUIF/machSUIF and evaluated it using a set of embedded C benchmarks from MediaBench and MiBench. Compared to a graph-coloring algorithm and an optimal ILP algorithm (when it runs to completion), our algorithm achieves close-to-optimal results and is superior to graph coloring for the benchmarks tested. © 2010 ACM.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

An automated bottle filling and capping project for freshman engineering students

An automated bottle filling and capping project for freshman...

引用

2010 ASEE Annual Conference and Exposition

作者： Meah, Kala Garrison, Timothy Kearns, James Link, Gregory Garrison, Laura Blanding, Wayne Celik, Emine Kuchnicki, Stephen Dawson, Jennifer McFarland, Barry Department of Physical Science York College of Pennsylvania United States Mechanical Engineering Program York College of Pennsylvania United States Department of Electrical and Computer Engineering York College of Pennsylvania United States Department of Thermal Sciences Freshmen Design Courses and Computer Programming York College of Pennsylvania United States Department of Electrical Engineering York College of Pennsylvania United States York College of Pennsylvania United States Department of Mechanical Engineering York College of Pennsylvania United States

All freshman engineering students at York College participate in a spring semester design challenge as part of a year-long, two-course introduction to engineering. This paper describes the course organization, the project goals, and project itself and how it supports the broader engineering curriculum goals of engaging freshman engineering students in a design project, exposing them in an interesting way to the breath of engineering, and motivating them in their engineering studies. The students work in small teams and have roughly 12 weeks to design an automated electromechanical system that first transports three empty Snapple bottles, three tennis balls, and 36 oz. of water to a 2/x3/ operational zone. The machine must fill each bottle with 12 oz. of water, cap each bottle by covering the top with a tennis ball, and then deliver the capped and filled bottles to an area outside of the operational zone. The bottle-filling project serves as the second of two interdisciplinary engineering design experiences during the freshman year. It introduces aspects of computer, electrical, and mechanical engineering, including the following five primary knowledge areas: (i) machining and fabrication;(ii) electronic circuit prototyping and programming;(iii) sensor and actuator applications;(iv) mechanical design;(v) project planning;and (vi) presentation skills. A project demonstration at the end of the semester determines the relative effectiveness of each machine based upon a number of quantitative factors, including the total time required to complete the overall process, the volume of water in each bottle, the number of bottles successfully capped, the amount of water spilled, and approximate manufacturing cost. Some qualitative factors considered are simplicity, creativity, and aesthetics. Student interest in this substantial hands-on experience, as measured by surveys and exhibited by attendance, enthusiasm, productivity, and success, appears to be high through the three y

关键词： Bottles

来源：评论

学校读者我要写书评

暂无评论

Toward Harnessing DOACROSS Parallelism for Multi-GPGPUs

Toward Harnessing DOACROSS Parallelism for Multi-GPGPUs

引用

International Conference on Parallel Processing (ICPP)

作者： Peng Di Qing Wan Xuemeng Zhang Hui Wu Jingling Xue Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW Australia

To exploit the full potential of GPGPUs for general purpose computing, DOACR parallelism abundant in scientific and engineering applications must be harnessed. However, the presence of cross-iteration data dependences in DOACR loops poses an obstacle to execute their computations concurrently using a massive number of fine-grained threads. This work focuses on iterative PDE solvers rich in DOACR parallelism to identify optimization principles and strategies that allow their efficient mapping to GPGPUs. Our main finding is that certain DOACR loops can be accelerated further on GPGPUs if they are algorithmically restructured (by a domain expert) to be more amendable to GPGPU parallelization, judiciously optimized (by the compiler), and carefully tuned by a performance-tuning tool. We substantiate this finding with a case study by presenting a new parallel SSOR method that admits more efficient data-parallel SIMD execution than red-black SOR on GPGPUs. Our solution is obtained non-conventionally, by starting from a K-layer SSOR method and then parallelizing it by applying a non-dependence-preserving scheme consisting of a new domain decomposition technique followed by a generalized loop tiling. Despite its relatively slower convergence, our new method outperforms red-black SOR by making a better balance between data reuse and parallelism and by trading off convergence rate for SIMD parallelism. Our experimental results highlight the importance of synergy between domain experts, compiler optimizations and performance tuning in maximizing the performance of applications, particularly PDE-based DOACR loops, on GPGPUs.

关键词： Tiles Instruction sets Kernel Graphics processing unit Parallel processing Convergence Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Foreword: First International Workshop on the Web and Requirements engineering

Foreword: First International Workshop on the Web and Requir...

引用

International Workshop on the Web and Requirements engineering (WeRE)

作者： Irene Garrigós Jose-Norberto Mazón Nora Koch Maria José Escalona John Mylopoulos Dept. of Software and Computing Systems University of Alicante Spain Dept. of Computer Languages and Systems University of Seville Spain Programming and Software Engineering Dept. University of Munich Germany Information Engineering and Computer Science Dept. University of Trento Italy

The International Workshop on the Web and Requirements engineering (WeRE) was held in conjunction with the 18 th International IEEE Requirements engineering Conference (RE'10) in Sydney (Australia) on September 28 2010. WeRE intends to be an international forum for exchanging ideas on both using Web technologies as a platform in the requirements engineering field, and applying requirements engineering in the development and use of websites. Papers focused on new domains and new experiences with the connection between requirements engineering and the Web were presented in WeRE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Foreword: First International Workshop on the Web and Requirements engineering

2010 1st International Workshop on the Web and Requirements ...

引用

2010 1st International Workshop on the Web and Requirements engineering, WeRE 2010 2010年 i-ii页

作者： Garrigós, Irene Mazón, Jose-Norberto Escalona, Maria José Koch, Nora Mylopoulos, John Dept. of Software and Computing Systems University of Alicante Spain Dept. of Computer Languages and Systems University of Seville Spain Programming and Software Engineering Dept. University of Munich Germany Information Engineering and Computer Science Dept. University of Trento Italy

来源：评论

学校读者我要写书评

暂无评论

engineering self-coordinating software intensive systems

Engineering self-coordinating software intensive systems

引用

FSE/SDP Workshop on the Future of Software engineering Research, FoSER 2010

作者： Schäfer, Wilhelm Birattari, Mauro Blömer, Johannes Dorigo, Marco Engels, Gregor O'Grady, Rehan Platzner, Marco Rammig, Franz Reif, Wolfgang Trächtler, Ansgar Heinz Nixdorf Institute University of Paderborn Fürstenallee 11 Paderborn Germany Heinz Nixdorf Institute University of Paderborn Pohlweg 98 Paderborn Germany Heinz Nixdorf Institute University of Paderborn Warburger Str. 100 Paderborn Germany Department of Computer Science University of Paderborn Warburger Str. 100 Paderborn Germany Department of Control Engineering and Mechatronics University of Paderborn Pohlweg 98 Paderborn Germany IRIDIA CoDE Université Libre de Bruxelles Ave. F. Roosevelt 50 1050 Brussels Belgium Department of Software Engineering and Programming Languages University of Augsburg Universitätsstr. 6a Augsburg Germany

ISBN: (纸本)9781450304276

It my great pleasure and honor to welcome you to FoSER 2010: The FSE/SDP Workshop on the Future of Software engineering Research. This workshop was organized in collaboration with and made possible by generous support from the Software Design and Productivity Coordinating Group (SDP) of the U.S. National Coordination Office (NCO) for Networking and Information Technology Research and Development (NITRD), and the National Science Foundation (NSF). This one-time, international working conference has brought together top academic and industrial researchers and government research funding agency personnel from around the world to engage in an extended discussion of consequential new ideas about the future of our field. The ideas produced by this workshop will be disseminated in two forms. First, the position papers accepted by the program committee will be published in a companion to the Proceedings of FSE-18. Second, the workshop findings will be published subsequently in a special report by NITRD/SDP. The call for papers for FoSER 2010 solicited 4-page position papers with new ideas about the future of software and software-reliant systems, and the research that will be needed to meet future needs. Papers were expected to be creative and thought-provoking, and to articulate compelling new perspectives, positions, problem formulations, assumptions and approaches. The workshop did not seek, and did not accept, technical research papers or abstracts. The workshop received a total of 139 position papers. Of these, 90 papers (65%) were accepted. Each paper was reviewed by at least two members of the workshop program committee. The committee was asked to accept all papers presenting significant new ideas about how our field should move forward. Copyright 2010 ACM.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

The positive outcomes of information security awareness training in companies - A case study

引用

Information Security Technical Report 2009年第4期14卷 223-229页

作者： Eminaǧaoǧlu, Mete Uçar, Erdem Eren, Şaban Yaar University Department of Computer Programming Izmir Turkey Trakya University Department of Computer Engineering Edirne Turkey Yaar University Department of Statistics Izmir Turkey

One of the key factors in successful information security management is the effective compliance of security policies and proper integration of "people", "process" and "technology". When it comes to the issue of "people", this effectiveness can be achieved through several mechanisms, one of which is the security awareness training of employees. However, the outcomes should also be measured to see how successful and effective this training has been for the employees. In this study, an information security awareness project is implemented in a company both by training and by subsequent auditing of the effectiveness and success of this training (which focussed on password usage, password quality and compliance of employees with the password policies of the company). The project was conducted in a Turkish company with 2900 white-collar employees. Each employee took information security training including password usage. Also, there were several supporting awareness campaigns such as educational posters, animations and e-messages on the company Intranet, surveys and simple online quizzes. The project was carried out over a 12 month period and three password security strength audits were made during this period. The results were comparatively and statistically analysed. The results show us the effectiveness of the project and the impact of human awareness on the success of information security management programmes in companies. This study gives us some crucial results, facts and methods that can also be used as a guideline for further similar projects. © 2010 Elsevier Ltd. All rights reserved.

关键词： Personnel training

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：