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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是201-210 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs 93

Optimal parallel construction of Hamiltonian cycles and span...

引用

5th annual acm symposium on parallel algorithms and architectures, SPAA 1993

作者： MacKenzie, Philip D. Stout, Quentin F. Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0897915992

We give tight bounds on the parallel complexity of some problems involving random graphs. Specifically, we show that a Hamiltonian cycle, a breadth first spanning tree, and a maximal matching can all be constructed in (logn) expected time using n/lognprocessors on the CRCW PRAM. This is a substantial improvement over the best previous algorithms, which required ((log log n)2) time and nlog2n processors. We then introduce a technique which allows us to prove that constructing an edge cover of a random graph from its adjacency matrix requires (logn) expected time on a CRCW PRAM with O(n) processors. Constructing an edge cover is implicit in constructing a spanning tree, a Hamiltonian cycle, and a maximal matching, so this lower bound holds for all these problems, showing that our algorithms are optimal. This new lower bound technique is one of the very few lower bound techniques known which apply to randomized CRCW PRAM algorithms, and it provides the first nontrivial parallel lower bounds for these problems. © 1993 acm.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

A simple load balancing scheme for task allocation in parallel machines 91

A simple load balancing scheme for task allocation in parall...

引用

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

作者： Rudolph, Larry Slivkin-Allalouf, Miriam Upfal, Eli Department of Computer Science Hebrew University Jerusalem Israel IBM TJ Watson Research Center Yorktown HeightsNY United States John Bryce Ltd. Science Based Industries PO BOX 23838 Jerusalem Israel Department of Applied Mathematics Weizman Institute Rehovot Israel IBM Almaden Research Center San JoseCA United States

ISBN: (纸本)0897914384

A collection of local workpiles (task queues) and a simple load balancing scheme is well suited for scheduling tasks in shared memory parallel machines. Task scheduling on such machines has usually been done through a single, globally accessible, workpile. The scheme introduced in this paper achieves a balancing comparable to that of a global workpile, while minimizing the overheads. In many parallel computer architectures, each processor has some memory that it can access more efficiently, and so it is desirable that tasks do not mirgrate frequently. The load balancing is simple and distributed: Whenever a processor accesses its local workpile, it performs a balancing operation with probability inversely proportional to the size of its workpile. The balancing operation consists of examining the workpile of a random processor and exchanging tasks so as to equalize the size of the two workpiles. The probabilistic analysis of the performance of the load balancing scheme proves that each tasks in the system receives its fair share of computation time. Specifically, the expected size of each local task queue is within a small constant factor of the average, i.e. total number of tasks in the system divided by the number of processors. © 1991 acm.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for the single function coarsest partition problem 93

An efficient parallel algorithm for the single function coar...

引用

5th annual acm symposium on parallel algorithms and architectures, SPAA 1993

作者： JáJá, Joseph F. Ryu, Kwan Woo Department of Electrical Engineering Institute for Systems Research Korea Republic of Department of Computer Engineering Kyungpook National University Daegu Korea Republic of Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897915992

We describe an efficient parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. The previous best known algorithm runs in 0(log2 n) time using 0(n log2 n) operations on the CREW PRAM. Another algorithm developed independently of ours runs in O(logn) time using 0(n log n) operations on the Arbitrary CRCW PRAM. Our solution is based on efficient algorithms for solving several subproblems that are of independent interest. In particular, we present efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths. © 1993 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

The effect of communication costs in solid-state quantum computing architectures 03

The effect of communication costs in solid-state quantum com...

引用

fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Copsey, Dean Oskin, Mark Metodiev, Tzvetan Chong, Frederic T. Chuang, Isaac Kubiatowicz, John University of Washington Seattle WA United States University of California at Davis Davis CA United States University of California Berkeley Berkeley CA United States

ISBN: (纸本)9781581136616

Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed under idealized assumptions without important physical constraints in mind. In this paper, we analyze two key constraints: the short spatial distance of quantum interactions and the short temporal life of quantum data. In particular, quantum computations must make use of extremely robust error correction techniques to extend the life of quantum data. We present optimized spatial layouts of quantum error correction circuits for quantum bits embedded in silicon. We analyze the complexity of error correction under the constraint that interaction between these bits is near neighbor and data must be propagated via swap operations from one part of the circuit to another. We discover two interesting results from our quantum layouts. First, the recursive nature of quantum error correction circuits requires a additional communication technique more powerful than near-neighbor swaps - too much error accumulates if we attempt to swap over long distances. We show that quantum teleportation can be used to implement recursive structures. We also show that the reliability of the quantum swap operation is the limiting factor in solid-state quantum computation.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient execution of nondeterministic parallel programs on asynchronous systems 96

Efficient execution of nondeterministic parallel programs on...

引用

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

作者： Aumann, Yonatan Bender, Michael A. Zhang, Lisa Bar-Ilan Univ Ramat-Gan Israel

ISBN: (纸本)9780897918091

We consider the problem of asynchronous execution of parallel programs. The original program is assumed to be designed for a synchronous system, while the actual system may be asynchronous. We seek an automatic execution scheme, which allows the asynchronous system to execute the synchronous program. Previous solutions to this problem provide a solution only for the case where the original program is deterministic. Here, we provide the first solution for the nondeterministic case (e.g. randomized programs). Our scheme is based on a novel agreement protocol for this setting. Our protocol allows n asynchronous processors to agree on n word-sized values in O(n log n log log n) total work. Total work is defined to be the summation of the number of steps performed by all processes (including busy waiting).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Localized algorithm for parallel association mining

