咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

  • 1,609 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 55 篇 统计学(可授理学、...
    • 16 篇 物理学
    • 9 篇 生物学
    • 9 篇 系统科学
    • 8 篇 化学
  • 73 篇 管理学
    • 64 篇 管理科学与工程(可...
    • 40 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 16 篇 农学
    • 16 篇 作物学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 医学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 237 篇 parallel algorit...
  • 173 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 47 篇 parallel archite...
  • 41 篇 hardware
  • 30 篇 scheduling
  • 27 篇 computer program...
  • 21 篇 graph algorithms
  • 20 篇 computer systems...
  • 18 篇 approximation al...
  • 18 篇 processor schedu...
  • 18 篇 computational mo...
  • 18 篇 field programmab...
  • 17 篇 parallel computi...
  • 16 篇 computer science
  • 16 篇 performance
  • 16 篇 delay

机构

  • 32 篇 carnegie mellon ...
  • 15 篇 swiss fed inst t...
  • 15 篇 carnegie mellon ...
  • 11 篇 univ maryland de...
  • 11 篇 stanford univ st...
  • 10 篇 univ maryland co...
  • 10 篇 mit 77 massachus...
  • 10 篇 univ calif berke...
  • 8 篇 eth zurich
  • 7 篇 georgetown univ ...
  • 7 篇 mit cambridge ma...
  • 7 篇 univ texas austi...
  • 6 篇 penn state univ ...
  • 6 篇 mit csail cambri...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...
  • 5 篇 harvard univ cam...

作者

  • 38 篇 blelloch guy e.
  • 20 篇 gu yan
  • 18 篇 gibbons phillip ...
  • 18 篇 shun julian
  • 18 篇 goodrich michael...
  • 16 篇 fineman jeremy t...
  • 15 篇 sun yihan
  • 14 篇 dhulipala laxman
  • 13 篇 vishkin uzi
  • 12 篇 agrawal kunal
  • 11 篇 leiserson charle...
  • 10 篇 ballard grey
  • 10 篇 hoefler torsten
  • 10 篇 anon
  • 10 篇 miller gary l.
  • 10 篇 harris david g.
  • 9 篇 ghaffari mohsen
  • 9 篇 tangwongsan kana...
  • 9 篇 reif john h.
  • 9 篇 demmel james

语言

  • 1,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是491-500 订阅
排序:
Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core architectures  28
Hardware/Software Vectorization for Closeness Centrality on ...
收藏 引用
28th IEEE International parallel & Distributed Processing symposium Workshops (IPDPSW)
作者: Sariyuce, Ahmet Erdem Saule, Erik Kaya, Kamer Catalyurek, Umit V. Ohio State Univ Dept Biomed Informat Columbus OH 43210 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Univ N Carolina Dept Comp Sci Charlotte NC 28223 USA
Centrality metrics have shown to be highly correlated with the importance and loads of the nodes in a network. Given the scale of today's social networks, it is essential to use efficient algorithms and high perfo... 详细信息
来源: 评论
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
Executing Dynamic Data-Graph Computations Deterministically ...
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kaler, Tim Hasenplaugh, William Schardl, Tao B. Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab 32 Vassar St Cambridge MA 02139 USA
A data-graph computation - popularized by such programming systems as Galois, Pregel, GraphLab, PowerGraph, and GraphChi - is an algorithm that performs local updates on the vertices of a graph. During each round of a... 详细信息
来源: 评论
SupMR: Circumventing Disk and Memory Bandwidth Bottlenecks for Scale-up MapReduce  28
SupMR: Circumventing Disk and Memory Bandwidth Bottlenecks f...
收藏 引用
28th IEEE International parallel & Distributed Processing symposium Workshops (IPDPSW)
作者: Sevilla, Michael Nassi, Ike Ioannidou, Kleoni Brandt, Scott Maltzahn, Carlos Univ Calif Santa Cruz Comp Sci Dept Santa Cruz CA 95060 USA
Reading input from primary storage (i.e. the ingest phase) and aggregating results (i.e. the merge phase) are important pre- and post-processing steps in large batch computations. Unfortunately, today's data sets ... 详细信息
来源: 评论
The future of accelerator programming: Abstraction, performance or can we have both?  14
The future of accelerator programming: Abstraction, performa...
收藏 引用
29th annual acm symposium on Applied Computing, SAC 2014
作者: Rocki, Kamil Burtscher, Martin Suda, Reiji IBM Research 650 Harry Road San Jose CA 95120 United States University of Tokyo Department of Computer Science 7-3-1 Hongo Bunkyo-ku Tokyo Japan Texas State University Department of Computer Science San Marcos TX 78666 United States
In a perfect world, code would only be written once and would run on different devices with high efficiency. To a degree, that used to be the case in the era of frequency scaling on a single core. However, due to powe... 详细信息
来源: 评论
Arbitrary Modulus Indexing  47
Arbitrary Modulus Indexing
收藏 引用
47th annual IEEE/acm International symposium on Microarchitecture (MICRO)
作者: Diamond, Jeffrey R. Fussell, Donald S. Keckler, Stephen W. Univ Texas Austin Austin TX 78712 USA NVIDIA Santa Clara CA USA
Modern high performance processors require memory systems that can provide access to data at a rate that is well matched to the processor's computation rate. Common to such systems is the organization of memory in... 详细信息
来源: 评论
Compiler Support for Optimizing Memory Bank-Level parallelism  47
Compiler Support for Optimizing Memory Bank-Level Parallelis...
收藏 引用
47th annual IEEE/acm International symposium on Microarchitecture (MICRO)
作者: Ding, Wei Guttman, Diana Kandemir, Mahmut Penn State Univ University Pk PA 16802 USA
Many prior compiler-based optimization schemes focused exclusively on cache data locality. However, cache locality is only one part of the overall performance of applications running on emerging multicores or manycore... 详细信息
来源: 评论
The complexity of optimal mechanism design
The complexity of optimal mechanism design
收藏 引用
25th annual acm-SIAM symposium on Discrete algorithms, SODA 2014
作者: Daskalakis, Constantinos Deckelbaum, Alan Tzamos, Christos EECS MIT United States Department of Mathtematics MIT United States
Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders [18]. Generalizing this work to selling multiple items at once has been a central questi... 详细信息
来源: 评论
A Stream Processing Framework for On-line Optimization of Performance and Energy Efficiency on Heterogeneous Systems  28
A Stream Processing Framework for On-line Optimization of Pe...
收藏 引用
28th IEEE International parallel & Distributed Processing symposium Workshops (IPDPSW)
作者: Ranft, Benjamin Denninger, Oliver Pfaffe, Philip FZI Res Ctr Informat Technol D-76131 Karlsruhe Germany Karlsruhe Inst Technol D-76131 Karlsruhe Germany
Modern processors have the potential of executing compute-intensive programs quickly and efficiently, but require applications to be adapted to their ever increasing parallelism. Here, heterogeneous systems add comple... 详细信息
来源: 评论
A Sound and Complete Abstraction for Reasoning about parallel Prefix Sums  14
A Sound and Complete Abstraction for Reasoning about Paralle...
收藏 引用
41st annual acm SIGPLAN-SIGACT symposium on Principles of Programming Languages (POPL)
作者: Chong, Nathan Donaldson, Alastair F. Ketema, Jeroen Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England
Prefix sums are key building blocks in the implementation of many concurrent software applications, and recently much work has gone into efficiently implementing prefix sums to run on massively parallel graphics proce... 详细信息
来源: 评论
Flexible cooperation in parallel local search  14
Flexible cooperation in parallel local search
收藏 引用
29th annual acm symposium on Applied Computing, SAC 2014
作者: Munera, Danny Diaz, Daniel Abreu, Salvador Codognet, Philippe University of Paris 1 France University of Évora CENTRIA Portugal JFLI - CNRS UPMC University of Tokyo Japan
Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving Constraint Satisfaction Problems (CSP). In order to further improve the performance of Local Search, one possible option is to...
来源: 评论