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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Software transactional memory for GPU architectures

Software transactional memory for GPU architectures

引用

12th acm/IEEE International symposium on Code Generation and Optimization, CGO 2014

作者： Xu, Yunlong Wang, Rui Goswami, Nilanjan Li, Tao Gao, Lan Qian, Depei School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China School of Computer Science and Engineering Beihang University Beijing China ECE Department University of Florida Gainesville United States

ISBN: (纸本)9781450326704

Modern GPUs have shown promising results in accel- erating computation intensive and numerical workloads with limited dynamic data sharing. However, many real-world applications manifest ample amount of data sharing among concurrently executing threads. Often data sharing requires mutual exclusion mechanism to ensure data integrity in multithreaded environment. Although modern GPUs provide atomic primitives that can be leveraged to construct fine-grained locks, lock-based synchronization requires significant programming efforts to achieve func- Tional correctness. the massive multithreading and SIMT execution paradigm of GPUs further extend the challenges of GPU locks. To make applications with dynamic data sharing benefit from GPU acceleration, we propose a novel software transac- Tional memory system for GPU architectures (GPU-STM). the major challenges include ensuring good scalability with respect to the massive multithreading of GPUs, and preventing livelocks caused by the SIMT execution paradigm of GPUs. To this end, we propose (1) a hierarchical valida- Tion technique and (2) an encounter-time lock-sorting mech- Anism to deal with the two challenges, respectively. We build our GPU-STM prototype based on the commercially avail- Able GPU platform and runtime. Our real system based evaluation shows that GPU-STM outperforms coarse-grain locks on GPUs by up to 20x. Copyright © 2014 by the Association for Computing Machinery, Inc. (acm).

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling

Executing Dynamic Data-Graph Computations Deterministically ...

引用

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

作者： Kaler, Tim Hasenplaugh, William Schardl, Tao B. Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab 32 Vassar St Cambridge MA 02139 USA

ISBN: (纸本)9781450328210

A data-graph computation - popularized by such programming systems as Galois, Pregel, GraphLab, PowerGraph, and GraphChi - is an algorithm that performs local updates on the vertices of a graph. During each round of a data-graph computation, an update function atomically modifies the data associated with a vertex as a function of the vertex's prior data and that of adjacent vertices. A dynamic data-graph computation updates only an active subset of the vertices during a round, and those updates determine the set of active vertices for the next round. this paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations. PRISM uses a vertex-coloring of the graph to coordinate updates performed in a round, precluding the need for mutual-exclusion locks or other nondeterministic data synchronization. A multibag data structure is used by PRISM to maintain a dynamic set of active vertices as an unordered set partitioned by color. We analyze PRISM using work-span analysis. Let G = (V,E) be a degree-Delta graph colored with colors, and suppose that Q subset of V is the set of active vertices in a round. Define size(Q) = vertical bar Q vertical bar+ Sigma (v is an element of q) deg (v) which is proportional to the space required to store the vertices of Q using a sparsegraph layout. We show that a P-processor execution of PRISM performs updates in Q using O(chi(lg(Q/chi) + lg Delta D) + lgP) span and theta(size(Q)+ chi + P) work. these theoretical guarantees are matched by good empirical performance. We modified GraphLab to incorporate PRISM and studied seven application benchmarks on a 12-core multicore machine. PRISM executes the benchmarks 1:2-2:1 times faster than GraphLab's nondeterministic lock-based scheduler while providing deterministic behavior. this paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operat

关键词： Data-graph computations multicore multithreading parallel programming chromatic scheduling determinism scheduling work stealing

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2014 IEEE International symposium on parallel and Distributed Processing with Applications, ISPA 2014

Proceedings - 2014 IEEE International Symposium on Parallel ...

引用

12th IEEE International symposium on parallel and Distributed Processing with Applications, ISPA 2014

ISBN: (纸本)9781479942930

the proceedings contain 33 papers. the topics discussed include: analyzing the energy efficiency of the memory subsystem in multicore processors;a proactive customer-aware resource allocation approach for data centers;parallel subgraph counting for multicore architectures;petapar: a scalable petascale framework for meshfree/particle simulation;a high performance compression method for climate data;a utility-maximizing tasks assignment method for rendering cluster system;efficient routing algorithms combining history and social predictors in mobile social networks;a high-throughput and low-latency parallelization of window-based stream joins on multicores;OpenCL application auto-tuning and run-time resource management for multi-core platforms;FPGA-based design using the FASTER toolchain: the case of STM spear development board;and EURETILE design flow: dynamic and fault tolerant mapping of multiple applications onto many-tile systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Faster 3-periodic merging networks 14

Faster 3-periodic merging networks

引用

Proceedings of the 26th acm symposium on parallelism in algorithms and architectures

作者： Marek Piotrów University of Wrocŏaw Wrocŏaw Poland

ISBN: (纸本)9781450328210

