咨询与建议

限定检索结果

文献类型

  • 336 篇 会议
  • 49 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

  • 73 篇 performance
  • 52 篇 parallel process...
  • 44 篇 parallel program...
  • 43 篇 languages
  • 42 篇 algorithms
  • 35 篇 design
  • 21 篇 gpu
  • 20 篇 parallel algorit...
  • 14 篇 experimentation
  • 12 篇 measurement
  • 11 篇 theory
  • 8 篇 mpi
  • 8 篇 parallel computi...
  • 7 篇 graphics process...
  • 7 篇 parallel
  • 7 篇 concurrency
  • 6 篇 scalability
  • 6 篇 parallelism
  • 6 篇 verification
  • 6 篇 openmp

机构

  • 7 篇 carnegie mellon ...
  • 4 篇 univ wisconsin d...
  • 4 篇 indiana univ blo...
  • 3 篇 univ of tokyo
  • 3 篇 tsinghua univers...
  • 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...

作者

  • 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 篇 chen wenguang
  • 4 篇 tan guangming
  • 4 篇 wang haojie
  • 4 篇 nikolopoulos dim...
  • 4 篇 long guoping
  • 4 篇 sarkar vivek
  • 4 篇 valero mateo
  • 4 篇 mellor-crummey j...
  • 4 篇 gu yan
  • 4 篇 kennedy ken
  • 3 篇 taura kenjiro

语言

  • 357 篇 英文
  • 28 篇 其他
检索条件"任意字段=9th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"
385 条 记 录,以下是291-300 订阅
排序:
User-controllable coherence for high performance shared memory multiprocessors
收藏 引用
acm sigplan NOTICES 2003年 第10期38卷 73-83页
作者: McCurdy, C Fischer, C Univ Wisconsin Dept Comp Sci Madison WI 53706 USA
In programming high performance applications, shared address-space platforms are preferable for fine-grained computation, while distributed address-space platforms are more suitable for coarse-grained computation. How... 详细信息
来源: 评论
Exploring the Use of WebAssembly in HPC  23
Exploring the Use of WebAssembly in HPC
收藏 引用
28th acm sigplan Annual symposium on principles and practice of parallel programming, PPoPP 2023
作者: Chadha, Mohak Krueger, Nils John, Jophin Jindal, Anshul Gerndt, Michael Benedict, Shajulin Computer Architecture and Parallel Systems Technische Universität München Germany Department of Computer Science and Engg. Indian and Institute of Information Technology Kottayam Kerala India
Containerization approaches based on namespaces offered by the Linux kernel have seen an increasing popularity in the HPC community both as a means to isolate applications and as a format to package and distribute the... 详细信息
来源: 评论
Scalable parallel Minimum Spanning Forest Computation
Scalable Parallel Minimum Spanning Forest Computation
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Nobari, Sadegh Cao, thanh-Tung Karras, Panagiotis Bressan, Stephane Natl Univ Singapore Singapore Singapore Rutgers State Univ Piscataway NJ 08855 USA
the proliferation of data in graph form calls for the development of scalable graph algorithms that exploit parallel processing environments. One such problem is the computation of a graph9;s minimum spanning fores... 详细信息
来源: 评论
Using thread-level speculation to simplify manual parallelization
收藏 引用
acm sigplan NOTICES 2003年 第10期38卷 1-12页
作者: Prabhu, MK Olukotun, K Stanford Univ Comp Syst Lab Stanford CA 94305 USA
In this paper, we provide examples of how thread-level speculation (TLS) simplifies manual parallelization and enhances its performance. A number of techniques for manual parallelization using TLS are presented and re... 详细信息
来源: 评论
A hierarchical approach to reducing communication in parallel graph algorithms  2015
A hierarchical approach to reducing communication in paralle...
收藏 引用
20th acm sigplan symposium on principles and practice of parallel programming, PPoPP 2015
作者: Harshvardhan Amato, Nancy M. Rauchwerger, Lawrence Parasol Laboratory Department of Computer Science and Engineering Texas A and M University United States
Large-scale graph computing has become critical due to the ever-increasing size of data. However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent... 详细信息
来源: 评论
Training one DeePMD Model in Minutes: a Step towards Online Learning  24
Training one DeePMD Model in Minutes: a Step towards Online ...
收藏 引用
29th acm sigplan Annual symposium on principles and practice of parallel programming (PPoPP)
作者: Hu, Siyu Zhao, Tong Sha, Qiuchen Li, Enji Meng, Xiangyu Liu, Liping Wang, Lin-Wang Tan, Guangming Jia, Weile Chinese Acad Sci Inst Comp Technol State Key Lab Proc Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China China Univ Petr Qingdao Inst Software Coll Comp Sci & Technol Qingdao Peoples R China Chinese Acad Sci Inst Semicond Beijing Peoples R China
Neural Network Molecular Dynamics (NNMD) has become a major approach in material simulations, which can speedup the molecular dynamics (MD) simulation for thousands of times, while maintaining ab initio accuracy, thus... 详细信息
来源: 评论
parallel binary code analysis  21
Parallel binary code analysis
收藏 引用
26th acm sigplan symposium on principles and practice of parallel programming, PPoPP 2021
作者: Meng, Xiaozhu Anderson, Jonathon M. Mellor-Crummey, John Krentel, Mark W. Miller, Barton P. Milaković, Sran Department of Computer Science Rice University Houston TX United States Computer Sciences Department University of Wisconsin-Madison MadisonWI United States
Binary code analysis is widely used to help assess a program9;s correctness, performance, and provenance. Binary analysis applications often construct control flow graphs, analyze data flow, and use debugging infor... 详细信息
来源: 评论
Using multiple energy gears in MPI programs on a power-scalable cluster  05
Using multiple energy gears in MPI programs on a power-scala...
收藏 引用
2005 acm sigplan symposium on principles and Practise of parallel programming, PROPP 05
作者: Freeh, Vincent W. Pan, Feng Kappiah, Nandini Lowenthal, David K. Department of Computer Science North Carolina State University Raleigh NC United States Department of Computer Science University of Georgia Athens GA United States
Recently, system architects have built low-power, high-performance clusters, such as Green Destiny. the idea behind these clusters is to improve the energy efficiency of nodes. However, these clusters save power at th... 详细信息
来源: 评论
Exploiting task-level concurrency in a programmable network interface
收藏 引用
acm sigplan NOTICES 2003年 第10期38卷 61-72页
作者: Kim, HY Pai, VS Rixner, S Rice Univ Houston TX 77251 USA
Programmable network interfaces provide the potential to extend the functionality of network services but lead to instruction processing overheads when compared to application-specific network interfaces. this paper a... 详细信息
来源: 评论
Generating local addresses and communication sets for data-parallel programs  93
Generating local addresses and communication sets for data-p...
收藏 引用
4th acm sigplan symposium on principles and practice of parallel programming, PPOPP 1993
作者: Chatterjee, Siddhartha Gilbert, John R. Long, Fred J.E. Schreiber, Robert Teng, Shang-Hua Research Institute for Advanced Computer Science Mail Stop T045-1 NASA Ames Research Center Moffett FieldCA94035-1000 United States Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo AltoCA943041314 United States Department of Computer and Information Science University of California Santa CruzCA95064 United States Department of Mathematics Massachusetts Institute of Technology CambridgeMA02139 United States
Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned t... 详细信息
来源: 评论