Massimult: A Novel Parallel CPU Architecture Based on Combinator Reduction

TL;DR

Massimult introduces a new CPU architecture leveraging combinator reduction, enabling highly parallel, energy-efficient, and secure computation, with a novel machine language and abstract machine designed for scalable hardware implementation.

Contribution

The paper presents a novel CPU architecture based on combinator reduction, including a new machine language and abstract machine that exploit parallelism and locality for improved performance and security.

Findings

Faster computation with lower energy consumption

Enhanced scalability across multiple processors

Improved security against attacks

Abstract

The Massimult project aims to design and implement an innovative CPU architecture based on combinator reduction with a novel combinator base and a new abstract machine. The evaluation of programs within this architecture is inherently highly parallel and localized, allowing for faster computation, reduced energy consumption, improved scalability, enhanced reliability, and increased resistance to attacks. In this paper, we introduce the machine language LambdaM, detail its compilation into KVY assembler code, and describe the abstract machine Matrima. The best part of Matrima is its ability to exploit inherent parallelism and locality in combinator reduction, leading to significantly faster computations with lower energy consumption, scalability across multiple processors, and enhanced security against various types of attacks. Matrima can be simulated as a software virtual machine and is intended for future hardware implementation.