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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

306 篇 工学
- 299 篇 计算机科学与技术...
- 192 篇 软件工程
- 31 篇 电气工程
- 27 篇 信息与通信工程
- 20 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
172 篇 理学
- 165 篇 数学
- 25 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 化学
16 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

92 篇 parallel algorit...
81 篇 parallel process...
14 篇 parallel program...
13 篇 computer program...
10 篇 computer archite...
10 篇 scheduling
8 篇 computer systems...
8 篇 pram
7 篇 parallel process...
6 篇 parallel archite...
5 篇 graph algorithms
5 篇 multithreading
4 篇 performance
4 篇 approximation al...
4 篇 computational ge...
4 篇 bandwidth
4 篇 processor schedu...
4 篇 pipeline process...
4 篇 transactional me...
4 篇 concurrency

机构

11 篇 carnegie mellon ...
4 篇 univ maryland de...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 carnegie mellon ...
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 篇 dipartimento di ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 ibm t.j. watson ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...

作者

12 篇 blelloch guy e.
12 篇 gibbons phillip ...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 muthukrishnan s.
5 篇 goodrich michael...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 ramachandran vij...
4 篇 tangwongsan kana...
4 篇 vitter jeffrey s...
4 篇 simhadri harsha ...
4 篇 gu yan
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 tarjan robert e.
3 篇 cormen thomas h.
3 篇 dhulipala laxman
3 篇 deng xiaotie
3 篇 monien burkhard

语言

422 篇 英文
14 篇 其他

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

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

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

详细简洁

排序：

Explicit multi-threading (XMT) bridging models for instruction parallelism *(extended abstract) 98

Explicit multi-threading (XMT) bridging models for instructi...

引用

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

作者： Vishkin, U. Dascal, Sh. Berkovich, E. Nuzman, J. Univ of Maryland and Tel-Aviv Univ

ISBN: (纸本)9780897919890

This paper envisions an extension to a standard instruction set which efficiently implements PRAM-style algorithms using explicit multi-threaded instruction-level parallelism (ILP);that is, Explicit Multi-Threading (XMT), a fine-grained computational paradigm covering the spectrum from algorithms through architecture to implementation is introduced;new elements are added where needed.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Computational bounds for fundamental problems on general-purpose parallel models 98

Computational bounds for fundamental problems on general-pur...

引用

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

作者： MacKenzie, Ph.D. Ramachandran, V. Boise State Univ Boise ID United States

ISBN: (纸本)9780897919890

We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models QSM and s-QSW, and the distributed-memory model, the BSP. For each of these models, we also obtain lower bounds for the number of rounds needed to solve these problems using a randomized algorithm on a p-processor machine. Our results on 'rounds' is of special interest in the context of designing work-efficient algorithms on a machine where latency and synchronization costs are high. Many of our lower bound results are complemented by upper bounds that match the lower bound or are close to it.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Analysis of first-come-first-serve parallel job scheduling

Analysis of first-come-first-serve parallel job scheduling

引用

proceedings of the 1998 9th annual acm SIAM symposium on Discrete algorithms

作者： Schwiegelshohn, Uwe Yahyapour, Ramin Univ Dortmund Dortmund Germany

This paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. Then, we propose a simple on-line algorithm employing job preemption without migration and derive theoretical bounds for the performance of the algorithm. The algorithm is experimentally evaluated with trace data from a large computing facility. These experiments show that the algorithm is highly sensitive on parameter selection and that substantial performance improvements over existing (non-preemptive) scheduling methods are possible.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient disk allocation for fast similarity searching 98

Efficient disk allocation for fast similarity searching

引用

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

作者： Prabhakar, S. Agrawal, D. El Abbadi, A. Univ of California Santa Barbara CA United States

ISBN: (纸本)9780897919890

As databases increasingly integrate non-textual information it is becoming necessary to support efficient similarity searching in addition to range searching. Recently, declustering techniques have been proposed for improving the performance of similarity searches through parallel I/O. In this paper, we propose a new scheme which provides good declustering for similarity searching. In particular, it does global declustering as opposed to local declustering, exploits the availability of extra disks and does not limit the partitioning of the data space. Our technique is based upon the Cyclic declustering schemes which were developed for range and partial match queries. We establish, in general, that Cyclic declustering techniques outperform previously proposed techniques.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Asynchronous parallel algorithm for mining association rules on a shared-memory multi-processors 98

Asynchronous parallel algorithm for mining association rules...

引用

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

作者： Cheung, D.W. Hu, K. Xia, Sh. The Univ of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780897919890

