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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是2971-2980 订阅

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

详细简洁

排序：

Breaking the barriers: two models for MPI programming

Breaking the barriers: two models for MPI programming

引用

international Conference on parallel Architecture and Compilation Techniques (PACT)

作者： J. Roda C. Rodriguez D.G. Morales F. Almeida P. Pulido D. Dorta Dpto. Estadistica I.O. y Computacion Univ. de La Laguna Tenerife Spain

The asynchronous nature of many MPI/PVM programs does not fit the BSP model. The barrier synchronization imposed by the model restricts the range of available algorithms and their performance. Through the suppression of barriers and the generalization of the concept of superstep we propose two new models, the BSP-like and the BSP Without Barriers (BSPWB) models. While the BSP-like extends the BSP* model to programs written using collective operations, the more general BSPWB model admits the MPI/PVM parallel asynchronous programming style. As LogP, the model encourages locality but it is simpler to use. The parameters of the models and their quality are evaluated on a distributed shared memory machine, the Origin 2000 and on a distributed memory machine, the CRAY T3E. The dependence of the time spent in an h-relation is stronger in the communication pattern than in the number of processors. The total variation of the h-relation time in both the patterns and processor numbers is smaller than sixty nanoseconds. To illustrate the proposed models, two different applications are considered: a parallel Sort using Regular Sampling (PSRS) and a parallel Dynamic programming Algorithm solving the Single Resource Allocation Problem (SRAP). The PSRS is a synchronous algorithm with a rich set of collective communication patterns and coarse grain communications. On the opposite extreme, the SRAP is a fine grain communication algorithm using permutation patterns. The computational results prove the accuracy of the models. The prediction of the communication times is robust even for the SRAP, where communication is dominated by small messages.

关键词： Costs parallel processing parallel programming Tellurium Sampling methods Dynamic programming Resource management Computer networks Concurrent computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Hectiling: an integration of fine and coarse-grained load-balancing strategies 98

Hectiling: an integration of fine and coarse-grained load-ba...

引用

international symposium on High Performance Distributed Computing

作者： S.H. Russ I. Banicescu S. Ghafoor B. Janapareddi J. Robinson Rong Lu NSF Engineering Research Center for Computational Field Simulation Mississippi State University USA

ISBN: (纸本)9780818685798

General-purpose programmers have come to expect a high degree of portability among widely varying architectures. Advances in run-time systems for parallel programs have been proposed in order to harness available resources as efficiently as possible. Simultaneously, advances in algorithmic methods of dynamically balancing computational load have been proposed in order to respond to variations in actual performance and therefore in run-time. The primary mechanism for harnessing idle resources effectively, task migration, can be used alongside the primary mechanism for dynamic load balancing, data redistribution. Besides the fact that the two methods can be used simultaneously to spur further increases in performance, the run-time information-gathering infrastructure necessary to detect and use idle resources can also benefit dynamically load-balanced applications. This paper describes an architecture for and preliminary implementation of a system that combines data-parallel load balancing with task-parallel load balancing. Performance test results are included as well.

关键词： Yarn programming profession Workstations Computational modeling Heuristic algorithms Runtime Load management System testing Application software Operating systems

来源：评论

学校读者我要写书评

暂无评论

Otter: bridging the gap between MATLAB and ScaLAPACK 98

Otter: bridging the gap between MATLAB and ScaLAPACK

引用

international symposium on High Performance Distributed Computing

作者： M.J. Quinn A. Malishevsky N. Seelam Department of Computer Science Oregon State University Corvallis OR USA

ISBN: (纸本)9780818685798

We have developed a compiler, nicknamed "Otter", which translates ordinary MATLAB scripts into C programs targeting parallel computers supporting ScaLAPACK and several other parallel numerical libraries. We outline the phases of the multi-pass compiler and we discuss the design and implementation of the runtime library. We present the performance achieved by ten compiled benchmark scripts on four distinct parallel platforms, relative to the speed of the MATLAB interpreter executing these scripts on a single CPU. Finally, we illustrate how different data distributions and block sizes can affect the performance of a compiled code.

关键词： MATLAB Runtime library Concurrent computing Program processors Runtime environment Central Processing Unit parallel programming parallel architectures Personal communication networks Design optimization

来源：评论

学校读者我要写书评

