Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

A constructive algorithm for memory-aware task assignment and scheduling

In English

Författare

  • Radoslaw Szymanek
  • Krzysztof Kuchcinski

Summary, in English

This paper presents a constructive algorithm for memory-aware task assignment and scheduling, which is a part of the prototype system MATAS. The algorithm is well suited for image and video processing applications which have hard memory constraints as well as constraints on cost, execution time, and resource usage. Our algorithm takes into account code and data memory constraints together with the other constraints. It can create pipelined implementations. The algorithm finds a task assignment, a schedule, and data and code memory placement in memory. Infeasible solutions caused by memory fragmentation are avoided. The experiments show that our memory-aware algorithm reduces memory utilization compared to greedy scheduling algorithm which has time minimization objective. Moreover, memory-aware algorithm is able to find task assignment and schedule when time minimization algorithm fails. MATAS can create pipelined implementations, therefore the design throughput is increased.

Publiceringsår

2001

Språk

Engelska

Sidor

147-152

Publikation/Tidskrift/Serie

Proceedings of the Ninth International Symposium on Hardware/Software Codesign

Dokumenttyp

Konferensbidrag

Ämne

  • Computer Science

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 1-58113-364-2