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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,814 篇 会议
176 篇 期刊文献
83 册 图书

馆藏范围

4,073 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,086 篇 工学
- 1,904 篇 计算机科学与技术...
- 1,023 篇 软件工程
- 367 篇 电气工程
- 150 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 75 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 24 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
524 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

647 篇 parallel process...
544 篇 parallel program...
527 篇 computer archite...
462 篇 parallel archite...
448 篇 concurrent compu...
358 篇 parallel algorit...
320 篇 programming
313 篇 hardware
282 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
166 篇 parallel process...
164 篇 dynamic programm...
154 篇 application soft...
139 篇 program processo...
138 篇 costs
136 篇 libraries
136 篇 distributed comp...
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...
5 篇 georgia institut...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,030 篇 英文
35 篇 其他
13 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4073 条记录，以下是2951-2960 订阅

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

详细简洁

排序：

Proceedings of the 1st Merged international parallel Processing symposium and symposium on parallel and Distributed Processing, IPPS/SPDP 1998

Proceedings of the 1st Merged International Parallel Process...

引用

1st Merged international parallel Processing symposium and symposium on parallel and Distributed Processing, IPPS/SPDP 1998

ISBN: (纸本)0818684038

The proceedings contain 125 papers. The topics discussed include: nearly optimal algorithms for broadcast on d-dimensional all-port and wormhole-routed torus;minimizing total communication distance of a time-step optimal broadcast in mesh networks;protocols for non-deterministic communication over synchronous channels;compiler optimization of implicit reductions for distributed memory multiprocessors;local enumeration techniques for sparse algorithms;an expression-rewriting framework to generate communication sets for HPF programs with block-cyclic distribution;evaluation of compiler and runtime library approaches for supporting parallel regular applications;automatic differentiation for message-passing parallel programs;processor lower bound formulas for array computations and parametric diophantine systems;a flexible class of parallel matrix multiplication algorithms;caching-efficient multithreaded fast multiplication of sparse matrices;permutation capability of optical multistage interconnection networks;HIPIQS: a high-performance switch architecture using input queuing;on the bisection width and expansion of butterfly networks;multiprocessor architectures using multi-hop multi-OPS lightwave networks and distributed control;an enhanced co-scheduling method using reduced ms-state diagrams;predicated software pipelining technique for loops with conditions;and analyzing the individual combined effects of speculative and guarded execution on a superscalar architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An object-oriented collection of minimum degree algorithms 2nd

An object-oriented collection of minimum degree algorithms

引用

2nd international symposium on Computing in Object-Oriented parallel Environments

作者： Kumfert, G Pothen, A Old Dominion Univ Dept Comp Sci Norfolk VA 23529 USA NASA Langley Res Ctr ICASE Hampton VA 23681 USA

ISBN: (纸本)3540653872

The multiple minimum degree (MMD) algorithm and its variants have enjoyed more than 20 years of research and progress in generating fill-reducing orderings for sparse, symmetric, positive definite matrices. Although conceptually simple, efficient implementations of these algorithms are deceptively complex and highly specialized. In this case study, we present an object-oriented library that implements several recent minimum degree-like algorithms. We discuss how object-oriented design forces us to decompose these algorithms in a different manner than earlier codes and demonstrate how this impacts the flexibility and efficiency of our C++ implementation. We compare the performance of our code against other implementations in C or Fortran.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Optimizing transformations of stencil operations for parallel object-oriented scientific frameworks on cache-based architectures 2nd

Optimizing transformations of stencil operations for paralle...

引用

2nd international symposium on Computing in Object-Oriented parallel Environments

作者： Bassetti, F Davis, K Quinlan, D Univ Calif Los Alamos Natl Lab Los Alamos NM 87545 USA

ISBN: (纸本)3540653872

High-performance scientific computing relies increasingly on high-level, large-scale, object-oriented software frameworks to manage both algorithmic complexity and the complexities of parallelism: distributed data management, process management, inter-process communication, and load balancing. This encapsulation of data management, together with the prescribed semantics of a typical fundamental component of such object-oriented frameworks-a parallel or serial array class library-provides an opportunity for increasingly sophisticated compile-time optimization techniques. This paper describes two optimizing transformations suitable for certain classes of numerical algorithms, one for reducing the cost of inter-processor communication, and one for improving cache utilization;demonstrates and analyzes the resulting performance gains;and indicates how these transformations are being automated.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Efficient runtime thread management for the nano-threads programming model 12th

