咨询与建议

限定检索结果

文献类型

  • 1,503 篇 会议
  • 106 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

  • 237 篇 parallel algorit...
  • 175 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 algorithms
  • 57 篇 parallel program...
  • 46 篇 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 篇 performance
  • 16 篇 delay
  • 15 篇 computer science

机构

  • 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,557 篇 英文
  • 52 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是211-220 订阅
排序:
annual acm symposium on parallelism in algorithms and architectures
Annual ACM symposium on parallelism in algorithms and archit...
收藏 引用
30th acm symposium on parallelism in algorithms and architectures, SPAA 2018
The proceedings contain 47 papers. The topics discussed include: parallel minimum cuts in near-linear work and low depth;trees for vertex cuts, hypergraph cuts and minimum hypergraph bisection;dynamic representations ...
来源: 评论
Analysis of on-chip communication properties in accelerator architectures for Deep Neural Networks
Analysis of on-chip communication properties in accelerator ...
收藏 引用
International symposium on Networks-on-Chip (NOCS)
作者: Hana Krichene Jean-Marc Philippe Université Paris-Saclay Palaiseau France
Deep neural networks (DNNs) algorithms are expected to be core components of next-generation applications. These high performance sensing and recognition algorithms are key enabling technologies of smarter systems tha... 详细信息
来源: 评论
Privacy Preserving Cooperative Computation for Personalized Web Search Applications  20
Privacy Preserving Cooperative Computation for Personalized ...
收藏 引用
35th annual acm symposium on Applied Computing (SAC)
作者: Kaaniche, Nesrine Masmoudi, Souha Znina, Souha Laurent, Maryline Demir, Levent Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England Inst Polytech Paris Telecom SudParis Evry France Inst Polytech Paris Telecom SudParis Chair Values & Policies Personal Informat SAMOVAR Evry France Qwant Res Paris France
With the emergence of connected objects and the development of Artificial Intelligence (AI) mechanisms and algorithms, personalized applications are gaining an expanding interest, providing services tailored to each s... 详细信息
来源: 评论
SOFF: An OpenCL High-Level Synthesis Framework for FPGAs  20
SOFF: An OpenCL High-Level Synthesis Framework for FPGAs
收藏 引用
47th acm/IEEE annual International symposium on Computer Architecture (ISCA)
作者: Jo, Gangwon Kim, Heehoon Lee, Jeesoo Lee, Jaejin ManyCoreSoft Seoul 08826 South Korea Seoul Natl Univ Dept Comp Sci & Engn Seoul 08826 South Korea
Recently, OpenCL has been emerging as a programming model for energy-efficient FPGA accelerators. However, the state-of-the-art OpenCL frameworks for FPGAs suffer from poor performance and usability. This paper propos... 详细信息
来源: 评论
Proceedings of the 11th Workshop on parallel Programming and Run-Time Management Techniques for Many-Core architectures / 9th Workshop on Design Tools and architectures for Multicore Embedded Computing Platforms, PARMA-DITAM 2020
Proceedings of the 11th Workshop on Parallel Programming and...
收藏 引用
8th International symposium on Highly-Efficient Accelerators and Reconfigurable Technologies, HEART 2017
The proceedings contain 5 papers. The topics discussed include: sparse matrix-dense matrix multiplication on heterogeneous CPU+FPGA embedded system;run-time power modeling in embedded GPUs with dynamic voltage and fre...
来源: 评论
A time-optimal randomized parallel algorithm for MIS  21
A time-optimal randomized parallel algorithm for MIS
收藏 引用
Proceedings of the Thirty-Second annual acm-SIAM symposium on Discrete algorithms
作者: Mohsen Ghaffari Bernhard Haeupler ETH Zurich Carnegie Mellon University
We present a randomized parallel algorithm, in the Exclusive-Read Exclusive-Write (EREW) PRAM model, that computes a Maximal Independent Set (MIS) in O(log n) time and using O(m log2 n) work, with high probability. Th...
来源: 评论
Dynamic graph algorithms with batch updates in the massively parallel computation model  21
Dynamic graph algorithms with batch updates in the massively...
收藏 引用
Proceedings of the Thirty-Second annual acm-SIAM symposium on Discrete algorithms
作者: Krzysztof Nowicki Krzysztof Onak University of Wroclaw and IBM T.J. Watson Research Center IBM Research
We study dynamic graph algorithms in the Massively parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of ed...
来源: 评论
Deterministic Atomic Buffering  53
Deterministic Atomic Buffering
收藏 引用
53rd annual IEEE/acm International symposium on Microarchitecture (MICRO)
作者: Chou, Yuan Hsi Ng, Christopher Cattell, Shaylin Intan, Jeremy Sinclair, Matthew D. Devietti, Joseph Rogers, Timothy G. Aamodt, Tor M. Univ British Columbia Vancouver BC Canada Univ Wisconsin Madison WI 53706 USA Univ Penn Philadelphia PA 19104 USA Purdue Univ W Lafayette IN 47907 USA AMD Res Santa Clara CA USA
Deterministic execution for GPUs is a desirable property as it helps with debuggability and reproducibility. It is also important for safety regulations, as safety critical workloads are starting to be deployed onto G... 详细信息
来源: 评论
NEBULA: A Neuromorphic Spin-Based Ultra-Low Power Architecture for SNNs and ANNs  20
NEBULA: A Neuromorphic Spin-Based Ultra-Low Power Architectu...
收藏 引用
47th acm/IEEE annual International symposium on Computer Architecture (ISCA)
作者: Singh, Sonali Sarma, Anup Jao, Nicholas Pattnaik, Ashutosh Lu, Sen Yang, Kezhou Sengupta, Abhronil Narayanan, Vijaykrishnan Das, Chita R. Penn State Univ Sch Elect Engn & Comp Sci University Pk PA 16802 USA
Brain-inspired cognitive computing has so far followed two major approaches - one uses multi-layered artificial neural networks (ANNs) to perform pattern-recognition-related tasks, whereas the other uses spiking neura... 详细信息
来源: 评论
Tight bounds for parallel paging and green paging  21
Tight bounds for parallel paging and green paging
收藏 引用
Proceedings of the Thirty-Second annual acm-SIAM symposium on Discrete algorithms
作者: Kunal Agrawal Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico Michele Scquizzato Washington University in St. Louis Stony Brook University MIT Università degli Studi di Padova Italy
In the parallel paging problem, there are p processors that share a cache of size k. The goal is to partition the cache among the processors over time in order to minimize their average completion time. For this long-...
来源: 评论