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

Exploiting high-level coherence information to optimize distributed shared state

acm sigplan NOTICES 2003年第10期38卷 131-142页

作者： Chen, DQ Tang, CQ Sanders, B Dwarkadas, S Scott, ML Univ Rochester Dept Comp Sci Rochester NY 14627 USA

InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointer-rich data structures across a wide variety of hardware architectures, operating systems, and programming languages. As a complement to RPC/RMI, InterWeave facilitates the rapid development of maintainable code by allowing processes to access shared data using ordinary reads and writes. Internally, InterWeave employs a variety of aggressive optimizations to obtain significant performance improvements with minimal programmer effort. In this paper, we focus on application-specific optimizations that exploit dynamic high-level information about an application's spatial data access patterns and the stringency of its coherence requirements. Using applications drawn from computer vision, datamining, and web proxy caching, we illustrate the specification of coherence requirements based on the (temporal) concept of "recent enough" to use, and introduce two (spatial) notions of views, which allow a program to limit coherence management to the portion of a data structure actively in use. Experiments with these applications show that InterWeave can reduce their communication traffic by up to one order of magnitude with minimum effort on the part of the application programmer.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Session details: programming model extensions 08

Session details: Programming model extensions

引用

Proceedings of the 13th acm sigplan symposium on principles and practice of parallel programming

作者： Lauren Smith U.S. Department of Defense

No abstract available.

ISBN: (纸本)9781595937957

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of Java's Remote Method Invocation

Proceedings of the ACM SIGPLAN Symposium on Principles and P...

引用

Proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP 1999年 173-182页

作者： Maassen, Jason van Nieuwpoort, Rob Veldema, Ronald Bal, Henri E. Plaat, Aske Vrije Universiteit Amsterdam Netherlands

Java offers interesting opportunities for parallel computing. In particular, Java Remote Method Invocation provides an unusually flexible kind of Remote Procedure Call. Unlike RPC, RMI supports polymorphism, which requires the system to be able to download remote classes into a running application. Sun's RMI implementation achieves this kind of flexibility by passing around object type information and processing it at run time, which causes a major run time overhead. Using Sun's JDK 1.1.4 on a Pentium Pro/Myrinet cluster, for example, the latency for a null RMI (without parameters or a return value) is 1228 μsec, which is about a factor of 40 higher than that of a user-level RPC. In this paper, we study an alternative approach for implementing RML based on native compilation. this approach allows for better optimization, eliminate the need for processing of type information at run time, and makes a light weight communication protocol possible. We have built a Java system based on a native compiler, which supports both compile time and run time generation of marshallers. We find that almost all of the run time overhead of RMI can be pushed to compile time. With this approach, the latency of a null RMI is reduced to 34 μsec, while still supporting polymorphic RMIs (and allowing interoperability with other JVMs).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Space-time memory: A parallel programming abstraction for interactive multimedia applications

Proceedings of the ACM SIGPLAN Symposium on Principles and P...

引用

Proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP 1999年 183-192页

作者： Ramachandran, Umakishore Nikhil, Rishiyur S. Harel, Nissim Rehg, James M. Knobe, Kathleen Georgia Inst of Technology Atlanta United States

Realistic interactive multimedia involving vision, animation, and multimedia collaboration is likely to become an important aspect of future computer applications. the scalable parallelism inherent in such applications coupled with their computational demands make them ideal candidates for SMPs and clusters of SMPs. these applications have novel requirements that offer new kinds of challenges for parallel system design. We have designed a programming system called Stampede that offers many functionalities needed to simplify development of such applications (such as high-level data sharing abstractions, dynamic cluster-wide threads, and multiple address spaces). We have built Stampede and it runs on clusters of SMPs. To date we have implemented two applications on Stampede, one of which is discussed herein. In this paper we describe a part of Stampede called Space-Time Memory (STM). It is a novel data sharing abstraction that enables interactive multimedia applications to manage a collection of time-sequenced data items simply, efficiently, and transparently across a cluster. STM relieves the application programmer from low level synchronization and data communication by providing a high level interface that subsumes buffer management, inter-thread synchronization, and location transparency for data produced and accessed anywhere in the cluster. STM also automatically handles garbage collection of data items that will no longer be accessed by any of the application threads. We discuss ease of use issues for developing applications using STM, and present preliminary/performance results to show that STM's overhead is low.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

ParGeo: a library for parallel computational geometry 22

ParGeo: a library for parallel computational geometry

引用

Proceedings of the 27th acm sigplan symposium on principles and practice of parallel programming

作者： Yiqiu Wang Shangdi Yu Laxman Dhulipala Yan Gu Julian Shun MIT CSAIL UC Riverside

We present ParGeo, a multicore library for computational geometry algorithms. We describe two of the algorithms from ParGeo, convex hull and the smallest enclosing ball, and present a short evaluation of all implement...

ISBN: (纸本)9781450392044

关键词：

来源：评论

学校读者我要写书评

暂无评论

Para-functional programming: A paradigm for programming multiprocessor systems 86

