Improved force-directed scheduling in high-throughput digital signal processing

W.F.J. Verhaegh; P.E.R. Lippens; E.H.L. Aarts; J.H.M. Korst; J. Meerbergen van; A. Werf van der

doi:10.1109/43.402495

Improved force-directed scheduling in high-throughput digital signal processing

W.F.J. Verhaegh, P.E.R. Lippens, E.H.L. Aarts, J.H.M. Korst, J. Meerbergen van, A. Werf van der

Research output: Contribution to journal › Article › Scientific › peer-review

37 Citations (Scopus)

Abstract

This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSL circuits. We present a mathematical justification of the technique of force-directed scheduling, introduced by Paulin and Knight (1989), and we show how the algorithm can be used to find cost-effective time assignments and resource allocations, allowing trade-offs between processing units and memories. Furthermore, we present modifications that improve the effectiveness and the efficiency of the algorithm. The significance of the improvements is illustrated by an empirical performance analysis based on a number of problem instances

Original language	English
Pages (from-to)	945-960
Number of pages	16
Journal	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume	14
Issue number	8
DOIs	https://doi.org/10.1109/43.402495
Publication status	Published - 1995
Externally published	Yes

Access to Document

10.1109/43.402495

Cite this

@article{820f8b724b7347b49e880063c551190f,

title = "Improved force-directed scheduling in high-throughput digital signal processing",

abstract = "This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSL circuits. We present a mathematical justification of the technique of force-directed scheduling, introduced by Paulin and Knight (1989), and we show how the algorithm can be used to find cost-effective time assignments and resource allocations, allowing trade-offs between processing units and memories. Furthermore, we present modifications that improve the effectiveness and the efficiency of the algorithm. The significance of the improvements is illustrated by an empirical performance analysis based on a number of problem instances",

author = "W.F.J. Verhaegh and P.E.R. Lippens and E.H.L. Aarts and J.H.M. Korst and {Meerbergen van}, J. and {Werf van der}, A.",

year = "1995",

doi = "10.1109/43.402495",

language = "English",

volume = "14",

pages = "945--960",

journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",

issn = "0278-0070",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Improved force-directed scheduling in high-throughput digital signal processing

AU - Verhaegh, W.F.J.

AU - Lippens, P.E.R.

AU - Aarts, E.H.L.

AU - Korst, J.H.M.

AU - Meerbergen van, J.

AU - Werf van der, A.

PY - 1995

Y1 - 1995

N2 - This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSL circuits. We present a mathematical justification of the technique of force-directed scheduling, introduced by Paulin and Knight (1989), and we show how the algorithm can be used to find cost-effective time assignments and resource allocations, allowing trade-offs between processing units and memories. Furthermore, we present modifications that improve the effectiveness and the efficiency of the algorithm. The significance of the improvements is illustrated by an empirical performance analysis based on a number of problem instances

AB - This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSL circuits. We present a mathematical justification of the technique of force-directed scheduling, introduced by Paulin and Knight (1989), and we show how the algorithm can be used to find cost-effective time assignments and resource allocations, allowing trade-offs between processing units and memories. Furthermore, we present modifications that improve the effectiveness and the efficiency of the algorithm. The significance of the improvements is illustrated by an empirical performance analysis based on a number of problem instances

U2 - 10.1109/43.402495

DO - 10.1109/43.402495

M3 - Article

SN - 0278-0070

VL - 14

SP - 945

EP - 960

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IS - 8

ER -

Improved force-directed scheduling in high-throughput digital signal processing

Abstract

Access to Document

Fingerprint

Cite this