Deriving the average-case performance of bandwidth-like interfaces for tasksets with infinite minimum inter-arrival time, equal task density, uniformly distributed deadlines, and infinite number of tasks.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/sigbed/AnderssonKLN17
%A Andersson, Björn
%A Kim, Hyoseung
%A Lehoczky, John P.
%A de Niz, Dionisio
%D 2017
%J SIGBED Rev.
%K
%N 3
%P 16-23
%T Deriving the average-case performance of bandwidth-like interfaces for tasksets with infinite minimum inter-arrival time, equal task density, uniformly distributed deadlines, and infinite number of tasks.
%U http://dblp.uni-trier.de/db/journals/sigbed/sigbed14.html#AnderssonKLN17
%V 14
@article{journals/sigbed/AnderssonKLN17,
added-at = {2023-12-13T02:05:09.000+0100},
author = {Andersson, Björn and Kim, Hyoseung and Lehoczky, John P. and de Niz, Dionisio},
biburl = {https://www.bibsonomy.org/bibtex/2a017cb8cb1d95b612ca05382261196cc/admin},
ee = {https://doi.org/10.1145/3166227.3166229},
interhash = {7aad6ac1db0a2eb51db07690eb585c36},
intrahash = {a017cb8cb1d95b612ca05382261196cc},
journal = {SIGBED Rev.},
keywords = {},
number = 3,
pages = {16-23},
timestamp = {2023-12-13T02:05:09.000+0100},
title = {Deriving the average-case performance of bandwidth-like interfaces for tasksets with infinite minimum inter-arrival time, equal task density, uniformly distributed deadlines, and infinite number of tasks.},
url = {http://dblp.uni-trier.de/db/journals/sigbed/sigbed14.html#AnderssonKLN17},
volume = 14,
year = 2017
}
