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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

488 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

211 篇 工学
- 197 篇 计算机科学与技术...
- 98 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
55 篇 理学
- 35 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

510 篇 英文
2 篇 其他
2 篇 中文

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

共 513 条记录，以下是371-380 订阅

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

详细简洁

排序：

A simple and efficient parallel disk mergesort

A simple and efficient parallel disk mergesort

引用

11th Annual ACM symposium on parallel algorithms and architectures

作者： Barve, RD Vitter, JS Winphoria Networks Andheri 400093 Mumbai India Duke Univ Dept Comp Sci Ctr Geometr & Biol Comp Durham NC 27708 USA

External sorting-the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks-is a fundamental subroutine in database systems [G], [IBM]. Of prime importance are techniques that use multiple disks in parallel in order to speed up the performance of external sorting. The simple randomized merging (SRM) mergesort algorithm proposed by Barve et al. [BGV] is the first parallel disk sorting algorithm that requires a provably optimal number of passes and that is fast in practice. Knuth [K, Section 5.4.9] recently identified SRM (which he calls "randomized striping") as the method of choice for sorting with parallel disks. In this paper we present an efficient implementation of SRM, based upon novel and elegant data structures. We give a new implementation for SRM's lookahead forecasting technique for parallel prefetching and its forecast and flush technique for buffer management. Our techniques amount to a significant improvement in the way SRM carries out the parallel, independent disk accesses necessary to read blocks of input runs efficiently during external merging. Our implementation is based on synchronous parallel I/O primitives provided by the TPIE programming environment [TPI], whenever our program issues an I/O read (write) operation, one block of data is synchronously read from (written to) each disk in parallel. We compare the performance of SRM over a wide range of input sizes with that of disk-striped mergesort (DSM), which is widely used in practice. DSM consists of a standard mergesort in conjunction with striped I/O for parallel disk access. SRM merges together significantly more runs at a time compared with DSM, and thus it requires fewer merge passes. We demonstrate in practical scenarios that even though the streaming speeds for merging with DSM are a little higher than those for SRM (since DSM merges fewer runs at a time), sorting using SRM is often significantly faster than with DSM

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

XtremWeb:: A generic Global Computing system

XtremWeb:: A generic Global Computing system

引用

1st IEEE/AMC international symposium on Cluster Computing and the Grid

作者： Fedak, G Germain, C Néri, V Cappello, F Univ Paris 11 Rech Informat Lab Orsay France

ISBN: (纸本)0769510116

Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model targets a parallel architecture defined by a very high number of nodes, poor communication performance and continuously varying resources. The unprecedented scale of the Global Computing architecture paradigm requires to revisit many, basic issues related to parallel architecture : programming models, performance models, and class of applications or algorithms suitable to this architecture, XtremWeb is an experimental Global Computing platform dedicated to provide a tool for such studies. This paper presents the design of XtremWeb. Two essential features of this design are multi-applications and high-performance. Accepting multiple applications allows institutions or enterprises to setup their own Global Computing applications or experiments. High-performance is ensured by scalability, fault tolerance, efficient scheduling and a large base of volunteer PCs. We also present an implementation of the first global application running on XtremWeb.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Runtime predictability of loops

Runtime predictability of loops

引用

IEEE international Workshop/symposium on Workload Characterization

作者： M.R. de Alba D.R. Kaeli Department of Electrical and Computer Engineering Northeastern University Boston MA USA

ISBN: (纸本)0780373154

To obtain the benefits of aggressive, wide-issue, architectures, a large window of valid instructions must be available. While researchers have been successful in obtaining high accuracies with a range of dynamic branch predictors, there still remains the need for more aggressive instruction delivery. Loop bodies possess a large amount of spatial and temporal locality. A large percentage of a program's entire execution can be attributed to code found in loop bodies. If we retain this code in a buffer or the cache, we do not have to refetch this code on subsequent loop iterations., Loops tend to iterate multiple times before exiting, thus providing us with the opportunity to speculatively issue multiple iterations. While some loops can be unrolled by a compiler many contain conditional branches. The number of times a loop iterates may be dependent on a program variable. These issues can hinder our ability to speculatively issue multiple iterations of a loop. If we are able to profile loops during runtime, we can use this information to more accurately issue speculative paths through loop bodies. In this paper we present a characterization of loop execution across the SPECint2000 benchmark suite. We intend for this study to serve as a guide in the selection of design parameters of a loop path predictor We characterize the patterns exhibited during multiple visits to a loop body. We present the design of a table that records path-based loop execution history and allows us to predict multiple loop iterations dynamically.

