咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 1,171 篇 工学
    • 1,114 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 582 篇 理学
    • 560 篇 数学
    • 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...
  • 73 篇 parallel process...
  • 57 篇 algorithms
  • 57 篇 parallel program...
  • 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...
  • 6 篇 carnegie mellon ...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...

作者

  • 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,571 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1611 条 记 录,以下是181-190 订阅
排序:
Steady state analysis of diffracting trees
Steady state analysis of diffracting trees
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Shavit, Nir Upfal, Eli Zemach, Asaph Tel Aviv Univ Israel
Diffracting trees are an effective and highly scalable distributed-parallel technique for shared counting and load balancing. This paper presents the first steady-state combinatorial model and analysis for diffracting... 详细信息
来源: 评论
parallel algorithms for gray-scale image component labeling on a mesh-connected computer  92
Parallel algorithms for gray-scale image component labeling ...
收藏 引用
4th annual acm symposium on parallel algorithms and architectures - SPAA '92
作者: Hambrusch, Susanne He, Xin Miller, Russ Purdue Univ West Lafayette IN United States
We present two asymptotically optimal Θ(n) time algorithms for labeling the connected components of a gray-scale image on a mesh-connected computer. We assume that the input is an n × n gray-scale image mapped o... 详细信息
来源: 评论
Constructing arrangements optimally in parallel  91
Constructing arrangements optimally in parallel
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Goodrich, M.T. Department of Computer Science The Johns Hopkins University Baltimore MD
We give two optimal parallel algorithms for constructing the arrangement of n lines in the plane. The first method is quite simple and runs in O(log2n) time using O(n2) work, and the second method, which is more sophi... 详细信息
来源: 评论
Finding Strongly Connected Components in parallel using O(log2 n) Reachability Queries  08
Finding Strongly Connected Components in Parallel using <i>O...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Schudy, Warren Brown Univ Providence RI 02912 USA
We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log(2) n) multi-source parallel reachability querie... 详细信息
来源: 评论
Brief announcement: parallel network mapping algorithms  33
Brief announcement: Parallel network mapping algorithms
收藏 引用
33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021
作者: Afshar, Ramtin Goodrich, Michael T. Matias, Pedro Osegueda, Martha C. University of California IrvineCA United States
Motivated from parallel network mapping, we provide efficient query complexity and round complexity bounds for graph reconstruction using distance queries, including a bound that improves a previous sequential complex... 详细信息
来源: 评论
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach  01
Towards a first vertical prototyping of an extremely fine-gr...
收藏 引用
13th annual symposium on parallel algorithms and architectures (SPAA)
作者: Naishlos, D Nuzman, J Tseng, CW Vishkin, U Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Explicit multithreading (XMT) is a parallel programming approach for exploiting on-chip parallelism. XMT introduces a computational framework with (1) a simple programming style that relies on fine-grained PRAM-style ... 详细信息
来源: 评论
parallel dynamic programming for solving the string editing problem on a CGM/BSP
Parallel dynamic programming for solving the string editing ...
收藏 引用
Fourteenth annual acm symposium on parallel algorithms and architectures
作者: Alves, C.E.R. Cáceres, E.N. Dehne, F. FTCE Universidade São Judas Tadeu São Paulo SP Brazil Universidade Federal de Mato Grosso do Sul Campo Grande MS Brazil School of Computer Science Carleton University Ottawa Ont. K1S 5B6 Canada
In this paper we present a coarse-grained parallel algorithm for solving the string edit distance problem for a string A and all substrings of a string C. Our method is based on a novel CGM/BSP parallel dynamic progra... 详细信息
来源: 评论
Embedding leveled hypercube algorithms into hypercubes
Embedding leveled hypercube algorithms into hypercubes
收藏 引用
4th annual acm symposium on parallel algorithms and architectures - SPAA '92
作者: Wilson, David Bruce Massachusetts Inst of Technology Cambridge United States
When a leveled hypercube algorithm (one dimension used at a time) is mapped in the straightforward way into a hypercube in which all edges are useable at once, most of the host machine's bandwidth is unused. This ... 详细信息
来源: 评论
SPAA 2020 - Proceedings of the 32nd acm symposium on parallelism in algorithms and architectures
SPAA 2020 - Proceedings of the 32nd ACM Symposium on Paralle...
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020
The proceedings contain 68 papers. The topics discussed include: faster deterministic all pairs shortest paths in congest model;contention resolution with message deadlines;memory tagging: minimalist synchronization f...
来源: 评论
Fast parallel matching in expander graphs  93
Fast parallel matching in expander graphs
收藏 引用
Proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Kelson, Pierre Univ. of British Columbia Vancouver B.C. Canada
Let iT be a bipartite graph with bipartition (A, B) where \A\-n and every subset X of A with at most a n elements has at least b\X\ neighbors (o 1). We consider the problem of computing a matching from a given subset... 详细信息
来源: 评论