咨询与建议

限定检索结果

文献类型

  • 329 篇 会议
  • 46 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 325 篇 工学
    • 275 篇 软件工程
    • 267 篇 计算机科学与技术...
    • 12 篇 电子科学与技术(可...
    • 7 篇 信息与通信工程
    • 4 篇 机械工程
    • 4 篇 控制科学与工程
    • 4 篇 生物工程
    • 3 篇 生物医学工程(可授...
    • 1 篇 力学(可授工学、理...
    • 1 篇 动力工程及工程热...
    • 1 篇 电气工程
    • 1 篇 核科学与技术
    • 1 篇 农业工程
    • 1 篇 环境科学与工程(可...
  • 56 篇 理学
    • 52 篇 数学
    • 5 篇 系统科学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 2 篇 化学
  • 15 篇 管理学
    • 11 篇 管理科学与工程(可...
    • 8 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 71 篇 performance
  • 49 篇 parallel process...
  • 42 篇 algorithms
  • 41 篇 parallel program...
  • 39 篇 languages
  • 34 篇 design
  • 21 篇 gpu
  • 20 篇 parallel algorit...
  • 12 篇 experimentation
  • 12 篇 measurement
  • 9 篇 theory
  • 8 篇 mpi
  • 8 篇 parallel computi...
  • 7 篇 graphics process...
  • 7 篇 parallel
  • 7 篇 verification
  • 7 篇 concurrency
  • 6 篇 parallelism
  • 6 篇 openmp
  • 5 篇 reliability

机构

  • 7 篇 carnegie mellon ...
  • 4 篇 univ wisconsin d...
  • 4 篇 indiana univ blo...
  • 3 篇 univ of tokyo
  • 3 篇 univ chinese aca...
  • 3 篇 massachusetts in...
  • 3 篇 univ illinois ur...
  • 3 篇 swiss fed inst t...
  • 3 篇 mit csail united...
  • 3 篇 shanghai jiao to...
  • 3 篇 tsinghua univ pe...
  • 3 篇 univ utah sch co...
  • 3 篇 rice univ housto...
  • 3 篇 univ calif berke...
  • 2 篇 ist austria klos...
  • 2 篇 princeton univ d...
  • 2 篇 georgetown univ ...
  • 2 篇 shanghai key lab...
  • 2 篇 univ of wisconsi...
  • 2 篇 tsinghua univers...

作者

  • 8 篇 blelloch guy e.
  • 6 篇 hoefler torsten
  • 6 篇 garland michael
  • 6 篇 chen haibo
  • 6 篇 shun julian
  • 5 篇 sun yihan
  • 5 篇 zhai jidong
  • 5 篇 tsigas philippas
  • 4 篇 dhulipala laxman
  • 4 篇 tan guangming
  • 4 篇 wang haojie
  • 4 篇 nikolopoulos dim...
  • 4 篇 long guoping
  • 4 篇 valero mateo
  • 4 篇 mellor-crummey j...
  • 4 篇 gu yan
  • 4 篇 kennedy ken
  • 3 篇 taura kenjiro
  • 3 篇 li jiajia
  • 3 篇 yonezawa akinori

语言

  • 349 篇 英文
  • 26 篇 其他
检索条件"任意字段=18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"
375 条 记 录,以下是161-170 订阅
排序:
Identifying Scalability Bottlenecks for Large-Scale parallel Programs with Graph Analysis  20
Identifying Scalability Bottlenecks for Large-Scale Parallel...
收藏 引用
25th acm sigplan symposium on principles and practice of parallel programming (PPoPP)
作者: Jin, Yuyang Wang, Haojie Tang, Xiongchao Hoefler, Torsten Liu, Xu Zhai, Jidong Tsinghua Univ Beijing Peoples R China Swiss Fed Inst Technol Zurich Switzerland Coll William & Mary Williamsburg VA 23187 USA
Scaling a parallel program to modern supercomputers is challenging due to inter-process communication, code serialization, and resource contention. Performance analysis tools for finding such scaling bottlenecks eithe... 详细信息
来源: 评论
CPMA: An Efficient Batch-parallel Compressed Set Without Pointers  24
CPMA: An Efficient Batch-Parallel Compressed Set Without Poi...
收藏 引用
29th acm sigplan Annual symposium on principles and practice of parallel programming (PPoPP)
作者: Wheatman, Brian Burns, Randal Buluc, Aydin Xu, Helen Johns Hopkins Univ Baltimore MD 21218 USA Lawrence Berkeley Natl Lab Lawrence KS USA Georgia Inst Technol Atlanta GA USA
this paper introduces the batch-parallel Compressed Packed Memory Array (CPMA), a compressed, dynamic, ordered set data structure based on the Packed Memory Array (PMA). Traditionally, batch-parallel sets are built on... 详细信息
来源: 评论
Scalable GPU Graph Traversal  12
Scalable GPU Graph Traversal
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Merrill, Duane Garland, Michael Grimshaw, Andrew Univ Virginia Charlottesville VA 22903 USA NVIDIA Corp Santa Clara CA USA
Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms. It is also representative of a class of parallel computations whose memory accesses and w... 详细信息
来源: 评论
parallel execution of multi-set constraint rewrite rules  08
Parallel execution of multi-set constraint rewrite rules
收藏 引用
PPDP 2008: 10th International acm sigplan symposium on principles and practice of Declarative programming
作者: Sulzmann, Martin Lam, Edmund S. L. Programming Logics and Semantics Group IT University of Copenhagen Rued Langgaards Vej 7 2300 Copenhagen S Denmark School of Computing National University of Singapore S16 Level 5 3 Science Drive 2 Singapore 117543 Singapore
Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be appli... 详细信息
来源: 评论
Extending a C-like Language for Portable SIMD programming  12
Extending a C-like Language for Portable SIMD Programming
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Leissa, Roland Hack, Sebastian Wald, Ingo Univ Saarland Compiler Design Lab Saarbrucken Germany Intel Corp Visual Applicat Res Santa Clara CA 95051 USA
SIMD instructions are common in CPUs for years now. Using these instructions effectively requires not only vectorization of code, but also modifications to the data layout. However, automatic vectorization techniques ... 详细信息
来源: 评论
High performance synchronization algorithms for multiprogrammed multiprocessors
High performance synchronization algorithms for multiprogram...
收藏 引用
Proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming
作者: Wisniewski, Robert W. Kontothanassis, Leonidas I. Scott, Michael L. Univ of Rochester Rochester United States
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barr... 详细信息
来源: 评论
Leapfrogging: A portable technique for implementing efficient futures  93
Leapfrogging: A portable technique for implementing efficien...
收藏 引用
4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993
作者: Wagner, David B. Calder, Bradley G. Department of Computer Science University of Colorado Campus Box 430 Boulder80309-0430 United States
A future is a language construct that allows programmers to expose parallelism in applicative languages such as MultiLisp [5] with minimal effort. In this paper we describe a technique for implementing futures, which ... 详细信息
来源: 评论
An Adaptive Performance Modeling Tool for GPU Architectures
An Adaptive Performance Modeling Tool for GPU Architectures
收藏 引用
15th acm sigplan symposium on principles and practice of parallel programming
作者: Baghsorkhi, Sara S. Delahaye, Matthieu Patel, Sanjay J. Gropp, William D. Hwu, Wen-mei W. Univ Illinois Urbana IL 61801 USA
this paper presents an analytical model to predict the performance of general-purpose applications on a GPU architecture. the model is designed to provide performance information to an auto-tuning compiler and assist ... 详细信息
来源: 评论
Improving parallelism and Locality with Asynchronous Algorithms
Improving Parallelism and Locality with Asynchronous Algorit...
收藏 引用
15th acm sigplan symposium on principles and practice of parallel programming
作者: Liu, Lixia Li, Zhiyuan Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA
As multicore chips become the main building blocks for high performance computers, many numerical applications face a performance impediment due to the limited hardware capacity to move data between the CPU and the of... 详细信息
来源: 评论
OPTIMAL MAPPING OF SEQUENCES OF DATA-parallel TASKS  95
OPTIMAL MAPPING OF SEQUENCES OF DATA-PARALLEL TASKS
收藏 引用
5th acm sigplan symposium on principles and practice of parallel programming
作者: SUBHLOK, J VONDRAN, G HEWLETT PACKARD CORP ADV LASER JET OPERAT BOISE ID 83714 USA
Many applications in a variety of domains including digital signal processing, image processing, and computer vision are composed of a sequence of tasks that act on a stream of input data sets in a pipelined manner. R... 详细信息
来源: 评论