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

Cross-Layer Memory Management for Managed language Applications

acm sigplan NOTICES 2015年第10期50卷 488-504页

作者： Jantz, Michael R. Robinson, Forrest J. Kulkarni, Prasad A. Doshi, Kshitij A. Univ Tennessee Knoxville TN 37996 USA Univ Kansas Lawrence KS 66045 USA Intel Corp Santa Clara CA 95051 USA

Performance and energy efficiency in memory have become critically important for a wide range of computing domains. However, it is difficult to control and optimize memory power and performance because these effects depend upon activity across multiple layers of the vertical execution stack. To address this challenge, we construct a novel and collaborative framework that employs object placement, cross-layer communication, and page-level management to effectively distribute application objects in the DRAM hardware to achieve desired power/performance goals. In this work, we describe the design and implementation of our framework, which is the first to integrate automatic object profiling and analysis at the application layer with fine-grained management of memory hardware resources in the operating system. We demonstrate the utility of our framework by employing it to more effectively control memory power consumption. We design a custom memory-intensive workload to show the potential of our approach. Next, we develop sampling and profiling-based analyses and modify the code generator in the HotSpot VM to understand object usage patterns and automatically determine and control the placement of hot and cold objects in a partitioned VM heap. This information is communicated to the operating system, which uses it to map the logical application pages to the appropriate DRAM ranks according to user-defined provisioning goals. We evaluate our framework and find that it achieves our test goal of significant DRAM energy savings across a variety of workloads, without any source code modifications or recompilations.

关键词： design Experimentation Performance Cross-layer Power Efficiency DRAM HotSpot

来源：评论

学校读者我要写书评

暂无评论

The implementation of the Cilk-5 multithreaded language 98

The implementation of the Cilk-5 multithreaded language

引用

proceedings of the acm sigplan 1998 conference on programming language design and implementation

作者： Matteo Frigo Charles E. Leiserson Keith H. Randall MIT Laboratory for Computer Science 545 Technology Square Cambridge Massachusetts

ISBN: (纸本)9780897919876

The fifth release of the multithreaded language Cilk uses a provably good "work-stealing" scheduling algorithm similar to the first system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path, this "work-first" principle has led to a portable Cilk-5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation compared to equivalent C programs. This paper describes how the work-first principle was exploited in the design of Cilk-5's compiler and its runtime system. In particular, we present Cilk-5's novel "two-clone" compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler.

关键词： parallel computing programming language runtime system critical path multithreading work

来源：评论

学校读者我要写书评

暂无评论

Mirrors: design principles for meta-level facilities of object-oriented programming languages 04

Mirrors: design principles for meta-level facilities of obje...

引用

proceedings of the 19th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Gilad Bracha David Ungar Sun Microsystems Santa Clara CA Sun Microsystems Mountain View CA

We identify three design principles for reflection and metaprogramming facilities in object oriented programming languages. Encapsulation: meta-level facilities must encapsulate their implementation. Stratification: m... 详细信息

ISBN: (纸本)9781581138313

We identify three design principles for reflection and metaprogramming facilities in object oriented programming languages. Encapsulation: meta-level facilities must encapsulate their implementation. Stratification: meta-level facilities must be separated from base-level functionality. Ontological correspondence: the ontology of meta-level facilities should correspond to the ontology of the language they manipulate. Traditional/mainstream reflective architectures do not follow these precepts. In contrast, reflective APIs built around the concept of mirrors are characterized by adherence to these three principles. Consequently, mirror-based architectures have significant advantages with respect to distribution, deployment and general purpose metaprogramming.

关键词： smalltalk mirrors java metaprogramming reflection self

来源：评论

学校读者我要写书评

暂无评论

GUM: a portable parallel implementation of Haskell 96

GUM: a portable parallel implementation of Haskell

引用

proceedings of the acm sigplan 1996 conference on programming language design and implementation

作者： P. W. Trinder K. Hammond J. S. Mattson A. S. Partridge S. L. Peyton Jones Department of Computing Science Glasgow University Hewlett-Packard California Language Laboratory and Department of Computing Science Glasgow University Department of Computer Science University of Tasmania and Department of Computing Science Glasgow University

ISBN: (纸本)9780897917957

GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the first such systems to be made publicly *** is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each *** performance figures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interprocedural constant propagation: a study of jump function implementation 93

