咨询与建议

限定检索结果

文献类型

  • 1,503 篇 会议
  • 108 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 1,171 篇 工学
    • 1,114 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 582 篇 理学
    • 560 篇 数学
    • 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...
  • 73 篇 parallel process...
  • 57 篇 algorithms
  • 57 篇 parallel program...
  • 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...
  • 6 篇 carnegie mellon ...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...

作者

  • 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,571 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1611 条 记 录,以下是101-110 订阅
排序:
Finding connected components on a scan line array processor  95
Finding connected components on a scan line array processor
收藏 引用
Proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Greenberg, Ronald I. Univ of Maryland College Park MD United States
This paper provides a new approach to labeling the connected components of an n × n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaran... 详细信息
来源: 评论
Quantitative comparison of parallel computation models
Quantitative comparison of parallel computation models
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Juurlink, Ben H.H. Wijshoff, Harry A.G. Leiden Univ Leiden Netherlands
This paper experimentally validates performance related issues for parallel computation models on several parallel platforms (a MasPar MP-1 with 1024 processors, a 64-node GCel and a CM-5 of 64 processors). Our work c... 详细信息
来源: 评论
Brief Announcement: Better Speedups for parallel Max-Flow  11
Brief Announcement: Better Speedups for Parallel Max-Flow
收藏 引用
23rd annual symposium on parallelism in algorithms and architectures
作者: Caragea, George C. Vishkin, Uzi Univ Maryland Dept Comp Sci College Pk MD 20742 USA
We present a parallel solution to the Maximum-Flow (Max-Flow) problem, suitable for a modern many-core architecture. We show that by starting from a PRAM algorithm, following an established "programmer's work... 详细信息
来源: 评论
Towards efficiency and portability: Programming with the BSP model
Towards efficiency and portability: Programming with the BSP...
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Goudreau, Mark Lang, Kevin Rao, Satish Suel, Torsten Tsantilas, Thanasis Univ of Central Florida Orlando United States
The Bulk-Synchronous parallel (BSP) model was proposed by Valiant as a model for general-purpose parallel computation. The objective of the model is to allow the design of parallel programs that can be executed effici... 详细信息
来源: 评论
Intersecting line segments in parallel with an output-sensitive number of processors  89
Intersecting line segments in parallel with an output-sensit...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Goodrich, Michael T. Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States
We give an efficient parallel algorithm for constructing the arrangement of n line segments in the plane, i.e., the planar graph 'determined by the segment endpoints and intersections. Our algorithm is efficient r... 详细信息
来源: 评论
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 =... 详细信息
来源: 评论
Brief Announcement: A parallel (?, G)-Stepping Algorithm for the Constrained Shortest Path Problem  34
Brief Announcement: A Parallel (?, G)-Stepping Algorithm for...
收藏 引用
34th acm symposium on parallelism in algorithms and architectures, SPAA 2022
作者: Bahreini, Tayebeh Fisher, Nathan Grosu, Daniel Wayne State University DetroitMI United States
We design a parallel algorithm for the Constrained Shortest Path (CSP) problem. The CSP problem is known to be NP-hard and there exists a pseudo-polynomial time sequential algorithm that solves it. To design the paral... 详细信息
来源: 评论
Low Depth Cache-Oblivious algorithms  10
Low Depth Cache-Oblivious Algorithms
收藏 引用
22nd acm symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on parallel machines with private or shared caches The approach is to design nested-parallel... 详细信息
来源: 评论
Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
Pursuit and evasion on a ring: An infinite hierarchy for par...
收藏 引用
13th annual symposium on parallel algorithms and architectures (SPAA 2001)
作者: Bruda, S.D. Akl, S.G. Dept. of Computing and Info. Science Queen's University Kingston Ont. K7L 3N6 Canada
A parallel real-time complexity theory was presented to study infinity hierarchy for parallel real-time systems. Set of timed ω-languages was closed under intersection, union, complement, concatenation and Kleene clo... 详细信息
来源: 评论
Better trade-offs for parallel list ranking  97
Better trade-offs for parallel list ranking
收藏 引用
Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Sibeyn, Jop F. Max-Plank-Inst fuer Informatik Saarbruecken Germany
An earlier parallel list ranking algorithm performs well for problem sizes N that are extremely large in comparison to the number of PUs P. However, no existing algorithm gives good performance for reasonable loads. W... 详细信息
来源: 评论