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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

63 篇 会议

馆藏范围

63 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

56 篇 工学
- 54 篇 软件工程
- 37 篇 计算机科学与技术...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
9 篇 理学
- 8 篇 数学
- 2 篇 系统科学
- 1 篇 大气科学
1 篇 教育学
- 1 篇 教育学

主题

6 篇 parallel program...
4 篇 computer program...
4 篇 concurrency
4 篇 gpu
3 篇 performance anal...
3 篇 synchronization
2 篇 shared memory pa...
2 篇 performance
2 篇 parallelism
2 篇 optimization
2 篇 concurrent data ...
2 篇 fusion
2 篇 semantics
2 篇 machine learning
2 篇 parallel computi...
2 篇 cache-coherence
2 篇 sparse matrix
2 篇 functional progr...
2 篇 scheduling
2 篇 openmp

机构

3 篇 carnegie mellon ...
2 篇 tsinghua univ de...
2 篇 pacific northwes...
2 篇 inria rocquencou...
2 篇 tsinghua univ pe...
2 篇 purdue univ w la...
1 篇 ist austria klos...
1 篇 fudan univ sch c...
1 篇 nyu comp sci dep...
1 篇 department of co...
1 篇 department of co...
1 篇 jetbrains prague...
1 篇 tera computer co...
1 篇 bnrist peoples r...
1 篇 coll william & m...
1 篇 univ lisbon inst...
1 篇 univ of californ...
1 篇 uc riverside riv...
1 篇 coll william mar...
1 篇 argonne natl lab...

作者

3 篇 chen wenguang
3 篇 zhai jidong
3 篇 wang haojie
2 篇 blelloch guy e.
2 篇 li jiajia
2 篇 dhulipala laxman
2 篇 steele guy l. jr...
2 篇 chen haibo
2 篇 rainey mike
2 篇 anderson daniel
2 篇 krishnamoorthy s...
2 篇 jin yuyang
2 篇 tang xiongchao
1 篇 guan haibing
1 篇 nicol david m.
1 篇 viswanathan rame...
1 篇 ichiyoshi nobuyu...
1 篇 dhruva tirumala
1 篇 ichiyoshi n.
1 篇 tirumala dhruva

语言

63 篇 英文

检索条件"任意字段=Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"

共 63 条记录，以下是31-40 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Real-time, concurrent checkpoint for parallel programs 90

Real-time, concurrent checkpoint for parallel programs

引用

2nd acm sigplan symposium on principles and practice of parallel programming, PPOPP 1990

作者： Li, Kai Naughton, Jeffrey F. Plank, James S. Computer Science Department Princeton University United States Computer Science Department University of Wisconsin United States

ISBN: (纸本)0897913507

We have developed and implemented a checkpointing and restart algorithm for parallel programs running on commercial uniprocessors and shared-memory multipro cessors. The algorithm runs concurrently with the target program, interrupts the target program for small, fixed amounts of time and is transparent to the checkpointed program and its compiler. The algorithm achieves its efficiency through a novel use of address translation hardware that allows the most time-consuming operations of the checkpoint to be overlapped with the running of the program being checkpointed. © 1990 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Multi-model parallel programming in psyche 90

Multi-model parallel programming in psyche

引用

2nd acm sigplan symposium on principles and practice of parallel programming, PPOPP 1990

作者： Scott, Michael L. LeBlanc, Thomas J. Marsh, Brian D. Computer Science Department University of Rochester RochesterNY14627 United States

ISBN: (纸本)0897913507

Many different parallel programming models, including lightweight processes that communicate with shared memory and heavyweight processes that communicate with messages, have been used to implement parallel applications. Unfortunately, operating systems and languages designed for parallel programming typically support only one model. Multi-model parallel programming is the simultaneous use of several different models, both across programs and within a single program. This paper describes multi-model parallel programming in the Psyche multiprocessor operating system. We explain why multi-model pro-grarnming is desirable and present an operating system interface designed to support it. Through a series of three examples, we illustrate how die Psyche operating system supports different models of parallelism and how the different models are able to interact. © 1990 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

It's Time for a New Old Language 17

It's Time for a New Old Language

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Steele, Guy L., Jr. Oracle Labs Burlington MA 01803 USA

ISBN: (纸本)9781450344937

The most popular programming language in computer science has no compiler or interpreter. Its definition is not written down in any one place. It has changed a lot over the decades, and those changes have introduced ambiguities and inconsistencies. Today, dozens of variations are in use, and its complexity has reached the point where it needs to be re-explained, at least in part, every time it is used. Much effort has been spent in hand-translating between this language and other languages that do have compilers. The language is quite amenable to parallel computation, but this fact has gone unexploited. In this talk we will summarize the history of the language, highlight the variations and some of the problems that have arisen, and propose specific solutions. We suggest that it is high time that this language be given a complete formal specification, and that compilers, IDEs, and proof-checkers be created to support it, so that all the best tools and techniques of our trade may be applied to it also.

