Multi-schedule design space exploration: an alternative synthesis framework


Dalkilic M. E. , Pitchumani V.

INTEGRATION-THE VLSI JOURNAL, cilt.27, ss.87-112, 1999 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 27 Konu: 2
  • Basım Tarihi: 1999
  • Doi Numarası: 10.1016/s0167-9260(99)00007-3
  • Dergi Adı: INTEGRATION-THE VLSI JOURNAL
  • Sayfa Sayıları: ss.87-112

Özet

A multi-schedule data-path synthesis framework is described that is an improvement over conventional single-schedule methods. The multi-schedule approach retains all feasible scheduling options and generates complete data-path solutions for each schedule. Constraints on time and resources are used to create a cost-ordered set of feasible scheduling solutions. Hence scheduling optimality is assured within the model of constraints. The algorithms have been converted to parallel form allowing execution on a cluster of workstations or an Intel hypercube. The results show that multi-schedule synthesis approach often outperforms well-known high-level synthesis systems in terms of both solution quality and run time. (C) 1999 Elsevier Science B.V. All rights reserved.