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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

329 篇 会议
31 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

63 篇 performance
48 篇 parallel process...
39 篇 algorithms
36 篇 parallel program...
33 篇 languages
30 篇 design
20 篇 parallel algorit...
20 篇 gpu
10 篇 experimentation
10 篇 measurement
9 篇 theory
9 篇 parallel computi...
8 篇 parallel
7 篇 mpi
7 篇 graphics process...
7 篇 logic programmin...
7 篇 concurrency
6 篇 parallelism
5 篇 scalability
5 篇 graph algorithms

机构

7 篇 carnegie mellon ...
5 篇 indiana univ blo...
3 篇 univ wisconsin d...
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 篇 purdue univ w la...
3 篇 univ calif berke...
2 篇 ist austria klos...
2 篇 georgetown univ ...
2 篇 yale university ...
2 篇 coll william & m...
2 篇 shanghai key lab...
2 篇 univ of wisconsi...

作者

8 篇 blelloch guy e.
6 篇 hoefler torsten
6 篇 garland michael
6 篇 chen haibo
6 篇 shun julian
5 篇 sun yihan
5 篇 zhai jidong
5 篇 tsigas philippas
5 篇 kennedy ken
4 篇 dhulipala laxman
4 篇 miller barton p.
4 篇 tan guangming
4 篇 wang haojie
4 篇 nikolopoulos dim...
4 篇 long guoping
4 篇 valero mateo
4 篇 mellor-crummey j...
4 篇 agrawal kunal
4 篇 gu yan
4 篇 leiserson charle...

语言

345 篇 英文
15 篇 其他

检索条件"任意字段=Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming"

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

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

详细简洁

排序：

parallel skeletons for structured composition

Parallel skeletons for structured composition

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Darlington, John Guo, Yi-ke To, Hing Wing Yang, Jin Imperial Coll London United Kingdom

In this paper, we propose a straightforward solution to the problems of compositional parallel programming by using skeletons as the uniform mechanism for structured composition. In our approach parallel programs are constructed by composing procedures in a conventional base language using a set of high-level, predefined, functional, parallel computational forms known as skeletons. the ability to compose skeletons provides us with the essential tools for building further and more complex application-oriented skeletons specifying important aspects of parallel computation. Compared with the process network based composition approach, such as PCN, the skeleton approach abstracts away the fine details of connecting communication ports to the higher level mechanism of making data distributions conform, thus avoiding the complexity of using lower level ports as the means of interaction. thus, the framework provides a natural integration of the compositional programming approach with the data parallel programming paradigm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Linear-time algorithm for computing the memory access sequence in data-parallel programs

Linear-time algorithm for computing the memory access sequen...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Kennedy, Ken Nedeljkovic, Nenad Sethi, Ajay Rice Univ Houston United States

Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the development of new techniques in both compilers and run-time systems. In this paper, we present an improved algorithm for finding the local memory access sequence in computations involving regular sections of arrays with cyclic(k) distributions. After establishing the fact that regular section indices correspond to elements of an integer lattice, we show how to find a lattice basis that allows for simple and fast enumeration of memory accesses. the complexity of our algorithm is shown to be lower than that of the previous solution for the same problem. In addition, the experimental results demonstrate the efficiency of our method in practice.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

High performance synchronization algorithms for multiprogrammed multiprocessors

High performance synchronization algorithms for multiprogram...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Wisniewski, Robert W. Kontothanassis, Leonidas I. Scott, Michael L. Univ of Rochester Rochester United States

Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barrier synchronization. Unfortunately, scalable synchronization algorithms are particularly sensitive to the effects of multiprogramming: their performance degrades sharply when processors are shared among different applications, or even among processes of the same application. In this paper we describe the design and evaluation of scalable scheduler-conscious mutual exclusion locks, reader-writer locks, and barriers, and show that by sharing information across the kernel/application interface we can improve the performance of scheduler-oblivious implementations by more than an order of magnitude.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

GENERATING parallel CODE FROM OBJECT-ORIENTED MAthEMATICAL-MODELS

GENERATING PARALLEL CODE FROM OBJECT-ORIENTED MATHEMATICAL-M...

引用

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

作者： ANDERSSON, N FRITZSON, P Linkoping Univ Linkoping Sweden

For a long time efficient use of parallel computers has been hindered by dependencies introduced in software through low-level implementation practice. In this paper we present a programming environment and language called Object-Math (Object oriented Mathematical language for scientific computing), which aims at eliminating this problem by allowing the user to represent mathematical equation-based models directly in the system. the system performs analysis of mathematical models to extract parallelism and automatically generates parallel code for numerical solution. In the context of industrial applications in mechanical analysis, we have so far primarily explored generation of parallel code for solving systems of ordinary differential equations (ODEs), in addition to preliminary work on generating code for solving partial differential equations. Two approaches to extracting parallelism have been implemented and evaluated: extracting parallelism at the equation system level and at the single equation level, respectively. We found that for several applications the corresponding systems of equations do not partition well into subsystems. this means that the equation system level approach is of restricted general applicability. thus, we focused on the equation-level approach which yielded significant parallelism for ODE systems solution. For the bearing simulation applications we present here, the achieved speedup is however critically dependent on low communication latency of the parallel computer.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Distributed data access in AC

Distributed data access in AC

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Carlson, William W. Draper, Jesse M. IDA Supercomputing Research Cent Bowie United States