We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. the challenging task is to construct such networks of small depth (called a period in this context). the first constructions of merging networks with a constant period were described by Kuty{l}owski et al. they gave 3-periodic network that merges two sorted sequences of N numbers in time 12log N and a similar network of period 4 that works in 5.67log N. We present a new family of 3-periodic merging networks with merging time upper-bounded by 6log N. the construction can be easily generalized to larger constant periods with decreasing running time, for example, to 4-periodic ones that work in time upper-bounded by 4log N.

关键词： oblivious merging merging network comparator parallel merging

来源：评论

学校读者我要写书评

暂无评论

Chimera grids for water simulation 13

Chimera grids for water simulation

引用

12th acm SIGGRAPH / Eurographics symposium on Computer Animation, SCA 2013

作者： Elliot English, R. Qiu, Linhai Yu, Yue Fedkiw, Ronald Stanford University United States Industrial Light + Magic United States

ISBN: (纸本)9781450321327

We introduce a new method for large scale water simulation using Chimera grid embedding, which discretizes space with overlapping Cartesian grids that translate and rotate in order to decompose the domain into different regions of interest with varying spatial resolutions. Grids can track both fluid features and solid objects, allowing for dynamic spatial adaptivity without remeshing or repartitioning the domain. We solve the inviscid incompressible Navier- Stokes equations with an arbitrary-Lagrangian-Eulerian style semi- Lagrangian advection scheme and a monolithic SPD Poisson solver. We modify the particle level set method in order to adapt it to Chimera grids including particle treatment across grid boundaries with disparate cell sizes, and strategies to deal with locality in the implementation of the level set and fast marching algorithms. We use a local Voronoi mesh construction to solve for pressure and address a number of issues that arise with the treatment of the velocity near the interface. the resulting method is highly scalable on distributed parallel architectures with minimal communication costs.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Schwarz Method with Two-sided Transmission Conditions for the Gravity Equations on Graphics Processing Unit

Schwarz Method with Two-sided Transmission Conditions for th...

引用

12th International symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Ahamed, Abal-Kassim Cheik Magoules, Frederic Ecole Cent Paris Paris France

ISBN: (纸本)9780769550602

In this paper, we solve the gravity equations on hybrid multi-CPU/GPU using high order finite elements. Domain decomposition methods are inherently parallel algorithms making them excellent candidates for implementation on hybrid architectures. Here, we propose a new stochastic-based optimization procedure for the optimized Schwarz domain decomposition method, which is implemented and tuned to graphics processors unit. To obtain high speed-up, several implementation optimizations should be carrefully performed, such as data transfert between CPU and GPU, matrix data storage, etc. We investigate, describe and present the optimizations we have developed for finite elements analysis, leading to better efficiency. Numerical experiments carried out on a reallistic test case, namely the Chicxulub crater, demonstrates the efficiency and robustness of the proposed method on massive hybrid multi-CPU/GPU platforms.

关键词： Domain decomposition methods Schwarz method parallel computing hybrid CPU/GPU gravity equations

来源：评论

学校读者我要写书评

暂无评论

Executing dynamic data-graph computations deterministically using chromatic scheduling 14

Executing dynamic data-graph computations deterministically ...

引用

Proceedings of the 26th acm symposium on parallelism in algorithms and architectures

作者： Tim Kaler William Hasenplaugh Tao B. Schardl Charles E. Leiserson MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781450328210

A data-graph computation — popularized by such programming systems as Galois, Pregel, GraphLab, PowerGraph, and GraphChi — is an algorithm that performs local updates on the vertices of a graph. During each round of a data-graph computation, an update function atomically modifies the data associated with a vertex as a function of the vertex's prior data and that of adjacent vertices. A dynamic data-graph computation updates only an active subset of the vertices during a round, and those updates determine the set of active vertices for the next *** paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations. PRISM uses a vertex-coloring of the graph to coordinate updates performed in a round, precluding the need for mutual-exclusion locks or other nondeterministic data synchronization. A multibag data structure is used by PRISM to maintain a dynamic set of active vertices as an unordered set partitioned by color. We analyze PRISM using work-span analysis. Let G=(V,E) be a degree-Δ graph colored with Χ colors, and suppose that Q⊆V is the set of active vertices in a round. Define size(Q)=[Q] + Σv∈Qdeg(v), which is proportional to the space required to store the vertices of Q using a sparse-graph layout. We show that a P-processor execution of PRISM performs updates in Q using O(Χ(lg (Q/Χ)+lgΔ)+ lgP) span and Θ(size(Q)+Χ+P) work. these theoretical guarantees are matched by good empirical performance. We modified GraphLab to incorporate PRISM and studied seven application benchmarks on a 12-core multicore machine. PRISM executes the benchmarks 1.2–2.1 times faster than GraphLab's nondeterministic lock-based scheduler while providing deterministic *** paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations. PRISM-R satisfies the same theoretical bounds as PRISM, but its implementation is

关键词： determinism reducers multithreading parallel programming work stealing data-graph computations chromatic scheduling multicore

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：