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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

311 篇 会议
19 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

280 篇 工学
- 240 篇 软件工程
- 227 篇 计算机科学与技术...
- 13 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 生物工程
- 3 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 核科学与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 网络空间安全
53 篇 理学
- 49 篇 数学
- 4 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
15 篇 管理学
- 11 篇 管理科学与工程(可...
- 8 篇 工商管理
- 4 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

54 篇 performance
48 篇 parallel process...
33 篇 algorithms
32 篇 parallel program...
27 篇 languages
25 篇 design
20 篇 parallel algorit...
20 篇 gpu
9 篇 experimentation
9 篇 measurement
7 篇 graphics process...
7 篇 theory
7 篇 parallel
6 篇 mpi
6 篇 parallel computi...
6 篇 concurrency
5 篇 scalability
5 篇 parallelism
5 篇 graph algorithms
4 篇 gpgpu

机构

7 篇 carnegie mellon ...
5 篇 univ of tokyo
4 篇 indiana univ blo...
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 calif berke...
2 篇 ist austria klos...
2 篇 georgetown univ ...
2 篇 univ wisconsin d...
2 篇 shanghai key lab...
2 篇 univ of wisconsi...
2 篇 tsinghua univers...
2 篇 tsinghua univ de...
2 篇 shanghai jiao to...
2 篇 nvidia corporati...

作者

8 篇 blelloch guy e.
6 篇 hoefler torsten
6 篇 garland michael
6 篇 chen haibo
6 篇 shun julian
5 篇 sun yihan
5 篇 zhai jidong
4 篇 dhulipala laxman
4 篇 tsigas philippas
4 篇 tan guangming
4 篇 wang haojie
4 篇 mellor-crummey j...
4 篇 gu yan
4 篇 kennedy ken
3 篇 taura kenjiro
3 篇 li jiajia
3 篇 yonezawa akinori
3 篇 pingali keshav
3 篇 kim jungwon
3 篇 chen wenguang

语言

327 篇 英文
3 篇 其他

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

共 330 条记录，以下是321-330 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Computation migration: Enhancing locality for distributed-memory parallel systems 93

Computation migration: Enhancing locality for distributed-me...

引用

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

作者： Hsieh, Wilson C. Wang, Paul Weihl, William E. MIT Laboratory for Computer Science 545 Technology Square CambridgeMA02139 United States

ISBN: (纸本)0897915895

We describe computation migration, a new technique that is based on compile-time program transformations, for accessing remote data in a distributed-memory parallel system. In contrast with RPC-style access, where the access is performed remotely, and with data migration, where the data is moved so that it is local, computation migration moves part of the current thread to the processor where the data resides. the access is performed at the remote processor, and the migrated thread portion continues to run on that same processor;this makes subsequent accesses in the thread portion local. We describe an implementation of computation migra^ tion that consists of two parts: an implementation that migrates single activation frames, and a high-level language annotation that allows a programmer to express when migration is desired. We performed experiments using two applications;these experiments demonstrate that computation migration is a valuable alternative to RPC and data migration.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Generating local addresses and communication sets for data-parallel programs 93

Generating local addresses and communication sets for data-p...

引用

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

作者： Chatterjee, Siddhartha Gilbert, John R. Long, Fred J.E. Schreiber, Robert Teng, Shang-Hua Research Institute for Advanced Computer Science Mail Stop T045-1 NASA Ames Research Center Moffett FieldCA94035-1000 United States Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo AltoCA943041314 United States Department of Computer and Information Science University of California Santa CruzCA95064 United States Department of Mathematics Massachusetts Institute of Technology CambridgeMA02139 United States

ISBN: (纸本)0897915895

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(κ) distribution, and a computation involving the regular section A(: h: s), the local memory access sequence for any processor is characterized by a finite state machine of at most κ;states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation scheme of concurrent object-oriented languages on stock multicomputers

Efficient implementation scheme of concurrent object-oriente...

引用

proceedings of the 4th acm sigplan symposium on principles & practice of parallel programming

作者： Taura, Kenjiro Matsuoka, Satoshi Yonezawa, Akinori Univ of Tokyo Japan

ISBN: (纸本)0897915895

Several novel techniques for efficient implementation of concurrent object-oriented languages on general purpose, stock multicomputers are presented. these techniques have been developed in implementing our concurrent object-oriented language ABCL on a Fujitsu Laboratory's experimental multicomputer AP1000 consisting of 512 SPARC chips. the proposed intra-node scheduling mechanism reduces the cost of local message passing. the cost of intra-node asynchronous message passing is about 20 SPARC instructions in the best case, including locality checking, dynamic method lookup, and scheduling. the minimum latency of asynchronous internode message passing is about 9 μs, or about 120 instructions, employing the self-dispatching mechanism independently proposed by Eicken et al. A large scale benchmark which involves 9,000,000 message passings shows 440 times speedup on the 512 nodes system compared to the sequential version of the same algorithm. We rely on simple hardware support for message passing and use no specialized architectural supports for object-oriented computing. thus, we are able to enjoy the benefits of future progress in standard processor technology. Our result shows that concurrent object-oriented languages can be implemented efficiently on conventional multicomputers.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

LogP: Towards a realistic model of parallel computation

LogP: Towards a realistic model of parallel computation

引用

proceedings of the 4th acm sigplan symposium on principles & practice of parallel programming

作者： Culler, David Karp, Richard Patterson, David Sahay, Abhijit Schauser, Klaus Erik Santos, Eunice Subramonian, Ramesh von Eicken, thorsten Univ of California Berkeley United States

ISBN: (纸本)0897915895

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Analysis of event synchronization in a parallel programming tool 90

Analysis of event synchronization in a parallel programming ...

引用

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

作者： Callahan, David Kennedy, Ken Subhlok, Jaspal Tera Computer Company 400 North 34th Street SeattleWA98103 United States Department of Computer Science Rice University HoustonTX77251-1892 United States

ISBN: (纸本)0897913507

Understanding synchronization is important for a parallel programming tool that uses dependence analysis as the basis for advising programmers on the correctness of parallel constructs. this paper discusses static analysis methods that can be applied to parallel programs with event variable synchronization. the objective is to be able to predict potential data races in a parallel program. the focus is on how dependences and synchronization statements inside loops can be used to analyze complete programs with parallel loop and parallel case style parallelism. © 1990 acm.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：