Recursive technique for computing lower-bound performance of schedules

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn , Issue , 1993, Pages 16-20

  Langevin, Michel ^a   Cerny, Eduard ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ELECTRIC NETWORK SYNTHESIS; GRAPH THEORY; LINEAR PROGRAMMING; PERFORMANCE; RECURSIVE FUNCTIONS; SCHEDULING;

AS SOON AS POSSIBLE UNDER CONSTRAINT (ASAPUC); DATA FLOW GRAPH (DFG); INTEGER LINEAR PROGRAMMING (ILP);

CRITICAL PATH ANALYSIS;

EID: 0027837634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)