Para-functional programming: A paradigm for programming mult...

引用

13th AnnuaJ acm symposium on the principles of programming Languages, POPL 1986

作者： Hudak, Paul Smith, Lauren Yale University Department of Computer Science United States

ISBN: (纸本)089791175X

One of the most important pragmatic advantages of functional languages is that concurrency in a program is implicit-there is no need for special constructs to express parallelism as is required in most conventional languages. Furthermore, it is fairly easy for compilers to automatically determine the concurrency as a step toward decomposing a program for execution on a suitable parallel architecture. Yet it is often the case that one knows precisely the optimal decomposition for execution on a particular machine, and one can never expect a compiler to determine such optimal mappings in all cases. this paper is concerned with ways to allow the programmer to explicitly express this mapping of program to machine, by using annotations that, given a few minor constraints, cannot alter the functional semantics of the program. We show through several deeded examples the expressiveness and conciseness of the resulting " para-functional programming methodology, using an experimental language called ParAlfl based on our ideas. We also give a formal denotational description of the mapping semantics using a notion of execution trees.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Impala: a middleware system for managing autonomic, parallel sensor systems

引用

acm sigplan NOTICES 2003年第10期38卷 107-118页

作者： Liu, T Martonosi, M Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

Sensor networks are long-running computer systems with many sensing/compute nodes working to gather information about their environment, process and fuse that information, and in some cases, actuate control mechanisms in response. Like traditional parallel systems, communication between nodes is of fundamental importance, but is typically accomplished via wireless transceivers. One further key attribute of sensor networks is that they are almost always long-running systems, intended to operate in situ, with minimal direct human intervention, for months or years. this requirement for long-running autonomy mandates careful design of the runtime system that manages applications on each node, to ensure reliability and ease of upgrades over the life of the system. this paper describes Impala, a middleware architecture that enables application modularity, adaptivity, and repair-ability in wireless sensor networks. Impala allows software updates to be received via the node's wireless transceiver and to be applied to the running system dynamically. In addition, Impala also provides an interface for on-the-fly application adaptation in order to improve the performance, energy-efficiency, and reliability of the software system. Impala has been designed to be a part of the ZebraNet mobile sensor network, but we are also prototyping it within HP/Compaq iPAQ Pocket PC handhelds. We present performance data for both real system measurements of the Pocket PC version as well as simulations of a full mobile sensor system deployment. Overall, Impala is a lightweight runtime system that can greatly improve system reliability, performance, and energy-efficiency. the ideas introduced here for sensor networks have applicability more broadly in other long-running autonomous parallel systems as well.

关键词： design experimentation performance sensor networks middleware system software adaptation software update

来源：评论

学校读者我要写书评

暂无评论

Automatic differentiation of parallel loops with formal methods 22

Automatic differentiation of parallel loops with formal meth...

引用

Proceedings of the 27th acm sigplan symposium on principles and practice of parallel programming

作者： Jan Hückelheim Laurent Hascoët Argonne National Laboratory Inria Sophia Antipolis

ISBN: (纸本)9781450392044

the accompanying poster to this short paper presents a combination of reverse mode AD and formal methods to enable efficient differentiation of (or backpropagation through) shared-memory parallel code. Compared to the state of the art, our approach can more often avoid the need for atomic updates or private data copies during the parallel derivative computation, even in the presence of unstructured or data-dependent data access patterns. this is achieved by gathering information about the memory access patterns from the input program, which is assumed to be correctly parallelized. this information is then used to build a model of assertions in a theorem prover, which can be used to check the safety of shared memory accesses during the parallel derivative computation.

关键词： OpenMP

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for masked sparse matrix-matrix products 22

Parallel algorithms for masked sparse matrix-matrix products

引用

Proceedings of the 27th acm sigplan symposium on principles and practice of parallel programming

作者： Srđan Milaković Oguz Selvitopi Israt Nisa Zoran Budimlić Aydin Buluç Rice University Lawrence Berkeley Nat. Laboratory AWS AI

ISBN: (纸本)9781450392044

Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is known as Masked SpGEMM since a subset of the output entries is considered to be "masked out". In this work, we investigate various novel algorithms and data structures for this rather challenging and important computation, and provide guidelines on how to design a fast Masked-SpGEMM for shared-memory architectures.

关键词： GraphBLAS

来源：评论

学校读者我要写书评

暂无评论

Compilers and parallel computing systems 08

Compilers and parallel computing systems

引用

Proceedings of the 13th acm sigplan symposium on principles and practice of parallel programming

作者： Frances Allen IBM T. J. Watson Research Center Yorktown Height NY USA

ISBN: (纸本)9781595937957

Increasing the delivered performance of computers by running programs in parallel is an old idea with a new urgency. Multi cores (multi processors) on chips have emerged as a way to increase performance wherever chips are used. the talk will focus on the role programming languages and compilers must play in delivering parallel performance to users and applications. the speaker's personal experiences with languages and compilers for high performance systems will provide the basis for her observations. the talk is intended to encourage the exploration of new approaches.

关键词： keynote talk abstract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：