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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

363 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 255 篇 计算机科学与技术...
- 173 篇 软件工程
- 25 篇 电气工程
- 23 篇 信息与通信工程
- 18 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
156 篇 理学
- 153 篇 数学
- 25 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
13 篇 管理学
- 10 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 parallel algorit...
69 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
8 篇 algorithms
7 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
4 篇 performance
4 篇 parallel archite...
4 篇 multithreading
4 篇 transactional me...
4 篇 work stealing
3 篇 parallel process...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 sorting

机构

10 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 ibm research div...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...

作者

13 篇 gibbons phillip ...
11 篇 blelloch guy e.
7 篇 matias yossi
6 篇 uzi vishkin
6 篇 ramachandran vij...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 goodrich michael...
5 篇 phillip b. gibbo...
4 篇 vijaya ramachand...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 yossi matias
4 篇 vishkin uzi
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 sohn andrew
3 篇 leighton tom

语言

368 篇 英文
13 篇 其他

检索条件"任意字段=Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures"

共 381 条记录，以下是261-270 订阅

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

详细简洁

排序：

A comparison of parallel algorithms for connected components 94

A comparison of parallel algorithms for connected components

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Greiner, John Carnegie Mellon University United States

ISBN: (纸本)0897916719

This paper presents a comparison of the pragmatic aspects of some parallel algorithms for finding connected components, together with optimizations on these algorithms. The algorithms being compared are two similar algorithms by Shiloach-Vishkin [22] and Awerbuch-Shiloach [2], a randomized contraction algorithm based on algorithms by Reif [21] and Phillips [20], and a hybrid algorithm [11]. Improvements are given for the first two to improve performance significantly, although without improving their asymptotic complexity. The hybrid combines features of the others and is generally the fastest of those tested. Timings were made using NESL [4] code as executed on a Connection Machine 2 and Cray Y-MP/C90. © 1994 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient compilation of high-level data parallel algorithms 94

Efficient compilation of high-level data parallel algorithms

引用

proceedings of the 6th annual acm symposium on parallel algorithms and architectures

作者： Suciu, Dan Tannen, Val Univ. of Pennsylvania Philadelpia

ISBN: (纸本)9780897916714

We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical “core” of an entire class of collection-oriented parallel languages. NSC is based on while-loops as opposed to general recursion. A formal, machine independent definition of the parallel time complexity and the work complexity of programs in NSC is given. Our main results are: (1) We give a translation method for a particular form of recursion, called map-recursion, into NSC, that preserves the time complexity and adds an arbitrarily small overhead to the work complexity, and (2) We give a compilation method for NSC into a very simple vector parallel machine, which preserves the time complexity and again adds an arbitrarily small overhead to the work complexity.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Modeling communication in parallel algorithms. A fruitful interaction between theory and systems? 94

Modeling communication in parallel algorithms. A fruitful in...

引用

proceedings of the 6th annual acm symposium on parallel algorithms and architectures

作者： Pal, Singh, Jaswinder Rothberg, Edward Gupta, Anoop Computer Systems Laboratory Stanford University Stanford CA Intel Supercomputer Systems 14924 NW Greenbrier Pkwy C06-09 Beaverton OR

ISBN: (纸本)9780897916714

Recently, several theoretical models of parallel architectures have been proposed to replace the PRAM as the model that is presented to an algorithm designer. A primary focus of the new models is to include the cost of interprocessor communication, which is increasingly important in modern parallel architectures. We argue that modeling the communication costs in the architecture or system is only one part of the problem. The other, and usually much more difficult, part is modeling the communication properties of the algorithm itself, which provides necessary inputs into the architectural model to determine overall complexity. In this context, we make three main points in this paper: (i) It is incomplete to describe communication without regard to its relationship with replication. We propose a description of the communication-replication relationship in terms of the working set hierarchy of an algorithm. (ii) Both inherent communication and the communication-replication relationship can be very difficult to model in irregular, dynamic computations that are crucial in many real-world applications. We present some examples that demonstrate this difficulty. (iii) We believe that substantial leverage can be obtained in this effort from the computer systems community, which can provide a hierarchy of simulation and profiling tools—from abstract to detailed—tailored to the needs of the algorithm designers. We propose an initial set of simulation tools, and we discuss possible future refinements to this set.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithm for the general planar monotone circuit value problem

Efficient parallel algorithm for the general planar monotone...

引用

proceedings of the fifth annual SIAM symposium on Discrete algorithms

作者： Ramachandran, Vijaya Yang, Honghua Univ of Texas at Austin Austin United States

ISBN: (纸本)0898713293