We have modified the C language to support a programming model based on a shared address space with physically distributed memory. With this model users can write programs in which the nodes of a massively parallel processor can access remote memory without message passing. AC provides support for distributed arrays as well as pointers to distributed data. Simple array references and pointer dereferencing are sufficient to generate low-overhead remote reads and writes. We have implemented these ideas in a compiler based on the GNU C compiler and targeted at Cray Research's T3D. Initial performance measurements show that AC generates code for remote accesses which is considerably faster than that of the native compiler for structures up to about 16 words in size and virtually equivalent for larger transfers.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Evaluating the locality benefits of active messages

Evaluating the locality benefits of active messages

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Spertus, Ellen Dally, William J. Massachusetts Inst of Technology Cambridge United States

A major challenge in fine-grained computing is achieving locality without excessive scheduling overhead. We built two J-Machine implementations of a fine-grained programming model, the Berkeley threaded Abstract Machine. One implementation takes an Active Messages approach, maintaining a scheduling hierarchy in software in order to improve data cache performance. Another approach relies on the J-Machine's message queues and fast task switch, lowering the control costs at the expense of data locality. Our analysis measures the costs and benefits of each approach, for a variety of programs and cache configurations. the Active Messages implementation is strongest when miss penalties are high and for the finest-grained programs. the hardware-buffered implementation is strongest in direct-mapped caches, where it achieves substantially better instruction cache performance.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Data and computation transformations for multiprocessors

Data and computation transformations for multiprocessors

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Anderson, Jennifer M. Amarasinghe, Saman P. Lam, Monica S. Stanford Univ Stanford United States

Effective memory hierarchy utilization is critical to the performance of modem multiprocessor architectures. We have developed the first compiler system that fully automatically parallelizes sequential programs and changes the original array layouts to improve memory system performance. Our optimization algorithm consists of two steps. the first step chooses the parallelization and computation assignment such that synchronization and data sharing are minimized. the second step then restructures the layout of the data in the shared address space with an algorithm that is based on a new data transformation framework. We ran our compiler on a set of application programs and measured their performance on the Stanford DASH multiprocessor. Our results show that the compiler can effectively optimize parallelism in conjunction with memory subsystem performance.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Cilk: An efficient multithreaded runtime system

Cilk: An efficient multithreaded runtime system

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Blumofe, Robert D. Joerg, Christopher F. Kuszmaul, Bradley C. Leiserson, Charles E. Randall, Keith H. Zhou, Yuli MIT Lab for Computer Science Cambridge United States

Cilk (pronounced `silk') is a C-based runtime system for multi-threaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the `work' and `critical path' of a Cilk computation can be used to accurately model performance. Consequently, a Cilk programmer can focus on reducing the work and critical path of his computation, insulated from load balancing and other runtime scheduling issues. We also prove that for the class of `fully strict' (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal. the Cilk runtime system currently runs on the Connection Machine CM5 MPP, the Intel Paragon MPP, the Silicon Graphics Power Challenge SMP, and the MIT Phish network of workstations. Applications written in Cilk include protein folding, graphic rendering, backtrack search, and the Socrates chess program, which won third prize in the 1994 acm International Computer Chess Championship.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient support for irregular applications on distributed-memory machines

Efficient support for irregular applications on distributed-...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Mukherjee, Shubhendu S. Sharma, Shamik D. Hill, Mark D. Larus, James R. Rogers, Anne Saltz, Joel Univ of Wisconsin-Madison Madison United States

Irregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type of parallel program difficult to write and adversely affects run-time performance. this paper explores three issues - partitioning, mutual exclusion, and data transfer - crucial to the efficient execution of irregular problems on distributed-memory machines. Unlike previous work, we studied the same programs running in three alternative systems on the same hardware base (a thinking Machines CM-5): the CHAOS irregular application library, Transparent Shared Memory (TSM), and extensible Shared Memory (XSM). CHAOS and XSM performed equivalently for all three applications. Both systems were somewhat (13%) to significantly faster (991%) than TSM.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL MAPPING OF SEQUENCES OF DATA-parallel TASKS 95

OPTIMAL MAPPING OF SEQUENCES OF DATA-PARALLEL TASKS

引用

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

作者： SUBHLOK, J VONDRAN, G HEWLETT PACKARD CORP ADV LASER JET OPERAT BOISE ID 83714 USA

ISBN: (纸本)9780897917001

Many applications in a variety of domains including digital signal processing, image processing, and computer vision are composed of a sequence of tasks that act on a stream of input data sets in a pipelined manner. Recent research has established that these applications are best mapped to a massively parallel machine by dividing the tasks into modules and assigning a subset of the available processors to each module. this paper addresses the problem of optimally mapping such applications onto a massively parallel machine. We formulate the problem of optimizing throughput in task pipelines and present two new solution algorithms. the formulation uses a general and realistic model for inter-task communication, takes memory constraints into account, and addresses the entire problem of mapping which includes clustering tasks into modules, assignment of processors to modules, and possible replication of modules. the first algorithm is based on dynamic programming and finds the optimal mapping of k tasks onto P processors in O(P(4)k(2)) time. We also present a heuristic algorithm that is linear in the number of processors and establish with theoretical and practical results that the solutions obtained are optimal in practical situations. the entire framework is implemented as an automatic mapping tool for the Fx parallelizing compiler for High Performance Fortran. We present experimental results that demonstrate the importance of choosing a good mapping and show that the methods presented yield efficient mappings and predict optimal performance accurately.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：