期刊名称：International Journal of Computer Systems Science and Engineering
印刷版ISSN：1307-430X
出版年度：2008
卷号：04
期号：01
页码：1-1
出版社：World Academy of Science, Engineering and Technology
摘要：In this paper, a mathematical framework for
the complexity analysis of parallel algorithms is presented.
The well-known dual complexity setting is recuperated as a
particular case of this new construction which is based on
the notion of an extended quasi-pseudo-metric. The theory is
illustrated by some examples.
Loading...
