咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 351 篇 工学
    • 296 篇 软件工程
    • 287 篇 计算机科学与技术...
    • 13 篇 电子科学与技术(可...
    • 7 篇 信息与通信工程
    • 7 篇 控制科学与工程
    • 4 篇 机械工程
    • 4 篇 电气工程
    • 4 篇 生物工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 动力工程及工程热...
    • 1 篇 力学(可授工学、理...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
    • 1 篇 核科学与技术
    • 1 篇 农业工程
    • 1 篇 环境科学与工程(可...
  • 61 篇 理学
    • 55 篇 数学
    • 6 篇 系统科学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 3 篇 化学
    • 1 篇 物理学
  • 17 篇 管理学
    • 12 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 4 篇 教育学
    • 4 篇 教育学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 72 篇 performance
  • 49 篇 parallel process...
  • 46 篇 parallel program...
  • 43 篇 algorithms
  • 40 篇 languages
  • 34 篇 design
  • 22 篇 gpu
  • 21 篇 parallel algorit...
  • 12 篇 experimentation
  • 12 篇 measurement
  • 10 篇 parallel computi...
  • 9 篇 theory
  • 8 篇 mpi
  • 7 篇 parallelism
  • 7 篇 graphics process...
  • 7 篇 parallel
  • 7 篇 openmp
  • 7 篇 concurrency
  • 6 篇 multicore
  • 5 篇 reliability

机构

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

作者

  • 8 篇 blelloch guy e.
  • 7 篇 chen haibo
  • 6 篇 hoefler torsten
  • 6 篇 garland michael
  • 6 篇 zhai jidong
  • 6 篇 shun julian
  • 5 篇 sun yihan
  • 5 篇 tsigas philippas
  • 4 篇 dhulipala laxman
  • 4 篇 pingali keshav
  • 4 篇 chen wenguang
  • 4 篇 tan guangming
  • 4 篇 wang haojie
  • 4 篇 nikolopoulos dim...
  • 4 篇 long guoping
  • 4 篇 valero mateo
  • 4 篇 mellor-crummey j...
  • 4 篇 gu yan
  • 4 篇 leiserson charle...
  • 4 篇 kennedy ken

语言

  • 380 篇 英文
  • 26 篇 其他
  • 1 篇 葡萄牙文
检索条件"任意字段=16th ACM Symposium on Principles and Practice of Parallel Programming"
407 条 记 录,以下是161-170 订阅
排序:
Space-efficient implementation of nested parallelism
Space-efficient implementation of nested parallelism
收藏 引用
Proceedings of the 1997 6th acm SIGPLAN symposium on principles and practice of parallel programming
作者: Narlikar, Girija J. Blelloch, Guy E. CMU Sch of Computer Science Pittsburgh United States
Many of today's high level parallel languages support dynamic, fine-grained parallelism. these languages allow the user to expose all the parallelism in the program, which is typically of a much higher degree than... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Fine-grain parallel megabase sequence comparison with multiple heterogeneous GPUs  14
Fine-grain parallel megabase sequence comparison with multip...
收藏 引用
2014 19th acm SIGPLAN symposium on principles and practice of parallel programming, PPoPP 2014
作者: De Sandes, Edans F.O. Miranda, Guillermo Melo, Alba C.M.A. Martorell, Xavier Ayguadé, Eduard University of Brasilia Brazil Universitat Politècnica de Catalunya Barcelona Supercomputing Center Spain
this paper proposes and evaluates a parallel strategy to execute the exact Smith-Waterman (SW) algorithm for megabase DNA sequences in heterogeneous multi-GPU platforms. In our strategy, the computation of a single hu... 详细信息
来源: 评论
Eunomia: Scaling Concurrent Search Trees under Contention Using HTM  17
Eunomia: Scaling Concurrent Search Trees under Contention Us...
收藏 引用
22nd acm SIGPLAN symposium on principles and practice of parallel programming (PPoPP)
作者: Wang, Xin Zhang, Weihua Wang, Zhaoguo Wei, Ziyun Chen, Haibo Zhao, Wenyun Fudan Univ Software Sch Shanghai Peoples R China Fudan Univ Shanghai Key Lab Data Sci Shanghai Peoples R China Fudan Univ Sch Comp Sci Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China NYU Comp Sci Dept New York NY 10003 USA
While hardware transactional memory (HTM) has recently been adopted to construct efficient concurrent search tree structures, such designs fail to deliver scalable performance under contention. In this paper, we first... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Compilation of parallel multimedia computations - extending retiming theory and Amdahl's law  97
Compilation of parallel multimedia computations - extending ...
收藏 引用
Proceedings of the 1997 6th acm SIGPLAN symposium on principles and practice of parallel programming
作者: Prasanna, G.N.Srinivasa Lucent Technologies Murray Hill NJ United States
Multimedia applications operate on downstreams. A large class of multimedia applications is described by the macro-dataflow graph model. this study attempted to examine how such multimedia applications can be compiled... 详细信息
来源: 评论
Triolet: A programming system that unifies algorithmic skeleton interfaces for high-performance cluster computing  14
Triolet: A programming system that unifies algorithmic skele...
收藏 引用
2014 19th acm SIGPLAN symposium on principles and practice of parallel programming, PPoPP 2014
作者: Rodrigues, Christopher Jablin, thomas Dakkak, Abdul Hwu, Wen-Mei University of Illinois at Urbana-Champaign United States
Functional algorithmic skeletons promise a high-level programming interface for distributed-memory clusters that free developers from concerns of task decomposition, scheduling, and communication. Unfortunately, prior... 详细信息
来源: 评论
Evaluating the locality benefits of active messages
Evaluating the locality benefits of active messages
收藏 引用
Proceedings of the 5th acm SIGPLAN symposium on principles and practice of parallel programming
作者: Spertus, Ellen Dally, William J. Massachusetts Inst of Technology Cambridge United States
A major challenge in fine-grained computing is achieving locality without excessive scheduling overhead. We built two J-Machine implementations of a fine-grained programming model, the Berkeley threaded Abstract Machi... 详细信息
来源: 评论
Work-stealing with Configurable Scheduling Strategies  13
Work-stealing with Configurable Scheduling Strategies
收藏 引用
18th acm SIGPLAN symposium on principles and practice of parallel programming
作者: Wimmer, Martin Traeff, Jesper Larsson Cederman, Daniel Tsigas, Philippas Vienna Univ Technol Fac Informat Res Grp Parallel Comp A-1040 Vienna Austria Chalmers Univ Technol S-41296 Gothenburg Sweden
Work-stealing systems are typically oblivious to the nature of the tasks they are scheduling. they do not know or take into account how long a task will take to execute or how many subtasks it will spawn. Moreover, ta... 详细信息
来源: 评论