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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

496 篇 会议
38 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

400 篇 工学
- 384 篇 计算机科学与技术...
- 262 篇 软件工程
- 44 篇 信息与通信工程
- 33 篇 电气工程
- 25 篇 控制科学与工程
- 11 篇 电子科学与技术（可...
- 9 篇 农业工程
- 4 篇 材料科学与工程（可...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
267 篇 理学
- 261 篇 数学
- 39 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 2 篇 化学
34 篇 管理学
- 30 篇 管理科学与工程(可...
- 25 篇 工商管理
- 4 篇 图书情报与档案管...
11 篇 农学
- 11 篇 作物学
- 2 篇 农业资源与环境
4 篇 经济学
- 4 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

118 篇 parallel process...
103 篇 parallel algorit...
20 篇 parallel program...
15 篇 computer program...
13 篇 scheduling
11 篇 computer archite...
8 篇 approximation al...
7 篇 computer systems...
7 篇 pram
6 篇 parallel process...
6 篇 parallel archite...
6 篇 sorting
5 篇 graph algorithms
5 篇 algorithms
4 篇 performance
4 篇 computational ge...
4 篇 multithreading
4 篇 heterogeneity
4 篇 data structures
4 篇 transactional me...

机构

10 篇 carnegie mellon ...
8 篇 carnegie mellon ...
5 篇 carnegie mellon ...
4 篇 university of ma...
4 篇 univ calif berke...
4 篇 univ of paderbor...
4 篇 carnegie mellon ...
3 篇 uc berkeley unit...
3 篇 paderborn univ p...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
3 篇 georgetown unive...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 univ calif davis...
2 篇 int comp sci ins...
2 篇 heinz nixdorf in...

作者

21 篇 blelloch guy e.
14 篇 gibbons phillip ...
9 篇 goodrich michael...
8 篇 leiserson charle...
8 篇 vishkin uzi
7 篇 tangwongsan kana...
7 篇 fineman jeremy t...
7 篇 reif john h.
6 篇 vitter jeffrey s...
6 篇 gu yan
6 篇 demmel james
5 篇 ballard grey
5 篇 sun yihan
5 篇 bender michael a...
5 篇 schwartz oded
5 篇 muthukrishnan s.
5 篇 simhadri harsha ...
5 篇 miller gary l.
5 篇 matias yossi
4 篇 karp richard m.

语言

520 篇 英文
14 篇 其他

检索条件"任意字段=Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures"

共 534 条记录，以下是81-90 订阅

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

详细简洁

排序：

Locality-Aware Task Management for Unstructured parallelism: A Quantitative Limit Study 13

Locality-Aware Task Management for Unstructured Parallelism:...

引用

annual acm symposium on parallel algorithms and architectures

作者： Richard M. Yoo Christopher J. Hughes Changkyu Kim Yen-Kuang Chen Christos Kozyrakis Parallel Computing Laboratory Intel Labs Santa Clara CA 95054 Pervasive Parallelism Laboratory Stanford University Stanford CA 94305

ISBN: (纸本)9781450315722

As we increase the number of cores on a processor die, the on-chip cache hierarchies that support these cores are getting larger, deeper, and more complex. As a result, non-uniform memory access effects are now prevalent even on a single chip. To reduce execution time and energy consumption, data access locality should be exploited. This is especially important for task-based programming systems, where a scheduler decides when and where on the chip the code segments, i.e., tasks, should execute. Capturing locality for structured task parallelism has been done effectively, but the more difficult case, unstructured parallelism, remains largely unsolved-little quantitative analysis exists to demonstrate the potential of locality-aware scheduling, and to guide future scheduler implementations in the most fruitful direction. This paper quantifies the potential of locality-aware scheduling for unstructured parallelism on three different many-core processors. Our simulation results of 32-core systems show that locality-aware scheduling can bring up to 2.39x speedup over a randomized schedule, and 2.05x speedup over a state-of-the-art baseline scheduling scheme. At the same time, a locality-aware schedule reduces average energy consumption by 55% and 47%, relative to the random and the baseline schedule, respectively. In addition, our 1024-core simulation results project that these benefits will only increase: Compared to 32-core executions, we see up to 1.83x additional locality benefits. To capture such potentials in a practical setting, we also perform a detailed scheduler design space exploration to quantify the impact of different scheduling decisions. We also highlight the importance of locality-aware stealing, and demonstrate that a stealing scheme can exploit significant locality while performing load balancing. Over randomized stealing, our proposed scheme shows up to 2.0x speedup for stolen tasks.

关键词： Task Scheduling Task Stealing Locality Performance Energy

来源：评论

学校读者我要写书评

暂无评论

Truly parallel burrows-wheeler compression and decompression 13

Truly parallel burrows-wheeler compression and decompression

引用

Proceedings of the twenty-fifth annual acm symposium on parallelism in algorithms and architectures

作者： James Alexander Edwards Uzi Vishkin University of Maryland College Park USA

ISBN: (纸本)9781450315722

We present novel work-optimal PRAM algorithms for Burrows-Wheeler (BW) compression and decompression of strings over a constant alphabet. For a string of length n, the depth of the compression algorithm is O(log2 n), and the depth of the corresponding decompression algorithm is O(log n). These appear to be the first polylogarithmic-time work-optimal parallel algorithms for any standard lossless compression *** algorithms for the individual stages of compression and decompression may also be of independent interest: 1. a novel O(log n)-time, O(n)-work PRAM algorithm for Huffman decoding; 2. original insights into the stages of the BW compression and decompression problems, bringing out parallelism that was not readily apparent. We then mapped such parallelism in interesting ways to elementary parallel routines that have O(log n)-time, O(n)-work solutions, such as: (i) prefix-sums problems with an appropriately-defined associative binary operator for several stages, and (ii) list ranking for the final stage of decompression (inverse blocksorting transform).Companion work reports empirical speedups of up to 25x for compression and up to 13x for decompression. This reflects a speedup of 70x over recent work on BW compression on GPUs.

关键词： burrows-wheeler lossless compression parallel pram

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Speedups for parallel graph triconnectivity 12

Brief announcement: Speedups for parallel graph triconnectiv...

引用

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

作者： Edwards, James A. Vishkin, Uzi University of Maryland College Park MD United States

ISBN: (纸本)9781450312134

We present a parallel solution to the problem of determining the triconnected components of an undirected graph. We obtain significant speedups over the only published optimal (linear-time) serial implementation of a triconnected components algorithm running on a modern CPU. This is accomplished on the PRAM-inspired XMT many-core architecture. To our knowledge, no other parallel implementation of a triconnected components algorithm has been published for any platform. Copyright is held by the author/owner(s).

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A parallel buffer tree 12

A parallel buffer tree

引用

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

作者： Sitchinava, Nodari Zeh, Norbert Institite for Theoretical Informatics Karlsruhe Institute of Technology Germany Faculty of Computer Science Dalhousie University Canada

ISBN: (纸本)9781450312134

We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of available processor cores compared to its sequential counterpart, thereby taking full advantage of multicore parallelism. The parallel buffer tree is a search tree data structure that supports the batched parallel processing of a sequence of N insertions, deletions, membership queries, and range queries in the optimal O(sortP (N) + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and sortP (N) is the parallel I/O complexity of sorting N elements using P processors. Copyright 2012 acm.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

parallel and I/O efficient set covering algorithms 12

Parallel and I/O efficient set covering algorithms

引用

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

作者： Blelloch, Guy E. Simhadri, Harsha Vardhan Tangwongsan, Kanat Carnegie Mellon University United States

ISBN: (纸本)9781450312134

This paper presents the design, analysis, and implementation of parallel and sequential I/O-efficient algorithms for set cover, tying together the line of work on parallel set cover and the line of work on efficient set cover algorithms for large, disk-resident instances. Our contributions are twofold: First, we design and analyze a parallel cache-oblivious set-cover algorithm that offers essentially the same approximation guarantees as the standard greedy algorithm, which has the optimal approximation. Our algorithm is the first efficient external-memory or cache-oblivious algorithm for when neither the sets nor the elements fit in memory, leading to I/O cost (cache complexity) equivalent to sorting in the Cache Oblivious or parallel Cache Oblivious models. The algorithm also implies low cache misses on parallel hierarchical memories (again, equivalent to sorting). Second, building on this theory, we engineer variants of the theoretical algorithm optimized for different hardware setups. We provide experimental evaluation showing substantial speedups over existing algorithms without compromising the solution's quality. Copyright 2012 acm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design 12

Parallel probabilistic tree embeddings, k-median, and buy-at...

引用

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

作者： Blelloch, Guy E. Gupta, Anupam Tangwongsan, Kanat Carnegie Mellon University United States

ISBN: (纸本)9781450312134

This paper presents parallel algorithms for embedding an arbitrary n-point metric space into a distribution of dominating trees with O(log n) expected stretch. Such embedding has proved useful in the design of many approximation algorithms in the sequential setting. We give a parallel algorithm that runs in O(n2 log n) work and O(log2 n) depth - these bounds are independent of Δ = maxx,y d(x,y)/minx≠y d(x;y), the ratio of the largest to smallest distance. Moreover, when Δ is exponentially bounded (Δ ≤/2O(n)), our algorithm can be improved to O(n2) work and O(log2 n) depth. Using these results, we give an RNC O(log κ)-approximation algorithm for κ-median and an RNC O(log n)-approximation for buy-at-bulk network design. The κ-median algorithm is the first RNC algorithm with non-trivial guarantees for arbitrary values of κ, and the buy-at-bulk result is the first parallel algorithm for the problem. Copyright 2012 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A (3/2 + Ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks 12

A (3/2 + Ε) approximation algorithm for scheduling moldable...

引用

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

作者： Jansen, Klaus Institut für Informatik Universität zu Kiel Olshausenstr. 40 D - 24098 Kiel Germany

ISBN: (纸本)9781450312134

In this paper we study a scheduling problem with moldable and non-moldable parallel tasks on m processors. A non-moldable parallel task is one that runs in parallel on a specific given number of processors. The goal is to find a non-preemptive schedule on the m processors which minimizes the makespan, or the latest task completion time. The previous best result is the list scheduling algorithm with an absolute approximation ratio of 2. On the other hand, there does not exist an approximation algorithm for scheduling non-moldable parallel tasks with ratio smaller than 1.5, unless P = NP. In this paper we show that a schedule with length (1.5+Ε)OPT can be computed for the scheduling problem in time O(n log n) + f(1/Ε). Furthermore we present an (1.5+Ε) approximation algorithm for scheduling moldable parallel tasks. Copyright 2012 acm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds 12

Brief announcement: Strong scaling of matrix multiplication ...

引用

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

作者： Ballard, Grey Demmel, James Holtz, Olga Lipshitz, Benjamin Schwartz, Oded UC Berkeley United States TU Berlin Germany

ISBN: (纸本)9781450312134

A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only recently been found. One is based on classical matrix multiplication (Solomonik and Demmel, 2011), and one is based on Strassen's fast matrix multiplication (Ballard, Demmel, Holtz, Lipshitz, and Schwartz, 2012). Both algorithms scale perfectly, but only up to some number of processors where the inter-processor communication no longer scales. We obtain a memory-independent communication cost lower bound on classical and Strassen-based distributed-memory matrix multiplication algorithms. These bounds imply that no classical or Strassen-based parallel matrix multiplication algorithm can strongly scale perfectly beyond the ranges already attained by the two parallel algorithms mentioned above. The memory-independent bounds and the strong scaling bounds generalize to other algorithms. Copyright is held by the author/owner(s).

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A lock-free B+tree 12

A lock-free B+tree

引用

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

作者： Braginsky, Anastasia Petrank, Erez Dept. of Computer Science Technion Israel Institute of Technology Haifa 32000 Israel

ISBN: (纸本)9781450312134

Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B+tree. The B +tree data structure has an important practical applications, and is used in various storage-system products. As far as we know this is the first design of a lock-free, dynamic, and balanced tree, that employs standard compare-and-swap operations. Copyright 2012 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

SPAA'12 - Proceedings of the 24th acm symposium on parallelism in algorithms and architectures

SPAA'12 - Proceedings of the 24th ACM Symposium on Paralleli...

引用

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

ISBN: (纸本)9781450312134

The proceedings contain 40 papers. The topics discussed include: time vs. space trade-offs for rendezvous in trees;allowing each node to communicate only once in a distributed system: shared whiteboard models;optimal and competitive runtime bounds for continuous, local gathering of mobile robots;online multi-robot exploration of grid graphs with rectangular obstacles;in search of parallel dimensions;delegation and nesting in best-effort hardware transactional memory;design, verification and applications of a new read-write lock algorithm;a lock-free B+tree;brief announcement: the problem based benchmark suite;brief announcement: subgraph isomorphism on a multithreaded shared memory architecture;efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model;a scalable framework for heterogeneous GPU-based clusters;and faster and simpler width-independent parallel algorithms for positive semidefinite programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共54页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：