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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

352 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 256 篇 计算机科学与技术...
- 173 篇 软件工程
- 25 篇 电气工程
- 25 篇 信息与通信工程
- 19 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
154 篇 理学
- 151 篇 数学
- 25 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
15 篇 管理学
- 12 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

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

机构

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 篇 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 ...
2 篇 bell laboratorie...

作者

12 篇 gibbons phillip ...
11 篇 blelloch guy e.
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 cormen thomas h.
4 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 meyer auf der he...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 monien burkhard
3 篇 sohn andrew
3 篇 leighton tom
3 篇 simhadri harsha ...

语言

357 篇 英文
13 篇 其他

检索条件"任意字段=Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures"

共 370 条记录，以下是191-200 订阅

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

详细简洁

排序：

Analysis of dag-consistent distributed shared-memory algorithms

Analysis of dag-consistent distributed shared-memory algorit...

引用

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

作者： Blumofe, Robert D. Frigo, Matteo Joerg, Christopher F. Leiserson, Charles E. Randall, Keith H. Univ of Texas at Austin Austin TX United States

In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page faults, and space requirements for multithreaded algorithms executed by a work-stealing thread scheduler and the BACKER coherence algorithm for maintaining dag consistency. We prove that if the accesses to the backing store are random and independent (the BACKER algorithm actually uses hashing), then the expected execution time of a `fully strict' multithreaded computation on P processors, each with an LRU cache of C pages, is O(T1(C)/P+mCT∞), where T1(C) is the total work of the computation including page faults, T∞ is its critical-path length excluding page faults, and m is the minimum page transfer time. As a corollary to this theorem, we show that the expected number of page faults incurred by a computation executed on P processors, each with an LRU cache of C pages, is F1(C)+O(CPT∞), where F1(C) is the number of serial page faults. Finally, we give simple bounds on the number of page faults and the space requirements for `regular' divide-and-conquer algorithms. We use these bounds to analyze parallel multithreaded algorithms for matrix multiplication and LU-decomposition.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Simple randomized mergesort on parallel disks 96

Simple randomized mergesort on parallel disks

引用

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

作者： Barve, Rakesh D. Grove, Edward F. Vitter, Jeffrey Scott Duke Univ Durham NC United States

ISBN: (纸本)9780897918091

We consider the problem of sorting a file of N records on the D-disk model of parallel I/O [VS94] in which there are two sources of parallelism. Records are transferred to and from disk concurrently in blocks of B contiguous records. In each I/O operation, up to one block can be transferred to or from each of the D disks in parallel. We propose a simple, efficient, randomized mergesort algorithm called SRM that uses a forecast-and-flush approach to overcome the inherent difficulties of simple merging on parallel disks. SRM exhibits a limited use of randomization and also has a useful deterministic version. Generalizing the forecasting technique of [Knu73], our algorithm is able to read in, at any time, the `right' block from any disk, and using the technique of flushing, our algorithm evicts, without any I/O overhead, just the `right' blocks from memory to make space for new ones to be read in. The disk layout of SRM is such that it enjoys perfect write parallelism, avoiding fundamental inefficiencies of previous mergesort algorithms. Our analysis technique involves a novel reduction to various maximum occupancy problems. We prove that the expected I/O performance of SRM is efficient under varying sizes of memory and that it compares favorably in practice to disk-striped mergesort (DSM). Our studies indicate that SRM outperforms DSM even when the number D of parallel disks is fairly small.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Modeling the benefits of mixed data and task parallelism 95

Modeling the benefits of mixed data and task parallelism

引用

proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95

作者： Chakrabarti, Soumen Demmel, James Yelick, Katherine U.C. Berkeley Berkeley CA United States

ISBN: (纸本)9780897917179

Mixed task and data parallelism exists naturally in many applications, but utilizing it may require sophisticated scheduling algorithms and software support. Recently, significant research effort has been applied to exploiting mixed parallelism in both theory and systems communities. In this paper, we ask how much mixed parallelism will improve performance in practice, and how architectural evolution impacts these estimates. First, we build and validate a performance model for a class of mixed task and data parallel problems based on machine and problem parameters. Second, we use this model to estimate the gains from mixed parallelism for some scientific applications on current machines. This quantifies our intuition that mixed parallelism is best when either communication is slow or the number of processors is large. Third, we show that, for balanced divide and conquer trees, a simple one-time switch between data and task parallelism gets most of the benefit of general mixed parallelism. Fourth, we establish upper bounds to the benefits of mixed parallelism for irregular task graphs. Apart from these detailed analyses, we provide a framework in which other applications and machines can be evaluated.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks 09

Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Mu...

