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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

8 篇 会议

馆藏范围

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

日期分布

学科分类号

7 篇 工学
- 6 篇 计算机科学与技术...
- 6 篇 软件工程
2 篇 理学
- 1 篇 地质学
- 1 篇 系统科学

主题

2 篇 parallel program...
1 篇 program debuggin...
1 篇 computer circuit...
1 篇 r
1 篇 application prog...
1 篇 machine learning
1 篇 parallel
1 篇 solid-state driv...
1 篇 locks (fasteners...

机构

1 篇 dept. of compute...
1 篇 i.b .m. t.j. wat...
1 篇 computer science...
1 篇 computer systems...
1 篇 johns hopkins un...
1 篇 johns hopkins un...
1 篇 center for resea...
1 篇 amazon seattle w...
1 篇 department of co...
1 篇 johns hopkins un...
1 篇 computer science...
1 篇 johns hopkins un...
1 篇 department of co...

作者

1 篇 warren david h. ...
1 篇 allan yang j.
1 篇 mint sang lyul
1 篇 burns randal
1 篇 vogelstein joshu...
1 篇 costa vitor sant...
1 篇 rinard martin c.
1 篇 hollingsworth je...
1 篇 mhembere disa
1 篇 mellor-crummey j...
1 篇 choi jong-deok
1 篇 zheng da
1 篇 scottt michael l...
1 篇 miller barton p.
1 篇 yang rong
1 篇 bruce irvin r.
1 篇 priebe carey e.
1 篇 lam monica s.
1 篇 choo young-ii

语言

8 篇 英文

检索条件"任意字段=3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 1991"

共 8 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of the acm sigplan symposium on principles and practice of parallel programming, ppopp

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

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

ISBN: (纸本)0897913906

The proceedings contain 21 papers. The topics discussed include: optimal schedules for parallel prefix computation with bounded resources;parallel-program transformation using a metalanguage;mapping concurrent programs to VLIW Processors;a unified framework for systematic loop transformations;scanning polyhedra with DO loops;removal of redundant dependence in DOACROSS constant dependence;exploitation of APL data parallelism on a shared-memory MIMD machine;Andorra-I: a parallel prolog system that transparently exploits both and- and or-parallelism;and scalable reader- writer synchronization for shared-memory multiprocessors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coarse-grain parallel programming 3

Coarse-grain parallel programming

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Lam, Monica S. Rinard, Martin C. Computer Systems Laboratory Stanford University CA94305 United States

ISBN: (纸本)0897913906

This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-Time system use this information to concurrently execute the program while respecting the progmm's data dependence constraints. Using Jade can significantly reduce the time and effort required to develop and maintain a parallel version of an imperative application with serial semantics. The paper introduces the basic principles of the language, compares Jade with other existing lrmguages, and presents the performance of a sparse matrix Cholesky factorization algorithm implemented in Jade. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Andorra-I: A parallel prolog system that transparently exploits both and-and or-parallelism 91

Andorra-I: A parallel prolog system that transparently explo...

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Costa, Vitor Santos Warren, David H. D. Yang, Rong Department of Computer Science University of Bristol BristolBS8 ITR United Kingdom

ISBN: (纸本)0897913906

Andorra-I is an experimental parallel Prolog system that transparently exploits both dependent and-parallelism and or-parallelism. It constitutes the first implementation of the Basic Andorra model, a parallel execution model for logic programs in which determinate goals are executed before other goals. This model, besides combining two of the most important forms of implicit parallelism in logic programs, also provides a form of implicit coroutining. This means that Andorra-I not only supports standard Prolog but also provides the capabilities of flat committed-choice languages such as Parlog and GHC. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

parallel-program transformation using a metalanguage 91

Parallel-program transformation using a metalanguage

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Allan Yang, J. Choo, Young-Ii Department of Computer Science Yale University New HavenCT06520-2158 United States

ISBN: (纸本)0897913906

Thk paper describes how program transformation using a rnetalanguage can be an effective methodology for developim~ gcorrect and efficient parallel programs. As an example, a class of different parallel matrix multiplication programs are derived. Starting from a four-line, intuitive, easy-Toverify, though inefficient program, more sophisticated and eilicient programs are derived. All the transformation steps preserve the semantics of the initial program so that the transformation process is a verification of the equivalence among all the derived programs. The metalanguage provides a simple, flexible, extensible, and formal framework for expressing transformational schemes. It also automates tlhe cumbersome and error-prone part of the program transformation. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

RACE FRONTIER: Reproducing data parallel-program debugging 3

RACE FRONTIER: Reproducing data parallel-program debugging

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Choi, Jong-Deok Mint, Sang Lyul I.B .M. T.J. Watson Research Center P.O. Box 704 Yorktown HeightsNY10598 United States Dept. of Computer Engineering Pusan National University Pusan609-735 Korea Republic of

ISBN: (纸本)0897913906

A data race is a typical case of unintended nondeterminism, which occurs when two or more processes concurrently access the same memory location, with at least one of the accesses being a write access. This paper presents a mechanism to debug data races in the execution of parallel programs. A RACE FRONTIER is a set of execution events, one event for each process, whose execution histories, including data races preceding them, can be reproduced. Data races can be debugged by first identifying a RACE FRONTIER and then reproducing all the events, including data-race events? up to the RACE FRONTIER. Reproducing and debugging data races up to a RACE FRONTIER will eventually result in an execution instance without any data races. This paper describes how to identify a RACE FRONTIER and how to reproduce the execution history of data races up to the RACE FRONTIER. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Scalable reader-writer synchronization for shared-memory multiprocessors 91

Scalable reader-writer synchronization for shared-memory mul...

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Mellor-Crummey, John M. Scottt, Michael L. Computer Science Department University of Rochester RochesterNY14627 United States Center for Research on Parallel Computation Rice University P.O. Box 1892 HoustonTX77251-1892 United States

ISBN: (纸本)0897913906

Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value. On uniprocessors, mutual exclusion and readerwriter locks are typically designed to de-schedule blocked processes;however, on shared-memory multiprocessors it is often advantageous to have processes busy wait. Unfortunately, implementations of busy-wait locks on sharedmemory multiprocessors typically cause memory and network contention that degrades performance. Several researchers have shown how to implement scalable mutual exclusion locks that exploit locality in the memory hierarchies of shared-memory multiprocessors to eliminate contention for memory and for the processor-memory interconnect. In this paper we present reader-writer locks that similarly exploit locality to achieve scalability, with variants for reader preference, writer preference, and reader-writer fairness. Performance results on a BBN TC2000 multiprocessor demonstrate that our algorithms provide low latency and excellent scalability. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

FlashR: parallelize and Scale R for Machine Learning using SSDs 18

FlashR: Parallelize and Scale R for Machine Learning using S...

引用

23rd acm sigplan symposium on principles and practice of parallel programming (ppopp)

作者： Zheng, Da Mhembere, Disa Vogelstein, Joshua T. Priebe, Carey E. Burns, Randal Amazon Seattle WA 98109 USA Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Johns Hopkins Univ Dept Biomed Engn Inst Computat Med Baltimore MD 21218 USA Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD 21218 USA Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9781450349826

R is one of the most popular programming languages for statistics and machine learning, but it is slow and unable to scale to large datasets. The general approach for having an efficient algorithm in R is to implement it in C or FORTRAN and provide an R wrapper. FlashR accelerates and scales existing R code by parallelizing a large number of matrix functions in the R base package and scaling them beyond memory capacity with solid-state drives (SSDs). FlashR performs memory hierarchy aware execution to speed up parallelized R code by (i) evaluating matrix operations lazily, (ii) performing all operations in a DAG in a single execution and with only one pass over data to increase the ratio of computation to I/O, (iii) performing two levels of matrix partitioning and reordering computation on matrix partitions to reduce data movement in the memory hierarchy. We evaluate FlashR on various machine learning and statistics algorithms on inputs of up to four billion data points. Despite the huge performance gap between SSDs and RAM, FlashR on SSDs closely tracks the performance of FlashR in memory for many algorithms. The R implementations in FlashR outperforms H2O and Spark MLlib by a factor of 3-20.

关键词： R parallel machine learning solid-state drives

来源：评论

学校读者我要写书评

暂无评论

The integration of application and system based metrics in a parallel program performance tool 91

The integration of application and system based metrics in a...

引用

3rd acm sigplan symposium on principles and practice of parallel programming, ppopp 1991

作者： Hollingsworth, Jeflrey K. Bruce Irvin, R. Miller, Barton P. Computer Sciences Department University of Wiseonsin-Madison 1210 W. Dayton Street MadisonWI53706 United States

ISBN: (纸本)0897913906

The IPS-2 parallel program measurement tools provide performance data from application programs, the operating system, hardware, network, and other sources. Previous versions of IPS-2 allowed programmers to collect information about an application based only on what could be collected by software instrumentation inserted into the program (and system call libraries). We have developed an open interface, called the "external time histogram", providing a graceful way to include external data from many sources. The user can tell IPS-2 of new sources of performance data through an extensible metric description language. The data from these external sources is automatically collected when the application program is run. IPS-2 provides a library to simplify constructing the external data collectors. The new version of IPS-2 can measure sharedmemory and message-passing parallel programs running on a heterogeneous collection of machines. Data from C or Fortran programs, and data from simulations ean be processed by the same tool. As a result of including the new external performance data, IPS-2 now can report on a whole new set of performance problems. We describe the results of using IPS-2 on two real applications: A shared-memory database join utility, and a multi-processor interconnection network simulator. Even though these applications previously went through careful tuning, we were able to precisely identify performance problems and extract additional performance improvements of about 30%. © 1991 Association for Computing Machinery. All Rights Reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：