咨询与建议

限定检索结果

文献类型

  • 352 篇 会议
  • 18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 255 篇 工学
    • 252 篇 计算机科学与技术...
    • 168 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
  • 151 篇 理学
    • 148 篇 数学
    • 23 篇 统计学(可授理学、...
    • 3 篇 生物学
    • 3 篇 系统科学
    • 1 篇 化学
  • 13 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 13 篇 computer program...
  • 12 篇 parallel program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 approximation al...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 cilk
  • 3 篇 sorting
  • 3 篇 chip multiproces...

机构

  • 10 篇 carnegie mellon ...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 department of co...
  • 3 篇 university of ma...
  • 3 篇 mit 77 massachus...
  • 2 篇 duke univ durham...
  • 2 篇 univ calif river...
  • 2 篇 carnegie mellon ...
  • 2 篇 univ of toronto ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 computer science...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...
  • 2 篇 bell laboratorie...

作者

  • 12 篇 gibbons phillip ...
  • 11 篇 blelloch guy e.
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 vitter jeffrey s...
  • 4 篇 muthukrishnan s.
  • 4 篇 goodrich michael...
  • 4 篇 miller gary l.
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 cormen thomas h.
  • 3 篇 deng xiaotie
  • 3 篇 tangwongsan kana...
  • 3 篇 sohn andrew
  • 3 篇 leighton tom
  • 3 篇 simhadri harsha ...
  • 3 篇 gu yan

语言

  • 357 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"
370 条 记 录,以下是171-180 订阅
排序:
Optimal latency - throughput tradeoffs for data parallel pipelines  96
Optimal latency - throughput tradeoffs for data parallel pip...
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Subhlok, Jaspal Vondran, Gary Carnegie Mellon Univ Pittsburgh PA United States
This paper addresses optimal mapping of parallel programs composed of a chain of data parallel tasks onto the processors of a parallel system. The input to this class of programs is a stream of data sets, each of whic... 详细信息
来源: 评论
High-probability parallel transitive closure algorithms  90
High-probability parallel transitive closure algorithms
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Ullman, Jeffrey D. Yannakakis, Mihalis Stanford Univ Stanford KY United States
The authors address the apparently difficult problem of doing parallel transitive closure when the (directed) graph is sparse and/or, only single-source information is desired. O(e) work is their target for the single... 详细信息
来源: 评论
Fast and reliable parallel hashing  91
Fast and reliable parallel hashing
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Bast, H. Saarlands, U. Hagerup, T. Fachbereich Informatik Universität des Saarlandes W-6600 Saarbrücken Germany Max-Planck-Institut für Informatik W-6600 Saarbrücken Germany
A perfect hash function for a (multi)set X of n integers is an infective function h : X → {1,., s}, where s = O(n), that can be stored in O(n) space and evaluated in constant time by a single processor. We show that ... 详细信息
来源: 评论
SPAA 2024 - proceedings of the 36th acm symposium on parallelism in algorithms and architectures
SPAA 2024 - Proceedings of the 36th ACM Symposium on Paralle...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures, SPAA 2024
The proceedings contain 54 papers. The topics discussed include: expediting hazard pointers with bounded RCU critical sections;Alock: asymmetric lock primitive for RDMA systems;when is parallelism fearless and zero-co...
来源: 评论
Can a shared-memory model serve as a bridging model for parallel computation?
Can a shared-memory model serve as a bridging model for para...
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya Lucent Technologies Murray Hill United States
We consider the question of whether a shared-memory model can serve as an effective bridging model for parallel computation along the lines of a distributed-memory model such as the BSP. As a candidate for a shared-me... 详细信息
来源: 评论
More time-work tradeoffs for parallel graph algorithms  91
More time-work tradeoffs for parallel graph algorithms
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Spencer, Thomas H. Computer Science Department Rensselaer Polytechnic Institute United States
Some parallel algorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes three such algorithms that find the strongly connected components of... 详细信息
来源: 评论
Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers  97
Using tadpoles to reduce memory and communication requiremen...
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Cooperman, Gene Tselman, Michael Northeastern Univ Boston MA United States
A parallel variant of breadth-first search for distributed computing is presented. The variant allows exhaustive enumeration of elements of a search space (implicitly defined graph) in which the representation of all ... 详细信息
来源: 评论
Issues and directions in scalable parallel computing  93
Issues and directions in scalable parallel computing
收藏 引用
proceedings of the 12th annual acm symposium on Principles of Distributed Computing
作者: Snir, Marc T.J. Watson Research Cent Yorktown Heights NY United States
The design and use of scalable parallel computers is discussed. Much of the knowledge gained in the study of distributd systems is relevant, although it needs to be used in new manners. The author argues that the chal... 详细信息
来源: 评论
Analysis of dag-consistent distributed shared-memory algorithms
Analysis of dag-consistent distributed shared-memory algorit...
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Blumofe, Robert D. Frigo, Matteo Joerg, Christopher F. Leiserson, Charles E. Randall, Keith H. Univ of Texas at Austin Austin TX United States
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page faults, and space requirements for multit... 详细信息
来源: 评论
Modeling the benefits of mixed data and task parallelism  95
Modeling the benefits of mixed data and task parallelism
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Chakrabarti, Soumen Demmel, James Yelick, Katherine U.C. Berkeley Berkeley CA United States
Mixed task and data parallelism exists naturally in many applications, but utilizing it may require sophisticated scheduling algorithms and software support. Recently, significant research effort has been applied to e... 详细信息
来源: 评论