Interprocedural constant propagation: a study of jump functi...

引用

proceedings of the acm sigplan 1993 conference on programming language design and implementation

作者： Dan Grove Linda Torczon Sun Microsystems Mountain View CA Rice Univ. Houston TX

ISBN: (纸本)9780897915984

An implementation of interprocedural constant propagation must model the transmission of values through each procedure. In the framework proposed by Callahan, Cooper, Kennedy, and Torczon in 1986, this intraprocedural propagation is modeled with a jump function. While Callahan et al. propose several kinds of jump functions, they give no data to help choose between them. This paper reports on a comparative study of jump function implementations. It shows that different jump functions produce different numbers of useful constants; it suggests a particular function, called the pass-through parameter jump function, as the most cost-effective in practice.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of a certifying compiler 98

The design and implementation of a certifying compiler

引用

proceedings of the acm sigplan 1998 conference on programming language design and implementation

作者： George C. Necula Peter Lee School of Computer Science Carnegie Mellon University Pittsburgh Pennsylvania

ISBN: (纸本)9780897919876

This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language programs, and a certifier that automatically checks the type safety and memory safety of any assembly language program produced by the compiler. The result of the certifier is either a formal proof of type safety or a counterexample pointing to a potential violation of the type system by the target program. The ensemble of the compiler and the certifier is called a certifying *** advantages of certifying compilation over previous approaches can be claimed. The notion of a certifying compiler is significantly easier to employ than a formal compiler verification, in part because it is generally easier to verify the correctness of the result of a computation than to prove the correctness of the computation itself. Also, the approach can be applied even to highly optimizing compilers, as demonstrated by the fact that our compiler generates target code, for a range of realistic C programs, which is competitive with both the cc and gcc compilers with all optimizations enabled. The certifier also drastically improves the effectiveness of compiler testing because, for each test case, it statically signals compilation errors that might otherwise require many executions to detect. Finally, this approach is a practical way to produce the safety proofs for a Proof-Carrying Code system, and thus may be useful in a system for safe mobile code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

X10: An object-oriented approach to non-uniform cluster computing

引用

acm sigplan NOTICES 2005年第10期40卷 519-538页

作者： Charles, P Donawa, C Ebcioglu, K Grothoff, C Kielstra, A von Praun, C Saraswat, V Sarkar, V IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA IBM Toronto Lab Markham ON L6G 1C7 Canada

It is now well established that the device scaling predicted by Moore's Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the rate that had been sustained during the last two decades. As a result, future systems are rapidly moving from uniprocessor to multiprocessor configurations, so as to use parallelism instead of frequency scaling as the foundation for increased compute capacity. The dominant emerging multi processor structure for the future is a Non- Uniform Cluster Computing (NUCC) system with nodes that are built out of multi-core SMP chips with non-uniform memory hierarchies, and interconnected in horizontally scalable cluster configurations such as blade servers. Unlike previous generations of hardware evolution, this shift will have a major impact on existing software. Current 00 language facilities for concurrent and distributed programming are inadequate for addressing the needs of NUCC systems because they do not Support the notions of non-uniform data access within a node, or of tight coupling of distributed nodes. We have designed a modern object-oriented programming language, X10, for high performance, high productivity programming of NUCC systems. A member of the partitioned global address space family of languages, X10 highlights the explicit reification of locality in the form of places;lightweight activities embodied in async, future, foreach, and ateach constructs;a construct for termination detection (finish);the use of lock-free synchronization (atomic blocks);and the manipulation of cluster-wide global data structures. We present an overview of the X10 programming model and language, experience with our reference implementation, and results from some initial productivity comparisons between the X10 and JAVA (TM) languages.

关键词： languages performance design X10 Java multithreading non-uniform cluster computing (NUCC) partitioned global address space (PGAS) places data distribution atomic blocks clocks scalability productivity

来源：评论

学校读者我要写书评

暂无评论

LLVM Compiler implementation for explicit parallelization and SIMD vectorization 4

LLVM Compiler implementation for explicit parallelization an...

引用

4th Workshop on the LLVM Compiler Infrastructure in HPC, LLVM-HPC 2017 - Held in conjunction with the International conference for High Performance Computing, Networking, Storage and Analysis, SC 2017

