Scheduling of data-independent recursive algorithms
1995 (English)In: Proc. 1995 European Conf. on Circuit Theory and Design, ECCTD'95, 1995, II-855-II-858 p.Conference paper (Refereed)
A new scheduling formulation for data independent recursive algorithms is proposed. This formulation is intuitive and finds a static rate optimal schedules. Processing elements may be non-preemptive and non-homogenous. Comparison with some other common scheduling methods to increase throughput is made.
Place, publisher, year, edition, pages
1995. II-855-II-858 p.
National CategoryOther Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-50883OAI: oai:DiVA.org:liu-50883DiVA: diva2:272296