关键词： programming languages compilers specifications

来源：评论

学校读者我要写书评

暂无评论

Leveraging parallel Nesting in Transactional Memory

Leveraging Parallel Nesting in Transactional Memory

引用

15th acm sigplan symposium on principles and practice of parallel programming

作者： Barreto, Joao Dragojevic, Aleksandar Ferreira, Paulo Guerraoui, Rachid Kapalka, Michal Univ Tecn Lisboa INESC ID Lisbon Portugal Swiss Fed Inst Technol CH-1015 Lausanne Switzerland

ISBN: (纸本)9781605587080

Exploiting the emerging reality of affordable multi-core architectures goes through providing programmers with simple abstractions that would enable them to easily turn their sequential programs into concurrent ones that expose as much parallelism as possible. While transactional memory promises to make concurrent programming easy to a wide programmer community, current implementations either disallow nested transactions to run in parallel or do not scale to arbitrary parallel nesting depths. This is an important obstacle to the central goal of transactional memory, as programmers can only start parallel threads in restricted parts of their code. This paper addresses the intrinsic difficulty behind the support for parallel nesting in transactional memory, and proposes a novel solution that, to the best of our knowledge, is the first practical solution to meet the lowest theoretical upper bound known for the problem. Using a synthetic workload configured to test parallel transactions on a multi-core machine, a practical implementation of our algorithm yields substantial speed-ups (up to 22x with 33 threads) relatively to serial nesting, and shows that the time to start and commit transactions, as well as to detect conflicts, is independent of nesting depth.

关键词： Algorithms Nested parallel programs fork-join work-stealing transactional memory

来源：评论

学校读者我要写书评

暂无评论

POSTER: A parallel Branch-and-Bound Algorithm with History-Based Domination 27

POSTER: A Parallel Branch-and-Bound Algorithm with History-B...

引用

27th acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Gonggiatgul, Taspon Shobaki, Ghassan Muyan-Ozcelik, Pinar Calif State Univ Sacramento CA USA

ISBN: (纸本)9781450392044

In this paper, we describe a parallel Branch-and-Bound (B&B) algorithm with a history-based domination technique, and we apply it to the Sequential Ordering Problem (SOP). To the best of our knowledge, the proposed algorithm is the first parallel B&B algorithm that includes a history-based domination technique and is the first parallel B&B algorithm for solving the SOP using a pure B&B approach. The proposed algorithm takes a pool-based approach and employs a collection of novel techniques that we have developed to achieve effective parallel exploration of the solution space, including parallel history domination, history table memory management, and a thread restart technique. The proposed algorithm was experimentally evaluated using the SOPLIB and TSPLIB benchmarks. The results show that using ten threads with a time limit of one hour on the medium-difficulty instances, the proposed algorithm gives a geometric-mean speedup of 19.9 on SOPLIB and 10.23 on TSPLIB, with super-linear speedups up to 65x seen on 17 instances.

关键词： parallel branch-and-bound sequential ordering problem combinatorial optimization NP-complete problems

来源：评论

学校读者我要写书评

暂无评论

POSTER: Towards OmpSs-2 and OpenACC Interoperation 27

POSTER: Towards OmpSs-2 and OpenACC Interoperation

引用

27th acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Korakitis, Orestis De Gonzalo, Simon Garcia Guidotti, Nicolas Barreto, Joao Pedro Monteiro, Jose C. Pena, Antonio J. Barcelona Supercomputing Ctr Barcelona Spain Univ Lisbon Inst Super Tecnico INESC ID Lisbon Portugal

ISBN: (纸本)9781450392044

The increasing demand in HPC to utilize accelerators has motivated the development of pragma-based directives to target these devices. OmpSs-2 and OpenACC are both directive-based solutions that allow application programmers to utilize accelerators. The two leverage distinct types of parallelism: task parallelism and data parallelism, respectively. Non-trivial scientific applications can benefit from both types of available parallelism. However, the combination of pragma-based models is difficult to coordinate, as both assume full control and are unaware of each other at runtime. We propose an interoperation mechanism to enable novel composability across pragma-based programming models. We study and propose a clear separation of duties and implement our approach by augmenting the OmpSs-2 programming model, compiler and runtime to support OmpSs-2 + OpenACC programming.

关键词： programming Productivity Data-flow Paradigm Runtime Scheduling Code Transformation parallelism GPU

来源：评论

学校读者我要写书评

暂无评论

A Chare Kernel implementation of a parallel prolog compiler 90

