Running Parallel Algorithms with APL on a Sequential Machine --by Tony Y. T. Chan Universiby of Aizu, Japan VERYAPLmt KNOWSTHE THICKthat one way to cut down on the CPU time is to avoid writing explicit APL loops. But it is not so common knowledge that when one has a choice between a sequential and a parallel algorithm for a given problem, implementing the parallel algorithm using an APL2-1ike language can achieve a substantial saving in CPU time--even on a sequential machine. This article will demonstrate the truth of that by a case study and hopes to persuade the readers to find parallel algorithm solutions to problems before implementing them in APL. T h e problem that we are dealing with is well known in the area of pattern recognition [Ref. 4], file comparison [Ref. 1, p. 158] and spelling correction. We are given a finite set ofsymbols, called the alphabet, and a finite set of edit operations. Each operation is the insertion, deletion, or subs fitution of one symbol and each operation has a cost which is a non-negative real number. Then, given two strings (words) generated from the alphabet, we want to find the minimum total cost
/lp/association-for-computing-machinery/running-parallel-algorithms-with-apl-on-a-sequential-machine-PG6qz8WXDh