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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Efficient parallel algorithms on restartable fail-stop processors 91

Efficient parallel algorithms on restartable fail-stop proce...

引用

10th annual acm symposium on Principles of Distributed Computing, PODC 1991

作者： Kanellakis, Paris C. Shvartsman, Alex A. Computer Science Dept. Brown University PO Box 1910 ProvidenceRI02912 United States Digital Equipment Corporation 550 King Street LittletonMA01460 United States

ISBN: (纸本)0897914392

We study efficient deterministic executions of parallel algorithms on restartable fail-stop CRCW PRAMs. We allow the PRAM processors to be subject to arbitrary stop failures and restarts, that are determined by an on-line adversary, and that result in loss of private memory but do not affect shared memory. For this model, we define and justify the complexity measures of: completed work, where processors are charged for completed fixed-size update cycles, and overhead ratio, which amortizes the work over necessary work and failures. This framework is a nontrivial extension of the fail-stop no-restart model of [KS 89]. We present a simulation strategy for any N processor PRAM on a restartable fail-stop P processor CRCW PRAM such that: it guarantees a terminating execution of each simulated N processor step, with 0(log2 N) overhead ratio, and 0(min{A'' + Plog2 N + Mlog JV, N P0'8}) (sub-quadratic) completed work, where M is the number of failures during this step's simulation. This strategy is work-optimal when the number of simulating processors is P © 1991 acm

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Randomized parallel algorithms for trapezoidal diagrams 91

Randomized parallel algorithms for trapezoidal diagrams

引用

Proceedings of the Seventh annual symposium on Computational Geometry

作者： Clarkson, K.L. Cole, R. Tarjan, R.E. AT&T Bell Labs Courant Institute New York University Princeton University and NEC Research Institute

ISBN: (纸本)0897914260

We describe randomized parallel CREW PRAM algorithms for building trapezoidal diagrams of line segments in the plane. For general segments, we give an algorithm requiring optimal O(A + nlogn) expected work and optimal O(logn) time, where A is the number of intersecting pairs of segments. If the segments form a simple chain, we give an algorithm requiring optimal O(n) expected work and O(log n log log ra log^∗ n) expected time, and a simpler algorithm requiring O(n log^∗ n) expected work. The serial algorithm corresponding to the latter is the simplest known algorithm requiring O(n log^∗ n) expected operations. For a set of segments forming K chains, we give an algorithm requiring O(A + n log^∗ n + K log n) expected work and O(log n log log n log^∗ n) expected time. The parallel time bounds require the assumption that enough processors are available, with processor allocations every log n steps. © 1991 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Object-oriented fortran for development of portable parallel programs 3

Object-oriented fortran for development of portable parallel...

引用

Proceedings of the Third IEEE symposium on parallel and Distributed Processing

作者： Reese, D.S. Luke, E. Mississippi State University NSF ERC for Computational Field Simulation United States

ISBN: (纸本)0818623101

parallel programming has to date remained inaccessible to the average scientific programmer. parallel programming languages are generally foreign to most scientific applications programmers who only speak Fortran. Automatic parallelization techniques have so far proved unsuccessful in extracting large amounts of parallelism from sequential codes and do not encourage development of new, inherently parallel algorithms. In addition, there is a lack of consistency of programmer interface across architectures which requires programmers to invest a lot of effort in porting code from one parallel machine to another. This paper discusses the object oriented Fortran language and support routines developed at Mississippi State in support of parallelizing complex field simulations. This interface is based on Fortran to ease its acceptance by scientific programmers and is implemented on top of the Unix operating system for portability. © 1991 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Efficient sequential and parallel algorithms for computing recovery points in trees and paths 53

Efficient sequential and parallel algorithms for computing r...

引用

2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991

作者： Chrobak, Marek Eppstein, David Italiano, Giuseppe F. Yung, Moti Department of Computer Science University of California RiversideCA92521 United States Xerox PARC Palo AltoCA94304 United States University of California IrvineCA92717 United States Department of Computer Science Columbia University New YorkNY10027 United States Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Roma Italy IBM Research Division T.J. Watson Research Center Yorktown HeightsNY10598 United States

ISBN: (纸本)0897913760

We present efficient sequential and parallel algorithms for the problem of finding an optimal placement of recovery points in a tree (and in a path) system. The placement of recovery points together with rollback mechanisms (which recover the latest such point) is a major fault-tolerance technique used in many systems. We achieve an O(n log n) time worst case algorithm for trees, which can be sped up when some problem parameters such as the number of recovery points, or the depth of the tree are small. For the important case of path systems we give an O(n log∗ n) algorithm. We also give efficient poly-logarithmic parallel (PRAM) algorithms for these problems. © 1991 Association for Computing Machinery. All rights reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Constant-Time parallel integer sorting 91

Constant-Time parallel integer sorting

引用

23rd annual acm symposium on Theory of Computing, STOC 1991

作者： Hagerup, Torben Max-Planck-Institut fur Informatik SaarbruckenW-6600 Germany

ISBN: (纸本)0897913973

We investigate a nonstandard output convention for sorting. Specifically, the input elements are to be returned not in an array sorted in *** order, but in a linked list sorted in nondecreasing order. This problem, which we call chuin-sorting, may be viewed as standard sorting "minus" list ranking, since chain-sorting followed by list ranking of the resulting list is equivalent to standard soI ting. The known lower bounds on parallel integer sorting apply to list ranking, but not to chain-sorting, which is one motivation for considering the latter problem: If chain-sorting constitutes the "essence" of sorting, as indeed we feel, what happens if it is isolated from list ranking? We have the following results for chain-sorting n integers in the range 1. n on a CRC W PRAM: (1) 0(1) time using n2 processors (trivial);(2) O(1) expected time using O(nlog n/log logn) processors (simple);(3) O(log n/log log n) expect ed time using O(n log log n/log n) processors (nont livial);and (4) O(loglognlog n/log loglogn) expected time using O(n log log log n/(log log n log" n)) processors (quite involved). As a by-product of results (3) or (4) above, we are able to improve the best previous results on (standard) randomized sorting of n integers in the range 1. n. The paper introduces several novel techniques in the design of very fast parallel algorithms. © 1991 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Ultra-fast expected time parallel algorithms 53

Ultra-fast expected time parallel algorithms

引用

2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991

作者： 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: (纸本)0897913760

It has been shown previously that given n items and a polynomial number of processors, sorting these items into n locations requires Ω(log n/log log n) time. We sidestep this lower bound with a new technique called Padded Sort, which sorts n items into n + o(n) locations. Since many problems simply rely on the relative ordering information found by sorting, and not on the exact rank of the sorted items, a Padded Sort is often just as useful as an unpadded sort. We show that a Padded Sort can be accomplished in o(log log n) expected time with n/log log n processors, assuming the items are taken from a uniform distribution. We also show using similar techniques that we can solve the All Nearest Neighbors, Voronoi Diagram, Delaunay Triangulation, and Largest Empty Circle problems in o (log log n) expected time with n/log log n processors, assuming points are taken from a uniform distribution in the unit square. Further, we present an algorithm to solve the Closest Pair problem in constant expected time with n processors regardless of the distribution of points. These algorithms all run on the CRCW PRAM model in which write conflicts are decided arbitrarily, and they all achieve linear speedup in expected time over their optimal serial counterparts. © 1991 Association for Computing Machinery. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

A new technique for induct ion variable removal 24

A new technique for induct ion variable removal

引用

24th annual International symposium on Microarchitecture, MICRO 1991

作者： Wang, Haigeng Nicolau, Alexandru Potasman, Roni Information and Computer Science Department University of California IrvineCA United States Dept. of Electrical and Computer Engineering University of California IrvineCA United States

ISBN: (纸本)0897914600

Removing redundant loop induction variables(IV's) in a sequential program can improve the code performance by making effective use of registers and reducing the dynamic instruction count in the loop. At the microcode level and in high-performance, fine-grain parallel architectures, it is even more important that a parallelizing compiler is able to remove redundant IV's generated as a by-product of parallelizing transformations. Conventional IV detection algorithm fails in finding an IV family with no basic IV. Copy propagation in general cannot transform an IV family with no basic IV into a family with a basic IV. As a result, conventional IV removal method would not work for more general types of IV families, which often result from loop parallelizing transformations and also exist in sequential programs. Furthermore, IV removal by copy propagation with loop unrolling cannot preserve the semantic of the original code in addition to its space-inefficiency. We present in this paper a new technique for redundant IV removal. It can remove redundant IV's from more general types of IV families without an overhead of code size increase, which is inevitably incurred by other methods such aa loop unwinding and copy propagation with node splitting . It can also be used to determine whether redundant IV's should be removed(i.e., benefits the overall performance). We then demonstrate the effectiveness of this technique using some benchmarks. © 1991 acm.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A parallel system for test pattern generation 3

A parallel system for test pattern generation

引用

3rd IEEE symposium on parallel and Distributed Processing, PDPS 1991

作者： Balboni, G.P. Cabodi, G.P. Gai, S. Sismondi, D. Reorda, M.S. CSELT Torino Italy Dip. Automatica e Informatica Politecnico di Torino Torino Italy

ISBN: (纸本)0818623101

The problem of generating test pattern sequences for digital circuits is a crucial one in the area of electronic CAD. While a significant effort has been made to develop new and more powerful algorithms to solve it, the required CPU times are still unacceptable in many cases. The authors propose a different approach based on the use of a general-purpose parallel architecture. The attention is devoted to combinational circuits described at the gate level, and faults are modeled as permanent single stuck-ats. parallelization strategies are discussed, together with an implementation on a transputer-based machine. The resulting system significantly speeds-up the test generation process: Its performance is discussed, also reporting the experimental results obtained on the standard set of bench-mark combinational circuits. © 1991 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Wait-free parallel algorithms for the union-find problem 91

Wait-free parallel algorithms for the union-find problem

引用

23rd annual acm symposium on Theory of Computing, STOC 1991

作者： Anderson, Richard J. Wont, Heather University of Washington United States University of California San Diego United States

ISBN: (纸本)0897913973

We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the union-find data structure. Our machine model is asynchronous and allows stopping faults. Thus we require our solutions to the data structure problem have the wait-free property, meaning that each thread continues to make progress on its operations, independent of the speeds of the other threads. In this model efficiency is best measured in terms of the total number of instructions used to perform a sequence of data structure operations, the work performed by the processors. We give a wait-free implementation of an efficient algorithm for union-find. In addition we show that the worst case performance of the algorithm can be improved by simulating a synchronized algorithm, or by simulating a larger machine if the data structure requests support sufficient parallelism. Our solutions apply to a much more general adversary model than has been considered by other authors. © 1991 acm.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Combining tentative and definite executions for very fast i)ependable parallel computing 23

Combining tentative and definite executions for very fast i)...

引用

23rd annual acm symposium on Theory of Computing, STOC 1991

作者： Kedem, Z.M. Palem, K.V. Raghunathan, A. Spirakis, P.G. Ecole des Hautes Etudes en Jniormatique Université René Descartes 45 rue des Saints-Pares Paris75006 France Department of Computer Science New York University 251 Mercer St New YorkNY10012-1185 United States Research Center and the Institute for Advanced Computer Studies University of Maryland. IBM Research Division T. 3. Watson Research Center P. 0. Box 704 Yorktown HeightNY10598 United States Computer Science Division University of California DavisCA95616 United States Computer Technology Institute Patras University P. 0. Box 1122 Patras26110 Greece

ISBN: (纸本)0897913973

We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a single parallel step of an ideal parallel machine on the unreliable machine. A definite algorithm is one that guarantees a correct execution of a step, while a tentative algorithm is one that is "highly likely" to produce a correct execution of a step on the unreliable machine. We show that any definite execution of one step requires Cl(log n) time on an∗processor unreliable machine, even if all the processors functioned perfectly, This implies an l(log n) slowdown for executing any non-Trivial program on the unreliable machine, provided only definite executions are used. We get around this overhead by combining tentative and definite execution schemes appropriately, to derive correct and efllcient robust executions for arbitrary PRAM programs, with expected amortized slowdown of only 0(1) for a variety of reasonable failure models. We adeve this by using a tentative algorithm to execute each of the program's steps, while using a definite algorithm to audit the execution at selected points. If the audit does not certify the execution as correct, then the execution is rolled back to a previous audit point and restarted from there. In contrast to this work, all previous results required a slowdown of Cl(log n), since they used definite algorithms only. © 1991 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共161页 << < 136 137 138 139 140 141 142 143 144 145 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：