🚀 go-pugleaf

In article <26765@cup.portal.com> bcase@cup.portal.com (Brian bcase Case) writes:
>>Vector machines always run faster on vector problems than non vector
>>machines.  Even if the cycle time is a little slower.

>I don't believe this.  See the WM-machine architecture proposed by
>W. Wulf.  This is a general-purpose architecture that can achieve
>vector rates without actual vector hardware (well, the memory system
>has to be done right, but there are no vector instructions).

The proposed WM machine assumes a memory access unit that is
programmed to access a linear data structure with a base address, a
stride, and a length.  That's a "vector move" instruction.  The WM
combines this with a Multiflow-style RISC-VLIW instruction set and
huge register file.  I have no doubts this machine can match standard
vector machine performance; in my opinion, it also qualifies as a
vector machine, as it has all the key features.
:-) Stan