咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 approximation al...
  • 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 篇 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 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 352 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures"
365 条 记 录,以下是101-110 订阅
排序:
Optimal parallel algorithms for Dendrogram Computation and Single-Linkage Clustering  24
Optimal Parallel Algorithms for Dendrogram Computation and S...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Dhulipala, Laxman Dong, Xiaojun Gowda, Kishen N. Gu, Yan Univ Maryland College Pk MD 20742 USA Univ Calif Riverside Riverside CA 92521 USA
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree), the SLD of) is a binary dendrogram that summarizes the n =... 详细信息
来源: 评论
Dynamic load balancing framework for unstructured adaptive computations on distributed-memory multiprocessors
Dynamic load balancing framework for unstructured adaptive c...
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Sohn, Andrew Biswas, Rupak Simon, Horst D. New Jersey Inst of Technology Newark United States
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn, requires signific... 详细信息
来源: 评论
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...
来源: 评论
An implementation of the e-relaxation algorithm on the CM-5  5
An implementation of the e-relaxation algorithm on the CM-5
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Narendran, B. De Leone, Renato Tiwari, Prasoon Computer Sciences Department University of Wisconsin-Madison MadisonWI53706 United States
This paper discusses a parallel implementation of the e-relaxation algorithm for the min-cost flow problem on the CM-5. There is considerable loss in efficiency in going from one processor sequential implementation to... 详细信息
来源: 评论
Efficient disk allocation for fast similarity searching  98
Efficient disk allocation for fast similarity searching
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Prabhakar, S. Agrawal, D. El Abbadi, A. Univ of California Santa Barbara CA United States
As databases increasingly integrate non-textual information it is becoming necessary to support efficient similarity searching in addition to range searching. Recently, declustering techniques have been proposed for i... 详细信息
来源: 评论
Lower bounds for parallel computation on linked structures  90
Lower bounds for parallel computation on linked structures
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Fich, Faith E. Univ of Toronto Toronto Ont Canada
The time required to compute any function of a collection of circular doubly linked lists on a CROW PRAM is shown to be at most a constant factor more than on a CREW PRAM, but this is not true for singly linked lists.... 详细信息
来源: 评论
Scan grammars: parallel attribute evaluation via data-parallelism  93
Scan grammars: Parallel attribute evaluation via data-parall...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Reps, Thomas University of Wisconsin United States
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism du... 详细信息
来源: 评论
Efficient parallel Reinforcement Learning Framework Using the Reactor Model  24
Efficient Parallel Reinforcement Learning Framework Using th...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kwok, Jacky Lohstroh, Marten Lee, Edward A. Univ Calif Berkeley Berkeley CA 94720 USA
parallel Reinforcement Learning (RL) frameworks are essential for mapping RL workloads to multiple computational resources, allowing for faster generation of samples, estimation of values, and policy improvement. Thes... 详细信息
来源: 评论
Unified approach to off-line permutation routing on parallel networks
Unified approach to off-line permutation routing on parallel...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Annexstein, Fred Baumslag, Marc Univ of Massachusetts Amherst United States
A unified framework for finding efficient permutation routes on parallel networks in an off-line setting is presented. If the underlying graph of a parallel network contains an appropriate 'approximate' produc... 详细信息
来源: 评论
Brief Announcement: Low Depth Cache-Oblivious Sorting  09
Brief Announcement: Low Depth Cache-Oblivious Sorting
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifies (cache size and cache line size) of each leve... 详细信息
来源: 评论