scientific article; zbMATH DE number 4133846

MaRDI QIDQ3035154zbMATH OpenFDO

Authors E. Aarts, J. Korst, Jan Karel Lenstra

Publication date 1990

zbMATH Keywords

simulated annealingapproximationmakespanVLSI algorithmsconstrained schedulingnumber of required storage units

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Scheduling with register constraints for DSP architectures
• Approximation algorithms for time constrained scheduling
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• scientific article; zbMATH DE number 3926249
• On synthesis of scheduling algorithms

Cited in

(4)

• Scheduling with register constraints for DSP architectures
• Determinstic VLSI block placement algorithm using less flexibility first principle
• Resource-constrained scheduling of partitioned algorithms on processor arrays
• Video signal processor scheduling

This page was built for publication:

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