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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

322 篇 会议
46 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

317 篇 工学
- 271 篇 软件工程
- 256 篇 计算机科学与技术...
- 12 篇 电子科学与技术（可...
- 7 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 生物工程
- 3 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 核科学与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
55 篇 理学
- 50 篇 数学
- 4 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
16 篇 管理学
- 12 篇 管理科学与工程(可...
- 8 篇 工商管理
- 4 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

71 篇 performance
49 篇 parallel process...
43 篇 algorithms
41 篇 parallel program...
39 篇 languages
34 篇 design
21 篇 gpu
20 篇 parallel algorit...
12 篇 experimentation
12 篇 measurement
9 篇 theory
8 篇 mpi
8 篇 parallel computi...
7 篇 graphics process...
7 篇 parallel
7 篇 concurrency
6 篇 parallelism
6 篇 verification
6 篇 openmp
5 篇 reliability

机构

7 篇 carnegie mellon ...
4 篇 univ wisconsin d...
4 篇 indiana univ blo...
3 篇 univ of tokyo
3 篇 univ chinese aca...
3 篇 massachusetts in...
3 篇 univ illinois ur...
3 篇 swiss fed inst t...
3 篇 mit csail united...
3 篇 shanghai jiao to...
3 篇 tsinghua univ pe...
3 篇 univ utah sch co...
3 篇 rice univ housto...
3 篇 univ calif berke...
2 篇 ist austria klos...
2 篇 princeton univ d...
2 篇 georgetown univ ...
2 篇 shanghai key lab...
2 篇 univ of wisconsi...
2 篇 tsinghua univers...

作者

8 篇 blelloch guy e.
7 篇 chen haibo
6 篇 hoefler torsten
6 篇 garland michael
6 篇 shun julian
5 篇 sun yihan
5 篇 zhai jidong
5 篇 tsigas philippas
4 篇 dhulipala laxman
4 篇 tan guangming
4 篇 wang haojie
4 篇 nikolopoulos dim...
4 篇 long guoping
4 篇 valero mateo
4 篇 mellor-crummey j...
4 篇 gu yan
4 篇 kennedy ken
3 篇 taura kenjiro
3 篇 li jiajia
3 篇 yonezawa akinori

语言

342 篇 英文
26 篇 其他

检索条件"任意字段=17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"

共 368 条记录，以下是351-360 订阅

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

详细简洁

排序：

parallelizing algorithms for symbolic computation using ||MAPLE|| 93

Parallelizing algorithms for symbolic computation using ||MA...

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Siegl, Kurt Johannes Kepler University LinzA-4040 Austria

ISBN: (纸本)0897915895

||MAPLE|| (speak: parallel Maple) is a portable system for parallel symbolic computation. the system is built as an interface between the parallel declarative programming language Strand and the sequential computer algebra system Maple, thus providing the elegance of Strand and the power of the existing sequential algorithms in Maple. the implementation of difFerent parallel programming paradigms shows that it is fairly easy to parallelize even complex algebraic algorithms using this system. Sample applications (among them algorithms solving multivariate nonlinear equation systems) are implemented on various parallel architectures. For example a straightforward parallelization of the complex and important problem of real root isolation has been parallelized using a generic Strand program of fewer than 20 Unes of code and a slight modification of 5 lines in the original sequential Maple source. Even with such a simple modification we gained a speed-up of 5 times, that is better than those reported by others in the literature.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Leapfrogging: A portable technique for implementing efficient futures 93

Leapfrogging: A portable technique for implementing efficien...

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Wagner, David B. Calder, Bradley G. Department of Computer Science University of Colorado Campus Box 430 Boulder80309-0430 United States

ISBN: (纸本)0897915895

A future is a language construct that allows programmers to expose parallelism in applicative languages such as MultiLisp [5] with minimal effort. In this paper we describe a technique for implementing futures, which we call leapfrogging, that reduces blocking due to load imbalance. the utility of leapfrogging is enhanced by the fact that it is completely platform-independent, is free from deadlock, and places a bound on stack sizes that is at most a small constant times the maximum stack size encountered during a sequential execution of the same computation. We demonstrate the performance of leapfrogging using a prototype implementation written in C++.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

DATA-FLOW EQUATIONS FOR EXPLICITLY parallel PROGRAMS 93

DATA-FLOW EQUATIONS FOR EXPLICITLY PARALLEL PROGRAMS

引用

4th SYMP ON principles AND practice OF parallel programming ( PPOPP )

作者： GRUNWALD, D SRINIVASAN, H UNIV COLORADO DEPT COMP SCIBOULDERCO 80309

ISBN: (纸本)9780897915892

We present a solution to the reaching definitions problem for programs with explicit lexically specified parallel constructs, such as cobegin/coend or parallel-sections, both with and without explicit synchronization operations, such as Post, Wait or Advance. the reaching definitions information for sequential programs is used to solve many standard optimization problems. In parallel programs, this information can also be used to explicitly direct communication and data ownership. Although work has been done on analyzing parallel programs to detect data races, little work has been done on optimizing such programs. We show how the memory consistency model specified by an explicitly parallel programming language can influence the complexity of the reaching definitions problem. By selecting the ''weakest'' memory consistency semantics, we can efficiently solve the reaching definitions problem for correct programs.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

AN EQUATIONAL LANGUAGE FOR DATA-parallelISM 93

AN EQUATIONAL LANGUAGE FOR DATA-PARALLELISM

引用

4th SYMP ON principles AND practice OF parallel programming ( PPOPP )

作者： RAO, P WALINSKY, C PORTLAND GRP WILSONVILLEOR 97070 DARTMOUTH COLL HANOVERNH 03755

ISBN: (纸本)9780897915892

Data-parallelism provides a clean conceptual framework for parallel programming. We are developing two programming languages: a high level equational language, called EL*, and a low-level implementation language. Both languages exploit data-parallelism instead of control-parallelism. EL* is a declarative data-parallel language. EL* programs are high-level equational specifications that use extensive pattern-matching and recursion. the language's syntax and semantics are intended to be clear and simple. Recursive forms are restricted to enable translation to efficient data-parallel operations. EL* programs are compiled into FP*, a variant of Backus's FP, where parallel operations are more explicit and low-level. the target language has a rich set of functions for performing communication, and computation. It also has a powerful set of combining forms that generate large highly-parallel functions from smaller program units. Prototype compilers have been implemented for both languages, and they demonstrate good performance. Several linear algebra and non-numeric problems have been programmed with relative ease using EL*. We are currently developing compilation techniques for a wider range of scientific problems that have more complex parallel solutions, and are continuing to expand the language's scope.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

High performance fortran without templates: An alternative model for distribution and alignment 93

High performance fortran without templates: An alternative m...

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Chapman, Barbara M. Mehrotra, Piyush Zima, Hans P. Department for Software Technology and Parallel Systems University of Vienna Austria ICASE MS 132C NASA Langley Research Center HamptonVA23681 United States

ISBN: (纸本)0897915895

Language extensions of Fortran are being developed which permit the user to map data structures to the individual processors of distributed memory machines. these languages allow a programming style in which global data references are used. Current efforts are fo-cussed on designing a common basis for such languages, the result of which is known as High Performance For-tran (HPF). One of the central debates in the HPF effort revolves around the concept of templates, introduced as an abstract index space to which data could be aligned. In this paper, we present a model for the mapping of data which provides the functionality of High Performance Fortran distributions without the use of templates. © 1993 acm.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

ActorSpace: An open distributed programming paradigm 93

ActorSpace: An open distributed programming paradigm

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Agha, Gul Callsen, Christian J. Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue UrbanaIL61801 United States Department of Math and Comp. Science Aalborg University Frederik Bajers Vej 7E Aalborg Øst9220 Denmark

ISBN: (纸本)0897915895

We present a new programming paradigm called ActorSpace. ActorSpace provides a new communication model based on destination patterns. An actorSpace is a computationally passive container of actors which acts as a context for matching patterns. Patterns are matched against listed attributes of actors and ac-torSpaces that are visible in the actorSpace. Both visibility and attributes are dynamic. Messages may be sent to one or all members of a group denned by a pattern. the paradigm provides powerful support for component-based construction of massively parallel and distributed applications. In particular, it supports open interfaces to servers and pattern-directed access to software repositories. © 1993 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of a portable nested data-parallel language 93

Implementation of a portable nested data-parallel language

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Blelloch, Guy E. Chatterjee, Siddhartha Hardwick, Jonathan C. Sipelstein, Jay Zagha, Marco School of Computer Science Carnegie Mellon University PittsburghPA15213 United States RIACS Mail Stop T045-1 NASA Ames Research Center Moffett FieldCA94035 United States

ISBN: (纸本)0897915895

this paper gives an overview of the implementation of NESL, a portable nested data-parallel language. this language and its implementation are the first to fully support nested data structures as well as nested data-parallel function calls. these features allow the concise description of parallel algorithms on irregular data, such as sparse matrices and graphs. In addition, they maintain the advantages of data-parallel languages: a simple programming model and portability. the current NESL implementation is based on an intermediate language called VcODE and a library of vector routines called CVL. It runs on the Connection Machine CM-2, the Cray Y-MP C90, and serial machines. We compare initial benchmark results of NESL with those of machine-specific code on these machines for three algorithms: least-squares line-fitting, median finding, and a sparse-matrix vector product. these results show that NESL'S performance is competitive with that of machine-specific codes for regular dense data, and is often superior for irregular data. © 1993 acm.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Experiences using the parascope editor: An interactive parallel programming tool 93

Experiences using the parascope editor: An interactive paral...

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Hall, Mary W. Harvey, Timothy J. Kennedy, Ken McIntosh, Nathaniel McKinley, Kathryn S. Oldham, Jeffrey D. Paleczny, Michael H. Roth, Gerald Center for Integrated Systems Stanford University Palo AltoCA94305 United States Department of Computer Science Rice University HoustonTX77251-1892 United States 35 rue Saint Honoré Fontainebleau CedexF-77305 France

ISBN: (纸本)0897915895

the ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses, provides a set of powerful interactive transformations, and supports program editing. this paper summarizes experiences of scientific programmers and tool designers using the ParaScope Editor. We evaluate existing features and describe enhancements in three key areas: user interface, analysis, and transformation. Many existing features prove crucial to successful program parallelization. they include interprocedural array side-effect analysis and program and dependence view filtering. Desirable functionality includes improved program navigation based on performance estimation, incorporating user assertions in analysis and more guidance in selecting transformations. these results offer insights for the authors of a variety of programming tools and parallelizing compilers. © 1993 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Data locality and load balancing in COOL 93

Data locality and load balancing in COOL

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Chandra, Rohit Gupta, Anoop Hennessy, John L. Center for Integrated Systems Stanford University StanfordCA94305 United States

ISBN: (纸本)0897915895

Large-scale shared memory multiprocessors typically support a multilevel memory hierarchy consisting of per-processor caches, a local portion of shared memory, and remote shared memory. On such machines, the performance of parallel programs is often limited by the high latency of remote memory references. In this paper we explore how knowledge of the underlying memory hierarchy can be used to schedule computation and distribute data structures, and thereby improve data locality. Our study is done in the context of COOL, a concurrent object-oriented language developed at Stanford. We develop abstractions for the programmer to supply optional information about the data reference patterns of the program. this information is used by the runtime system to distribute tasks and objects so that the tasks execute close (in the memory hierarchy) to the objects they reference. We demonstrate the effectiveness of these techniques by applying them to several applications chosen from the SPLASH parallel benchmark suite. Our experience suggests that improving data locality can be simple through a combination of programmer abstractions and smart runtime scheduling.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

LogP: Towards a realistic model of parallel computation 93

LogP: Towards a realistic model of parallel computation

引用

4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993

作者： Culler, David Karp, Richard Patterson, David Sahay, Abhijit Erik Schauser, Klaus Santos, Eunice Subramonian, Ramesh Von Eicken, thorsten Computer Science Division University of California Berkeley United States International Computer Science Institute Berkeley United States

ISBN: (纸本)0897915895

A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of current and future parallel machines. this paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. It is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. the model is based on four parameters that specify abstractly the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. the utility of the model is demonstrated through examples that are implemented on the CM-5. © 1993 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：