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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Fine-grain multithreading with the EM-X multiprocessor 97

Fine-grain multithreading with the EM-X multiprocessor

引用

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

作者： Sohn, Andrew Kodama, Yuetsu Ku, Jui Sato, Mitsuhisa Sakane, Hirofumi Yamana, Hayato Sakai, Shuichi Yamaguchi, Yoshinori New Jersey Inst of Technology Newark NJ United States

ISBN: (纸本)9780897918909

Multithreading aims to tolerate latency by overlapping communication with computation. This report explicates the multithreading capabilities of the EM-X distributed-memory multiprocessor through empirical studies. The EM-X provides hardware supports for fine-grain multithreading, including a by-passing mechanism for direct remote reads and writes, hardware FIFO thread scheduling, and dedicated instructions for generating fixed-sized communication packets. Bitonic sorting and Fast Fourier Transform are selected for experiments. Parameters that characterize the performance of multithreading are investigated, including the number of threads, the number of thread switches, the run length, and the number of remote reads. Experimental results indicate that the best communication performance occurs when the number of threads is two to four. FFT yielded over 95% overlapping due to a large amount of computation and communication parallelism across threads. Even in the absence of thread computation parallelism, multithreading helps overlap over 35% of the communication time for bitonic sorting.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Bounding Laconic Proof Systems by Solving CSPs in parallel 17

Bounding Laconic Proof Systems by Solving CSPs in Parallel

引用

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

作者： Li, Jason O'Donnell, Ryan Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450345934

We show that the basic semidefinite programming relaxation value of any constraint satisfaction problem can be computed in NC;that is, in parallel polylogarithmic time and polynomial work. As a complexity-theoretic consequence we get that MIP1[k, c, s] subset of PSPACE provided s/c <= (.62 -o(1))k/2(k), resolving a question of Austrin, Hastad, and Pass. Here MIP1[k, c, s] is the class of languages decidable with completeness c and soundness s by an interactive proof system with k provers, each constrained to communicate just 1 bit.

关键词： constraint satisfaction problems semidefinite programming complexity theory

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for asymmetric read-write costs 16

Parallel algorithms for asymmetric read-write costs

引用

28th acm symposium on parallelism in algorithms and architectures, SPAA 2016

作者： Ben-David, Naama Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Gu, Yan McGuffey, Charles Shun, Julian Carnegie Mellon University United States Georgetown University United States UC Berkeley United States

ISBN: (纸本)9781450342100

Motivated by the significantly higher cost of writing than reading in emerging memory technologies, we consider parallel algorithm design under such asymmetric read-write costs, with the goal of reducing the number of writes while preserving work-efficiency and low span. We present a nested-parallel model of computation that combines (i) small per-task stack-allocated memories with symmetric read-write costs and (ii) an unbounded heap-allocated shared memory with asymmetric read-write costs, and show how the costs in the model map efficiently onto a more concrete machine model under a work-stealing scheduler. We use the new model to design reduced-write, work-efficient, low-span parallel algorithms for a number of fundamental problems such as reduce, list contraction, tree contraction, breadth-first search, ordered filter, and planar convex hull. For the latter two problems, our algorithms are output-sensitive in that the work and number of writes decrease with the output size. We also present a reduced-write, low-span minimum spanning tree algorithm that is nearly work-efficient (off by the inverse Ackermann function). Our algorithms reveal several interesting techniques for significantly reducing shared memory writes in parallel algorithms without asymptotically increasing the number of shared memory reads. © 2016 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Relaxing the problem-size bound for out-of-core columnsort 03

Relaxing the problem-size bound for out-of-core columnsort

引用

Fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Chaudhry, Geeta Hamon, Elizabeth A. Cormen, Thomas H. Dartmouth College Department of Computer Science 6211 Sudikoff Laboratory Hanover NH 03755 United States

ISBN: (纸本)9781581136616

