Maximal strips data structure to represent free space on partially reconfigurable FPGAs

DOI10.1080/17445760902720081zbMath1177.68057OpenAlexW2046283961MaRDI QIDQ3399241

Mostafa Elbidweihy, Jerry L. Trahan

Publication date: 29 September 2009

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760902720081

zbMATH Keywords

real timereconfigurable architectureonline schedulingtask placementfree space data structure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Cites Work

• Unnamed Item
• A new algorithm for the largest empty rectangle problem
• On the maximum empty rectangle problem
• Efficient algorithms for the largest rectangle problem
• Mining for empty spaces in large data sets.

This page was built for publication: Maximal strips data structure to represent free space on partially reconfigurable FPGAs