关键词： Runtime Dynamic range History Computer aided instruction Computer architecture programming profession Iterative algorithms parallel processing Terminology

来源：评论

学校读者我要写书评

暂无评论

Portable runtime support for graph-oriented parallel and distributed programming 5

Portable runtime support for graph-oriented parallel and dis...

引用

5th international symposium on parallel architectures, algorithms and Networks (I-SPAN 2000)

作者： Cao, J Liu, Y Xie, L Mao, B Zhang, K Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 21008 Peoples R China

ISBN: (纸本)0769509363

In this paper, we describe the design and implementation of a portable run-time system for GOP, a graph-oriented programming framework aiming at providing high-level abstractions for configuring and programming cooperative parallel processes. The runtime system provides an interface with a library of programming primitives to the low-level facilities required to support graph-oriented communications and synchronization. The implementation is on top of the parallel Virtual Machine (PVM) in a local area network of Sun workstations. Issues related to the implementation of a graph operations in a distributed environment are discussed. Performance of the runtime system is evaluated by estimating the overheads associated with using GOP primitives as opposed to PVM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings - international symposium on parallel architectures, algorithms, and Networks, I-SPAN 2000

Proceedings - International Symposium on Parallel Architectu...

引用

5th international symposium on parallel architectures, algorithms, and Networks, I-SPAN 2000

ISBN: (纸本)0769509363

The proceedings contain 40 papers. The topics discussed include: parallel real-time computation: sometimes quantity means quality;a parallel tabu search and its hybridization with genetic algorithm;reconfigurable mesh-connected processor arrays using row-column bypassing and direct replacement;batched circuit switched routing for efficient service of requests;environment of multiprocessor simulator development;portable runtime support for graph-oriented parallel and distributed programming;comprehensive evaluation of an instruction reissue mechanism;an accurate analysis of reliability parameters in meshes with fault-tolerant adaptive routing;on the effect of link failures in fibre channel storage area networks;and an approximation algorithm for multiprocessor scheduling of trees with communication delays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uintah: A massively parallel problem solving environment 9

Uintah: A massively parallel problem solving environment

引用

9th IEEE international symposium on High Performance Distributed Computing

作者： Germain, JDDS McCorquodale, J Parker, SG Johnson, CR Univ Utah Sci Comp & Imaging Inst Salt Lake City UT 84112 USA

ISBN: (纸本)0769507840

This paper describes Uintah, a component-based visual problem solving environment (PSE) that is designed to specifically address the unique problems of massively parallel computation, on terascale computing platforms. Uintah supports the entire life cycle of scientific applications by allowing scientific programmers to quickly and easily develop new techniques, debug new implementations, and apply known algorithms to solve novel problems. Uintah is built on three principles: 1) As much as possible, the complexities of parallel execution should be handled for the scientist, 2) software should be reusable at the component level, and 3) scientists should be able to dynamically steer and visualize their simulation results as the simulation executes. To provide this functionality, Uintah builds upon the best features of the SCIRun PSE and the DoE Common Component Architecture (CCA).

关键词： Application software Component architectures Computational modeling Concurrent computing Problem-solving programming profession Runtime Scientific computing Software reusability Visualization

来源：评论

学校读者我要写书评

暂无评论

Ordering unstructured meshes for sparse matrix computations on leading parallel systems

Ordering unstructured meshes for sparse matrix computations ...

引用

IEEE international parallel and Distributed Processing symposium (IPDP 2000)

作者： Oliker, L Li, XY Heber, G Biswas, R Lawrence Berkeley Natl Lab NERSC Berkeley CA 94720 USA Cornell Univ Cornell Theory Ctr Ithaca NY 14853 USA NASA Ames Res Ctr MRJ Moffett Field CA 94035 USA

ISBN: (纸本)354067442X