作者： Tian, Xinmin Saito, Hideki Su, Ernesto Lin, Jin Guggilla, Satish Caballero, Diego Masten, Matt Savonichev, Andrew Rice, Michael Demikhovsky, Elena Zaks, Ayal Rapaport, Gil Gaba, Abhinav Porpodas, Vasileios Garcia, Eric Intel Corporation 3600 Juliette Lane Santa ClaraCA95054 United States

ISBN: (纸本)9781450355650

With advances of modern multi-core processors and accelerators, many modern applications are increasingly turning to compilerassisted parallel and vector programming models such as OpenMP, OpenCL, Halide, Python and TensorFlow. It is crucial to ensure that LLVM-based compilers can optimize parallel and vector code as effectively as possible. In this paper, we first present a set of updated LLVM IR extensions for explicitly parallel, vector, and offloading program constructs in the context of C/C++/OpenCL. Secondly, we describe our LLVM design and implementation for advanced features in OpenMP such as parallel loop reduction, task and taskloop, SIMD loop and functions, and we discuss the impact of our updated implementation on existing LLVM optimization passes. Finally, we present a re-use case of our infrastructure to enable explicit parallelization and vectorization extensions in our OpenCL compiler to achieve ~35x performance speedup for a wellknown autonomous driving workload on a multi-core platform configured with Intel(r) Xeon(r) Scalable Processors. © 2017 Association for Computing Machinery.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Finding application errors and security flaws using PQL: a program query language

引用

acm sigplan NOTICES 2005年第10期40卷 365-383页

作者： Martin, M Livshits, B Lam, MS Stanford Univ Dept Comp Sci Stanford CA 94305 USA

A number of effective error detection tools have been built in recent years to check if a program conforrns to certain design rules. An important class of design rules deals with sequences of events associated with a set of related objects. This paper presents a language called PQL (Program Query language) that allows programmers to express such questions easily in an application-specific context. A query looks like a code excerpt corresponding to the shortest amount of code that would violate a design rule. Details of the target application's precise implementation are abstracted away. The programmer may also specify actions to perform when a match is found, such as recording relevant information or even correcting an erroneous execution on the fly. We have developed both static and dynamic techniques to find solutions to PQL queries. Our static analyzer finds all potential matches conservatively using a context-sensitive, flow-insensitive, inclusion-based pointer alias analysis. Static results are also useful in reducing the number of instrumentation points for dynamic analysis. Our dynamic analyzer instruments the source program to catch all violations precisely as the program runs and to optionally perform user-specified actions. We have implemented the techniques described in this paper and found 206 errors in 6 large real-world open-source Java applications containing a total of nearly 60,000 classes. These errors are important security flaws, resource leaks, and violations of consistency invariants. The combination of static and dynamic analysis proves effective at addressing a wide range of debugging and program comprehension queries. We have found that dynamic analysis is especially suitable for preventing errors such as security vulnerabilities at runtime.

关键词： languages security reliability program traces pattern matching web applications SQL injection resource leaks bug finding

来源：评论

学校读者我要写书评

暂无评论

Input Responsiveness: Using Canary Inputs to Dynamically Steer Approximation

引用

acm sigplan NOTICES 2016年第6期51卷 161-176页

作者： Laurenzano, Michael A. Hill, Parker Samadi, Mehrzad Mahlke, Scott Mars, Jason Tang, Lingjia Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

This paper introduces Input Responsive Approximation ( IRA), an approach that uses a canary input - a small program input carefully constructed to capture the intrinsic properties of the original input - to automatically control how program approximation is applied on an input-by-input basis. Motivating this approach is the observation that many of the prior techniques focusing on choosing how to approximate arrive at conservative decisions by discounting substantial differences between inputs when applying approximation. The main challenges in overcoming this limitation lie in making the choice of how to approximate both effectively (e.g., the fastest approximation that meets a particular accuracy target) and rapidly for every input. With IRA, each time the approximate program is run, a canary input is constructed and used dynamically to quickly test a spectrum of approximation alternatives. Based on these runtime tests, the approximation that best fits the desired accuracy constraints is selected and applied to the full input to produce an approximate result. We use IRA to select and parameterize mixes of four approximation techniques from the literature for a range of 13 image processing, machine learning, and data mining applications. Our results demonstrate that IRA significantly outperforms prior approaches, delivering an average of 10.2x speedup over exact execution while minimizing accuracy losses in program outputs.

关键词： Performance Runtime Systems Compilers Approximate Computing Performance Experimentation design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：