咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 2 篇 parallel randomi...
  • 1 篇 execution times
  • 1 篇 linear-time algo...
  • 1 篇 intel paragon
  • 1 篇 parallel program...
  • 1 篇 pfast algorithm
  • 1 篇 compile-time sch...
  • 1 篇 casch tool
  • 1 篇 directed acyclic...
  • 1 篇 computer-aided p...
  • 1 篇 running time con...
  • 1 篇 computer-aided s...
  • 1 篇 maximal matching
  • 1 篇 multiprocessors
  • 1 篇 parallel program...
  • 1 篇 parallel random ...
  • 1 篇 time complexity
  • 1 篇 parallel fast as...

机构

  • 1 篇 school of electr...

作者

  • 1 篇 s. k. dhall
  • 1 篇 s. lakshmivaraha...
  • 1 篇 i. ahmad
  • 1 篇 yu-kwong kwok
  • 1 篇 s. b. yang

语言

  • 2 篇 英文
检索条件"主题词=parallel randomized algorithm"
2 条 记 录,以下是1-10 订阅
A parallel algorithm For Compile-Time Scheduling Of parallel Programs On Multiprocessors  97
A Parallel Algorithm For Compile-Time Scheduling Of Parallel...
收藏 引用
Proceedings of the 1997 International Conference on parallel Architectures and Compilation Techniques
作者: Yu-Kwong Kwok I. Ahmad
Proposes a parallel randomized algorithm, called PFAST (parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST a... 详细信息
来源: 评论
AN IMPROVED MAXIMAL MATCHING algorithm
收藏 引用
parallel Processing Letters 1991年 第2期1卷 135-142页
作者: S. B. YANG S. K. DHALL S. LAKSHMIVARAHAN School of Electrical Engineering and Computer Science University of Oklahoma Norman Oklahoma 73019 U.S.A.
In this paper we present a randomized parallel maximal matching algorithm that requires only O(n) processors on an. EREW PRAM, where n is the number of vertices in an undirected graph G = (V, E). Our algorithm outputs... 详细信息
来源: 评论