暂无评论

NoWait-RPC: extending ONC RPC to a fully compatible message passing system

NoWait-RPC: extending ONC RPC to a fully compatible message ...

引用

international symposium on parallel Processing

作者： T. Hopfner F. Fischer G. Farber Laboratory for Process Control and Real-Time Systems Germany Technische Universität München Germany

Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communication. Remote Procedure Calling (RPC) fulfills these requirements but suffers unnecessarily strict synchronization and the danger of deadlocks with complex client/server relations. Using message passing to avoid the inherent problems of RPC, however requires additional knowledge and sometimes a complete structural redesign. This paper presents NoWait-RPC, an extended but fully compatible version of SUN's Open Network Computing Group's ONC RPC, which adds message passing capabilities to form an easy to use programming environment for robust system integration. NoWait-RPC was developed to resolve potentially arising deadlocks in an already RPC-based complex application. It is designed to be a plug-and-play substitute for ONC RPC and consists of the library and the extended protocol compiler nwrpcgen. Additionally, applications using the asynchronous (non-blocking) features of NoWait-RPC may experience a major speedup compared to ONC RPC through pipelining calls to different servers. It has successfully been employed in a research programme dealing with the development of autonomous mobile robots.

关键词： Message passing System recovery Application software Computer architecture Communication system software Network servers Sun Computer networks programming environments Robustness

来源：评论

学校读者我要写书评

暂无评论

Optimizing data scheduling on processor-in-memory arrays

Optimizing data scheduling on processor-in-memory arrays

引用

international symposium on parallel Processing

作者： Y. Tian E.H.-M. Sha C. Chantrapornchai P.M. Kogge Department of Computer Science and Engineering University of Notre Dame Notre Dame IN USA

In the study of PetaFlop project, Processor-in-Memory array was proposed to be a target architecture in achieving 10/sup 15/ floating point operations per second computing performance. However one of the major obstacles to achieve the fast computing was interprocessor communications, which lengthen the total execution time of an application. A good data scheduling, consisting of finding initial data placement and data movement during the run-time, can give a significant reduction in the total communication cost and the execution time of the application. In this paper, we propose efficient algorithms for the data scheduling problem. Experimental results show the effectiveness of the proposed approaches. Compared with default data distribution methods such as row-wise or column-wise distributions, the average improvement for the tested benchmarks can be up to 30%.

关键词： Processor scheduling Electrical capacitance tomography Runtime Terminology Computer science Costs Benchmark testing parallel architectures Computer architecture Logic

来源：评论

学校读者我要写书评

暂无评论

Stratum approaches to temporal DBMS implementation

Stratum approaches to temporal DBMS implementation

引用

international symposium on Database Engineering and Applications (IDEAS)

作者： K. Torp C.S. Jensen R.T. Snodgrass Department of Computer Science University of Aalborg Denmark Department of Computer Science University of Arizona Tucson USA

Previous approaches to implementing temporal DBMSs have assumed that a temporal DBMS must be built from scratch, employing an integrated architecture and using new temporal implementation techniques such as temporal indexes and join algorithms. However, this is a very large and time-consuming task. The paper explores approaches to implementing a temporal DBMS as a stratum on top of an existing non-temporal DBMS, rendering implementation more feasible by reusing much of the functionality of the underlying conventional DBMS. More specifically, the paper introduces three stratum meta-architectures, each with several specific architectures. Based on a new set of evaluation criteria, advantages and disadvantages of the specific architectures are identified. The paper also classifies all existing temporal DBMS implementations according to the specific architectures they, employ. It is concluded that a stratum architecture is the best short, medium, and perhaps even long-term, approach to implementing a temporal DBMS.

关键词： Computer science Database systems Computer architecture Read only memory Cost accounting Financial management Stock markets Electrical capacitance tomography Writing programming profession

来源：评论

学校读者我要写书评

暂无评论

Partitioned schedules for clustered VLIW architectures

Partitioned schedules for clustered VLIW architectures

引用

international symposium on parallel Processing

作者： M.M. Fernandes J. Llosa N. Topham Dept. of Comput. Sci. Edinburgh Univ. UK Department d' Arquitectura de Computadors Universitat Politecnica de Catalunya Spain Department of Computer Science University of Edinburgh UK

