A STUDY ON THE REPLlCATED DATA ALGORITHM FOR SOLVING THE SINGLE SOURCE SHORTEST PATH PROBLEM
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This paper first proposes a data parallel algorithm and a replicated data algo-rithm for the graph theoretic operation of computing the single source shortest paths and demonstrates the generality of the data replicated technique by applying it to the graph theoretic operation for solving SSSP problems,then computes and discusses the speedup of the replicated data algorithm over the data parallel algorithm,finally points out that the data replication technique is not only applicable to fast image analysis,hut also is general enouth to be applicable to a large class of the graph theoretic operation problems.

    Reference
    Related
    Cited by
Get Citation

杨敬安.求解SSSP问题图运算的复制数据算法*.软件学报,1996,7(zk):394-399

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 09,1995
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063