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

39th Annual international Symposium on Computer Architecture (ISCA)

作者： Van Craeynest, Kenzo Jaleel, Aamer Eeckhout, Lieven Narvaez, Paolo Emer, Joel Univ Ghent B-9000 Ghent Belgium VSSAD Intel Corp Hudson MA USA

ISBN: (纸本)9781467304764

Single-ISA heterogeneous multi-core processors are typically composed of small (e. g., in-order) power-efficient cores and big (e. g., out-of-order) high-performance cores. the effectiveness of heterogeneous multi-cores depends on how well a scheduler can map workloads onto the most appropriate core type. In general, small cores can achieve good performance if the workload inherently has high levels of ILP. On the other hand, big cores provide good performance if the workload exhibits high levels of MLP or requires the ILP to be extracted dynamically. this paper proposes Performance Impact Estimation (PIE) as a mechanism to predict which workload-to-core mapping is likely to provide the best performance. PIE collects CPI stack, MLP and ILP profile information, and estimates performance if the workload were to run on a different core type. Dynamic PIE adjusts the scheduling at run-time and thereby exploits fine-grained time-varying execution behavior. We show that PIE requires limited hardware support and can improve system performance by an average of 5.5% over recent state-of-the-art scheduling proposals and by 8.7% over a sampling-based scheduling policy.

关键词： project independence evaluation system Workload core type inductive logic programming running condition CSRP3 gene Core samples core Runtime System performance

来源：评论

学校读者我要写书评

暂无评论

Discrete Generalised Polynomial Functors

Discrete Generalised Polynomial Functors

引用

39th international Colloquium on Automata, Languages, and programming (ICALP)

作者： Fiore, Marcelo Univ Cambridge Comp Lab Cambridge CB2 1TN England

ISBN: (纸本)9783642315855

We study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. the main theoretical contribution is the introduction of discrete generalised polynomial functors, a class that lies in between the classes of cocontinuous and finitary functors, and is closed under composition, sums, finite products, and differentiation. A variety of applications are given: to the theory of nominal algebraic effects;to the algebraic modelling of languages, and equational theories there of, with variable binding and polymorphism;and to the synthesis of dependent zippers.

关键词： presheaf categories Kan extensions generalised logic polynomial functors equational systems algebraic effects abstract syntax dependent programming

来源：评论

学校读者我要写书评

暂无评论

Can Traditional programming Bridge the Ninja Performance Gap for Parallel Computing Applications?

Can Traditional Programming Bridge the Ninja Performance Gap...

引用

39th Annual international Symposium on Computer Architecture (ISCA)

作者： Satish, Nadathur Kim, Changkyu Chhugani, Jatin Saito, Hideki Krishnaiyer, Rakesh Smelyanskiy, Mikhail Girkar, Milind Dubey, Pradeep Intel Corp Parallel Comp Lab Santa Clara CA 95051 USA Intel Corp Intel Compiler Lab Santa Clara CA 95051 USA

ISBN: (纸本)9781467304764

Current processor trends of integrating more cores with wider SIMD units, along with a deeper and complex memory hierarchy, have made it increasingly more challenging to extract performance from applications. It is believed by some that traditional approaches to programming do not apply to these modern processors and hence radical new languages must be discovered. In this paper, we question this thinking and offer evidence in support of traditional programming methods and the performance-vs-programming effort effectiveness of common multi-core processors and upcoming many-core architectures in delivering significant speedup, and close-to-optimal performance for commonly used parallel computing workloads. We first quantify the extent of the "Ninja gap", which is the performance gap between naively written C/C++ code that is parallelism unaware (often serial) and best-optimized code on modern multi-/many-core processors. Using a set of representative throughput computing benchmarks, we show that there is an average Ninja gap of 24X (up to 53X) for a recent 6-core Intel (R) Core (TM) i7 X980 Westmere CPU, and that this gap if left unaddressed will inevitably increase. We show how a set of well-known algorithmic changes coupled with advancements in modern compiler technology can bring down the Ninja gap to an average of just 1.3X. these changes typically require low programming effort, as compared to the very high effort in producing Ninja code. We also discuss hardware support for programmability that can reduce the impact of these changes and even further increase programmer productivity. We show equally encouraging results for the upcoming Intel (R) Many Integrated Core architecture (Intel (R) MIC) which has more cores and wider SIMD. We thus demonstrate that we can contain the otherwise uncontrolled growth of the Ninja gap and offer a more stable and predictable performance growth over future architectures, offering strong evidence that radical language changes are

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Coalgebraic Predicate logic

