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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 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...
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
3 篇 guoliang chen

语言

502 篇 英文
2 篇 其他
1 篇 中文

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

共 505 条记录，以下是451-460 订阅

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

详细简洁

排序：

Optimal architecture-independent scheduling of fine-grain tree-sweep computations

Optimal architecture-independent scheduling of fine-grain tr...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Lixin Gao A.L. Rosenberg R.K. Sitaraman Department of Computer Science University of Massachusetts Amherst MA USA

We present algorithms for optimally scheduling computations that comprise a sequence of complete up- and/or down-sweeps on a complete binary tree, on a parallel architecture in which the communication delay between any two processors is uniform. Such computations include, for instance, those that implement broadcast, accumulation, and the parallel-prefix operator; such architectures include, for instance, networks of workstations. Our schedules are optimal in the sense of having the actual minimum time-to-completion-not just on approximation thereof-considering the time for both computation and communication. We concentrate on schedules for fine-grain tree-sweep computations-wherein communication costs are rather large relative to per-task computation cost.

关键词： Processor scheduling Concurrent computing Computational efficiency Scheduling algorithm Binary trees parallel architectures Delay Computer networks Broadcasting Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Global predicates in rough real time

Global predicates in rough real time

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： J. Mayo P. Kearns Department of Computer Science Williamsburg VA USA

Evaluation of predicates on the state of a distributed system is complicated by the lack of either a common clock or common memory. In these systems, message passing is often used to order local events globally. This leads to a partial, causal ordering of system events. Predicate evaluation algorithms based on this causal ordering generally cannot determine if an unstable predicate was true at some instant of real time without freezing the underlying application. They only determine whether or not the predicate could have occurred. This ordering is sufficient for evaluating stable predicates, but algorithms based on it require a good deal of message passing. We present two algorithms which conclusively evaluate both stable and a restricted class of unstable predicates for a given execution. The algorithms are based on the use of roughly synchronized clocks. We present an algorithm for scheduled evaluation as well as a centralized detection algorithm.

关键词： Clocks Message passing Synchronization Computer science Detection algorithms programming Counting circuits

来源：评论

学校读者我要写书评

暂无评论

On symbolic scheduling and parallel complexity of loops

On symbolic scheduling and parallel complexity of loops

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Tao Yang O.H. Ibarra Department of Computer Science University of California Santa Barbara CA USA

We first consider the symbolic scheduling and performance prediction of a partitioned single loop on message passing architectures with non zero communication and a sufficient number of processors. The loop body contains a set of coarse grain tasks whose computational weights change during the course of the iterations. Using the macro dataflow task: model and software pipelining techniques, we develop an algorithm for computing a heuristic schedule, and provide analytic and experimental results on the correctness and asymptotic performance of this schedule. Using this result, we can show the impact of partitioning on the performance of parallelization. While this result is effective for a class of loops, there are many other methods proposed for loop parallelization. An interesting fundamental question is whether every instance of a nested loop can be efficiently executed, We present some positive and negative results on this issue.

关键词： Processor scheduling Message passing Computer architecture Software performance Pipeline processing Partitioning algorithms Software algorithms Scheduling algorithm Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures

Bubble scheduling: A quasi dynamic algorithm for static allo...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Yu-Kwong Kwok I. Ahmad Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is static, the algorithm is quasi dynamic because it is not specific to any particular system topology and thus can be used at run-time for the processor configuration available at that time. The proposed algorithm, called Bubble Scheduling and Allocation (BSA) algorithm, works by first serializing the task graph and "injecting" all the tasks to one processor. The parallel tasks are then "bubbled up" to other processors and are inserted at appropriate time slots. The edges among the tasks are also scheduled by treating communication links between the processors as resources. The scheduling of messages on the links depends on the routing strategy, such as circuit switching and wormhole routing, of the underlying network. The proposed algorithm has admissible time complexity and is suitable for regular as well as irregular task graph structures.

关键词： Dynamic scheduling Heuristic algorithms Scheduling algorithm Processor scheduling Routing Network topology Computer architecture Computer networks Computational efficiency Runtime

来源：评论

学校读者我要写书评

暂无评论

Monte Carlo and molecular dynamics simulations using p4

Monte Carlo and molecular dynamics simulations using p4

引用

international symposium on parallel Processing

作者： K.J. Runge L.P. Lee J. Correa R.T. Scalettar V. Oklobdzija Physics Department University of California Davis CA USA Department of Electrical and Computer Engineering University of California Davis CA USA

Monte Carlo (MC) and molecular dynamics (MD) simulations are powerful tools for understanding the properties of systems of interacting electrons and phonons in a solid. When mobile electrons are studied, these simulations are limited to a few hundred particles. More powerful machines and algorithms must be used to address many of the most important issues in the field. We present results from using the p4 parallel programming system on a variety of parallel architectures to conduct MC and MD simulations.< >

关键词： Monte Carlo methods Computational modeling Application software Electrons Libraries Lattices Quantum computing parallel programming Concurrent computing Software tools

来源：评论

学校读者我要写书评

暂无评论

Partitioning and scheduling for parallel image processing operations

