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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

347 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

82 篇 parallel algorit...
68 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
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
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 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 sohn andrew
3 篇 leighton tom
3 篇 simhadri harsha ...
3 篇 miller gary l.
3 篇 gu yan

语言

352 篇 英文
13 篇 其他

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

共 365 条记录，以下是161-170 订阅

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

详细简洁

排序：

parallel searching in generalized monge arrays with applications 90

Parallel searching in generalized monge arrays with applicat...

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

作者： Aggarwal, Alok Kravets, Dina Park, James K. Sen, Sandeep T. J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897913701

This paper investigates the parallel time and processor complexities of several searching problems involving Monge and Monge-composite arrays. We present array-searching algorithms for concurrent-read-concurrent-write (CRCW) PRAMs, concurrent-read-exclusive-write (CREW) PRAMs, hypercubes, cube-connected-cycles, and shuffle-exchange networks. All these algorithms run in optimal time, and their processor-time products are all within an O(lg n) factor of the worst-case sequential bounds. Several applications of these algorithms are also given. Two applications improve previous results substantially, and the others provide novel parallel algorithms for problems not previously considered.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Issues and directions in scalable parallel computing 93

Issues and directions in scalable parallel computing

引用

proceedings of the 12th annual acm symposium on Principles of Distributed Computing

作者： Snir, Marc T.J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897916131

The design and use of scalable parallel computers is discussed. Much of the knowledge gained in the study of distributd systems is relevant, although it needs to be used in new manners. The author argues that the challenge is to achieve maximum reuse of existing technologies, microprocessor architectures, I/O systems, programming languages, operating systems, application codes, without compromising too much parallel performance and scalability. Such skillful compromises are essential to the success of the parallel processing industry, and pose even more intellectual challenges than the 'start from scratch' approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A parallel Dynamic Programming Algorithm on a Multi-core Architecture 07

A Parallel Dynamic Programming Algorithm on a Multi-core Arc...

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Tan, Guangming Sun, Ninghui Gao, Guang R. Chinese Acad Sci Key Lab Comp Syst & Architecture Beijing Peoples R China

ISBN: (纸本)9781595936677

Dynamic programming is an efficient technique to solve combinatorial search and optimization problem. There have been many parallel dynamic programming algorithms. The purpose of this paper is to study a family of dynamic programming algorithm where data dependence appear between non-consecutive stages, in other words, the data dependence is non-uniform. This kind of dynamic programming is typically called nonserial polyadic dynamic programming. Owing to the: non-uniform data dependence;it is harder to optimize this problem for parallelism and locality on parallel architectures. In this paper, we address the chanllenge of exploiting fine grain parallelism and locality of nonserial polyadic dynamic programming on a multi-core architecture. We present a programming and execution model for multi-core architectures with memory hierarchy. In the framework of the new model, the parallelism and locality benifit from a data dependence transformation. We propose a parallel pipelined algorithm for filling the dynamic programming matrix by decomposing the computation operators. The new parallel algorithm tolerates the memory access latency using multi-thread and is easily improved with the technique. We formulate and analytically solve the optimization problem determing the the size that minimizes the total execution time. The experiments on a simulator give a validation of the proposed model and show that the fine grain parallel algorithm achieves sub-linear speedup and that a potential high scalability on multi-core arichitecture.

关键词： Dynamic Programming Data Dependence Multicore Memory Hierarchy Scalabilitiy

来源：评论

学校读者我要写书评

暂无评论

parallel construction of trees with optimal weighted path length 91

Parallel construction of trees with optimal weighted path le...

引用

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

作者： Larmore, Lawrence L. Przytycka, Teresa M. Department of Computer Science University of California RiversideCA92521 United States Instytut Informatyki Uniwersytet Warszawski United States

ISBN: (纸本)0897914384

This paper deals with the problem of parallel construction of trees with optimal weighted path length. We study both the unordered case, known as the Huffman coding problem and the ordered case known as the optimal alphabetic binary tree problem. The methods used in both cases are different. We reduce the Huffman coding problem to the Concave Least Weight Subsequence and give a parallel algorithm that solves the latter problem in O(√n log n) time with n processors on a CREW PRAM. This leads to the first sublinear time o(n2)-total work parallel algorithm for the Huffman coding problem. The alphabetic binary tree problem is a special case of the Optimum Binary Search Tree problem and can be solved in O(log2 n) time with n4 processors using the dynamic programming technique. We show that an optimal height restricted alphabetic tree can be constructed in O(L log n) time on a CREW PRAM using only linearly many processors, where L is an upper bound on the height of the tree. © 1991 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Implementing the multiprefix operation on parallel and vector computers 93

Implementing the multiprefix operation on parallel and vecto...

引用

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

作者： Sheffler, Thomas J. Carnegie Mellon University Pittsburgh 15213 PA United States

ISBN: (纸本)0897915992

