咨询与建议

限定检索结果

文献类型

  • 5,684 篇 会议
  • 3,510 篇 期刊文献
  • 34 篇 学位论文
  • 4 册 图书
  • 1 篇 资讯

馆藏范围

  • 9,233 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5,519 篇 工学
    • 4,505 篇 计算机科学与技术...
    • 1,617 篇 软件工程
    • 1,423 篇 电气工程
    • 455 篇 信息与通信工程
    • 299 篇 控制科学与工程
    • 268 篇 电子科学与技术(可...
    • 95 篇 仪器科学与技术
    • 78 篇 力学(可授工学、理...
    • 76 篇 机械工程
    • 66 篇 动力工程及工程热...
    • 64 篇 化学工程与技术
    • 60 篇 生物工程
    • 55 篇 生物医学工程(可授...
    • 51 篇 农业工程
    • 50 篇 材料科学与工程(可...
    • 43 篇 土木工程
    • 39 篇 光学工程
    • 31 篇 建筑学
  • 2,444 篇 理学
    • 2,003 篇 数学
    • 334 篇 物理学
    • 150 篇 统计学(可授理学、...
    • 113 篇 系统科学
    • 97 篇 生物学
    • 94 篇 化学
  • 518 篇 管理学
    • 403 篇 管理科学与工程(可...
    • 123 篇 图书情报与档案管...
    • 78 篇 工商管理
  • 81 篇 医学
    • 58 篇 临床医学
  • 67 篇 农学
    • 62 篇 作物学
  • 37 篇 经济学
    • 35 篇 应用经济学
  • 28 篇 法学
  • 13 篇 文学
  • 8 篇 教育学
  • 5 篇 艺术学
  • 4 篇 军事学

主题

  • 9,233 篇 parallel algorit...
  • 1,156 篇 concurrent compu...
  • 847 篇 algorithm design...
  • 672 篇 parallel process...
  • 616 篇 computer science
  • 462 篇 computational mo...
  • 375 篇 computer archite...
  • 289 篇 phase change ran...
  • 232 篇 application soft...
  • 224 篇 parallel archite...
  • 215 篇 hypercubes
  • 200 篇 very large scale...
  • 198 篇 parallel program...
  • 198 篇 costs
  • 178 篇 scalability
  • 176 篇 sorting
  • 166 篇 hardware
  • 151 篇 data mining
  • 147 篇 routing
  • 146 篇 clustering algor...

机构

  • 26 篇 carnegie mellon ...
  • 19 篇 school of electr...
  • 18 篇 department of co...
  • 17 篇 ibm thomas j. wa...
  • 16 篇 department of co...
  • 15 篇 old dominion uni...
  • 15 篇 hiroshima univ d...
  • 13 篇 school of comput...
  • 13 篇 purdue univ dept...
  • 13 篇 univ texas dept ...
  • 12 篇 georgia inst tec...
  • 12 篇 univ maryland de...
  • 12 篇 old dominion uni...
  • 11 篇 swiss fed inst t...
  • 11 篇 univ maryland co...
  • 11 篇 univ maryland in...
  • 10 篇 georgia inst tec...
  • 10 篇 department of co...
  • 10 篇 department of co...
  • 10 篇 eth zurich

作者

  • 35 篇 shun julian
  • 33 篇 olariu s
  • 30 篇 p. banerjee
  • 30 篇 blelloch guy e.
  • 26 篇 nakano koji
  • 24 篇 bader david a.
  • 18 篇 dhulipala laxman
  • 18 篇 gu yan
  • 17 篇 ito yasuaki
  • 16 篇 schwing jl
  • 15 篇 v. kumar
  • 15 篇 khan maleq
  • 14 篇 ballard grey
  • 14 篇 sun yihan
  • 14 篇 shi-jinn horng
  • 14 篇 vishkin uzi
  • 13 篇 takefuji y
  • 13 篇 banerjee p
  • 13 篇 han yj
  • 13 篇 s. olariu

语言

  • 8,892 篇 英文
  • 256 篇 其他
  • 61 篇 中文
  • 9 篇 俄文
  • 7 篇 德文
  • 5 篇 法文
  • 3 篇 西班牙文
检索条件"主题词=Parallel algorithms"
9233 条 记 录,以下是4961-4970 订阅
排序:
Approximating Huffman codes in parallel
收藏 引用
29th International Colloquium on Automata, Languages and Programming
作者: Berman, P Karpinski, M Nekrich, Y Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Univ Bonn Dept Comp Sci D-5300 Bonn Germany
In this paper we present new results on the approximate parallel construction of Huffman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the... 详细信息
来源: 评论
parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Parallel integer sorting is more efficient than parallel com...
收藏 引用
10th Annual ACM-SIAM Symposium on Discrete algorithms
作者: Han, YJ Shen, XJ Univ Missouri Sch Interdisciplinary Comp & Engn Kansas City MO 64110 USA
We present a significant improvement for parallel integer sorting. On the EREW (exclusive read exclusive write) PRAM our algorithm sorts n integers in the range {0, 1,..., m 1} in time O(log n) with O(n(q) (log n) ove... 详细信息
来源: 评论
parallel randomization for large structured Markov chains
Parallel randomization for large structured Markov chains
收藏 引用
International Conference on Dependable Systems and Networks
作者: Kemper, P Univ Dortmund Informat 4 D-44221 Dortmund Germany
Multiprocessor architectures with few but powerful processors gain more and more popularity. In this paper we describe a parallel iterative algorithm to perform randomization for a continuous time Markov, chain with a... 详细信息
来源: 评论
Finding a 2-core of a tree in linear time
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第2期15卷 193-210页
作者: Wang, BF Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30043 Taiwan
Let T e an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where p greater than or equal to 1 is an in... 详细信息
来源: 评论
A note on constructing binary heaps with periodic networks
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第3期83卷 129-134页
作者: Piotrów, M Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland
We consider the problem of constructing binary heaps on constant degree networks performing compare-exchange operations only. The heap data structure, introduced by William and Williams [Comm. ACM 7 (6) (1964) 347-348... 详细信息
来源: 评论
Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers
收藏 引用
ADVANCES IN ENGINEERING SOFTWARE 2002年 第3期33卷 169-177页
作者: Yang, LT Brent, RP St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada Univ Oxford Comp Lab Oxford OX1 3QD England
For the solutions of linear systems of equations with unsymmetric coefficient matrices, we have proposed an improved version of the quasi-minimal residual (IQMR) method [Proceedings of The International Conference on ... 详细信息
来源: 评论
Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2002年 第6期51卷 702-707页
作者: Han, YJ Pan, Y Shen, H Elect Data Syst Inc Troy MI 48098 USA Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Japan Adv Inst Sci & Technol Grad Sch Informat Sci Tatsunokuchi Ishikawa 9231292 Japan
The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model, where processors are connected by a reconfigurable optical bus. In this paper, we show that the ... 详细信息
来源: 评论
Scaling multiple addition and prefix sums on the reconfigurable mesh
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第6期82卷 277-282页
作者: Trahan, JL Vaidyanathan, R Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA
Multiple addition is the problem of adding N b-bit integers. Prefix sums and multiple addition play fundamental roles in many algorithms, particularly on the reconfigurable mesh (R-Mesh). Scaling algorithms on the R-M... 详细信息
来源: 评论
Near optimal Cholesky factorization on orthogonal multiprocessors
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第1期84卷 23-30页
作者: Bansal, SS Vishal, B Gupta, P Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India
The effect of data allocation strategies on the running time of parallel Cholesky factorization algorithms on orthogonal multiprocessors has been studied. Four new strategies which give better running time are propose... 详细信息
来源: 评论
Fast gossiping in square meshes/tori with bounded-size packets
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2002年 第4期13卷 349-358页
作者: Lau, FCM Zhang, SH Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China
Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many... 详细信息
来源: 评论