Localized algorithm for parallel association mining

引用

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

作者： Zaki, Mohammed Javeed Parthasarathy, Srinivasan Li, Wei Univ of Rochester Rochester United States

Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules from them. Several parallel and sequential algorithms have been proposed in the literature to solve this problem. Almost all of these algorithms make repeated passes over the database to determine the commonly occurring patterns or itemsets (set of items), thus incurring high I/O overhead. In the parallel case, these algorithms do a reduction at the end of each pass to construct the global patterns, thus incurring high synchronization cost. In this paper we describe a new parallel association mining algorithm. Our algorithm is a result of detailed study of the available parallelism and the properties of associations. The algorithm uses a scheme to cluster related frequent itemsets together, and to partition them among the processors. At the same time it also uses a different database layout which clusters related transactions together, and selectively replicates the database so that the portion of the database needed for the computation of associations is local to each processor. After the initial set-up phase, the algorithm eliminates the need for further communication or synchronization. The algorithm further scans the local database partition only three times, thus minimizing I/O overheads. Unlike previous approaches, the algorithms uses simple intersection operations to compute frequent itemsets and doesn't have to maintain or search complex hash structures. Our experimental testbed is a 32-processor DEC Alpha cluster inter-connected by the Memory Channel network. We present results on the performance of our algorithm on various databases, and compare it against a well known parallel algorithm. Our algorithm outperforms it by an more than an order of magnitude.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient message passing interface (MPI) for parallel computing on clusters of workstations 95

Efficient message passing interface (MPI) for parallel compu...

引用

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

作者： Bruck, Jehoshua Dolev, Danny Ho, Ching-Tien Rosu, Marcel-Catalin Strong, Ray California Inst of Technology Pasadena CA United States

ISBN: (纸本)9780897917179

An efficient design and implementation of the collective communication part in a Message Passing Interface (MPI) that is optimized for clusters of workstations is described. The system which consist of two main components, the MPI-CCL layer and a User-level Reliable Transport Protocol (URTP), is integrated with the operating system via an efficient kernel extension mechanism. The system is then implemented on a collection of IBM RS/6000 workstations connected via a 10Mbit Ethernet LAN. Results indicate that the performance of the MPI Broadcast (on top of Ethernet) is about twice as fast as a recently published software implementation of broadcast on top of ATM.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

The Pochoir Stencil Compiler 11

The Pochoir Stencil Compiler

引用

23rd annual symposium on parallelism in algorithms and architectures

作者： Tang, Yuan Chowdhury, Rezaul Kuszmaul, Bradley C. Luk, Chi-Keung Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781450307437

A stencil computation repeatedly updates each point of a d-dimensional grid as a function of itself and its near neighbors. parallel cache-efficient stencil algorithms based on "trapezoidal decompositions" are known, but most programmers find them difficult to write. The Pochoir stencil compiler allows a programmer to write a simple specification of a stencil in a domain-specific stencil language embedded in C++ which the Pochoir compiler then translates into high-performing Cilk code that employs an efficient parallel cache-oblivious algorithm. Pochoir supports general d-dimensional stencils and handles both periodic and aperiodic boundary conditions in one unified algorithm. The Pochoir system provides a C++ template library that allows the user's stencil specification to be executed directly in C++ without the Pochoir compiler (albeit more slowly), which simplifies user debugging and greatly simplified the implementation of the Pochoir compiler itself. A host of stencil benchmarks run on a modern multicore machine demonstrates that Pochoir outperforms standard parallel-loop implementations, typically running 2-10 times faster. The algorithm behind Pochoir improves on prior cache-efficient algorithms on multidimensional grids by making "hyperspace" cuts, which yield asymptotically more parallelism for the same cache efficiency.

关键词： C plus cache-oblivious algorithm Cilk compiler embedded domain-specific language multicore parallel computation stencil trapezoidal decomposition

来源：评论

学校读者我要写书评

暂无评论

New algorithms for Efficient parallel String Comparison 10

New Algorithms for Efficient Parallel String Comparison

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Krusche, Peter Tiskin, Alexander Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

ISBN: (纸本)9781450300797

In this paper. we show new parallel algorithms for a set of classical string comparison problems. computation of string alignments. longest common subsequences (LCS) or edit distances, and longest increasing subsequence computation. These problems have a wide range of applications, in particular in computational biology and signal processing. We discuss the scalability of our new parallel algorithms in computation time, in memory, and in commumcation Our new algorithms are based on an efficient parallel method for (min, +)-multiplication of distance matrices The core result of this paper is a scalable parallel algorithm for multiplying Implicit simple unit-Monge matrices of size n x n on p processors using lime O(n log n/p), communication O(n log p/p) and O( log p) supersteps. This algorithm allows us to implement scalable LCS computation for two strings of length n using time O(n(2)/p) and communication O(n/root P) requiring local memory of size O(n/root P) on each processor Furthermore, our algorithm can be used to obtain the first generally work-scalable algorithm for computing the longest increasing subsequence (LIS) Our algorithm for LIS computation requires computation O(n log(2) n/p), communication O(n log(2) p/p), and O(log(2) p) supersteps for computing the LIS of a sequence of length n This is within a log n factor of work-optimality for the LIS problem. which can be solved sequentially in time O(n log n) in the comparison-based model. Our LIS algorithm is also within a log p-factor of achieving perfectly scalable communication and furthermore has perfectly scalable memory size requirements of O(n/p) per processor

关键词： BSP algorithms longest common subsequences longest increasing subsequences

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：