引用

21st acm symposium on parallelism in algorithms and architectures

作者： Buluc, Aydin Fineman, Jeremy T. Frigo, Matteo Gilbert, John R. Leiserson, Charles E. Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781605586069

This paper introduces a storage format for sparse matrices, called compressed sparse blocks (CSB), which allows both Ax and A(x)(inverted perpendicular) to be computed efficiently in parallel, where A is an n x n sparse matrix with nnz >= n nonzeros and x is a dense n-vector. Our algorithms use Theta(nnz) work (serial running time) and Theta(root nlgn) span (critical-path length), yielding a parallelism of Theta(nnz/root nlgn), which is amply high for virtually any large matrix. The storage requirement for CSB is esssentially the same as that for the more-standard compressed-sparse-rows (CSR) format, for which computing Ax in parallel is easy but A(x)(inverted perpendicular) is difficult. Benchmark results indicate that on one processor, the CSB algorithms for Ax and A(x)(inverted perpendicular) run just as fast as the CSR algorithm for Ax, but the CSB algorithms also scale up linearly with processors until limited by off-chip memory bandwidth.

关键词： Compressed sparse blocks compressed sparse columns compressed sparse rows matrix transpose matrix-vector multiplication multithreaded algorithm parallelism span sparse matrix storage format work

来源：评论

学校读者我要写书评

暂无评论

parallel continuous randomized load balancing

Parallel continuous randomized load balancing

引用

proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Berenbrink, P. Friedetzky, T. Mayr, E.W. Paderborn Univ Paderborn Germany

Recently, the subject of allocating tasks to servers has attracted much attention. There are several ways of distinguishing load balancing problems. There are sequential and parallel strategies, that is, placing the tasks one after the other or all of them in parallel. Another approach divides load balancing problems into continuous and static ones. In the continuous case new tasks are generated and consumed as time proceeds, in the second case the number of tasks is fixed. We present and analyze a parallel randomized continuous load balancing algorithm in a scenario where n processors continuously generate and consume tasks according to some given probability distribution. Each processor initiates load balancing actions only if its load exceeds a certain threshold t, and then tries to find a balancing partner for moving some of its tasks to this partner. We consider several randomized load generation and consumption schemes which yield an expected load of O(n) in the whole system. We show that the maximum load of any processor is upper bounded by (log log n)2, with high probability. The expected number of load requests required for finding a balancing partner is constant.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for routing in non-blocking networks 91

Parallel algorithms for routing in non-blocking networks

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Lin, Geng Pippenger, Nicholas Department of Computer Science University of British Columbia VancouverBCV6T 1W5 Canada

ISBN: (纸本)0897914384

Non-blocking networks have many applications in communications. Typical examples are telephone switching networks and communication networks among processors or between processors and memory devices. We construct non-blocking networks that are efficient not only as regards their cost and delay, but also as regards the time and space required to control them. In this paper, we present the first simultaneous "weakly optimal" solutions for the explicit construction of non-blocking networks, the design of algorithms and the design of data-structures. "Weakly optimal" is in the sense that all measures of complexity (size and depth of the network, time for the algorithm, and space for the data-structure) are within one or more factors of logn of their smallest possible values. In fact, we explicitly construct a scheme in which networks with n inputs and n outputs have size O(n(logn)2) and depth O(logn). And we present deterministic and randomized on-line parallel algorithms to establish and abolish routes dynamically in these networks. The deterministic algorithm uses O((logn) 5) steps to process any number of transactions in parallel (with one processor per transaction), maintaining a data structure that use O(n(logn) 2) words and the randomized algorithm uses O((logn) 2) expected steps to process any number of transactions in parallel (with one processor per transaction), maintaining a data structure that use O(n(logn) 2) words. © 1991 acm.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum

From algorithm parallelism to instruction-level parallelism:...

引用

proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Vishkin, Uzi

