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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

108 篇 会议
13 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 83 篇 计算机科学与技术...
- 53 篇 软件工程
- 8 篇 电子科学与技术（可...
- 6 篇 信息与通信工程
- 4 篇 力学（可授工学、理...
- 4 篇 电气工程
- 4 篇 农业工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 石油与天然气工程
- 1 篇 核科学与技术
51 篇 理学
- 51 篇 数学
- 8 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 系统科学
11 篇 管理学
- 7 篇 管理科学与工程(可...
- 6 篇 工商管理
- 4 篇 图书情报与档案管...
4 篇 农学
- 4 篇 作物学
1 篇 经济学
- 1 篇 应用经济学

主题

20 篇 parallel archite...
17 篇 parallel algorit...
15 篇 programming
15 篇 parallel process...
8 篇 computer archite...
8 篇 parallel program...
7 篇 parallel process...
5 篇 approximation al...
5 篇 hardware
4 篇 computational mo...
4 篇 graphics process...
3 篇 performance
3 篇 routing
3 篇 computer systems...
3 篇 memory managemen...
3 篇 algorithm design...
3 篇 parallel computi...
3 篇 field programmab...
3 篇 scheduling
3 篇 data models

机构

4 篇 carnegie mellon ...
2 篇 harvard univ div...
2 篇 bar ilan univ de...
2 篇 paderborn univ p...
2 篇 school of comput...
2 篇 mit comp sci & a...
2 篇 school of comput...
2 篇 suny stony brook...
1 篇 instutut d'elect...
1 篇 univ wroclaw ins...
1 篇 faculty of compu...
1 篇 inesc-id isel ip...
1 篇 dipartimento di ...
1 篇 ens rennes renne...
1 篇 ecole cent paris
1 篇 soochow univ sch...
1 篇 department of co...
1 篇 state key lab of...
1 篇 cinvestav tamaul...
1 篇 dept. of electro...

作者

4 篇 blelloch guy e.
4 篇 tangwongsan kana...
2 篇 ballard grey
2 篇 holtz olga
2 篇 varman peter j.
2 篇 jianxi fan
2 篇 anon
2 篇 jigang wu
2 篇 hasenplaugh will...
2 篇 bender ma
2 篇 schardl tao b.
2 篇 schwartz oded
2 篇 simhadri harsha ...
2 篇 kaler tim
2 篇 lipshitz benjami...
2 篇 klein st
2 篇 leiserson charle...
2 篇 rabin mo
2 篇 vishkin uzi
2 篇 demmel james

语言

120 篇 英文
2 篇 其他

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

共 122 条记录，以下是51-60 订阅

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

详细简洁

排序：

Productive parallel linear algebra programming with unstructured topology adaption 12

Productive parallel linear algebra programming with unstruct...

引用

12th IEEE/acm International symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

作者： Gottschling, Peter Hoefler, Torsten Technische Universität Dresden and SimuNova Helmholtzstr. 10 01069 Dresden Germany National Center for Supercomputing Applications University of Illinois at Urbana-Champaign 1205 W. Clark Street Urbana IL United States

ISBN: (纸本)9780769546919

Sparse linear algebra is a key component of many scientific computations such as computational fluid dynamics, mechanical engineering or the design of new materials to mention only a few. the discretization of complex geometries in unstructured meshes leads to sparse matrices with irregular patterns. their distribution in turn results in irregular communication patterns within parallel operations. In this paper, we show how sparse linear algebra can be implemented effortless on distributed memory architectures. We demonstrate how simple it is to incorporate advanced partitioning, network topology mapping, and data migration techniques into parallel HPC programs by establishing novel abstractions. For this purpose, we developed a linear algebra library - parallel Matrix Template Library 4 - based on generic and meta-programming introducing a new paradigm: meta-tuning. the library establishes its own domain-specific language embedded in C++. the simplicity of software development is not paid by lower performance. Moreover, the incorporation of topology mapping demonstrated performance improvements up to 29%. © 2012 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A highly parallel multi-class pattern classification on GPU 12

A highly parallel multi-class pattern classification on GPU

引用

12th IEEE/acm International symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

作者： Nabiyouni, Mahdi Aghamirzaie, Delasa Department of Computer Engineering Amirkabir University of Technology Tehran Iran

ISBN: (纸本)9780769546919

Multi-class pattern classification has a variety of applications and could be achieved using artificial neural networks (ANN). there are two major system architectures for using ANNs in multi-class pattern classification: using a single ANN and using multiple ANNs. Independent of what architecture is used, one of the main concerns of using ANNs is that with increasing number of pattern classes and training datasets, the training time will increase dramatically which renders the ANN unfeasible. In this paper, the vast computational power of Graphics Processing Units (GPUs) is utilized to mitigate this problem. Different architectures and different methods of feeding pattern classes are implemented in a GPU platform. Different methods have been proposed to achieve maximum parallelism and subsequently maximize throughput. Our implementation exceeds the state-of-the-art in literature in terms of speed and the accurate use of GPU resources. As a result, the proposed approach's run time is about 75% shorter than the previous approaches. In multi-ANN architecture, due to the inherent parallelism in the proposed implementation, the execution time of a system for a digit recognition application is reduced from seven hours in CPU to about 4 seconds in GPU. © 2012 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel implementation for three-dimensional incompressible pipe flow based on SIMPLE 12

An efficient parallel implementation for three-dimensional i...

引用

12th IEEE/acm International symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

作者： Zhang, Ji-Lin Zhu, Li-Ting Wan, Jian Mao, Jie Xu, Xiang-Hua Jiang, Cong-Feng Di, Peng Department of Computer Science and Technology Hangzhou Dianzi University Hangzhou China School of Mechanical Engineering Hangzhou Dianzi University Hangzhou China School of Computer Science and Engineering University of New South Wales Sydney NSW Australia

ISBN: (纸本)9780769546919

SIMPLE (Semi-Implicit Method for Pressure-Linked Equations) algorithm is important in the simulation of steady flows. As the traditional 3-D SIMPLE algorithm is time-consuming, we propose a parallel SIMPLE algorithm based on a novel tiling strategy - alternate tiling, through replacing the original linear system and reordering the iteration space tiles. the novelty of our parallel algorithm lies in the introduction of the sequence of iteration space tiles as the sequence of execution, the time skewing technique to partition the iteration space, update operations of the grids from two directions alternately, and the improvement of the data locality. the effectiveness of the parallel algorithm and serial model of finite difference stencil algorithm are validated. Numerical experiments on distributed clusters show that the cache misses and the cost of communication and synchronization are reduced by reordering the tiles of iteration space, and the parallel SIMPLE algorithm based on alternate tiling has a good data locality and parallel efficiency in the three-dimensional incompressible pipe flow project. © 2012 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication-optimal parallel algorithm for strassen's matrix multiplication 12

Communication-optimal parallel algorithm for strassen's matr...

引用

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

作者： Ballard, Grey Demmel, James Holtz, Olga Lipshitz, Benjamin Schwartz, Oded EECS Department UC Berkeley Berkeley CA 94720 United States Mathematics Department CS Division UC Berkeley Berkeley CA 94720 United States Mathematics Department UC Berkeley TU Berlin Berkeley CA 94720 United States

ISBN: (纸本)9781450312134

parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on Strassen's fast matrix multiplication and minimizes communication. the algorithm outperforms all known parallel matrix multiplication algorithms, classical and Strassen-based, both asymptotically and in practice. A critical bottleneck in parallelizing Strassen's algorithm is the communication between the processors. Ballard, Demmel, Holtz, and Schwartz (SPAA '11) prove lower bounds on these communication costs, using expansion properties of the underlying computation graph. Our algorithm matches these lower bounds, and so is communication-optimal. It exhibits perfect strong scaling within the maximum possible range. Benchmarking our implementation on a Cray XT4, we obtain speedups over classical and Strassen-based algorithms ranging from 24% to 184% for a fixed matrix dimension n = 94080, where the number of processors ranges from 49 to 7203. Our parallelization approach generalizes to other fast matrix multiplication algorithms. Copyright 2012 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Greedy sequential maximal independent set and matching are parallel on average 12

Greedy sequential maximal independent set and matching are p...

引用

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

作者： Blelloch, Guy E. Fineman, Jeremy T. Shun, Julian Carnegie Mellon University United States Georgetown University United States

ISBN: (纸本)9781450312134

the greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in an arbitrary order adding a vertex to the resulting set if and only if no previous neighboring vertex has been added. In this loop, as in many sequential loops, each iterate will only depend on a subset of the previous iterates (i.e. knowing that any one of a vertex's previous neighbors is in the MIS, or knowing that it has no previous neighbors, is sufficient to decide its fate one way or the other). this leads to a dependence structure among the iterates. If this structure is shallow then running the iterates in parallel while respecting the dependencies can lead to an efficient parallel implementation mimicking the sequential algorithm. In this paper, we show that for any graph, and for a random ordering of the vertices, the dependence length of the sequential greedy MIS algorithm is polylogarithmic (O(log2 n) with high probability). Our results extend previous results that show polylogarithmic bounds only for random graphs. We show similar results for greedy maximal matching (MM). For both problems we describe simple linear-work parallel algorithms based on the approach. the algorithms allow for a smooth tradeoff between more parallelism and reduced work, but always return the same result as the sequential greedy algorithms. We present experimental results that demonstrate efficiency and the tradeoff between work and parallelism. Copyright 2012 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：