咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 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...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 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...
  • 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,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是1381-1390 订阅
排序:
Time-work tradeoffs for parallel graph algorithms  53
Time-work tradeoffs for parallel graph algorithms
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: Spencer, Thomas H. Computer Science Department Rensselaer Polytechnic Institute United States
The computational complexity of a parallel algorithm can be measured by the time it takes and the work it does. The work done by a parallel algorithm is the product of the time required and the processors used. Often,... 详细信息
来源: 评论
Converting high probability into nearly-constant time - with applications to parallel hashing  23
Converting high probability into nearly-constant time - with...
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Matias, Yossi Vishkin, Uzi University of Maryland United States Tel-Aviv University Israel
We present a new paradigm for efficient randomized parallel algorithms that needs ō(log' n) time, where Ō(x) means 'O(Z) expected'. It leads to: (1) constructing a perfect hash function for n elements in... 详细信息
来源: 评论
Dynamic scheduling on parallel machines
Dynamic scheduling on parallel machines
收藏 引用
Proceedings of the 32nd annual symposium on Foundations of Computer Science
作者: Feldmann, Anja Sgall, Jiri Teng, Shang-Hua
The problem of online job scheduling on various parallel architectures is studied. An O((log log n)1/2)-competitive algorithm for online dynamic scheduling on an n × n mesh is given. It is proved that this algori... 详细信息
来源: 评论
Proceedings of the annual acm symposium on Principles of Distributed Computing
Proceedings of the Annual ACM Symposium on Principles of Dis...
收藏 引用
10th annual acm symposium on Principles of Distributed Computing, PODC 1991
The proceedings contain 28 papers. The topics discussed include: practical uses of synchronized clocks undistributed systems;randomized wait-free concurrent objects;efficient parallel algorithms on restartable fail-st...
来源: 评论
parallel complexity of tridiagonal symmetric eigenvalue problem  53
Parallel complexity of tridiagonal symmetric eigenvalue prob...
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: Bini, Dario Pan, Victor Dipartimento di Matematica Università di Pisa Italy Department of Computer Science Columbia University New York United States Department of Mathematics and Computer Science Lehman College City United States
Surprisingly simple corollaries from the Courant-Fischer rninimax characterization theorem enable us to devise a very effective algorithm for the evaluation of a set S interleaving the set E of the eigenvalues of a re... 详细信息
来源: 评论
algorithms for parallel k-'vertex connectivity and sparse certificates  91
Algorithms for parallel k-'vertex connectivity and sparse ce...
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Cheriyan, Joseph Thurimella, Ramakrishna IJMIACS University of Maryland at College Park College ParkMD20742 United States
A certificate for the k-vertex connectivity of a graph G = (V, E) is a subset E' of E such that (V, E') is k-vertex connected iff G is k-vertex connected. Let n = IV[ and m = IEI. A certificate is called spars... 详细信息
来源: 评论
On the parallel complexity of evaluating game trees  53
On the parallel complexity of evaluating game trees
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: Broder, Andrei Z. Karlin, Anna Raghavan, Prabhakar Upfal, Eli DEC Systems Research Center Palo AltoCA United States IBM T.J. Watson Research Center Yorktown HeightsNY United States IBM Almaden Research Center San JoseCA United States Department of Applied Mathematics Weizmann Institute of Science Rehovot Israel
We consider efficient parallel algorithms for the evaluation of game trees. We prove an inherent limitation on the speedup achievable, and give an algorithm that achieves its best performance bounds on trees of the so... 详细信息
来源: 评论
A SUBLINEAR-TIME RANDOMIZED parallel ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM IN PERFECT GRAPHS  53
A SUBLINEAR-TIME RANDOMIZED PARALLEL ALGORITHM FOR THE MAXIM...
收藏 引用
2ND annual SYMP OF THE ASSOC FOR COMPUTING MACHINERY AND THE SOC FOR INDUSTRIAL AND APPLIED MATHEMATICS : DISCRETE algorithms
作者: ALIZADEH, F Computer Science Department University of Minnesota Minneapolis 55455 MN United States
We will show that Lovasz number of graphs may be computed using interior-point methods. This technique will require O(√|V|) iterations, each consisting of matrix operations which have polylog parallel time complexity... 详细信息
来源: 评论
An efficient parallel algorithm for the row minima of a totally monotone matrix  53
An efficient parallel algorithm for the row minima of a tota...
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: Atallah, Mikhail J. Rao Kosaraju, S. Dept. of Computer Science Purdue University West LafayetteIN47907 United States Dept. of Computer Science Johns Hopkins University BaltimoreMD21218 United States
We give a parallel algorithm for the problem of computing the row minima of a totally monotone two-dimensional matrix. Whereas the previous best CREW-PRAM algorithm for this problem ran in O(log n log log n) time with... 详细信息
来源: 评论
parallel programming with coordination structures  91
Parallel programming with coordination structures
收藏 引用
18th acm SIGPLAN-SIGACT symposium on Principles of Programming Languages, POPL 1991
作者: Lucco, Steven Sharpt, Oliver Computer Science Division UC Berkeley 571 Evans Hall BerkeleyCA94720 United States
parallel programs display two fundamentally different kinds of execution behavior: synchronous and asynchronous. Some methodologies, such as distributed data structures, are best suited to the construction of asynchro... 详细信息
来源: 评论