咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

  • 7 篇 carnegie mellon ...
  • 5 篇 indiana univ blo...
  • 4 篇 univ wisconsin d...
  • 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 篇 purdue univ w la...
  • 3 篇 univ calif berke...
  • 2 篇 ist austria klos...
  • 2 篇 princeton univ d...
  • 2 篇 georgetown univ ...
  • 2 篇 yale university ...
  • 2 篇 coll william & m...

作者

  • 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
  • 5 篇 kennedy ken
  • 4 篇 dhulipala laxman
  • 4 篇 miller barton p.
  • 4 篇 tan guangming
  • 4 篇 wang haojie
  • 4 篇 nikolopoulos dim...
  • 4 篇 long guoping
  • 4 篇 valero mateo
  • 4 篇 mellor-crummey j...
  • 4 篇 agrawal kunal
  • 4 篇 gu yan
  • 4 篇 leiserson charle...

语言

  • 356 篇 英文
  • 26 篇 其他
检索条件"任意字段=14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"
382 条 记 录,以下是201-210 订阅
排序:
Scalable parallel debugging with statistical assertions  12
Scalable parallel debugging with statistical assertions
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming, PPoPP'12
作者: Dinh, Minh Ngoc Abramson, David Jin, Chao Gontarek, Andrew Moench, Bob DeRose, Luiz Monash University Clayton 3800 VIC Australia Cray Inc. Saint Paul MN 55101-2987 United States
Traditional debuggers are of limited value for modern scientific codes that manipulate large complex data structures. this paper discusses a novel debug-time assertion, called a "Statistical Assertion", that... 详细信息
来源: 评论
PPDP'12 - Proceedings of the 2012 acm sigplan principles and practice of Declarative programming
PPDP'12 - Proceedings of the 2012 ACM SIGPLAN Principles and...
收藏 引用
14th symposium on principles and practice of Declarative programming, PPDP 2012
the proceedings contain 19 papers. the topics discussed include: symbolic evaluation graphs and term rewriting a general methodology for analyzing logic programs;automatic synthesis of specifications for first order c...
来源: 评论
PPoPP'11 - Proceedings of the 2011 acm sigplan symposium on principles and practice of parallel programming
PPoPP'11 - Proceedings of the 2011 ACM SIGPLAN Symposium on ...
收藏 引用
16th acm symposium on principles and practice of parallel programming, PPoPP'11
the proceedings contain 39 papers. the topics discussed include: ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms;programming the memory hierarchy revisited: supporting ir...
来源: 评论
Scalable parallel Debugging with Statistical Assertions
Scalable Parallel Debugging with Statistical Assertions
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Minh Ngoc Dinh Abramson, David Jin, Chao Gontarek, Andrew Moench, Bob DeRose, Luiz Monash Univ Clayton Vic 3800 Australia Cray Inc St Paul MN 55101 USA
Traditional debuggers are of limited value for modern scientific codes that manipulate large complex data structures. this paper discusses a novel debug-time assertion, called a "Statistical Assertion", that... 详细信息
来源: 评论
Portable parallel Performance from Sequential, Productive, Embedded Domain-Specific Languages  12
Portable Parallel Performance from Sequential, Productive, E...
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Kamil, Shoaib Coetzee, Derrick Beamer, Scott Cook, Henry Gonina, Ekaterina Harper, Jonathan Morlan, Jeffrey Fox, Armando Univ Calif Berkeley Berkeley CA 94720 USA Mississippi State Univ Mississippi State MS USA
Domain-expert productivity programmers desire scalable application performance, but usually must rely on efficiency programmers who are experts in explicit parallel programming to achieve it. Since such programmers ar... 详细信息
来源: 评论
Deterministic parallel Random-Number Generation for Dynamic-Multithreading Platforms  12
Deterministic Parallel Random-Number Generation for Dynamic-...
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Leiserson, Charles E. Schardl, Tao B. Sukha, Jim MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. this paper proposes that a mechanism called pedigrees be built into the runtime system to enable e... 详细信息
来源: 评论
Scalable parallel minimum spanning forest computation  12
Scalable parallel minimum spanning forest computation
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming, PPoPP'12
作者: Nobari, Sadegh Cao, thanh-Tung Karras, Panagiotis Bressan, St´ephane National University of Singapore Singapore Rutgers University United States
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 graph's minimum spanning fores... 详细信息
来源: 评论
Internally Deterministic parallel Algorithms Can Be Fast  12
Internally Deterministic Parallel Algorithms Can Be Fast
收藏 引用
17th acm sigplan symposium on principles and practice of parallel programming
作者: Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Shun, Julian Carnegie Mellon Univ Pittsburgh PA 15213 USA Georgetown Univ Pittsburgh PA USA Intel Labs Pittsburgh PA USA
the virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one of the strongest forms, requiring that... 详细信息
来源: 评论
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 graph's minimum spanning fores... 详细信息
来源: 评论
Proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP: Chairs' Welcome
Proceedings of the ACM SIGPLAN Symposium on Principles and P...
收藏 引用
Proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP 2011年 iii页
作者: Cascaval, Calin Yew, Pen-Chung Qualcomm Research United States Academia Sinica Taiwan University of Minnesota United States
来源: 评论