Can We Prove Time Protection? — mentioned by GregarianChild

Thu, 04 Mar 2021 13:44:52 GMT

That would be great. But isn't there a danger, that such a CPU, at least if implemented naievely, would basically mostly idle, since modern OoO processors schedule memory access dynamically? For hard real-time tasks, some CPUs don't have caches, to make timing more predictable, but there is a heavy performance penalty to be paid for that predictability. Are you familiar with works like [1]? That is thinking in this direction, but from a different angle. [1] G. Heiser, G. Klein, T. Murray, Can We Prove Time Protection?. https://arxiv.org/pdf/1901.08338.pdf

Paper and discussion history. A mention is not an endorsement.

Can We Prove Time Protection? — HN submission

Thu, 31 Jan 2019 18:57:38 GMT

Can We Prove Time Protection?

27 points; 3 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Can We Prove Time Protection? · HackerPapers discussions

Can We Prove Time Protection? — mentioned by GregarianChild

Can We Prove Time Protection? — HN submission