For a sequence of n values, each with an associated integer label, the multiprefix operation calculates a partial sum for each value summing all preceding values with the same label, and for each label, a reduction value summing all values with that label. The multiprefix operation has been proposed as a parallel primitive because of its power for expressing many data parallel algorithms succinctly. However, most approaches to implementing this operation have been based on special hardware, limiting its usefulness. This paper presents an algorithm for the multiprefix operation on n elements that runs in S-0(y/n) parallel steps on a p = y/n processor CRCW-ARBITRARY PRAM. Because this algorithm performs only W = 0(n) work, it is work efficient. While approaches based on sorting could be implemented in asymptotically fewer parallel steps, the work efficiency of this algorithm, and its low overhead make it attractive for use in real applications. A fully vectorized version of this algorithm has been designed for the CRAY Y-MP and provides good performance for a number of important algorithms. Performance data collected from integer sorting and sparse matrix-vector multiplication benchmarks based on the multiprefix operation achieve speeds that are often better than currently employed algorithms for that machine. © 1993 acm.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Scheduling Jobs with Work-Inefficient parallel Solutions 24

Scheduling Jobs with Work-Inefficient Parallel Solutions

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Kuszmaul, William Westover, Alek Harvard Univ Cambridge MA 02138 USA MIT Cambridge MA USA

ISBN: (纸本)9798400704161

This paper introduces the serial-parallel decision problem. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. The parallel implementation has the advantage that it can make progress concurrently on multiple processors, but the disadvantage that it is (potentially) work-inefficient. As tasks arrive, the scheduler must decide for each task which implementation to use. We begin by studying total awake time. We give a simple decide-on-arrival scheduler that achieves a competitive ratio of 3 for total awake time-this scheduler makes serial/parallel decisions immediately when jobs arrive. Our second result is an parallel-work-oblivious scheduler that achieves a competitive ratio of 6 for total awake time-this scheduler makes all of its decisions based only on the size of each serial job and without needing to know anything about the parallel implementations. Finally, we prove a lower bound showing that, if a scheduler wishes to achieve a competitive ratio of O(1), it can have at most one of the two aforementioned properties (decide-on-arrival or parallel-work-oblivious). We also prove lower bounds of the form 1 + Omega(1) on the optimal competitive ratio for any scheduler. Next, we turn our attention to optimizing mean response time. Here, we show that it is possible to achieve an O(1) competitive ratio with O(1) speed augmentation. This is the most technically involved of our results. We also prove that, in this setting, it is not possible for a parallel-work-oblivious scheduler to do well. In addition to these results, we present tight bounds on the optimal competitive ratio if we allow for arrival dependencies between tasks (e.g., tasks are components of a single parallel program), and we give an in-depth discussion of the remaining open questions.

关键词： Scheduling parallel Work-Inefficient Competitive-Analysis

来源：评论

学校读者我要写书评

暂无评论

Processor efficient parallel solution of linear systems over an abstract field 91

Processor efficient parallel solution of linear systems over...

引用

3rd annual acm symposium on parallel algorithms and architectures - SPAA'91

作者： Kaltofen, E. Pan, V. Department of Computer Science Rensselaer Polytechnic Institute Troy New York and Department of Computer Science University of Toronto Toronto Canada M5S 1A4 Department of Mathematics and Computer Science Lehman College City University of New York Bronx New York

parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)2) time, where each time unit represe... 详细信息

ISBN: (纸本)0897914384

parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)²) time, where each time unit represents an arithmetic operation in the field generated by the matrix entries. The algorithms utilize within a O(log n) factor as many processors as are needed to multiply two n × n matrices. The algorithms avoid zero divisions with controllably high probability provided the O(n) random elements used are selected uniformly from a sufficiently large set. For fields of small positive characteristic, the processor count measures of our solutions are somewhat higher. © 1991 acm.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

SPAA'12 - proceedings of the 24th acm symposium on parallelism in algorithms and architectures

SPAA'12 - Proceedings of the 24th ACM Symposium on Paralleli...

引用

24th acm symposium on parallelism in algorithms and architectures, SPAA'12

ISBN: (纸本)9781450312134

The proceedings contain 40 papers. The topics discussed include: time vs. space trade-offs for rendezvous in trees;allowing each node to communicate only once in a distributed system: shared whiteboard models;optimal and competitive runtime bounds for continuous, local gathering of mobile robots;online multi-robot exploration of grid graphs with rectangular obstacles;in search of parallel dimensions;delegation and nesting in best-effort hardware transactional memory;design, verification and applications of a new read-write lock algorithm;a lock-free B+tree;brief announcement: the problem based benchmark suite;brief announcement: subgraph isomorphism on a multithreaded shared memory architecture;efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model;a scalable framework for heterogeneous GPU-based clusters;and faster and simpler width-independent parallel algorithms for positive semidefinite programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA 2022 - proceedings of the 34th acm symposium on parallelism in algorithms and architectures

SPAA 2022 - Proceedings of the 34th ACM Symposium on Paralle...

引用

34th acm symposium on parallelism in algorithms and architectures, SPAA 2022

ISBN: (纸本)9781450391467

The proceedings contain 44 papers. The topics discussed include: deterministic distributed sparse and ultra-sparse spanners and connectivity certificates;fully polynomial-time distributed computation in low-treewidth graphs;adaptive massively parallel algorithms for cut problems;preparing for disaster: leveraging precomputation to efficiently repair graph structures upon failures;the energy complexity of Las Vegas leader election;a fully-distributed peer-to-peer protocol for byzantine-resilient distributed hash tables;brief announcement: the (limited) power of multiple identities: asynchronous byzantine reliable broadcast with improved resilience through collusion;brief announcement: composable dynamic secure emulation;and robust and optimal contention resolution without collision detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：