On Schedulability and Time Composability of Multisensor Data Aggregation Networks
Saremi, Fatemeh; Jayachandran, Praveen; Iandola, Forrest; Uddin, Md Yusuf Sarwar; Abdelzaher, Tarek F.
Loading…
Permalink
https://hdl.handle.net/2142/25837
Description
Title
On Schedulability and Time Composability of Multisensor Data Aggregation Networks
Author(s)
Saremi, Fatemeh
Jayachandran, Praveen
Iandola, Forrest
Uddin, Md Yusuf Sarwar
Abdelzaher, Tarek F.
Issue Date
2011-07
Keyword(s)
Data Aggregation
Delay
Composition
Schedulability
Abstract
This paper develops a framework to analyze
the latency and delay composition of workflows in a real-time networked aggregation system. These workflows are
characterized by different inputs that are processed along parallel branches that eventually merge or fuse to compute the aggregation result. The results for each flow must be produced within certain end-to-end deadlines or else the information would become stale and useless. We consider an end-to-end view of the aggregation system that allows us to derive a much tighter analysis of the end-to-end delay compared to traditional analysis techniques. The framework extends results developed by the authors recently to analyze end-to-end latency of various workflow topologies. We then provide a reduction of the aggregation network system to an equivalent hypothetical uniprocessor for the purposes of schedulability analysis. Extensive simulations show that latency bound obtained from the analysis framework is significantly more accurate than that of traditional analysis techniques.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.