Sciweavers

APL
1998
ACM

Reducing computational complexity with array predicates

13 years 7 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. The search primitives, indexof and set membership, and the sorting primitives, upgrade and downgrade, execute in linear time on such arguments. Our contribution, a method for static determination of array properties, lets us generate code that is optimized for special cases of primitives. Our approach eliminates runtime checks which would otherwise slow down the execution of all cases of the effected primitives. We use the same analysis technique to reduce the type complexity of certain array primitives.
Robert Bernecky
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where APL
Authors Robert Bernecky
Comments (0)