The Programmable Algorithm Machine (PAM). Part 1. Theory.
Maniel Vineberg · Defense Technical Information Center (DTIC) · 1976
This is Part 1 of a document which describes a Programmable Algorithm Machine (PAM). The proposed architecture includes multiple processing elements, spearate instruction and operand memories, instruction pipelining, and extensibility. The PAM can be programmed in the PAM High-Level Language (PHIL) or in the PAM Assembly Language (PAL). PHIL is an algorithmic programming language; PAL is based upon postfix assignment statements. A single parameterized compiler/assembler translates PHIL programs into PAL and maps PAL programs on to the PAM. A single parameterized simulation models the PAM family. Suggested applications for the PAM are described in Part 2 (Applications) of this document. (Author)