←back to thread

The Skyline algorithm for packing 2D rectangles

(jvernay.fr)
218 points lapnect | 2 comments | 18 Nov 24 15:19 UTC | HN request time: 0s | source
Show context
romesmoke ◴[18 Nov 24 17:56 UTC] No.42174962[source]▶
An interesting variation is Dynamic Storage Allocation, in which the rectangles can slide only alongside one axis.

AKA "static memory allocation", since the heights of the rectangles can be interpreted as buffer sizes, and their widths as lifetimes.

Most of my PhD's effort has been devoted to beating the SOTA in this. Problem's importance nowadays is owed to deep learning's memory wall.

replies(2): >>42175495 #>>42178981 #
auvi ◴[18 Nov 24 18:42 UTC] No.42175495[source]▶
nice! you have your thesis or any related paper available online?
replies(3): >>42177050 #>>42179023 #>>42180210 #
1. romesmoke ◴[19 Nov 24 05:01 UTC] No.42180210[source]▶
Hopefully I'll defend next summer.

Papers-and-code-wise, I haven't published the "final" thing yet. Right now I'm looking into integrating it with IREE, to get some end-to-end figures.

replies(1): >>42184591 #
2. almostgotcaught ◴[19 Nov 24 15:34 UTC] No.42184591[source]▶
> Right now I'm looking into integrating it with IREE

clever guy. IREE is just about the only serious/available runtime where you can do this because IREE codegens the runtime calls as well as the kernel code. But you're gonna have to either patch an existing HAL or write a new one to accomplish what you want to accomplish. If you want I can help you - if you go to the discord (https://discord.gg/J68usspH) and ask about this in #offtopic I'll DM you and can point you to the right places.