咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是291-300 订阅
排序:
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs  93
Optimal parallel construction of Hamiltonian cycles and span...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: MacKenzie, Philip D. Stout, Quentin F. Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States
We give tight bounds on the parallel complexity of some problems involving random graphs. Specifically, we show that a Hamiltonian cycle, a breadth first spanning tree, and a maximal matching can all be constructed in... 详细信息
来源: 评论
An efficient parallel algorithm for the single function coarsest partition problem  93
An efficient parallel algorithm for the single function coar...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: JáJá, Joseph F. Ryu, Kwan Woo Department of Electrical Engineering Institute for Systems Research Korea Republic of Department of Computer Engineering Kyungpook National University Daegu Korea Republic of Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States
We describe an efficient parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. The previous best kno... 详细信息
来源: 评论
Experience in massively parallel discrete event simulation  93
Experience in massively parallel discrete event simulation
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Greenberg, Albert G. Lubachevsky, Boris D. Wang, Li-Chung AT and T Bell Laboratories United States University of Texas Austin United States
Discrete event simulation of complex systems is one of the most important problems in scientific and industrial computing. It is not uncommon for a single simulation run to take hours on a high speed workstation. Mass... 详细信息
来源: 评论
A dynamic distributed load balancing algorithm with provable good performance  93
A dynamic distributed load balancing algorithm with provable...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Lüling, Reinhard Monien, Burkhard Department of Mathematics and Computer Science University of Paderborn Germany
The overall efficiency of parallel algorithms is most decisively effected by the strategy applied for the mapping of workload. Strategies for balancing dynamically generated workload on a processor network which are a... 详细信息
来源: 评论
Efficient parallel shortest-paths in digraphs with a separator decomposition  93
Efficient parallel shortest-paths in digraphs with a separat...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Cohen, Edith AT and T Bell Laboratories Murray HillNJ07974 United States
We consider shortest paths and reachability problems on directed graphs with real-valued edge weights. For sparser graphs, the known AfC algorithms for these problems perform much more work than their sequential count... 详细信息
来源: 评论
parallel construction of optimal alphabetic trees  93
Parallel construction of optimal alphabetic trees
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Larmore, Lawrence Przytycka, M. Department of Computer Science University of California Riverside 92521 CA United States Department of Mathematics and Computer Science Odense University Odense M DK-5239 Denmark Institute of Informatics Warsaw University ul. Banacha 2 Warsaw 02-097 Poland
A parallel algorithm is given which constructs an optimal alphabetic tree in 0(log3 n) time with n2 log n processors. The construction is basically a parallelization of the Garsia-Wachs version [5] of the Hu-tucker al... 详细信息
来源: 评论
parallel construction and query of suffix trees for two-dimensional matrices  93
Parallel construction and query of suffix trees for two-dime...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Giancarlo, Raffaele Grossi, Roberto AT and T Bell Laboratories Murray HillNJ07974 United States University of Palermo Italy Dipartimento di Informatica Università di Pisa Pisa56125 Italy Dipartimento di Sistemi e Informatica Università di Firenze Firenze50134 Italy
We give efficient CRCW PRAM algorithms for the construction of two data structures, the Lsuffix Tree of a square matrix and the Nested Suffix Tree of a general matrix. The Lsuffix tree, introduced by Giancarlo [11], r... 详细信息
来源: 评论
Asymptotically tight bounds for performing BMMC permutations on parallel disk systems  93
Asymptotically tight bounds for performing BMMC permutations...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Cormen, Thomas H. Wisniewski, Leonard F. Department of Mathematics and Computer Science Dartmouth College United States
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform BMMC permutations (defined by a characteristic matrix that is nonsingular over GF{2)) on parallel disk ... 详细信息
来源: 评论
A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer  93
A doubly logarithmic communication algorithm for the complet...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Goldberg, Leslie Ann Jerrum, Mark Leighton, Tom Rao, Satish Sandia National Labs Department 1423 PO Box 5800 AlbuquerqueNM87185 United States University of Edinburgh Department of Computer Science King's Buildings EdinburghEH9 3JZ United Kingdom MIT Mathematics Department Laboratory for Computer Science CambridgeMA02139 United States NEC Research Institute 4 Independence Way PrincetonNJ08540 United States
In this paper we consider the problem of interprocessor communication on a Completely Connected Optical Communication parallel Computer (OCPC). The particular problem we study is that of realizing an h-relation. In th... 详细信息
来源: 评论
Highly efficient dictionary matching in parallel  93
Highly efficient dictionary matching in parallel
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Muthukrishnan, S. Palem, K. Courant Institute of Mathematical Sciences 251 Mercer Street New YorkNY10012-1185 United States IBM Research Division T. J. Watson Research Center P. O. Box 704 Yorktown HeightsNY10598 United States
We present highly efficient parallel algorithms for several well-studied dictionary matching problems. Our algorithms are faster and more efficient in terms of their parallel work, compared to previously known results... 详细信息
来源: 评论