A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that contains only AND and OR gates. Goldschlager, Cook & Dymond and others have developed NC2 algorithms to evaluate a special layered form of a PMC. These algorithms require a large number of processors (Ω(n6), where n is the size of the input circuit). Yang, and more recently, Delcher & Kosaraju have given NC algorithms for the general planar monotone circuit value problem. These algorithms use at least as many processors as the algorithms for the layered case. In this paper, we give an efficient parallel algorithm that evaluates a general PMC of size n in polylog time using only a linear number of processors on an EREW PRAM. This is a substantial improvement over the earlier algorithms for the problem. Our algorithm uses several novel techniques to perform the evaluation, including the use of the dual of the plane embedding of the circuit to derive some crucial properties of the propagation of values within the circuit.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel tasks to minimize average response time

Scheduling parallel tasks to minimize average response time

引用

proceedings of the fifth annual SIAM symposium on Discrete algorithms

作者： Turek, John Schwiegelshohn, Uwe Wolf, Joel L. Yu, Philip S. IBM Thomas J. Watson Research Cent Yorktown Heights United States

ISBN: (纸本)0898713293

Consider a system of independent tasks which are to be scheduled without preemption on a parallel computer. For each task both the number of processors required and the corresponding execution time are known. The problem of finding a schedule with minimum makespan has been extensively studied in the literature. In this paper we tackle the corresponding problem of finding a schedule with minimum average response time. The results are analogous: The average response time problem is also NP-hard, and we construct a polynomial time algorithm whose solution is within a fixed multiplicative constant of optimal. Moreover, we show that none of the classic algorithms for the makespan problem have this property when viewed as solutions to the average response time problem.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

List ranking and list scan on the Cray C-90 94

List ranking and list scan on the Cray C-90

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Reid-Miller, Margaret School of Computer Science Carnegie Mellon University PittsburghPA15213-3891 United States

ISBN: (纸本)0897916719

List ranking and list scan are two primitive operations used in many parallel algorithms that use list, trees, and graph data structures. But vectorizing and parallelizing list ranking is a challenge because it is highly communication intensive and dynamic. In addition, the serial algorithm is very simple and has very small constants. In order to compete, a parallel algorithm must also be simple and have small constants. A parallel algorithm due to Wyllie is such an algorithm, but it is not work efficient-its performance degrades for longer and longer linked lists. In contrast, work efficient PRAM algorithms developed to date have very large constants. We introduce a new fully vectorized and parallelized algorithm that both is work efficient and has small constants. It does not achieve O(log n) running time, but we contend that work efficiency and small constants is more important, given that vector and multiprocessor machines are used for problems that are much larger than the number of processors and, therefore, the O(log n) time is never achieved in practice. In particular, to the best of our knowledge, our implementation of list ranking and list scan on the Cray C-90 is the fastest implementation to date. In addition, it is the first implementation of which we are aware that outperforms fast workstations. The success of our algorithm is due to its relatively large grain size and simplicity of the inner loops, and the success of the implementation is due to pipelining reads and writes through vectorization to hide latency, minimizing load balancing by deriving equations for predicting and optimizing performance, and avoiding conditional tests except when load balancing. © 1994 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Studying overheads in massively parallel Min/Max-tree evaluation (extended abstract) 94

Studying overheads in massively parallel Min/Max-tree evalua...

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Feldmann, Rainer Mysliwietz, Peter Monien, Burkhard Department of Mathematics and Computer Science University of Paderborn Germany

ISBN: (纸本)0897916719

In this paper we study the overheads arising in our algorithm for distributed evaluation of Min/Max trees. The overheads are classified into search overhead, performance loss, and decrease of work load. Several mechanisms are investigated to cope with these overheads in order to achieve a high performance. We study a combination of local, medium range, and global load distribution strategies that does not only show a good behavior in terms of work load, but also has a positive influence on the search overhead. The efficient use of a virtual shared memory, that is distributed among the processors, shows also a big contribution to the overall performance of the system. A carefully restricted application of parallelism using an improved version of the Young Brothers Wait Concept (YBWC) leads to a perfect behavior for minimal Min/Max trees and to a quite low search overhead, if well ordered trees are searched. Well ordered trees constitute the most important case in practice, since a couple of move ordering mechanisms are known that achieve a nearly optimal move ordering in many applications. The resulting combination of the methods shows an efficiency better than any previous approach. Experiments carried out using 256 DeBruijn-connected Transputers result in a speedup of 142 even applying restricted timing constraints. With a system consisting of 1024 grid connected Transputers we obtain a speedup of 344. Moreover the algorithm shows a very good scalability, especially using interconnection networks with logarithmic diameter. The experiments have been carried out using a Min/Max search program that incorporates all important state-of-the- art search techniques (Zugzwang, current vice world champion in computer chess) and therefore makes sure, that no artificial or simplifying assumptions on the structure of the problem are made. © 1994 acm.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) 94