Coalgebraic Predicate Logic

引用

39th international Colloquium on Automata, Languages, and programming (ICALP)

作者： Litak, Tadeusz Pattinson, Dirk Sano, Katsuhiko Schroder, Lutz Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England Imperial Coll London Dept Comp London England Japan Adv Inst Sci & Technol Sch Informat Sci Tokyo Japan Friedrich Alexander Univ Dept Comp Sci Erlangen Germany

ISBN: (纸本)9783642315855

We propose a generalization of first-order logic originating in a neglected work by C. C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for two natural classes of such logics. Moreover, we show that an entirely general completeness result is not possible. We study the expressive power of our language, contrasting it with both coalgebraic modal logic and existing first-order proposals for special classes of Set-coalgebras (apart for relational structures, also neighbourhood frames and topological spaces). the semantic characterization of expressivity is based on the fact that our language inherits a coalgebraic variant of the Van Benthem-Rosen theorem. Basic model-theoretic constructions and results, in particular ultraproducts, obtain for the two classes which allow for completeness-and in some cases beyond that.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Harmony: Collection and Analysis of Parallel Block Vectors

Harmony: Collection and Analysis of Parallel Block Vectors

引用

39th Annual international Symposium on Computer Architecture (ISCA)

作者： Kambadur, Melanie Tang, Kui Kim, Martha A. Columbia Univ New York NY 10027 USA

ISBN: (纸本)9781467304764

Efficient execution of well-parallelized applications is central to performance in the multicore era. Program analysis tools support the hardware and software sides of this effort by exposing relevant features of multithreaded applications. this paper describes parallel block vectors, which uncover previously unseen characteristics of parallel programs. Parallel block vectors provide block execution profiles per concurrency phase (e. g., the block execution profile of all serial regions of a program). this information provides a direct and fine-grained mapping between an application's runtime parallel phases and the static code that makes up those phases. this paper also demonstrates how to collect parallel block vectors with minimal application perturbation using Harmony. Harmony is an instrumentation pass for the LLVM compiler that introduces just 16-21% overhead on average across eight Parsec benchmarks. We apply parallel block vectors to uncover several novel insights about parallel applications with direct consequences for architectural design. First, that the serial and parallel phases of execution used in Amdahl's Law are often composed of many of the same basic blocks. Second, that program features, such as instruction mix, vary based on the degree of parallelism, with serial phases in particular displaying different instruction mixes from the program as a whole. third, that dynamic execution frequencies do not necessarily correlate with a block's parallelism.

关键词： Legal Executions Parallel Lines Serial Publications parallelism Parallel programming Phase Computer hardware

来源：评论

学校读者我要写书评

暂无评论

ClouDiA: A Deployment Advisor for Public Clouds

引用

PROCEEDINGS OF thE VLDB ENDOWMENT 2012年第2期6卷 121-132页

作者： Zou, Tao Le Bras, Ronan Salles, Marcos Vaz Demers, Alan Gehrke, Johannes Cornell Univ Ithaca NY 14850 USA Univ Copenhagen Copenhagen Denmark

An increasing number of distributed data-driven applications are moving into shared public clouds. By sharing resources and operating at scale, public clouds promise higher utilization and lower costs than private clusters. To achieve high utilization, however, cloud providers inevitably allocate virtual machine instances non-contiguously, i.e., instances of a given application may end up in physically distant machines in the cloud. this allocation strategy can lead to large differences in average latency between instances. For a large class of applications, this difference can result in significant performance degradation, unless care is taken in how application components are mapped to instances. In this paper, we propose ClouDiA, a general deployment advisor that selects application node deployments minimizing either (i) the largest latency between application nodes, or (ii) the longest critical path among all application nodes. ClouDiA employs mixed-integer programming and constraint programming techniques to efficiently search the space of possible mappings of application nodes to instances. through experiments with synthetic and real applications in Amazon EC2, we show that our techniques yield a 15% to 55% reduction in time-to-solution or service response time, without any need for modifying application code.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

