咨询与建议

限定检索结果

文献类型

  • 12 篇 会议
  • 7 篇 期刊文献

馆藏范围

  • 19 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 18 篇 工学
    • 16 篇 计算机科学与技术...
    • 9 篇 软件工程
    • 2 篇 电气工程

主题

  • 19 篇 irregular algori...
  • 5 篇 amorphous data-p...
  • 3 篇 optimistic paral...
  • 2 篇 thread concurren...
  • 2 篇 asynchronous pro...
  • 2 篇 task pools
  • 2 篇 processor alloca...
  • 2 篇 multicore proces...
  • 2 篇 multi-gpu
  • 2 篇 turan's theorem
  • 2 篇 context switchin...
  • 2 篇 gpu
  • 1 篇 parallel algorit...
  • 1 篇 graph partitioni...
  • 1 篇 parallel branch ...
  • 1 篇 single-source sh...
  • 1 篇 performance
  • 1 篇 runtime
  • 1 篇 profiling
  • 1 篇 smp clusters

机构

  • 3 篇 univ texas austi...
  • 2 篇 texas tech univ ...
  • 2 篇 univ texas austi...
  • 1 篇 université lille...
  • 1 篇 tact comp labs b...
  • 1 篇 univ texas austi...
  • 1 篇 texas state univ...
  • 1 篇 georgia inst tec...
  • 1 篇 indiana univ ope...
  • 1 篇 tech univ chemni...
  • 1 篇 concordia univ d...
  • 1 篇 georgia inst tec...
  • 1 篇 univ padua dept ...
  • 1 篇 texas state univ...
  • 1 篇 virginia tech co...
  • 1 篇 hangzhou dianzi ...
  • 1 篇 purdue univ sch ...
  • 1 篇 swiss fed inst t...
  • 1 篇 univ texas austi...
  • 1 篇 univ rochester d...

作者

  • 8 篇 pingali keshav
  • 2 篇 sutton michael
  • 2 篇 ben-nun tal
  • 2 篇 leidel john d.
  • 2 篇 pai sreepathi
  • 2 篇 wang xi
  • 2 篇 versaci francesc...
  • 2 篇 chen yong
  • 2 篇 burtscher martin
  • 1 篇 ma yuchen
  • 1 篇 yan chenggang
  • 1 篇 cledat romain
  • 1 篇 goswami dhrubajy...
  • 1 篇 nasre rupesh
  • 1 篇 hoefler torsten
  • 1 篇 li jiajia
  • 1 篇 hassaan m. amber
  • 1 篇 williams brody
  • 1 篇 hofmann m.
  • 1 篇 ruenger gudula

语言

  • 19 篇 英文
检索条件"主题词=Irregular Algorithms"
19 条 记 录,以下是11-20 订阅
排序:
Operator-level GPU-Accelerated Branch and Bound algorithms
收藏 引用
Procedia Computer Science 2013年 18卷 280-289页
作者: I. Chakroun N. Melab Université Lille 1 LIFL/UMR CNRS 8022 - INRIA Lille Nord Europe 59655 - Villeneuve d’Ascq cedex - France
Branch-and-Bound (B&B) algorithms are well-known tree-based exploratory methods for solving to optimality NP-hard discrete optimization problems. The construction of the B&B tree and its exploration are perfor... 详细信息
来源: 评论
Processor Allocation for Optimistic Parallelization of irregular Programs  1
收藏 引用
12th International Conference on Computational Science and Its Applications (ICCSA)
作者: Versaci, Francesco Pingali, Keshav Univ Padua TU Wien I-35100AOGJ Padua Italy Univ Texas Austin Austin TX USA
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent a... 详细信息
来源: 评论
Brief Announcement: Processor Allocation for Optimistic Parallelization of irregular Programs  11
Brief Announcement: Processor Allocation for Optimistic Para...
收藏 引用
23rd Annual Symposium on Parallelism in algorithms and Architectures
作者: Versaci, Francesco Pingali, Keshav Univ Padua Dept Informat Engn I-35100 Padua Italy
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent a... 详细信息
来源: 评论
Leveraging Data-Structure Semantics for Efficient Algorithmic Parallelism  11
Leveraging Data-Structure Semantics for Efficient Algorithmi...
收藏 引用
8th ACM International Conference on Computing Frontiers (CF)
作者: Cledat, Romain Ravichandran, Kaushik Pande, Santosh Georgia Inst Technol Coll Comp Sch Comp Sci Atlanta GA 30332 USA
irregular or pointer-based structures such as graphs and trees are commonly used in algorithms dealing with sparse data. Given their reliance on pointers, these algorithms are difficult to analyze and the structure of... 详细信息
来源: 评论
Towards a Science of Parallel Programming  10
Towards a Science of Parallel Programming
收藏 引用
19th International Conference on Parallel Architectures and Compilation Techniques
作者: Pingali, Keshav Univ Texas Austin Dept Comp Sci Austin TX 78712 USA
How do we give parallel programming a more scientific foundation? In this talk, I will discuss the approach we are taking in the Galois project.
来源: 评论
Scalable Communication Protocols for Dynamic Sparse Data Exchange
Scalable Communication Protocols for Dynamic Sparse Data Exc...
收藏 引用
15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
作者: Hoefler, Torsten Siebert, Christian Lumsdaine, Andrew Indiana Univ Open Syst Lab Bloomington IN 47405 USA
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such programs may involve all (or large num... 详细信息
来源: 评论
Task Pool Teams:: a hybrid programming environment for irregular algorithms on SMP clusters
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2006年 第12期18卷 1575-1594页
作者: Hippold, Judith Ruenger, Gudula Tech Univ Chemnitz Dept Comp Sci D-09107 Chemnitz Germany
Clusters of symmetric multiprocessors (SMPs) are popular platforms for parallel programming since they provide large computational power for a reasonable price. For irregular application programs with dynamically chan... 详细信息
来源: 评论
Towards an adaptive task pool implementation
Towards an adaptive task pool implementation
收藏 引用
22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008)
作者: Hofmann, M. Ruenger, G. Tech Univ Chemnitz Dept Comp Sci Chemnitz Germany
Task pools can be used to achieve the dynamic load balancing that is required for an efficient parallel implementation of irregular applications. However, the performance strongly depends on a task pool implementation... 详细信息
来源: 评论
A comparison of task pools for dynamic load balancing of irregular algorithms
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2004年 第1期16卷 1-47页
作者: Korch, M Rauber, T Univ Bayreuth Lehrstuhl Angew Informat 2 Fac Math Phys & Comp Sci D-95440 Bayreuth Germany
Since a static work distribution does not allow for satisfactory speed-ups of parallel irregular algorithms, there is a need for a dynamic distribution of work and data that can be adapted to the runtime behavior of t... 详细信息
来源: 评论