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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,504 篇 会议
105 篇 期刊文献

馆藏范围

1,609 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,168 篇 工学
- 1,111 篇 计算机科学与技术...
- 557 篇 软件工程
- 118 篇 电气工程
- 75 篇 信息与通信工程
- 46 篇 控制科学与工程
- 37 篇 电子科学与技术（可...
- 13 篇 材料科学与工程（可...
- 13 篇 农业工程
- 11 篇 机械工程
- 11 篇 光学工程
- 8 篇 化学工程与技术
- 8 篇 生物工程
- 7 篇 建筑学
- 7 篇 生物医学工程（可授...
- 6 篇 动力工程及工程热...
- 5 篇 土木工程
- 3 篇 力学（可授工学、理...
579 篇 理学
- 557 篇 数学
- 55 篇 统计学（可授理学、...
- 16 篇 物理学
- 9 篇 生物学
- 9 篇 系统科学
- 8 篇 化学
73 篇 管理学
- 64 篇 管理科学与工程(可...
- 40 篇 工商管理
- 10 篇 图书情报与档案管...
16 篇 农学
- 16 篇 作物学
6 篇 经济学
- 6 篇 应用经济学
3 篇 法学
- 3 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 医学
1 篇 文学
1 篇 军事学

主题

237 篇 parallel algorit...
173 篇 parallel process...
80 篇 computer archite...
74 篇 parallel process...
57 篇 parallel program...
55 篇 algorithms
47 篇 parallel archite...
41 篇 hardware
30 篇 scheduling
27 篇 computer program...
21 篇 graph algorithms
20 篇 computer systems...
18 篇 approximation al...
18 篇 processor schedu...
18 篇 computational mo...
18 篇 field programmab...
17 篇 parallel computi...
16 篇 computer science
16 篇 performance
16 篇 delay

机构

32 篇 carnegie mellon ...
15 篇 swiss fed inst t...
15 篇 carnegie mellon ...
11 篇 univ maryland de...
11 篇 stanford univ st...
10 篇 univ maryland co...
10 篇 mit 77 massachus...
10 篇 univ calif berke...
8 篇 eth zurich
7 篇 georgetown univ ...
7 篇 mit cambridge ma...
7 篇 univ texas austi...
6 篇 penn state univ ...
6 篇 mit csail cambri...
5 篇 univ calif river...
5 篇 princeton univer...
5 篇 university of ma...
5 篇 microsoft res re...
5 篇 carnegie mellon ...
5 篇 harvard univ cam...

作者

38 篇 blelloch guy e.
20 篇 gu yan
18 篇 gibbons phillip ...
18 篇 shun julian
18 篇 goodrich michael...
16 篇 fineman jeremy t...
15 篇 sun yihan
14 篇 dhulipala laxman
13 篇 vishkin uzi
12 篇 agrawal kunal
11 篇 leiserson charle...
10 篇 ballard grey
10 篇 hoefler torsten
10 篇 anon
10 篇 miller gary l.
10 篇 harris david g.
9 篇 ghaffari mohsen
9 篇 tangwongsan kana...
9 篇 reif john h.
9 篇 demmel james

语言

1,569 篇 英文
40 篇 其他

检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"

共 1609 条记录，以下是1211-1220 订阅

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

详细简洁

排序：

Dynamic parallel tree contraction 94

Dynamic parallel tree contraction

引用

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

作者： Reif, John H. Tate, Stephen R. Carnegie Mellon Univ. Pittsburgh PA Univ. of North Texas Denton TX

ISBN: (纸本)9780897916714

parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph algorithms. We propose a corresponding technique for the parallel solution of incremental problems. As our computational model, we assume a variant of the CRCW PRAM where we can dynamically activate processors by a forking *** consider a dynamic binary tree T of ≤ n nodes and unbounded depth. We describe a procedure, which we call the dynamic parallel tree contraction algorithm, which incrementally processes various parallel modification requests and queries:(1)parallel requests to add or delete leaves of T, or modify labels of internal nodes or leaves of T, and also(2) parallel tree contraction queries which require recomputingvalues at specified nodes. Each modification or query is with respect to a set of nodes U in *** dynamic parallel tree contraction algorithm is a randomized algorithm that takes O(log(|U|log n)) expected parallel time using O(|U|log n/log(|U|log n) processors. We give a large number of applications (with the same bounds), including:(a) maintaining the usual tree properties (such as number of ancestors, preorder, etc.),(b) Eulerian tour,(c) expression evaluation,(d) least common ancestor, and(e) canonical forms of ***, there where no known parallel algorithms for incrementally maintaining and solving such problems in parallel time less than Θ(log n).In deriving our incremental algorithms, we solve a key subproblem, namely a processor activation problem, within the same asymptotic bounds, which may be useful in the design of other parallel incremental algorithms. This algorithm uses an interesting persistent parallel data structures involving a non-trivial *** a subsequent paper, we apply our dynamic parallel tree contraction technique to various incremental graph problems: maintaining various properties, (such as coloring, minimum covering set, maximum matching, etc.). of parall

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel sorting in multi-level storage

Optimal parallel sorting in multi-level storage

引用

Proceedings of the Fifth annual SIAM symposium on Discrete algorithms

作者： Aggarwal, Alok Plaxton, C.Greg Thomas J. Watson Research Cent Yorktown Heights United States

ISBN: (纸本)0898713293

We adapt the Sharesort algorithm of Cypher and Plaxton to run on various parallel models of multi-level storage, and analyze its resulting performance. Sharesort was originally defined in the context of sorting n records on an n-processor hypercubic network. In that context, it is not known whether Sharesort is asymptotically optimal. Nonetheless, we find that Sharesort achieves optimal time bounds for parallel sorting in multi-level storage, under a variety of models that have been defined in the literature.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Techniques for extracting instruction level parallelism on MIMD architectures

Techniques for extracting instruction level parallelism on M...

引用

Proceedings of the 26th annual International symposium on Microarchitecture

作者： Tyson, Gary Farrens, Matthew Univ of California Davis United States

ISBN: (纸本)0897917073

Extensive research has been done on extracting parallelism from single instruction stream processors. This paper presents some results of our investigation into ways to modify MIMD architectures to allow them to extract the instruction level parallelism achieved by current superscalar and VLIW machines. A new architecture is proposed which utilizes the advantages of a multiple instruction stream design while addressing some of the limitations that have prevented MIMD architectures from performing ILP operation. A new code scheduling mechanism is described to support this new architecture by partitioning instructions across multiple processing elements in order to exploit this level of parallelism.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Maisie environment for parallel simulation

Maisie environment for parallel simulation

引用

Proceedings of the IEEE 27th annual Simulation symposium

作者： Bagrodia, Rajive L. Jha, Vikas Waldorf, Jerry Univ of California at Los Angeles Los Angeles United States

ISBN: (纸本)0818656204

Maisie is among the few languages that separates the simulation program from the underlying algorithm (sequential or parallel) that is used to execute the program. It is thus possible to design a sequential simulation and, if needed, to subsequently port it to a parallel machine for execution with optimistic or conservative algorithms. This paper gives an overview of the Maisie simulation environment and presents experimental measurements of a model with both conservative and optimistic parallel algorithms. We also describe our current work in adding inheritance to the Maisie language.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

ProperPLACE: a portable parallel algorithm for standard cell placement

ProperPLACE: a portable parallel algorithm for standard cell...

引用

Proceedings of the 8th International parallel Processing symposium

作者： Kim, Sungho Chandy, John A. Parkes, Steven Ramkumar, Balkrishna Banerjee, Prithviraj LSI Logic Corp Milpitas United States

ISBN: (纸本)0818656026

parallel algorithms developed for CAD problems today suffer from three important drawbacks. first, they are machine specific and tend to perform poorly on architectures other than the one for which they were designed. Second, they cannot use the latest advances in improved versions of the sequential algorithms for solving the problem. Third, the quality of results degrade significantly during parallel execution. In this paper we address these three problems for an important CAD application: standard cell placement. We have developed a new parallel placement algorithm that is portable across a range of MIMD parallel architectures. The algorithm is part of the ProperCAD project which allows the development and implementation of a parallel algorithm such that it can be executed on a wide variety of parallel machines without any change to the source. The parallel placement algorithm is based on an existing implementation of the sequential simulated annealing algorithm, TimberWolfSC 6.0 [1].

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

O(log2 n) time efficient parallel factorization of dense, sparse separable and banded matrices 94

O(log2 n) time efficient parallel factorization of dense, sp...

引用

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

作者： Reif, John H. Carnegie Mellon Univ. Pittsburgh PA

ISBN: (纸本)9780897916714

Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many *** paper gives new parallel methods for various exact factorizations of several classes of matrices. We assume the input matrices are n × n with either integer entries of size ≤ 2no(1). We make no other assumption on the input. We assume the arithmetic PRAM model of parallel computation. Our main result is a reduction of the known parallel time bounds for these factorizations from O(log3n) to O(log2n). Our results are work efficient; we match the best known work bounds of parallel algorithms with polylog time bounds, and are within a log n factor of the work bounds for the best known sequential algorithms for the same *** exact factorizations we compute for symmetric positive definite matrices include: 1. recursive factorization sequences and trees,2. LU factorizations,3. QR factorizations, and4. reduction to upper Hessenberg *** classes of matrices for which we can efficiently compute these factorizations include:1. dense matrices, in time O(log2n) with processor bound P(n) (the number of processors needed to multiply two n × n matrices in O(log n time),2. block diagonal matrices, in time O(log2b with P(b)n/b processors,3. sparse matrices which are s(n)-separable (recursive factorizations only), in time O(log2n) with P(s(n)) processors where s(n) is of the form n γ for 0 < γ < 1, and4. banded matrices, in parallel time O((logn) log b) with P(b)n/b *** factorizations also provide us similarly efficient algorithms for exact computation (given arbitrary rational matrices that need not be symmetric positive definite) of the following: 1

关键词： dense matrices Newton iteration sparse matrices LU factorization parallel algorithms banded matrices linear systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the annual acm symposium on Principles of Distributed Computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

13th annual acm symposium on Principles of Distributed Computing, PODC 1994

ISBN: (纸本)0897916549

The proceedings contain 38 papers. The topics discussed include: contention-free complexity of shared memory algorithms;making operations of concurrent data types fast;open systems in TLA;delimiting the power of bounded size synchronization objects;wait-freedom vs. bounded wait-freedom in public data structures;ENF event predicate detection in distributed systems;repeatable and portable message-passing programs;mixed consistency: a model for parallel programming;using belief to reason about cache coherence;global flush communication primitive communication;multimedia networking: applications and challenges;a performance evaluation of lock-free synchronization protocols;disjoint-access-parallel implementations of strong shared memory primitives;time-optimal message-efficient work performance in the presence of faults;using k-exclusion to implement resilient, scalable shared objects;coins, weights and contention in balancing networks;resilience of general interactive tasks;asynchronous secure computations with optimal resilience;a combinatorial treatment of balancing networks;and memory-efficient and self-stabilizing network reset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems 94

Optimal parallel randomized algorithms for the Voronoi diagr...

引用

Proceedings of the 10th annual symposium on Computational Geometry

作者： Rajasekaran, Sanguthevar Ramaswami, Suneeta Univ of Pennsylvania Philadelphia PA United States

ISBN: (纸本)0897916484

In this paper, we present an optimal parallel randomized algorithm for the Voronoi diagram of a set of n non-intersecting (except possibly at endpoints) line segments in the plane. Our algorithm runs in O(log n) time with very high probability and uses O(n) processors on a CRCW PRAM. This algorithm is optimal in terms of P.T bounds since the sequential time bound for this problem is Ω(n log n). Our algorithm improves by an O(log n) factor the previously best known deterministic parallel algorithm which runs in O(log2n) time using O(n) processors [13]. We obtain this result by using random sampling at 'two stages' of our algorithm and using efficient randomized search techniques. This technique gives a direct optimal algorithm for the Voronoi diagram of points as well (all other optimal parallel algorithms for this problem use reduction from the 3-d convex hull construction).

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication and computation patterns of large scale image convolutions on parallel architectures

Communication and computation patterns of large scale image ...

引用

Proceedings of the 8th International parallel Processing symposium

作者： Dykes, Sandra G. Zhang, Xiaodong Zhou, Yan Yang, Haixu The Univ of Texas at San Antonio San Antonio United States

ISBN: (纸本)0818656026

Segmentation and other image processing operations rely on convolution calculations with heavy computational and memory access demands. This paper presents an analysis of a texture segmentation application containing a 96x96 convolution. Sequential execution required several hours on single processors systems with over 99% of the time spent performing the large convolution. 70% to 75% of execution time is attributable to cache misses within the convolution. We implemented the same application on CM-5, iPSC/860 and PVM distributed memory multicomputers, tailoring the parallel algorithms to each machine's architectures. parallelization significantly reduced execution time, taking 49 second on a 512 node CM-5 and 6.5 minutes on a 32 node iPSC/860.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共161页 << < 118 119 120 121 122 123 124 125 126 127 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：