Scalable and Efficient Configuration of Time-Division Multiplexed Resources

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00233703" target="_blank" >RIV/68407700:21230/16:00233703 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.jss.2015.11.019" target="_blank" >http://dx.doi.org/10.1016/j.jss.2015.11.019</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jss.2015.11.019" target="_blank" >10.1016/j.jss.2015.11.019</a>

Result language

angličtina

Original language name

Scalable and Efficient Configuration of Time-Division Multiplexed Resources

Original language description

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average performance. For cost-efficient design, contemporary platforms feature an increasing number of cores that share resources, such as memories and interconnects. However, resource sharing causes contention that must be resolved by a resource arbiter, such as Time-Division Multiplexing. A key challenge is to configure this arbiter to satisfy the bandwidth and latency requirements of the real-time applications, while maximizing the slack capacity to improve performance of their non-real-time counterparts. As this configuration problem is NP-hard, a sophisticated automated configuration method is required to avoid negatively impacting design time. The main contributions of this article are: 1) An optimal approach that takes an existing integer linear programming (ILP) model addressing the problem and wraps it in a branch-and- price framework to improve scalability. 2) A faster heuristic algorithm that typically provides near-optimal solutions. 3) An experimental evaluation that quantitatively compares the branch- and-price approach to the previously formulated ILP model and the proposed heuristic. 4) A case study of an HD video and graphics processing system that demonstrates the practical applicability of the approach.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

The Journal of Systems and Software

ISSN

0164-1212

e-ISSN

—

Volume of the periodical

113

Issue of the periodical within the volume

March

Country of publishing house

GB - UNITED KINGDOM

Number of pages

15

Pages from-to

44-58

UT code for WoS article

000369456600003

EID of the result in the Scopus database

2-s2.0-84962160018