咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是1391-1400 订阅
排序:
Efficient parallel algorithms on restartable fail-stop processors  91
Efficient parallel algorithms on restartable fail-stop proce...
收藏 引用
10th annual acm symposium on Principles of Distributed Computing, PODC 1991
作者: Kanellakis, Paris C. Shvartsman, Alex A. Computer Science Dept. Brown University PO Box 1910 ProvidenceRI02912 United States Digital Equipment Corporation 550 King Street LittletonMA01460 United States
We study efficient deterministic executions of parallel algorithms on restartable fail-stop CRCW PRAMs. We allow the PRAM processors to be subject to arbitrary stop failures and restarts, that are determined by an on-... 详细信息
来源: 评论
Randomized parallel algorithms for trapezoidal diagrams  91
Randomized parallel algorithms for trapezoidal diagrams
收藏 引用
Proceedings of the Seventh annual symposium on Computational Geometry
作者: Clarkson, K.L. Cole, R. Tarjan, R.E. AT&T Bell Labs Courant Institute New York University Princeton University and NEC Research Institute
We describe randomized parallel CREW PRAM algorithms for building trapezoidal diagrams of line segments in the plane. For general segments, we give an algorithm requiring optimal O(A + nlogn) expected work and optimal... 详细信息
来源: 评论
Object-oriented fortran for development of portable parallel programs  3
Object-oriented fortran for development of portable parallel...
收藏 引用
Proceedings of the Third IEEE symposium on parallel and Distributed Processing
作者: Reese, D.S. Luke, E. Mississippi State University NSF ERC for Computational Field Simulation United States
parallel programming has to date remained inaccessible to the average scientific programmer. parallel programming languages are generally foreign to most scientific applications programmers who only speak Fortran. Aut... 详细信息
来源: 评论
Efficient sequential and parallel algorithms for computing recovery points in trees and paths  53
Efficient sequential and parallel algorithms for computing r...
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: Chrobak, Marek Eppstein, David Italiano, Giuseppe F. Yung, Moti Department of Computer Science University of California RiversideCA92521 United States Xerox PARC Palo AltoCA94304 United States University of California IrvineCA92717 United States Department of Computer Science Columbia University New YorkNY10027 United States Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Roma Italy IBM Research Division T.J. Watson Research Center Yorktown HeightsNY10598 United States
We present efficient sequential and parallel algorithms for the problem of finding an optimal placement of recovery points in a tree (and in a path) system. The placement of recovery points together with rollback mech... 详细信息
来源: 评论
Constant-Time parallel integer sorting  91
Constant-Time parallel integer sorting
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Hagerup, Torben Max-Planck-Institut fur Informatik SaarbruckenW-6600 Germany
We investigate a nonstandard output convention for sorting. Specifically, the input elements are to be returned not in an array sorted in *** order, but in a linked list sorted in nondecreasing order. This problem, wh... 详细信息
来源: 评论
Ultra-fast expected time parallel algorithms  53
Ultra-fast expected time parallel algorithms
收藏 引用
2nd annual acm-SIAM symposium on Discrete algorithms, SODA 1991
作者: 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
It has been shown previously that given n items and a polynomial number of processors, sorting these items into n locations requires Ω(log n/log log n) time. We sidestep this lower bound with a new technique called P... 详细信息
来源: 评论
A new technique for induct ion variable removal  24
A new technique for induct ion variable removal
收藏 引用
24th annual International symposium on Microarchitecture, MICRO 1991
作者: Wang, Haigeng Nicolau, Alexandru Potasman, Roni Information and Computer Science Department University of California IrvineCA United States Dept. of Electrical and Computer Engineering University of California IrvineCA United States
Removing redundant loop induction variables(IV's) in a sequential program can improve the code performance by making effective use of registers and reducing the dynamic instruction count in the loop. At the microc... 详细信息
来源: 评论
A parallel system for test pattern generation  3
A parallel system for test pattern generation
收藏 引用
3rd IEEE symposium on parallel and Distributed Processing, PDPS 1991
作者: Balboni, G.P. Cabodi, G.P. Gai, S. Sismondi, D. Reorda, M.S. CSELT Torino Italy Dip. Automatica e Informatica Politecnico di Torino Torino Italy
The problem of generating test pattern sequences for digital circuits is a crucial one in the area of electronic CAD. While a significant effort has been made to develop new and more powerful algorithms to solve it, t... 详细信息
来源: 评论
Wait-free parallel algorithms for the union-find problem  91
Wait-free parallel algorithms for the union-find problem
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Anderson, Richard J. Wont, Heather University of Washington United States University of California San Diego United States
We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the union-find data structure. Our machine model is asynchronous and allows stopping faults. Thus ... 详细信息
来源: 评论
Combining tentative and definite executions for very fast i)ependable parallel computing  23
Combining tentative and definite executions for very fast i)...
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Kedem, Z.M. Palem, K.V. Raghunathan, A. Spirakis, P.G. Ecole des Hautes Etudes en Jniormatique Université René Descartes 45 rue des Saints-Pares Paris75006 France Department of Computer Science New York University 251 Mercer St New YorkNY10012-1185 United States Research Center and the Institute for Advanced Computer Studies University of Maryland. IBM Research Division T. 3. Watson Research Center P. 0. Box 704 Yorktown HeightNY10598 United States Computer Science Division University of California DavisCA95616 United States Computer Technology Institute Patras University P. 0. Box 1122 Patras26110 Greece
We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail dur... 详细信息
来源: 评论