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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Genetic-based solution to load balancing in parallel computers

Genetic-based solution to load balancing in parallel compute...

引用

Proceedings of the 22nd annual acm Computer Science Conference

作者： Baumgartner, Joseph P. Cook, Diane J. Univ of Texas at Arlington

ISBN: (纸本)0897916344

Efficient use of resources in a parallel computer often requires the redistribution of tasks during the execution of applications. This problem of load balancing is a formidable one because of the unpredictable and dynamic nature of many user programs. We present a Genetic Algorithm load balancer that optimizes the placement of tasks within the system. Our method incorporates the genetic algorithm into a more traditional load balancing framework. Using an event-driven simulator we evaluate the effectiveness of our algorithm and compare it to an existing approach. While genetic algorithms have been used in a variety of optimization problems, this represents the first attempt to use them in this domain. It also represents a departure from traditional heuristic-based load balancing schemes in that the genetic algorithm is the primary decision-making authority. Early results indicate that the use of genetic algorithms in load balancing can lead to a load balancing system that offers stability and adaptability to a variety of architectures and applications.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel tasks to minimize average response time

Scheduling parallel tasks to minimize average response time

引用

Proceedings of the Fifth annual SIAM symposium on Discrete algorithms

作者： Turek, John Schwiegelshohn, Uwe Wolf, Joel L. Yu, Philip S. IBM Thomas J. Watson Research Cent Yorktown Heights United States

ISBN: (纸本)0898713293

Consider a system of independent tasks which are to be scheduled without preemption on a parallel computer. For each task both the number of processors required and the corresponding execution time are known. The problem of finding a schedule with minimum makespan has been extensively studied in the literature. In this paper we tackle the corresponding problem of finding a schedule with minimum average response time. The results are analogous: The average response time problem is also NP-hard, and we construct a polynomial time algorithm whose solution is within a fixed multiplicative constant of optimal. Moreover, we show that none of the classic algorithms for the makespan problem have this property when viewed as solutions to the average response time problem.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Lazy array data-flow dependence analysis 94

Lazy array data-flow dependence analysis

引用

21st annual acm symposium on Principles of Programming Languages, POPL'94

作者： Maslov, Vadim Univ of Maryland College Park MD United States

ISBN: (纸本)0897916360

Automatic parallelization of real FORTRAN programs does not live up to users expectations yet, and dependence analysis algorithms which either produce too many false dependences or are too slow contribute significantly to this. In this paper we introduce a data-flow dependence analysis algorithm which exactly computes value-based dependence relations for program fragments in which all subscripts, loop bounds and IF conditions are affine. Our algorithm also computes good affine approximations of dependence relations for non-affine program fragments. Actually, we know of no other algorithm which can compute better approximations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel string algorithms: Merging, sorting and computing the minimum 26

Optimal parallel string algorithms: Merging, sorting and com...

引用

Proceedings of the 26th annual acm symposium on the Theory of Computing

作者： Hagerup, Torben Max-Planck-Inst fuer Informatik Saarbruecken Germany

ISBN: (纸本)0897916638

We study fundamental comparison problems on strings of characters, equipped with the usual lexicographical ordering. For each problem studied, we give a parallel algorithm that is optimal with respect to at least one criterion for which no optimal algorithm was previously known. Specifically, our main results are: qq Two sorted sequences of strings, containing altogether n characters, can be merged in O(log n) time using O(n) operations on an EREW PRAM. This is optimal as regards both the running time and the number of operations. qq A sequence of strings, containing altogether n characters represented by integers of size polynomial in n, can be sorted in O(log n/log log n) time using O(n log log n) operations on a CRCW PRAM. The running time is optimal for any polynomial number of processors. qq The minimum string in a sequence of strings containing altogether n characters can be found using (expected) O(n) operations in (expected) time ranging from O(1) on a randomized CRCW PRAM to O(log n log log n) on a deterministic EREW PRAM.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

An o(n) work EREW parallel algorithm for updating MST 2nd

引用

2nd annual European symposium on algorithms, ESA 1994

作者： Das, Sajal K. Ferragina, Paolo Dept. of Computer Science University of North Texas P.O. Box 13886 DentonTX76203 United States Dipartimento di Informatica Università di Pisa Corso Italia 40 Pisa56125 Italy

ISBN: (纸本)9783540584346

We provide an o(m)-work EREW PRAM algorithm to maintain the minimum spanning forest of an undirected graph under edge insertions and deletions. Then, using the sparsification data structure, we improve this result obtaining the first o(n)-work EREW parallel algorithm requiring O(log n log [formula presented]) time for each update. The problem of treating multiple edge updates is also addressed. © Springer-Verlag Berlin Heidelberg 1994.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Impact of sharing-based thread placement on multithreaded architectures

Impact of sharing-based thread placement on multithreaded ar...

引用

Proceedings of the 21st annual International symposium on Computer Architecture

作者： Thekkath, Radhika Eggers, Susan J. Univ of Washington Seattle United States

Multithreaded architectures context switch between instruction streams to hide memory access latency. Although this improves processor utilization, it can increase cache interference and degrade overall performance. One technique to reduce the interconnect traffic is to co-locate threads that share data on the same processor. Multiple threads sharing in the cache should reduce compulsory and invalidation misses, thereby improving execution time. To test this hypothesis, we compared a variety of thread placement algorithms via trace-driven simulation of fourteen coarse- and medium-grain parallel applications on several multithreaded architectures. Our results contradict the hypothesis. Rather than decreasing, compulsory and invalidation misses remained nearly constant across all placement algorithms, for all processor configurations, even with an infinite cache. That is, sharing-based placement had no (positive) effect on execution time. Instead, load balancing was the critical factor that affected performance. Our results were due to one or both of the following reasons: (1) the sequential and uniform access of shared data by the application's threads and (2) the insignificant number of data references that require interconnect access, relative to the total number of instructions.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