Partitioning and scheduling for parallel image processing op...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Cheolwhan Lee Tao Yang Yuan-Fang Wang Department of Computer Science University of California Santa Barbara CA USA

ISBN: (纸本)0818671955

Many computer vision and image processing (CVIP) operations can be represented as a sequence of tasks with nested loops, specified by the visual programming language Khoros. This paper addresses the automatic partitioning and scheduling of such operations on distributed memory multiprocessors. The major difficulties in determining the optimal image data distribution for each task are that the number of processors available and the size of the input image may vary at the run time, and the cost of some image processing operations may be data-dependent. This paper proposes a compile-time processor assignment and data partitioning scheme that optimizes the average run-time performance of task chains with nested loops by considering the data redistribution overheads and possible run-time parameter variations. This paper presents the theoretical analysis and experimental results on a Meiko CS-2 distributed memory machine.

关键词： Image processing Processor scheduling Runtime Partitioning algorithms Dynamic scheduling Computer science Cost function Computer vision Concurrent computing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A communication+computation load balanced loop partitioning method

A communication+computation load balanced loop partitioning ...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： S. Pande School of Electrical Engineering and Computer Science Ohio University Athens OH USA

We present an iteration and data partitioning approach for DOALL loops on distributed memory systems. The method first examines the highest amount of parallelism (available parallelism) which could be potentially exploited in a loop nest. It then examines the amount of communication overhead which can potentially nullify the benefits due to parallelism and attempts to maximally eliminate the communication to minimize the loop completion time by trading parallelism to a minimal extent. This is achieved by determining the directions of iteration space partitioning which result in minimum communication. Finally, in order to generate a load balanced partition with respect to computation+communication, the method uses a new larger partition owns rule to distribute the underlying data. Necessary theoretical framework has been developed and the merit of the method is shown through a performance evaluation on Cray T3D.

关键词： parallel processing Computer science Distributed computing programming Data communication Distribution functions Costs Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

An evaluation of DELTA, a decoupled pre-fetching virtual shared memory system

An evaluation of DELTA, a decoupled pre-fetching virtual sha...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： I. Watson A. Rawsthorne M. Cumpstey F. Charpin Department Computer Science University of Manchester Institute of Science and Technology Manchester UK

Decoupled pre-fetching is a technique for reducing the page miss overheads in Distributed Shared Memory systems by separating out those instructions responsible for data fetching from the main instruction stream and running them on a separate CPU whose function is to predict store accesses ahead of time. This approach differs from other pre-fetching approaches in that the predictions of data usage are obtained dynamically from partial evaluation of the program and this promises to produce considerably better performance in circumstances where the access patterns are non-regular and cannot be extracted by static analysis of the program. This paper reviews the techniques of decoupled pre-fetching with particular emphasis on Cache only Memory architectures (COMA). It then presents a more thorough evaluation of the ideas than has previously been attempted using some of the SPLASH benchmarks. It is shown that the techniques perform well on some programs but that, as expected, the benefits of pre-fetching are negated when there is a high rate of data invalidation caused by global updating.

关键词： Memory architecture Yarn Switches Computer science Data mining Distributed decision making Delay programming profession Program processors Data structures

来源：评论

学校读者我要写书评

暂无评论

Supporting I/O-efficient scientific computation in TPIE

Supporting I/O-efficient scientific computation in TPIE

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： D.E. Vengroff J. Scott Vitter Department of Computer Science Brown University Providence RI USA Department of Computer Science Duke University Durham NC USA

We describe the facilities that TPIE provides to support scientific computation. TPIE, a transparent parallel I/O environment, is a system designed to assist programmers in implementing I/O-efficient computations. It supports I/O-efficient paradigms for problems from a variety of domains, including sorting and permuting, computational geometry, graph algorithms, and scientific computation. Our main focus in on the algorithmic issues faced in designing the portions of TPIE that support scientific computation. We consider four computing paradigms: scanning, sorting, sparse matrix methods, and dense matrix methods. Benchmark results using TPIE are also briefly described. References to more detailed discussions of these benchmarks, as well as the overall goals, philosophy, and structure of TPIE are provided.

关键词： Computer science Concurrent computing Algorithm design and analysis Sorting Sparse matrices Large-scale systems Bandwidth Disk drives Prototypes programming profession

来源：评论

学校读者我要写书评

暂无评论

Research on programming languages for massively parallel processing

Research on programming languages for massively parallel pro...

引用

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

作者： Amamiya, Makoto Satoh, Masahiko Makinouchi, Akifumi Hagiwara, Ken-ichi Yuasa, Taiichi Aida, Hitoshi Ueda, Kazunori Araki, Keijiro Ida, Tetsuo Baba, Takanobu Ministry of Education Science and Culture Japan

The activity of research group of massively parallel programming language is introduced. This group is developing two types of languages. The first one is the SIMD type language called NCX which is oriented toward data parallel execution, and the second is the MIMD type highly asynchronous language called V, which is oriented toward data parallel and concurrent object oriented language. The NCX is designed as a data parallel extension of the language C in order to support practical massively parallel computations especially in the application area of scientific computations. The language V on the other hand is designed as an experimental language for exploring a new massively parallel programming paradigm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共51页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：