Mining association rules from large databases is an important problem in data mining. There is a need to develop parallel algorithm for this problem because it is a very costly computation process. However, all proposed parallel algorithms for mining association rules follow the conventional level-wise approach. On a shared-memory multi-processors, they will impose a synchronization in every iteration which degrades greatly their performance. The deficiency comes from the contention on the shared I/O channel when all processors are accessing their database partitions in the shared storage synchronously. An asynchronous algorithm APM has been proposed for mining association rules on shared-memory multiprocessors. All participating processors in APM generate candidates and count their supports independently without synchronization. Furthermore, it can finish the computation with less I/O than required in the level-wise approach. The algorithm has been implemented on a Sun Enterprise 4000 multi-processors with 12 nodes. The experiments show that APM has super performance than other proposed synchronous algorithms.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast set operations using treaps 98

Fast set operations using treaps

引用

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

作者： Blelloch, G.E. Reid-Miller, M. Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897919890

We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the algorithms run in expected O(m lg(n/m)) work and O(lg n) depth (parallel time) on an EREW PRAM with scan operations (implying O(lg2 n) depth on a plain EREW PRAM). As with the sequential algorithms on treaps for insertion and deletion the main advantage of our algorithms are their simplicity. In fact our algorithms for set operations seem simpler than previous sequential algorithms with the same work bounds, and might therefore also be useful in a sequential context. To analyze the effectiveness of the algorithms we implemented both sequential and parallel versions of the algorithms and ran several experiments on them. Our parallel implementation uses the Cilk [5] shared memory runtime system on a 16 processor SGI Power Challenge and a 6 processor Sun Ultra Enterprise 3000. It shows reasonable speedup: 6.3 to 6.8 speedup on 8 processors of the SGI, and 4.1 to 4.4 speedup on 5 processors of the Sun.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication-optimal parallel minimum spanning tree algorithms extended abstract

Communication-optimal parallel minimum spanning tree algorit...

引用

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

作者： Adler, M. Dittrich, W. Juurlink, B. Kutylowski, M. Rieping, I. Univ of Toronto Toronto Ont Canada

Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the first non-trivial lower bounds on the communication volume required to solve the MST problem. Let p denote the number of processors, n the number of nodes of the input graph, and m the number of edges of the input graph. We show that in the worst case a total of Ω(k·min(m, pn)) bits need to be transmitted in order to solve the MST problem, where k is the number of bits required to represent a single edge weight. This implies that if each message contains k bits, any BSP algorithm for finding an MST requires communication time Ω(g · min(m/p, n)), where g is the gap parameter of the BSP model. In addition, we present two algorithms whose running times match the lower bounds in different situations. Both algorithms perform linear work and use a number of super-steps independent of the input size. The first algorithm is simple but can employ at most m/n processors efficiently. Hence, it should be applied in situations where the input graph is relatively dense. The second algorithm is a randomized algorithm that performs linear work with high probability, provided that m ≥ n · log p. This is the first linear work BSP algorithm for finding an MST in sparse graphs.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic parallel I/O performance optimization in Panda 98

Automatic parallel I/O performance optimization in Panda

引用

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

作者： Chen, Y. Winslett, M. Cho, Y. Kuo, S. Univ of Illinois

ISBN: (纸本)9780897919890

parallel I/O systems typically consist of individual processors, communication networks, and a large number of disks. Managing and utilizing these resources to meet performance, portability and usability goals of applications has become a significant challenge. We believe that a parallel I/O system that automatically selects efficient I/O plans for user applications is a solution to this problem. In this paper, we present such an automatic performance optimization approach for scientific applications performing collective I/O requests on multidimensional arrays. Under our approach, an optimization engine in a parallel I/O system selects optimal I/O plans automatically without human intervention based on a description of the application I/O requests and the system configuration. To validate our hypothesis, we have built an optimizer that uses a rule-based and randomized search-based algorithms to select optimal parameter settings in Panda, a parallel I/O library for multidimensional arrays. Our performance results obtained from two IBM SPs with significantly different configurations show that the Panda optimizer is able to select high-quality I/O plans and deliver high performance under a variety of system configurations.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Elimination forest guided 2D sparse LU factorization 98

Elimination forest guided 2D sparse LU factorization

引用

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

作者： Shen, K. Jiao, X. Yang, T. Univ of California Santa Barbara CA United States

ISBN: (纸本)9780897919890

Sparse LU factorization with partial pivoting is important for many scientific applications and delivering high performance for this problem is difficult on distributed memory machines. Our previous work has developed an approach called S* that incorporates static symbolic factorization, supernode partitioning and graph scheduling. This paper studies the properties of elimination forests and uses them to guide supernode partitioning/amalgamation and execution scheduling. The new design with 2D mapping effectively identifies dense structures without introducing too many zeros in the BLAS computation and exploits asynchronous parallelism with low buffer space cost. The implementation of this code, called S+, uses supernodal matrix multiplication which retains the BLAS-3 level efficiency and avoids unnecessary arithmetic operations. The experiments show that S+ improves our previous code substantially and can achieve up to 11.04GFLOPS on 128 Cray T3E 450 MHz nodes, which is the highest performance reported in the literature.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：