This paper presents results on a new approach to partitioning a modulo-scheduled loop for distributed execution on parallel clusters of functional units organized as a VLIW machine. A distinctive characteristic of this architecture is the use of register files organized by means of queues, which results in a number of advantages over conventional schemes, but also requires the development of specific compiling and hardware features. We have investigated a scheme based on copy operations to deal with data values to be consumed more than once during loop execution. Experiments with loop unrolling were also performed in order to optimize both loop execution and the use of machine resources. A partitioning algorithm has been implemented to perform some experiments with the clustered architecture model, an organization widely accepted as being essential for very wide issue machines.

关键词： VLIW Hardware Pipeline processing parallel processing Processor scheduling Computer architecture Computer science Registers Software algorithms Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Aggressive dynamic execution of multimedia kernel traces

Aggressive dynamic execution of multimedia kernel traces

引用

international symposium on parallel Processing

作者： B. Bishop R. Owens M.J. Irwin Department of Computer Science and Engineering Pennsylvania State University University Park PA USA

There has been relatively little analytical work on processor optimizations for multimedia applications. With the introduction of MMX by Intel, it is clear that this is an area of increasing importance. Building on previous work, the authors propose optimizations for multimedia architectures that support independent parallel execution of instructions within dynamically assembled traces, resulting in dramatic performance improvements. Specifically they propose simplified instruction scheduling and register renaming algorithms due to constraints on trace formation. In addition, they suggest specific instruction pool and trace cache parameters. They constructed a simulator in order to measure the benefits of these processor optimizations for multimedia applications. The simulated machine, which could fetch/decode 2 instructions per cycle, performed better than a superscalar machine that could fetch/decode 8 instructions per cycle. Execution rates as high as 7.3 instructions per cycle were achieved for the benchmarks simulated, assuming 16 instructions per trace.

关键词： Kernel Dynamic scheduling parallel processing Processor scheduling Decoding Computer science Application software Buildings Assembly Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

parallelization of benchmarks for scalable shared-memory multiprocessors 98

Parallelization of benchmarks for scalable shared-memory mul...

引用

international Conference on parallel Architecture and Compilation Techniques (PACT)

作者： Yunheung Paek A. Navarro E. Zapata D. Padua New Jersey Institute of Technology USA University of Màlaga Spain University of Illinois USA

ISBN: (纸本)9780818685910

This paper identifies practical compiling techniques for scalable shared memory machines. For this, we have focused on experimental studies using a real machine and representative codes. In the experiments, we transformed conventional codes to shared memory codes using several existing techniques and ran the output on the target machine to evaluate those techniques and to identify where improvement is needed. Based on the analysis of the results, we developed a few new techniques, and experimented again on the target machine to measure the effectiveness of each one. The results reported in this paper were quite positive, lending useful information to future research on compiler optimizations for existing SSM machines.

关键词： Contracts Message passing Radio access networks programming profession Program processors parallel machines Government Benchmark testing Yarn algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient methods for multi-dimensional array redistribution 98

Efficient methods for multi-dimensional array redistribution

引用

international Conference on parallel Architecture and Compilation Techniques (PACT)

作者： Yeh-Ching Chung Ching-Hsien Hsu Department of Information Engineering Feng Chia University FCU Taichung Taiwan

ISBN: (纸本)9780818685910

In this paper, we present efficient methods for multidimensional array redistribution. Based on the previous work, the basic-cycle calculation technique, we present a basic-block calculation (BBC) and a complete-dimension calculation (CDC) techniques. We have developed a theoretical model to analyze the computation costs of these two techniques. The theoretical model shows that the BBC method has smaller indexing costs and performs well for the redistribution with small array size. The CDC method has smaller packing/unpacking costs and performs well when the array size is large. We also have implemented these two techniques along with the PITFALLS method and the Prylli's method on an IBM SP2 parallel machine. The experimental results show that the BBC method has the smallest execution time of these four algorithms when the array size is small. The CDC method has the smallest execution time of these four algorithms when the array size is large. Furthermore, the BBC method outperforms the PITFALLS method and the Prylli's method for all test samples.

关键词： Phased arrays Costs Runtime Computational efficiency Testing Fast Fourier transforms Equations parallel programming Program processors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共408页 << < 294 295 296 297 298 299 300 301 302 303 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：