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

DOI10.1080/17445760902720081MaRDI QIDQ3399241zbMATH OpenOpenAlexFDO

Authors 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 timeonline schedulingreconfigurable architecturetask placementfree space data structure

Mathematics Subject Classification ID

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

Recommendations

• Languages and Compilers for Parallel Computing
• scientific article; zbMATH DE number 1941082
• scientific article; zbMATH DE number 1955868

Cites work

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

Cited in

(3)

• An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
• An efficient list scheduling algorithm for time placement problem
• scientific article; zbMATH DE number 1941082 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399241)