摘要
本文针对集群的最短路径的并行算法的研究,通过对运行时间的分析,讨论了在确定规模下的并行程序所能获得的最大加速比。
This paper focuses on the maximum accelerator ratio.It can be got from the concurrency programs,which runs under certain scale. The research on the concurrency about the shortest path of set group,and the analysis of the running time are discussed.
出处
《渤海大学学报(自然科学版)》
CAS
2004年第3期230-232,共3页
Journal of Bohai University:Natural Science Edition
关键词
集群
加速比
加速效率
最短路径
set group
accelerator ratio
accelerator efficiency
shortest path