39th international conference on Very Large Data Bases, VLDB 2013

39th International Conference on Very Large Data Bases, VLDB...

引用

39th international conference on Very Large Data Bases, VLDB 2012

the proceedings contain 223 papers. the special focus in this conference is on Very Large Data Bases. the topics include: On differentially private frequent itemset mining;Query processing under GLAV mappings for relational and graph databases;Large scale cohesive subgraphs discovery for social network visual analysis;An in-depth comparison of subgraph isomorphism algorithms in graph databases;Memory efficient minimum substring partitioning.;Actively soliciting feedback for query answers in keyword search-based data integration;Efficient implementation of generalized quantification in relational query languages;Upper and lower bounds on the cost of a map-reduce computation;Practical differential privacy via grouping and smoothing;Efficient querying of inconsistent databases with binary integer programming;Schema extraction for tabular data on the web;Supporting user-defined functions on uncertain data;Ratio threshold queries over distributed data sources;A distributed algorithm for large-scale generalized matching;Sharing data and work across concurrent analytical queries;Improving flash write performance by using update frequency;Extraction and integration of partially overlapping web sources;Mining and indexing graphs for supergraph search;A general framework for geo-social query processing;Continuous cloud-scale query optimization and processing;Adaptive and big data scale parallel execution in oracle;Overview of turn data management platform for digital advertising;Designing query optimizers for big data problems of the future;Towards database virtualization for database as a service;Aggregate profile clustering for telco analytics;Graph queries in a next-generation datalog system;Mining and linking patterns across live data streams and stream archives and fast iterative graph computation with block updates.

关键词：

来源：评论

学校读者我要写书评

暂无评论

39th international conference on Very Large Data Bases, VLDB 2013

39th International Conference on Very Large Data Bases, VLDB...

引用

39th international conference on Very Large Data Bases, VLDB 2012

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning to Act Optimally in Partially Observable Markov Decision Processes Using Hybrid Probabilistic logic Programs

引用

5th international conference on Scalable Uncertainty Management (SUM 2011)

作者： Saad, Emad Gulf Univ Sci & Technol Dept Comp Sci Mishref Kuwait

ISBN: (纸本)9783642239625

We present a probabilistic logic programming framework to reinforcement learning, by integrating reinforcement learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer set semantics, that is capable of representing domain-specific knowledge. We formally prove the correctness of our approach. We show that the complexity of finding a policy for a reinforcement learning problem in our approach is NP-complete. In addition, we show that any reinforcement learning problem can be encoded as a classical logic program with answer set semantics. We also show that a reinforcement learning problem can be encoded as a SAT problem. We present a new high level action description language that allows the factored representation of POMDP. Moreover, we modify the original model of POMDP so that it be able to distinguish between knowledge producing actions and actions that change the environment.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Gossamer: A lightweight approach to using multicore machines

Gossamer: A lightweight approach to using multicore machines

引用

international conference on Parallel Processing

作者： Roback, Joseph A. Andrews, Gregory R. Department of Computer Science University of Arizona Tucson AZ 85721 United States

ISBN: (纸本)9780769541563

the key to performance improvements in the multicore era is for software to utilize the available concurrency. this paper presents a lightweight programming framework called Gossamer that is easy to use, enables the solution of a broad range of parallel programming problems, and produces efficient code. Gossamer contains (1) a set of high-level annotations that one adds to a sequential program to specify concurrency and synchronization, (2) a source-to-source translator that produces an optimized program that uses our threading library, and (3) a run-time system that provides efficient threads and synchronization. Gossamer supports iterative and recursive parallelism, pipelined computations, domain decomposition, and MapReduce computations. © 2010 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：