A Chare Kernel implementation of a parallel prolog compiler

引用

2nd acm sigplan symposium on principles and practice of parallel programming, PPOPP 1990

作者： Ramkumar, Balkrishna Kalé, Laxmikant V. Dept. of Computer Science University of Illinois at Urbana-Champaign UrbanaIL61801 United States

ISBN: (纸本)0897913507

We have designed and implemented a compiler for the parallel execution of Prolog programs as a machine independent application on top of a run time environment for parallel programming called the Chare Kernel. The compiler is based on the Reduce-OR process model for the And and OR parallel execution of Prolog programs and hence exploits both OR and independent And parallelism found in Prolog programs. We describe the salient features of the parallel Prolog compiler from the viewpoint of its implementation as a Chare Kernel application. The responsibilities of process creation, load balancing, queueing strategies for work pool management, memory management and interprocess communication are all assumed by the Chare Kernel thereby eliminating these concerns at the application level. We discuss the effectiveness of this separation for a large application like the parallel Prolog compiler. The machine independence property makes the compiler easy to port on all machines, both shared and nonshared, that support the Chare Kernel. The compiler has been implemented on a variety of machines, including the Encore Mnltimax, the Sequent Symmetry, the Intel iPSC/2 hypercube and the Alliant FX/8. We briefly discuss its performance on a range of benchmarks exhibiting And, OR and And/OR parallelism on two of these machines. The speedups obtained are linear, demonstrating the effectiveness of the Chare Kernel as a simple, elegant, yet powerful environment for parallel programming. © 1990 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Design and distributed implementation of the parallel logic language shared prolog 90

Design and distributed implementation of the parallel logic ...

引用

2nd acm sigplan symposium on principles and practice of parallel programming, PPOPP 1990

作者： Ambriola, V. Ciancarini, P. Danelutto, M. Dipartimento di Informatica Università di Pisa Italy Dipartimento di Matematica e Informatica Università di Udine Italy

ISBN: (纸本)0897913507

The parallel logic language Shared Prolog embeds Prolog as its sequential component. A program in Shared Prolog is composed of a set of logic agents, i.e. Prolog programs, that communicate associatively via a shared workspace called blackboard. The distinct features that characterize Shared Prolog with respect to other parallel (logic) languages are: scheduling of agents and granularity of parallelism explicitly controlled;Prolog embedded in the language;intrinsic modularity;associative send/receive of messages among agents with a simple operational semantics in terms of assert/retract of clauses. The model of communication puts Shared Prolog in the Linda family of parallel languages. The current prototype implementation is exposed. The architecture of the system is a distributed network of extended Prolog interpreters running under Unix and communicating via Internet sockets, and was obtained refining a specification written in SP itself. © 1990 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

parallel Block-Delayed Sequences 22

Parallel Block-Delayed Sequences

引用

27th acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Westrick, Sam Rainey, Mike Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450392044

programming languages using functions on collections of values, such as map, reduce, scan and filter, have been used for over fifty years. Such collections have proven to be particularly useful in the context of parallelism because such functions are naturally parallel. However, if implemented naively they lead to the generation of temporary intermediate collections that can significantly increase memory usage and runtime. To avoid this pitfall, many approaches use "fusion" to combine operations and avoid temporary results. However, most of these approaches involve significant changes to a compiler and are limited to a small set of functions, such as maps and reduces. In this paper we present a library-based approach that fuses widely used operations such as scans, filters, and flattens. In conjunction with existing techniques, this covers most of the common operations on collections. Our approach is based on a novel technique which parallelizes over blocks, with streams within each block. We demonstrate the approach by implementing libraries targeting multicore parallelism in two languages: parallel ML and C++, which have very different semantics and compilers. To help users understand when to use the approach, we define a cost semantics that indicates when fusion occurs and how it reduces memory allocations. We present experimental results for a dozen benchmarks that demonstrate significant reductions in both time and space. In most cases the approach generates code that is near optimal for the machines it is running on.

关键词： parallel programming fusion collections functional programming

来源：评论

学校读者我要写书评

暂无评论

Conference Record of the Annual acm symposium on principles of programming Languages

Conference Record of the Annual ACM Symposium on Principles ...

引用

2nd acm SIGACT-sigplan symposium on principles of programming Languages, POPL 1975

The proceedings contain 22 papers. The topics discussed include: application of lattice algebra to loop optimization;fast and usually linear algorithm for global flow analysis;some optimization techniques for an extensible language;automatic data structure choice in a language of very high level;correctness-preserving program transformations;reduction: a new method of proving properties of systems of processes;semantic model for parallel systems with scheduling;a description of path expressions by Petri nets;and even simple programs are hard to analyze.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共7页 << < 1 2 3 4 5 6 7 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：