English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Heterogeneous multi-cores utilize the strength of different architectures forexecuting particular types of workload, and usually offer higher performanceand energy efficiency. In this paper, we study the worst-case response time(WCRT) analysis of \emph{typed} scheduling of parallel DAG tasks onheterogeneous multi-cores, where the workload of each vertex in the DAG is onlyallowed to execute on a particular type of cores. The only known WCRT bound forthis problem is grossly pessimistic and suffers the\emph{non-self-sustainability} problem. In this paper, we propose two new WCRTbounds. The first new bound has the same time complexity as the existing bound,but is more precise and solves its \emph{non-self-sustainability} problem. Thesecond new bound explores more detailed task graph structure information togreatly improve the precision, but is computationally more expensive. We provethat the problem of computing the second bound is strongly NP-hard if thenumber of types in the system is a variable, and develop an efficient algorithmwhich has polynomial time complexity if the number of types is a constant.Experiments with randomly generated workload show that our proposed new methodsare significantly more precise than the existing bound while having goodscalability.

Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-cores