引用

10 Workshops held in conjunction with 12th international parallel symposium and 9th symposium on parallel and Distributed Processing, IPPS/SPDP 1998

作者： Nikolopoulos, Dimitrios S. Polychronopoulos, Eleftherios D. Papatheodorou, Theodore S. High Performance Computing Architectures Laboratory Department of Computer Engineering and Informatics University of Patras Rio Patras26500 Greece

ISBN: (纸本)3540643591

The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelism from standard applications. A prerequisite for the applicability of the nano-threads programming model is the ability of the runtime environment to manage parallelism at any level of granularity with minimal overheads. In this paper, we introduce runtime techniques for efficient memory management and user-level scheduling in an experimental runtime system designed to support the nano-threads programming model. We evaluate the exploitation of processor affinity for the management of nano-thread contexts, and the use of hierarchical queues to implement user-level scheduling strategies for applications with inherent multilevel parallelism. The proposed mechanisms attempt to obtain maximum benefits from data locality on cache-coherent NUMA multip'rocessors. Through the use of synthetic benchmarks, we find that our mechanism for memory management in the runtime system reduces overheads by 52% on average, compared to other known mechanisms. The use of hierarchical queues gives significant performance improvements between 17% and 40%, compared to scheduling strategies that use local queues. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Multiprogramming

来源：评论

学校读者我要写书评

暂无评论

parallel tree building on a range of shared address space multiprocessors: algorithms and application performance

Parallel tree building on a range of shared address space mu...

引用

international symposium on parallel Processing

作者： H. Shan J.P. Singh Department of Computer Science Princeton University USA

Irregular, particle-based applications that use trees, for example hierarchical N-body applications, are important consumers of multiprocessor cycles, and are argued to benefit greatly in programming ease from a coherent shared address space programming model. As more and more supercomputing platforms that can support different programming models become available to users, from tightly-coupled hardware-coherent machines to clusters of workstations or SMPs, to truly deliver on its ease of programming advantages to application users it is important that the shared address space model not only perform and scale well in the tightly-coupled case but also port well in performance across the range of platforms (as the message passing model can). For tree-based N-body applications, this is currently not true: while the actual computation of interactions ports well, the parallel tree building phase can become a severe bottleneck on coherent shared address space platforms, in particular on platforms with less aggressive, commodity-oriented communication architectures (even though it takes less 3 percent of the time in most sequential executions). The authors therefore investigate the performance of five parallel tree building methods in the context of a complete galaxy simulation on four very different platforms that support this programming model.

关键词： Hardware Application software Message passing Protocols Partitioning algorithms Workstations Buildings Context modeling Coherence Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

High-level management of communication schedules in HPF-like languages 98

High-level management of communication schedules in HPF-like...

引用

Proceedings of the 1998 international Conference on Supercomputing

作者： Benkner, Siegfried Mehrotra, Piyush Van Rosendale, John Zima, Hans Univ of Vienna Vienna Austria

ISBN: (纸本)9780897919982

The goal of High Performance Fortran (HPF) is to 'address the problems of writing data parallel programs where the distribution of data affects performance', providing the user with a high-level language interface for programming scalable parallel architectures and delegating to the compiler the task of producing an explicity parallel message-passing program. For some applications, this approach may result in dramatic performance losses. An important example is the inspector/executor paradigm, which HPF uses to support irregular data accesses in parallel loops. In many cases, the compiler does not have sufficient information to decide whether an inspector computation is redundant or needs to be repeated. In such cases, the performance of the whole program may be significantly degraded. In this paper, we describe an approach to solve this problem through the introduction of constructs allowing explicit manipulation of communication schedules at the HPF language level. The goal is to avoid the use of extrinsics for expressing irregular computation via message-passing primitives, while guaranteeing essentially the same performance. These languages features allow the user to control the reuse of schedules and to specify access patterns that may be used to compute a schedule. They have been implemented as part of the HPF+ language and we report some preliminary performance numbers from this implementation.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

All-du-path coverage for parallel programs 98

All-du-path coverage for parallel programs

引用

1998 ACM SIGSOFT international symposium on Software Testing and Analysis, ISSTA 1998

作者： Yang, Cheer-Sun D. Souter, Amie L. Pollock, Lori L. Department of Computer and Information Sciences University of Delaware NewarkDE19716 United States

ISBN: (纸本)0897919718

