咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是161-170 订阅
排序:
Sparse parallel Delaunay Mesh Refinement  07
Sparse Parallel Delaunay Mesh Refinement
收藏 引用
19th annual symposium on parallelism in algorithms and architectures
作者: Hudson, Benoit Miller, Gary L. Phillips, Todd Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA
The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with piecewise-linear constraining (P... 详细信息
来源: 评论
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 neighbourhood modeling: Research summary
Parallel neighbourhood modeling: Research summary
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Hutchinson, D. Kuttner, L. Lanthier, M. Maheshwari, A. Nussbaum, D. Roytenberg, D. Sack, J.-R. Carleton Univ Ottawa Canada
NEighborhood MOdeling (NEMO) provides transparent parallelism to develop parallel spatial data processing. It addresses the following parallel issues: architecture and machine independence;communication bottlenecks;da... 详细信息
来源: 评论
Brief Announcement: Low Depth Cache-Oblivious Sorting  09
Brief Announcement: Low Depth Cache-Oblivious Sorting
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifies (cache size and cache line size) of each leve... 详细信息
来源: 评论
Randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Randomized parallel 3D convex hull algorithm for coarse grai...
收藏 引用
Proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Dehne, Frank Deng, Xiaotie Dymond, Patrick Fabri, Andreas Khokhar, Ashfaq A. Carleton Univ Ottawa Canada
We present a randomized parallel algorithm for constructing the 3D convex hull on a generic p-processor coarse grained multicomputer with arbitrary interconnection network and n/p local memory per processor, where n/p... 详细信息
来源: 评论
Reconstructing Binary Trees in parallel  20
Reconstructing Binary Trees in Parallel
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020
作者: Afshar, Ramtin Goodrich, Michael T. Matias, Pedro Osegueda, Martha C. University of California Irvine United States
We study the parallel query complexity of reconstructing binary trees from simple queries involving their nodes. We show that a querier can efficiently reconstruct a binary tree with a logarithmic number of rounds and... 详细信息
来源: 评论
LogGP: incorporating long messages into the LogP model - one step closer towards a realistic model for parallel computation
LogGP: incorporating long messages into the LogP model - one...
收藏 引用
Proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Alexandrov, Albert Ionescu, Mihai F. Schauser, Klaus E. Scheiman, Chris Univ of California Santa Barbara United States
The original LogP model for parallel computation use four parameters;the communication latency (L), overhead (n), bandwidth (g), and the number of processors (P). This basic model is extended with a linear model for l... 详细信息
来源: 评论
Fast deterministic approximate and exact parallel sorting  93
Fast deterministic approximate and exact parallel sorting
收藏 引用
Proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Hagerup, Torben Max-Planck-Institut Für Informatik Im Stadtwald Saarbrücken W-6600 Germany UMIACS University of Maryland College Park 20742 MD United States
Padded sorting requires n input keys to be output in sorted order in an array with slightly more than n locations, unused locations being filled with a special null value. We show that a deterministic CRCW PRAM with k... 详细信息
来源: 评论
Dynamic load balancing framework for unstructured adaptive computations on distributed-memory multiprocessors
Dynamic load balancing framework for unstructured adaptive c...
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Sohn, Andrew Biswas, Rupak Simon, Horst D. New Jersey Inst of Technology Newark United States
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn, requires signific... 详细信息
来源: 评论
Three-dimensional pattern matching  97
Three-dimensional pattern matching
收藏 引用
Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Galil, Zvi Park, Jong Geun Park, Kunsoo Columbia Univ NY United States
We present a parallel algorithm on a CRCW PRAM for three-dimensional pattern matching, i.e., finding all occurrences of a pattern of size m3 in a text of size n3. The text search of the algorithm is alphabet-independe... 详细信息
来源: 评论