咨询与建议

限定检索结果

文献类型

  • 348 篇 会议
  • 18 篇 期刊文献

馆藏范围

  • 366 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 252 篇 工学
    • 249 篇 计算机科学与技术...
    • 163 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
  • 146 篇 理学
    • 143 篇 数学
    • 23 篇 统计学(可授理学、...
    • 3 篇 生物学
    • 3 篇 系统科学
    • 1 篇 化学
  • 13 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 83 篇 parallel algorit...
  • 69 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 approximation al...
  • 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 maryland de...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...

作者

  • 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 篇 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 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 353 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures"
366 条 记 录,以下是151-160 订阅
排序:
Selecting tile shape for minimal execution time
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 201-211页
作者: Hogstedt, Karin Carter, Larry Ferrante, Jeanne Univ of California at San Diego La Jolla CA United States
Many computationally-intensive programs, such as those for differential equations, spatial interpolation, and dynamic programming, spend a large portion of their execution time in multiply-nested loops which have a re... 详细信息
来源: 评论
Data management in networks: Experimental evaluation of a provably good strategy
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 165-174页
作者: Krick, Christof Meyer auf der Heide, Friedhelm Raecke, Harald Voecking, Berthold Westermann, Matthias Univ of Paderborn Paderborn Germany
This paper deals with data management for parallel and distributed systems in which the computing nodes are connected by a relatively sparse network. We present the DIVA (Distributed Variables) library that provides f... 详细信息
来源: 评论
Making sparse matrix computations scalable
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 1-1页
作者: Demmel, Jim Univ of California Berkeley United States
Sparse matrix computations are ubiquitous in science and engineering. In particular, solving a sparse linear system of equations is the bottleneck in many computations. Of the many available algorithms, some are easy ... 详细信息
来源: 评论
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
Proceedings of the 1998 10th Annual ACM Symposium on Paralle...
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
The papers submitted to the Tenth annual acm symposium on parallel algorithms and architectures are presented. The issues considered include network protocols, parallel algorithms, multiprocessing systems, parallel pr... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Explicit multi-threading (XMT) bridging models for instruction parallelism *(extended abstract)  98
Explicit multi-threading (XMT) bridging models for instructi...
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Vishkin, U. Dascal, Sh. Berkovich, E. Nuzman, J. Univ of Maryland and Tel-Aviv Univ
This paper envisions an extension to a standard instruction set which efficiently implements PRAM-style algorithms using explicit multi-threaded instruction-level parallelism (ILP);that is, Explicit Multi-Threading (X... 详细信息
来源: 评论
Computational bounds for fundamental problems on general-purpose parallel models  98
Computational bounds for fundamental problems on general-pur...
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: MacKenzie, Ph.D. Ramachandran, V. Boise State Univ Boise ID United States
We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models QSM and s-QSW, and the distributed-memory model, the BSP. For each of t... 详细信息
来源: 评论
Analysis of first-come-first-serve parallel job scheduling
Analysis of first-come-first-serve parallel job scheduling
收藏 引用
proceedings of the 1998 9th annual acm SIAM symposium on Discrete algorithms
作者: Schwiegelshohn, Uwe Yahyapour, Ramin Univ Dortmund Dortmund Germany
This paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. Then, we propose a simple on-line algo... 详细信息
来源: 评论
Efficient disk allocation for fast similarity searching  98
Efficient disk allocation for fast similarity searching
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Prabhakar, S. Agrawal, D. El Abbadi, A. Univ of California Santa Barbara CA United States
As databases increasingly integrate non-textual information it is becoming necessary to support efficient similarity searching in addition to range searching. Recently, declustering techniques have been proposed for i... 详细信息
来源: 评论
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... 详细信息
来源: 评论