咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是111-120 订阅
排序:
Processor efficient parallel matching
收藏 引用
THEORY OF COMPUTING SYSTEMS 2008年 第1期42卷 73-90页
作者: Sankowski, Piotr Warsaw Univ Inst Informat PL-02097 Warsaw Poland
In this paper we consider the problem of finding perfect matchings in parallel. We present a RNC algorithm with almost optimal work with respect to sequential algorithms, i.e., it uses O(n(omega)) processors, where om... 详细信息
来源: 评论
SPAA'21 panel paper: Architecture-friendly algorithms versus algorithm-friendly architectures  21
SPAA'21 panel paper: Architecture-friendly algorithms versus...
收藏 引用
33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021
作者: Blelloch, Guy Dally, William Martonosi, Margraret Vishkin, Uzi Yelick, Katherine Carnegie Mellon University Pittsburgh United States NVIDIA Santa Clara United States Pricneton University Princeton United States College Park United States University of California Berkeley Electrical Engineering and Computer Sciences Berkeley United States
The current paper provides preliminary statements of the panelists ahead of a panel discussion at the acm SPAA 2021 conference on the topic: algorithm-friendly architecture versus architecture-friendly algorithms. ... 详细信息
来源: 评论
Analysis of gang scheduling for multiprogrammed parallel computing environments
Analysis of gang scheduling for multiprogrammed parallel com...
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Squillante, Mark S. Wang, Fang Papaefthymiou, Marios T.J. Watson Research Cent Yorktown Heights NY United States
Gang scheduling is a resource management scheme for parallel and distributed systems that combines time-sharing with space-sharing to ensure short response times for interactive tasks and high overall system throughpu... 详细信息
来源: 评论
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm  97
Implementation and evaluation of an efficient parallel Delau...
收藏 引用
Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Hardwick, Jonathan C. Carnegie Mellon Univ Pittsburgh PA United States
This paper describes the derivation of an empirically efficient parallel two-dimensional Delaunay triangulation program from a theoretically efficient CREW PRAM algorithm. Compared to previous work, the resulting impl... 详细信息
来源: 评论
Directed Transmission Method, a Fully Asynchronous Approach to Solve Sparse Linear Systems in parallel  08
Directed Transmission Method, a Fully Asynchronous Approach ...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Wei, Fei Yang, Huazhong Tsinghua Univ Dept Elect Engn Beijing Peoples R China
There are many algorithms to solve large sparse linear systems in parallel;however, most of them acquire synchronization and thus are lack of scalability. In this paper, we propose a new distributed numerical algorith... 详细信息
来源: 评论
Analyses of load stealing models based on differential equations  98
Analyses of load stealing models based on differential equat...
收藏 引用
Proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Mitzenmacher, M. Digital Systems Research Cent Palo Alto CA United States
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the number of processors grows to infinity usi... 详细信息
来源: 评论
Modeling parallel bandwidth: Local vs. global restrictions
Modeling parallel bandwidth: Local vs. global restrictions
收藏 引用
Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Adler, Micah Gibbons, Phillip B. Matias, Yossi Ramachandran, Vijaya Heinz Nixdorf Inst Paderborn Germany
Recently there has been an increasing interest in models of parallel computation that account for the bandwidth limitations in communication networks. Some models (e.g., BSP and LOGP) account for bandwidth limitations... 详细信息
来源: 评论
O(n log log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
O(n log log n)-work parallel algorithms for straight-line gr...
收藏 引用
4th annual acm symposium on parallel algorithms and architectures - SPAA '92
作者: Fuerer, Martin He, Xin Kao, Ming-Yang Raghavachari, Balaji Pennsylvania State Univ University Park United States
A straight-line grid embedding of a planar graph is a drawing of the graph on a plane where the vertices are located at grid points and the edges are represented by nonintersecting segments of straight lines joining t... 详细信息
来源: 评论
ASYNCHRONOUS SHARED MEMORY parallel COMPUTATION - (PRELIMINARY VERSION)  90
ASYNCHRONOUS SHARED MEMORY PARALLEL COMPUTATION - (PRELIMINA...
收藏 引用
2ND annual SYMP OF THE ASSOC FOR COMPUTING MACHINERY : parallel algorithms AND architectures ( SPAA 90 ) / AEGEAN WORKSHOP ON COMPUTING
作者: NISHIMURA, N University of Toronto
The contributions of this paper are twofold. First, we outline criteria by which any model of asynchronous shared memory parallel computation can be judged. Previous models are considered with respect to these factors... 详细信息
来源: 评论
On multiprocessor system scheduling  96
On multiprocessor system scheduling
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Deng, Xiaotie Dymond, Patrick York Univ North York Ont Canada
The issue of effectiveness of private caches for processors were studied. Since time for all processors to access the shared memory simultaneously is usually much longer than the time for a processor to access its own... 详细信息
来源: 评论