Heuristic-based scheduling algorithm for high level synthesis

Heuristic-based scheduling algorithm for high level synthesis

A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mohamed, Gulam, Tan, Han-Ngee, Chng, Chew-Lye
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer Programming And Software
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Mohamed, Gulam
Tan, Han-Ngee
Chng, Chew-Lye
description A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.
format Conference Proceeding
fullrecord <record><control><sourceid>nasa_CYI</sourceid><recordid>TN_cdi_nasa_ntrs_19940017231</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19940017231</sourcerecordid><originalsourceid>FETCH-nasa_ntrs_199400172313</originalsourceid><addsrcrecordid>eNrjZLD1SC0tyiwuyUzWTUosTk1RKE7OSE0pzcnMS1dIzEnPL8osychVSMsvUsjITM9QyEktS81RKK7MK8lILc4s5mFgTUvMKU7lhdLcDDJuriHOHrp5icWJ8XklRcXxhpaWJgYGhuZGxobGBKQBUF8sjg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Heuristic-based scheduling algorithm for high level synthesis</title><source>NASA Technical Reports Server</source><creator>Mohamed, Gulam ; Tan, Han-Ngee ; Chng, Chew-Lye</creator><creatorcontrib>Mohamed, Gulam ; Tan, Han-Ngee ; Chng, Chew-Lye</creatorcontrib><description>A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.</description><language>eng</language><publisher>Legacy CDMS</publisher><subject>Computer Programming And Software</subject><creationdate>1992</creationdate><rights>Copyright Determination: GOV_PUBLIC_USE_PERMITTED</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,777,797</link.rule.ids><linktorsrc>$$Uhttps://ntrs.nasa.gov/citations/19940017231$$EView_record_in_NASA$$FView_record_in_$$GNASA$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Mohamed, Gulam</creatorcontrib><creatorcontrib>Tan, Han-Ngee</creatorcontrib><creatorcontrib>Chng, Chew-Lye</creatorcontrib><title>Heuristic-based scheduling algorithm for high level synthesis</title><description>A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.</description><subject>Computer Programming And Software</subject><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1992</creationdate><recordtype>conference_proceeding</recordtype><sourceid>CYI</sourceid><recordid>eNrjZLD1SC0tyiwuyUzWTUosTk1RKE7OSE0pzcnMS1dIzEnPL8osychVSMsvUsjITM9QyEktS81RKK7MK8lILc4s5mFgTUvMKU7lhdLcDDJuriHOHrp5icWJ8XklRcXxhpaWJgYGhuZGxobGBKQBUF8sjg</recordid><startdate>19920101</startdate><enddate>19920101</enddate><creator>Mohamed, Gulam</creator><creator>Tan, Han-Ngee</creator><creator>Chng, Chew-Lye</creator><scope>CYE</scope><scope>CYI</scope></search><sort><creationdate>19920101</creationdate><title>Heuristic-based scheduling algorithm for high level synthesis</title><author>Mohamed, Gulam ; Tan, Han-Ngee ; Chng, Chew-Lye</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-nasa_ntrs_199400172313</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Computer Programming And Software</topic><toplevel>online_resources</toplevel><creatorcontrib>Mohamed, Gulam</creatorcontrib><creatorcontrib>Tan, Han-Ngee</creatorcontrib><creatorcontrib>Chng, Chew-Lye</creatorcontrib><collection>NASA Scientific and Technical Information</collection><collection>NASA Technical Reports Server</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mohamed, Gulam</au><au>Tan, Han-Ngee</au><au>Chng, Chew-Lye</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Heuristic-based scheduling algorithm for high level synthesis</atitle><date>1992-01-01</date><risdate>1992</risdate><abstract>A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.</abstract><cop>Legacy CDMS</cop><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_nasa_ntrs_19940017231
source NASA Technical Reports Server
subjects Computer Programming And Software
title Heuristic-based scheduling algorithm for high level synthesis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T20%3A52%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-nasa_CYI&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Heuristic-based%20scheduling%20algorithm%20for%20high%20level%20synthesis&rft.au=Mohamed,%20Gulam&rft.date=1992-01-01&rft_id=info:doi/&rft_dat=%3Cnasa_CYI%3E19940017231%3C/nasa_CYI%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true