Computer simulations of realistic applications usually require solving a set of non-linear partial differential equations (PDEs) over a finite region. The process of obtaining numerical solutions to the governing PDEs involves solving large sparse linear or eigen systems over the unstructured meshes that model the underlying physical objects. These systems are often solved iteratively, where the sparse matrix-vector multiply (SPMV) is the most expensive operation within each iteration. In this paper, we focus on the efficiency of SPMV using various ordering/partitioning algorithms. We examine different implementations using three leading programming paradigms and architectures. Results show that ordering greatly improves performance, and that cache reuse can be more important than reducing communication. However, a multithreaded implementation indicates that ordering and partitioning are not required on the Tera MTA to obtain an efficient and scalable SPMV.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Portable runtime support for graph-oriented parallel and distributed programming

Portable runtime support for graph-oriented parallel and dis...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： J. Cao Y. Liu L. Xie B. Mao K. Zhang National Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computing Hong Kong Polytechnic University Hong Kong China Department of Computer Science University of Texas Dallas Richardson TX USA

ISBN: (纸本)0769509363

In this paper, we describe the design and implementation of a portable run-time system for GOP, a graph-oriented programming framework aiming at providing high-bevel abstractions for configuring and programming cooperative parallel processes. The runtime system provides an interface with a library of programming primitives to the low-level facilities required to support graph-oriented communications and synchronization. The implementation is on top of the parallel Virtual Machine (PVM) in a local area network of Sun workstations. Issues related to the implementation of graph operations in a distributed environment are discussed. Performance of the runtime system is evaluated by estimating the overheads associated with using GOP primitives as opposed to PVM.

关键词： parallel programming programming profession Concurrent computing Distributed computing Runtime library Data structures Distributed control Message passing Dynamic programming Portable computers

来源：评论

学校读者我要写书评

暂无评论

3rd international symposium on High Performance Computing, ISHPC 2000

3rd International Symposium on High Performance Computing, I...

引用

3rd international symposium on High Performance Computing, ISHPC 2000

ISBN: (纸本)9783540411284

The proceedings contain 56 papers. The special focus in this conference is on Compilers, architectures, Evaluation, algorithms, Models and Applications. The topics include: An object-based programming and execution model for processor-in-memory arrays;limits of task-based parallelism in irregular applications;the case for speculative multithreading on SMT processors;skewed data partition and alignment techniques for compiling programs on distributed memory multicomputers;processor mechanisms for software shared memory;an evaluation of page aggregation technique on different DSM systems;partitioned parallel radix sort;transonic wing shape optimization based on evolutionary algorithms;on performance modeling for HPF applications with ASL;performance sensitivity of routing algorithms to failures in networks of workstations;decentralized load balancing in multi-node broadcast schemes for hypercubes;design and implementation of an efficient thread partitioning algorithm;a flexible routing scheme for networks of workstations;java bytecode optimization with advanced instruction folding mechanism;performance evaluation of a java based chat system;on the influence of the selection function on the performance of networks of workstations;combining in-transit buffers with optimized routing schemes to boost the performance of networks with source routing;a comparison of locality-based and recency-based replacement policies;at our management comparison with related split data cache schemes sensitive to data localities;global magneto-hydrodynamic simulations of differentially rotating accretion disk by astrophysical rotational plasma simulator;exploring multi-level parallelism in cellular automata networks and functional BSP programs on enumerated vectors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uintah: a massively parallel problem solving environment

Uintah: a massively parallel problem solving environment

引用

international symposium on High Performance Distributed Computing

作者： J. Davison de St. Germain J. McCorquodale S.G. Parker C.R. Johnson Sci. Comput. & Imaging Inst. Utah Univ. Salt Lake City UT USA Scientific Computing and Imaging Institute Salt Lake UT USA

Describes Uintah, a component-based visual problem-solving environment (PSE) that is designed to specifically address the unique problems of massively parallel computation on tera-scale computing platforms. Uintah supports the entire life-cycle of scientific applications by allowing scientific programmers to quickly and easily develop new techniques, debug new implementations and apply known algorithms to solve novel problems. Uintah is built on three principles: (1) as much as possible, the complexities of parallel execution should be handled for the scientist, (2) the software should be reusable at the component level, and (3) scientists should be able to dynamically steer and visualize their simulation results as the simulation executes. To provide this functionality, Uintah builds upon the best features of the SCIRun (Scientific Computing and Imaging Run-time) PSE and the DoE (Department of Energy) Common Component Architecture (CCA).

关键词： Problem-solving Concurrent computing Computational modeling Application software programming profession Software reusability Visualization Scientific computing Runtime Component architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：