Previous implementations of out-of-core columnsort limit the problem size to N ≤ √(M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the total number of records that the entire system can hold in its memory. We implemented two variations to out-of-core columnsort that relax this restriction. Sub-block columnsort is based on an algorithmic modification of the underlying columnsort algorithm, and it improves the problem-size bound to N ≤ (M/P)5/3/42/3 but at the cost of additional disk I/O. M-columnsort changes the notion of the column size in columnsort, improving the maximum problem size to N ≤ √/M3/2 but at the cost of additional computation and communication. Experimental results on a Beowulf cluster show that both subblock columnsort and M-columnsort run well but that M-columnsort is faster. A further advantage of M-columnsort is that it handles a wider range of problem sizes than subblock columnsort.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A dynamic distributed load balancing algorithm with provable good performance 93

A dynamic distributed load balancing algorithm with provable...

引用

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

作者： Lüling, Reinhard Monien, Burkhard Department of Mathematics and Computer Science University of Paderborn Germany

ISBN: (纸本)0897915992

The overall efficiency of parallel algorithms is most decisively effected by the strategy applied for the mapping of workload. Strategies for balancing dynamically generated workload on a processor network which are also useful for practical applications have intensively been investigated by simulations and by direct applications. This paper presents the complete theoretical analysis of a dynamically distributed load balancing strategy. The algorithm is adaptive by nature and is therefore useful for a broad range of applications. A similar algorithmic principle has already been implemented for a number of applications in the areas of combinatorial optimization, parallel programming languages and graphical animation. The algorithm performed convincingly for all these applications. In our analysis we will prove that the expected number of packets on each processor varies only by a constant factor compared with that on any other processor, independent of the generation and consumption of workload on each processor. We give exact bounds for these values and prove an exact upper bound, independent of the number of processors. Thus, the algorithm achieves a well-balanced workload distribution on any network for any underlying application. We also prove that the variation of the expected number of packets on a processor is very small and only dependent on the parameters of the algorithm. Furthermore, we present some analysis of the costs of our algorithm. We will also show that all tradeoffs between balancing quality, variation and costs can be determined by the parameters of the algorithm. © 1993 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Work-optimal parallel minimum cuts for non-sparse graphs 21

Work-optimal parallel minimum cuts for non-sparse graphs

引用

33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021

作者： López-Martínez, Andrés Mukhopadhyay, Sagnik Nanongkai, Danupon KTH Royal Institute of Technology Stockholm Sweden University of Copenhagen Copenhagen Denmark

ISBN: (纸本)9781450380706

We present the first work-optimal polylogarithmic-depth parallel algorithm for the minimum cut problem on non-sparse graphs. For ≥ n^1+ϵ for any constant ϵ>0, our algorithm requires O(m log n) work and O(log^3 n) depth and succeeds with high probability. Its work matches the best O(m log n) runtime for sequential algorithms [MN STOC'20;GMW SOSA'21]. This improves the previous best work by Geissmann and Gianinazzi [SPAA'18] by a O(log^3 n) factor, while matching the depth of their algorithm. To do this, we design a work-efficient approximation algorithm and parallelize the recent sequential algorithms [MN STOC'21;GMW SOSA'21] that exploit a connection between 2-respecting minimum cuts and 2-dimensional orthogonal range searching. © 2021 acm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Implementations of randomized sorting on large parallel machines 92

Implementations of randomized sorting on large parallel mach...

引用

4th annual acm symposium on parallel algorithms and architectures - SPAA '92

作者： Hightower, William L. Prins, Jan F. Reif, John H. Elon Coll Elon College NC United States

ISBN: (纸本)089791483X

Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a sophisticated randomized sampling technique to form a splitter set, but Samplesort distributes the splitter set to each processor while Flashsort uses splitter-directed routing. In this paper we present B-Flashsort, a new batched-routing variant of Flashsort designed to sort N > P values using P processors connected in a d-dimensional mesh and using constant space in addition to the input and output. The key advantage of the Flashsort approach over Samplesort is a decrease in memory requirements, by avoiding the broadcast of the splitter set to all processors. The practical advantage of B-Flashsort over Flashsort is that it replaces pipelined splitter-directed routing with a set of synchronous local communications and bounds recursion, while still being demonstrably efficient. The performance of B-Flashsort and Samplesort is compared using a parameterized analytic model in the style of [BLM+91] to show that on a d-dimensional toroidal mesh B-Flashsort improves on Samplesort when (N/P) 1log P + c2dP1/d + c3), for machine-dependent parameters c1, c2, and c3. Empirical confirmation of the analytical model is obtained through implementations on a MasPar MP-1 of Samplesort and two B-Flashsort variants.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Asynchronous shared memory search structures 96

Asynchronous shared memory search structures

引用

8th annual acm symposium on parallel algorithms and architectures

作者： Adler, M Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA Int Comp Sci Inst Berkeley CA 94704 USA

ISBN: (纸本)9780897918091

We study the problem of storing an ordered E;et On an asynchronous shared memory parallel computer. We examine the case where we want to perform successor (least upper bound) queries efficiently on the set members that are stored. We also examine the case where processors insert and delete members of the set. Due to asynchrony, we require processors to perform queries and to maintain the structure independently. Although several such structures have been proposed, the analysis of these structures has been very limited. We here ut;e the recently proposed QRQW PRAM model to provide upper and lower bounds on the performance of such data structures. In the asynchronous QRQW PRAM, the problem of processors concurrently and independently searching a shared data structure is very similar to the problem of routing packets through a network. Using this as a guide, we introduce the Search-Butterfly, a search structure that combines the efficient packet routing properties of the butterfly graph with the efficient search structure properties of the B-Tree. We analyze the behavior of the Search-Butterfly when the following operations are performed: arbitrary searches, random searches,and random searches, insertions, and deletions. We also provide lower bounds that show that the results are within a factor of O (log n) of optimal where n is the number of keys;in the structure. When the searches are random, the results are within a constant factor of optimal. Many of the proofs are derived from closely related results for packet routing. Others are of independent interest, most notably a method of adding queues to any network belonging to a large class of queuing networks with non-Markovian routing in a manner that allows us to bound the delay experienced by packets in the augmented network.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Faster and simpler width-independent parallel algorithms for positive semidefinite programming 12

Faster and simpler width-independent parallel algorithms for...

引用

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

作者： Peng, Richard Tangwongsan, Kanat Carnegie Mellon University United States

ISBN: (纸本)9781450312134

This paper studies the problem of finding a (1+Ε)-approximate solution to positive semidefinite programs. These are semidefinite programs in which all matrices in the constraints and objective are positive semidefinite and all scalars are nonnegative. At FOCS'11, Jain and Yao gave an NC algorithm that requires O(1/Ε13 log13 mlog n) iterations on input n constraint matrices of dimension m-by-m, where each iteration performs at least Δ(mω) work since it involves computing the spectral decomposition. We present a simpler NC parallel algorithm that on input with n constraint matrices, requires O(1/Ε4 log4 n log(1/Ε )) iterations, each of which involves only simple matrix operations and computing the trace of the product of a matrix exponential and a positive semidefinite matrix. Further, given a positive SDP in a factorized form, the total work of our algorithm is nearly-linear in the number of non-zero entries in the factorization. Our algorithm can be viewed as a generalization of Young's algorithm and analysis techniques for positive linear programs (Young, FOCS'01 ) to the semidefinite programming setting. Copyright 2012 acm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共161页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：