Login / Signup
Buffer capacity computation for throughput-constrained modal task graphs.
Maarten Wiggers
Marco Jan Gerrit Bekooij
Gerard J. M. Smit
Published in:
ACM Trans. Embed. Comput. Syst. (2010)
Keyphrases
</>
blocking probability
buffer size
buffer allocation
subgraph isomorphism
channel capacity
loss probability
response time
graph matching
graph theory
frame buffer
directed graph
modal logic
graph structure
mobile networks
buffer management
median graph