blob: 6b40f1977157a0c27340c851ea95a65893c03e5c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
|
+++
title = "Superblock scheduling"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["3c3e1"]
forwardlinks = ["1b7"]
zettelid = "3c3e2"
+++
OOPSLA '21 paper to appear.
An alternative is superblock ([\#1b7]) scheduling, where a block is
composed of a path for each entry node. The scheduling algorithm then
converts the path into a different path, and also returns a mapping of
the old path to the original. This mapping is then used during the proof
to select the paths to be compared to each other.
[\#1b7]: /zettel/1b7
|