One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools simikvto the tools that sequential programmers currently utilize. In partici liai automatic or semi-automatic testing tools for parallel program are lacking. This paper describes our work in automatic generstioa of all-du-paths for testing parallel programs. Our goal is to demonstrate that with some extension sequential test data adequacy cri teria are still applicable to parallel program testing. The concepts and algorithms in this paper have been incorporated as the foundatior of our Delaware parallel Software Testing Aid della pasta.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel evolutionary optimisation with constraint propagation

Parallel evolutionary optimisation with constraint propagati...

引用

5th international Conference on parallel Problem Solving from Nature (PPSN V)

作者： Ruiz-Andino, A Araujo, L Ruz, J Sáenz, F Univ Complutense Madrid Dept Comp Sci Madrid Spain

ISBN: (纸本)3540650784

This paper describes a parallel model for a distributed memory architecture of a non traditional evolutionary computation method, which integrates constraint propagation and evolution programs. This integration provides a problem-independent optimisation strategy for large scale constrained combinatorial problems over finite integer domains. We have adopted a global parallelisation approach which preserves the properties, behaviour, and theoretical studies of the sequential algorithm. Moreover, high speedup is achieved since genetic operators are coarse-grained, as they perform a search in a discrete space carrying out constraint propagation. A global parallelisation implies a single population but, as we focus on distributed memory architectures, the single virtual population is physically distributed among the processors. Selection and mating consider all the individuals in the population, but the application of genetic operators is performed in parallel. The implementation of the model has been tested on a GRAY T3E multiprocessor using two complex constrained optimisation problems. Experiments have proved the efficiency of this approach since linear speedups have been obtained.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

On evolving hardware: On-line evolution by cellular programming

On evolving hardware: On-line evolution by cellular programm...

引用

Proceedings of the 1998 IEEE international symposium on Circuits and Systems, ISCAS. Part 5 (of 6)

作者： Nicoletti, Guy M. Univ of Pittsburgh at Greensburg Pittsburgh United States

Extensive research shows that the implementation of evolutionary algorithms are costly in many cases. This paper reports on an alternative construct, namely non-uniform cellular automatons (CA) with which (1) it is possible to increase the capacity for complex computations while preserving the main features of CAs, (2) evolve parallel cellular machines to perform computational tasks via cellular programming, and (3) attain evolware with implementations centering on hardware. The hardware architecture of the cellular programming evolware departs from in that: (1) a group of individual cells is in operation rather than a single one, (2) genetic operators are implemented on-board rather than on offline computer, and (3) the evolutionary phase proceeds uninterrupted via a continuous machine's operation. The active components of the evolware complex comprise exclusively the latest cellular FPGA circuit. Accordingly, this paper is organized as follows: Section I presents fundamentals and analysis of computations in Quasi-Uniform Cellular Automata in a quasi-uniform cellular space. Section II introduces the basic approach for Coevolving Cellular Computation and Cellular Machines, denoted Cellular programming. Section III adopts synchronization as a criteria to attain evolware centered on hardware. Cellular programming is implemented in hardware. The algorithm is slightly modified (without loss of performance): the genetic operators, one-point crossover and mutation, are replaced with the operator uniform crossover. This results in the creation of an offspring genome from two parent genomes (bit strings) with a 50% probability for each parent. Finally, Section IV analyzes performance and results.

关键词： Cellular neural networks

来源：评论

学校读者我要写书评

暂无评论

Characterization of efficiently solvable problems on distance-hereditary graphs

引用

9th Annual international symposium on algorithms and Computation, ISAAC'98

作者： Hsieh, Sun-Yuan Ho, Chin-Wen Hsu, Tsan-Sheng Ko, Ming-Tat Chen, Gen-Huey Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science and Information Engineering National Central University Chung-Li Taiwan Institute of Information Science Academia Sinica Taipei Taiwan

ISBN: (纸本)3540653856

In the literature, there are quite a few sequential and parallel algorithms to solve problems in a distance-hereditary graph G utilizing techniques discovered from the properties of the problems. Based on structural properties of G, we first sketch characteristics of problems which can be systematic solved on G and then define a general problem-solving paradigm. Given a decomposition tree representation of G, we propose a unified approach to construct sequential dynamic-programming algorithms for several fundamental graph-theoretical problems that fit into our paradigm. We also show that our sequential solutions can be efficiently parallelized using the tree contraction technique. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共408页 << < 292 293 294 295 296 297 298 299 300 301 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：