【英文】软件工程大会论文集 (79).pdf

plexit y Measure of Programming
for P arallel Algorithm
Hiromi Koba y ashi
Departmen t of Managemen t Engineering, T ok ai Univ ersit y
1117 Kita-k aname, Hiratsuk a 259-1292, Japan
k oba y ******@k ey .u-tok ai.
Abstract
plexit y measure of transformation from a par-
allel algorithm to a program in m ultipro cessor par-
Some alogorithms are scarcely used ev en if they
puters. W e pro vide denitions and criteria
are sup erior in plexit y and plexit y
of this measure and explain b y using examples in
due to dicult y of programming in parallel pro cess-
this pap er. A measure of programmi plexit y
ing. Then, complexit y measures of programming for
called an or der of p attern is prop osed in this pap er.
alogorithm are needed. This pap er presen ts -
The main idea of this measure is that programmi ng
plexit y or, dicult y measure of programmi ng, .,
is easy when pro cesses at ev ery step in ev ery no de
plexit y measure of transformation from a paral-
dep end up on a simple rule pattern.
lel algorithm to a program, in m ultipro cessor parallel
As the rst step of this researc h, a limited arc hi-
computers. Programming can b e assumed to b e easy
tecture that is a m ultipro w puter
when pro cesses at ev ery step in ev ery no de dep end
comp osed of a plen t y parativ ely ne grain
up on a simple rule pattern. W e prop