Dynamic load balancing in parallel and distributed networks ...

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Ghosh, Bhaskar Muthukrishnan, S. Department of Computer Science Yale University P.O. Box 208285 New HavenCT06520 United States Courant Institute of Mathematical Sciences New York University 251 Mercer Street New YorkNY10012-1185 United States

ISBN: (纸本)0897916719

The fundamental problems in dynamic load balancing and job scheduling in parallel and distributed computers involve moving load between processors. In this paper, we consider a new model for load movement in synchronous parallel and distributed machines. In each step of our model, each processor can transfer load to at most one neighbor;also, any amount of load can be moved along a communication link between two processors in one step. This is a reasonable model for load movement in significant classes of dynamic load balancing problems. We derive efficient algorithms for a number of task reallocation problems under our model of load movement. These include dynamic load balancing on processor networks, adaptive mesh re-partitioning such as those in finite element methods, and progressive job migration under dynamic generation and consumption of load. To obtain the above-mentioned results, we introduce and solve the abstract problem of Incremental Weight Migration (IWM) on arbitrary graphs. Our main result is a simple, randomized, algorithm for this problem which provably results in asymptotically optimal convergence towards the state where weights on the nodes of the graph are all equal. This algorithm utilizes an appropriate random set of edges forming a matching. Our algorithm for the IWM problem is used in deriving efficient algorithms for all the problems mentioned above. Our results are very general. The algorithms we derive are local, and hence, scalable. They work for arbitrary load distributions and for networks of arbitrary topology which can possibly undergo link failures. Of independent interest is our proof technique which we use to lower bound the convergence of our algorithms in terms of the eigenstructure of the underlying graph. Finally, we present preliminary experimental results analyzing issues in load balancing related to our algorithms. © 1994 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

QRQW PRAM: Accounting for contention in parallel algorithms

QRQW PRAM: Accounting for contention in parallel algorithms

引用

proceedings of the fifth annual SIAM symposium on Discrete algorithms

作者： Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya AT&T Bell Lab Murray Hill United States

ISBN: (纸本)0898713293

We introduce the queue-read, queue-write (QRQW) PRAM model, which permits concurrent reading and writing, but at a cost proportional to the number of readers/writers to a memory location in a given step. Previously, there were no formal complexity models that accounted for the contention to memory locations, despite the large impact of such contentions on the performance of parallel programs. The QRQW PRAM is strictly more powerful than the EREW PRAM. We show a separation of √lg n between the two models, and present faster and more efficient QRQW algorithms for many basic problems. Nevertheless, we show that the QRQW can be efficiently emulated with only logarithmic slowdown on Valiant's BSP model, and hence on hypercube-type non-combining networks, even when latency, synchronization, and memory granularity overheads are taken into account. In contrast, efficient emulations for the CRCW PRAM on such networks are only known with polynomial slowdown. Most existing machines obey the queue-read, queue-write rule. We study the impact of the QRQW rule on algorithm design, devising new techniques for low-contention algorithms. Our results include fast and efficient algorithms for computing the OR, leader election, linear compaction, multiple compaction, integer sorting, and CRCW simulation, as well as several lower bounds. Some of the results presented are quite involved and use several novel ideas and techniques that are interesting on their own.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Subtree max gap problem with application to parallel string covering

Subtree max gap problem with application to parallel string ...

引用

proceedings of the fifth annual SIAM symposium on Discrete algorithms

作者： Ben-Amram, Amir M. Berkman, Omer Iliopoulos, Costas S. Park, Kunsoo

ISBN: (纸本)0898713293

We introduce the subtree max gap problem. Consider a tree T with n leaves whose internal nodes have degree at least two. Each leaf is associated with a real number. For each internal node v, let Av be the set of numbers associated with the leaves in the subtree rooted at v, regarded as points on the x-axis. The subtree max gap problem is to compute the maximum distance (gap) between any two consecutive points of Av for every internal node v of T. Our algorithm for the subtree max gap problem follows a series of reductions to other combinatorial problems which are interesting on their own merit. The algorithm runs in O(log n) time using n processors on the CREW PRAM. The subtree max gap problem plays a central role in the parallel solution of the string covering problem. Recently, Iliopoulos, Moore and Park gave an O(n log n) time sequential algorithm for the string covering problem. Neither parallelizing the above sequential algorithm nor using known techniques in strings seems to yield an efficient parallel algorithm for string covering. Our parallel algorithm thus follows a new approach, introducing the use of suffix trees and reducing the string covering problem to the subtree max gap problem. The algorithm runs in O(log n) time using n processors on the CRCW PRAM, thereby matching the number of operations in [15].

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：