咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是131-140 订阅
排序:
Asynchronous parallel algorithm for mining association rules on a shared-memory multi-processors  98
Asynchronous parallel algorithm for mining association rules...
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Cheung, D.W. Hu, K. Xia, Sh. The Univ of Hong Kong Hong Kong Hong Kong
Mining association rules from large databases is an important problem in data mining. There is a need to develop parallel algorithm for this problem because it is a very costly computation process. However, all propos... 详细信息
来源: 评论
parallel RAMs with bounded memory wordsize  89
Parallel RAMs with bounded memory wordsize
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Bellantoni, Stephen J. Department of Computer Science University of Toronto Canada
The PRAM model of parallel computation is examined with respect to wordsize, the number of bits which can be held in each global memory cell. First, adversary arguments are used to show the incomparability of certain ... 详细信息
来源: 评论
Scheduling Threads for Constructive Cache Sharing on CMPs  07
Scheduling Threads for Constructive Cache Sharing on CMPs
收藏 引用
19th annual symposium on parallelism in algorithms and architectures
作者: Chen, Shimin Gibbons, Phillip B. Kozuch, Michael Liaskovitis, Vasileios Ailamaki, Anastassia Blelloch, Guy E. Falsafi, Babak Fix, Limor Hardavellas, Nikos Mowry, Todd C. Wilkerson, Chris Intel Res Pittsburgh Pittsburgh PA USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Intel Microproc Res Lab Pittsburgh PA USA
In chip multiprocessors (CMPs), limiting the number of offchip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently sche... 详细信息
来源: 评论
Efficient automatic simulation of parallel computation on networks of workstations
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第10期154卷 1500-1509页
作者: Kaklamanis, Christos Krizanc, Danny Montangero, Manuela Persiano, Giuseppe Univ Modena & Reggio Emilia Dipartimento Ingn Informaz I-41100 Modena Italy Univ Patras Inst Comp Technol GR-26500 Patras Greece Univ Patras Dept Comp Engn & Informat GR-26500 Patras Greece Wesleyan Univ Dept Math & Comp Sci Middletown CT 06459 USA Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi Italy
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: proceedings of the acm symposium on Theory of Computing, 1996, pp. 257-265;Improved methods for hiding latency in high bandwidth netw... 详细信息
来源: 评论
Constructing arrangements optimally in parallel  91
Constructing arrangements optimally in parallel
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Goodrich, M.T. Department of Computer Science The Johns Hopkins University Baltimore MD
We give two optimal parallel algorithms for constructing the arrangement of n lines in the plane. The first method is quite simple and runs in O(log2n) time using O(n2) work, and the second method, which is more sophi... 详细信息
来源: 评论
DREADLOCKS: Efficient Deadlock Detection  08
DREADLOCKS: Efficient Deadlock Detection
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Koskinen, Eric Herlihy, Maurice Brown Univ Dept Comp Sci Providence RI 02912 USA
We present Dreadlocks. an efficient new shared-memory spin lock that actively detects deadlocks. Instead of spinning on a Boolean value, each thread spins on the lock owner's per-thread digest, a compact represent... 详细信息
来源: 评论
Finding Strongly Connected Components in parallel using O(log2 n) Reachability Queries  08
Finding Strongly Connected Components in Parallel using <i>O...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Schudy, Warren Brown Univ Providence RI 02912 USA
We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log(2) n) multi-source parallel reachability querie... 详细信息
来源: 评论
Optimal trade-offs between size and slowdown for universal parallel networks
Optimal trade-offs between size and slowdown for universal p...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Meyer auf der Heide, Friedhelm Storch, Martin Wanka, Rolf Univ of Paderborn Paderborn Germany
In this paper, we address the question how efficiently a single constant-degree processor network can simulate the computation of any constant-degree processor network. We show the following lower bound trade-off: If ... 详细信息
来源: 评论
SPAA'11 - proceedings of the 23rd annual symposium on parallelism in algorithms and architectures
SPAA'11 - Proceedings of the 23rd Annual Symposium on Parall...
收藏 引用
23rd acm symposium on parallelism in algorithms and architectures, SPAA'11
The proceedings contain 50 papers. The topics discussed include: graph expansion and communication costs of fast matrix multiplication;near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch...
来源: 评论
Efficient load balancing and data remapping for adaptive grid calculations  97
Efficient load balancing and data remapping for adaptive gri...
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Oliker, Leonid Biswas, Rupak NASA Ames Research Cent Moffett Field CA United States
Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads ... 详细信息
来源: 评论