A novel comprehensive and coherent approach for the purpose of increasing instruction-level parallelism (ILP) is devised. The key new tool in our envisioned system update is the addition of a parallel prefix-sum (PS) instruction, which will have efficient implementation in hardware, to the instruction-set architecture. This addition gives for the first time a concrete way for recruiting the whole knowledge base of parallel algorithms for that purpose. The potential increase in ILP is demonstrated by experimental results for a test application. The main technical contribution is in the form of a `completeness theorem'. Perhaps surprisingly, the current abstract proves that in an envisioned system which employs parallel PS functional units, a proper use of a serial programming language suffices for the following. With a moderate effort, one can program a parallel algorithm (in a serial language), so that a parallelizing compiler (even without run-time methods!) will be able to extract the same (i.e., `complete') ILP from such serial code as from code written in a parallel language. Alternatively, rather than have the programmer produce the serial code, a precompiler could derive it from a parallel language. The most interesting idea in the proof is the reliance on the new parallel PS for circumventing collision-ambiguity in references to memory. Other new ideas in the paper include hardware-design of a prefix-sum unit and an on-line algorithm for high-bandwidth register-files. An informal upshot of this paper is the following general insight: to accommodate parallelism in uniprocessor systems (from algorithms to ILP), it is sufficient to only add (and, of course, incorporate) parallel prefix-sum functional units to standard serial system designs.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Near Linear-Work parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs 11

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decompos...

引用

23rd annual symposium on parallelism in algorithms and architectures

作者： Blelloch, Guy E. Gupta, Anupam Koutis, Ioannis Miller, Gary L. Peng, Richard Tangwongsan, Kanat Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450307437

This paper presents the design and analysis of a near linear-work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input of a SDD n-by-n matrix A with m non-zero entries and a vector h, our algorithm computes a vector (x) over tilde;such that parallel to(x) over tilde - A(+)b parallel to A <= epsilon . parallel to A(+)b parallel to A in O(m log(O(1)) n log 1/epsilon) work and O(m(1/3+theta) log 1/epsilon) depth for any fixed theta > 0. The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first develop a parallel decomposition algorithm that in polylogarithmic depth and (O) over tilde vertical bar E vertical bar) work(1), partitions a graph into components with polylogarithmic diameter such that only a small fraction of the original edges are between the components. This can be used to generate low-stretch spanning trees with average stretch O(n(alpha)) in O(n(1+alpha)) work and O(n(alpha)) depth. Alternatively, it can be used to generate spanning subgraphs with polylogarithmic average stretch in O(vertical bar E vertical bar) work and polylogarithmic depth. We apply this subgraph construction to derive our solver. By using the linear system solver in known applications, our results imply improved parallel randomized algorithms for several problems, including single-source shortest paths, maximum flow, min-cost flow, and approximate max-flow.

关键词： parallel algorithms linear systems low-stretch spanning trees low-stretch subgraphs low-diameter decomposition

来源：评论

学校读者我要写书评

暂无评论

MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED parallel PROCESSORS.

MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED PARALLEL PRO...

引用

Conference proceedings - 12th annual International symposium on Computer Architecture.

作者： Smith, Bradley Warren Siegel, Howard Jay Purdue Univ Sch of Electrical Engineering West Lafayette IN USA Purdue Univ Sch of Electrical Engineering West Lafayette IN USA

ISBN: (纸本)0818606347

An approach is proposed for modeling off-the-shelf hardware and for modeling parallel algorithms, along with a design methodology to use the information provided by these models, to design a class of macro-pipelined special-purpose architectures. Nine parameters to form a model of the characteristics of parallel/distributed algorithms and the environment in which they must execute are presented. In addition, a set of tuples to model the characteristics of computer architectures is presented. By combining the tuples with the parameters, the execution time of the algorithm modeled by the parameters on the hardware modeled by the tuples can be approximated. The combination of these models could be used as a basis for computer-aided tools used in the design of macro-pipelined parallel/distributed processors.

关键词： COMPUTER SYSTEMS, DIGITAL

来源：评论

学校读者我要写书评

暂无评论

On parallel evaluation of game trees 89

On parallel evaluation of game trees

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Karp, Richard M. Zhang, Yanjun Computer Science Division University of California BerkeleyCA94720 United States

ISBN: (纸本)089791323X

We present parallel algorithms for evaluating game trees. These algorithms parallelize the "left-To-right" sequential algorithm for evaluating AND]OR trees and the α-β pruning procedure for evaluating MIN/MAX trees. We show that, on every instance of a uniform tree, these parallel algorithms achieve a linear speed-up over their corresponding sequential algorithms, if the number of processors used is close to the height of the input tree. These are the first non-Trivial deterministic speed-up bounds known for the "left-To-right" algorithm and the α-β pruning procedure. © 1989 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：