We present an algorithm that explicitly generates all full-span regular sub arrays of a given N dimensional regular array. By explicit, we mean that we generate the N-dimensional indexes of the j-dimensional sub array...
详细信息
ISBN:
(纸本)9781581136685
We present an algorithm that explicitly generates all full-span regular sub arrays of a given N dimensional regular array. By explicit, we mean that we generate the N-dimensional indexes of the j-dimensional sub array cells that make up each j-dimensional sub array. The algorithm can be viewed as generating all j-dimensional full span sub arrays for fixed j, for j = 0 to j = N. We first list some lemmas and definitions, and then give the algorithm that is based upon the knowledge gained from a new expansion [1] and [2]. There is an alternate combinatorial argument yielding the same algorithm. First we give an heuristic summary and then a more detailed example use. In the algorithm, we use apl-C-Java order in the indexes, i.e., right-to-left (RTL). However, essentially the same algorithm (except for transpositions) holds for left-to-right (LTR) order as used in FORTRAN. In the exposition, we use mathematical notation, which is LTR. There is a Java 1.4 code and an apl WS available. The Java code requires an interactive input of the dimension of the original array and its shape vector. The apl WS contains FNS that work the same way, and others that can be used as callable sub FNS. An appendix exhibits the apl code that computes this algorithm for a given j.
F-Script is a Smalltalk-like interactive scripting language based on the Mac OS X object model. F-Script provides scripting and interactive access to Mac OS X frameworks and custom objects. It also introduces an innov...
详细信息
ISBN:
(纸本)1581137516
F-Script is a Smalltalk-like interactive scripting language based on the Mac OS X object model. F-Script provides scripting and interactive access to Mac OS X frameworks and custom objects. It also introduces an innovative high-level object-oriented programming model based on apl-like arrayprogramming principles.
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level arrayprogramming in the style of apl offers a f...
详细信息
ISBN:
(纸本)0889863415
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level arrayprogramming in the style of apl offers a far more concise and abstract approach than traditional scalar languages such as C/C++ or FORTRAN-77. The same sort of applications often can also be characterized as performance critical and today represents the major domain for parallel processing. This paper reports on the development of a compiler backend which allows to implicitly generate multithreaded code from high-level array program specifications. On shared memory multiprocessor systems, this code can be executed in parallel without any additional programming effort. After sketching out basic compilation schemes, optimizations on the runtime system are addressed and, finally, experimental runtime figures are presented.
暂无评论