The kernel logic manual was the design document for the 370 kernel. When a discrepancy between the manual and the kernel code was found, the code was deemed to be wrong!

First there are a few historical and philosophical notes about patterns found in the kernel and antecedents to these patterns. See adapted data for notes on streamlining node state for accelerating kernel transactions, and adaptive formats for even older simpler precursors. Next some platitudes on why the kernel is fast, large, and yet trustworthy:

The kernel is bigger than its semantics would suggest in part for reasons of efficiency. Considerable additional code is devoted to guarding against bugs in this extra code.

EROS hackers will find little new so far. This terminology map between Keykos and EROS may help in the following. Next there is some meat where Keykos differs from EROS: Prepared keys allow for quicker access to the object designated by a key. Prepared keys are also quickly found starting from the thing they designate. The kernel queue structure exploits this. You might start exploring at the core table.

Nodes may also be prepared and this leads to involved keys. Here are the particular ways that nodes may be prepared:
Meters are much more efficient than their external specs suggest.
Domains are adapted for quick starts and stops.
The prepared segment is the most complex of the data adaptations.

Rescinding Keys, Revoking access to memory, Kernel Disk Logic

The kernel deals with locks in a unified fashion.

Some notes on the 370 kernel.
Here are some notes that I made as we adapted the C code to the SPARC architecture.

Here is a note about requiring kernel additions to be unnecessary.

Things to write about