QRQW PRAM: Accounting for contention in parallel algorithms

QRQW PRAM: Accounting for contention in parallel algorithms

引用

Proceedings of the Fifth annual SIAM symposium on Discrete algorithms

作者： Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya AT&T Bell Lab Murray Hill United States

ISBN: (纸本)0898713293

We introduce the queue-read, queue-write (QRQW) PRAM model, which permits concurrent reading and writing, but at a cost proportional to the number of readers/writers to a memory location in a given step. Previously, there were no formal complexity models that accounted for the contention to memory locations, despite the large impact of such contentions on the performance of parallel programs. The QRQW PRAM is strictly more powerful than the EREW PRAM. We show a separation of √lg n between the two models, and present faster and more efficient QRQW algorithms for many basic problems. Nevertheless, we show that the QRQW can be efficiently emulated with only logarithmic slowdown on Valiant's BSP model, and hence on hypercube-type non-combining networks, even when latency, synchronization, and memory granularity overheads are taken into account. In contrast, efficient emulations for the CRCW PRAM on such networks are only known with polynomial slowdown. Most existing machines obey the queue-read, queue-write rule. We study the impact of the QRQW rule on algorithm design, devising new techniques for low-contention algorithms. Our results include fast and efficient algorithms for computing the OR, leader election, linear compaction, multiple compaction, integer sorting, and CRCW simulation, as well as several lower bounds. Some of the results presented are quite involved and use several novel ideas and techniques that are interesting on their own.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Subtree max gap problem with application to parallel string covering

Subtree max gap problem with application to parallel string ...

引用

Proceedings of the Fifth annual SIAM symposium on Discrete algorithms

作者： Ben-Amram, Amir M. Berkman, Omer Iliopoulos, Costas S. Park, Kunsoo

ISBN: (纸本)0898713293

We introduce the subtree max gap problem. Consider a tree T with n leaves whose internal nodes have degree at least two. Each leaf is associated with a real number. For each internal node v, let Av be the set of numbers associated with the leaves in the subtree rooted at v, regarded as points on the x-axis. The subtree max gap problem is to compute the maximum distance (gap) between any two consecutive points of Av for every internal node v of T. Our algorithm for the subtree max gap problem follows a series of reductions to other combinatorial problems which are interesting on their own merit. The algorithm runs in O(log n) time using n processors on the CREW PRAM. The subtree max gap problem plays a central role in the parallel solution of the string covering problem. Recently, Iliopoulos, Moore and Park gave an O(n log n) time sequential algorithm for the string covering problem. Neither parallelizing the above sequential algorithm nor using known techniques in strings seems to yield an efficient parallel algorithm for string covering. Our parallel algorithm thus follows a new approach, introducing the use of suffix trees and reducing the string covering problem to the subtree max gap problem. The algorithm runs in O(log n) time using n processors on the CRCW PRAM, thereby matching the number of operations in [15].

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

The parallel complexity of eden growth, solid-on-solid growth and ballistic deposition 2nd

引用

2nd annual European symposium on algorithms, ESA 1994

作者： Greenlaw, Raymond Machta, Jonathan Department of Computer Science University of New Hampshire DurhamNH03824 United States Department of Physics and Astronomy University of Massachusetts AmherstMA01003 United States

ISBN: (纸本)9783540584346

In this interdisciplinary research we apply the tools of algorithmic complexity theory to three important non-equilibrium growth models that are used in statistical physics. Much of the insight into these models has been derived by numerical simulation;it is important to develop good parallel algorithms for them. Eden growth, solidon-solid growth and ballistic deposition are all seemingly highly sequential processes. However, we are able to provide algorithms for the models that run in time O(log2 N) using a polynomial number of processors on a randomized CREW P-RAM, where N is the system size. In addition to their potential practical value, our algorithms serve to classify these growth models as less complex than other growth models, such as diffusion-limited aggregation, for which fast parallel algorithms probably do not exist. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Statistical Physics

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel approximation for prefix sums and integer sorting

Optimal parallel approximation for prefix sums and integer s...

引用

Proceedings of the Fifth annual SIAM symposium on Discrete algorithms

作者： Goodrich, Michael T. Matias, Yossi Vishkin, Uzi Johns Hopkins Univ Baltimore United States

ISBN: (纸本)0898713293

parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms today. Its time complexity on the CRCW PRAM is Θ(lg n/lg lg n) using a polynomial number of processors, even in a randomized setting. Nevertheless, there are a number of non-trivial applications that have been shown to be solvable using only an approximate version of the prefix sums problem. In this paper we resolve the issue of approximating parallel prefix by introducing an algorithm that runs in O(lg* n) time with very high probability, using n/lg* n processors, which is optimal in terms of both work and running time. Our approximate prefix sums are guaranteed to come within a factor of (1+Ε) of the values of the true sums in a `consistent fashion', where Ε is o(1). We achieve this result through the use of a number of interesting new techniques, such as overcertification and estimate-focusing, as well as through new adaptations of known techniques, such as failure-sweeping and bit-thinning. We give a number of non-trivial applications of our approximate parallel prefix routine. Perhaps the most interesting application is for padded integer sorting, an approximation version of another fundamental problem in parallel algorithm design - integer sorting - where one wishes to sort n integers into an array of size O(n), allowing for gaps between consecutive elements. We show that this problem can also be solved in O(lg* n) time, with very high probability, using a linear amount of work, which is also optimal in both time and work. Finally, we show several applications to integer-coordinate (non-approximate) problems in computational geometry, such as convex hulls and hidden-line elimination, as well as for approximate selection.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共161页 << < 119 120 121 122 123 124 125 126 127 128 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：