| Age | Commit message (Collapse) | Author |
|---|
|
+ Seems to decrease performance a little bit, presumably due to
extra register copy, but simplifies code a lot and opens up more
genericism so I'll consider it an upgrade for now. Copying packets
around is rather slow though, might in the future move to some
kind of pointer based packet handling
|
|
|
|
|
|
+ Kind of like CHERI, but uses out-of-line pointer information.
The idea is that a core that is compatible with ALLOC_IF queries
the allocation tracker if an address is legal and gets a response.
This ideal tracker effectively has infinite memory and doesn't talk to
any other components, but a real implementation might want to limit
the allocations per process or chat with some reserved memory region
somewhere else in the system to maintain a binary tree or something.
|
|
+ Purely virtual, doesn't exist, but would be 'theoretically' ideal.
|
|
+ Previous name was grid
|
|
|
|
+ Not quite deadlock free for 2D/3D for whatever reason
|
|
|
|
+ As they are currently implemented, grid *may* get stuck if two nodes
try to send to eachother at the same time, I should probably add in
some kind of input buffer as well
|
|
|
|
|
|
+ Also allow reusing packets, though only with external buffers.
|
|
|
|
|
|
|
|
|
|
|
