On schedulability and time composability of data aggregation networks

Fatemeh Saremi, Praveen Jayachandran, Forrest Iandola, Md Yusuf Sarwar Uddin, Tarek Abdelzaher, Aylin Yener

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 sensor 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, inaccurate and useless. We extend results developed by the authors recently and 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. 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.

    Original languageEnglish (US)
    Title of host publication15th International Conference on Information Fusion, FUSION 2012
    Pages997-1004
    Number of pages8
    StatePublished - Oct 24 2012
    Event15th International Conference on Information Fusion, FUSION 2012 - Singapore, Singapore
    Duration: Sep 7 2012Sep 12 2012

    Publication series

    Name15th International Conference on Information Fusion, FUSION 2012

    Other

    Other15th International Conference on Information Fusion, FUSION 2012
    CountrySingapore
    CitySingapore
    Period9/7/129/12/12

    Fingerprint

    Agglomeration
    Electric fuses
    Sensors
    Chemical analysis

    All Science Journal Classification (ASJC) codes

    • Information Systems

    Cite this

    Saremi, F., Jayachandran, P., Iandola, F., Uddin, M. Y. S., Abdelzaher, T., & Yener, A. (2012). On schedulability and time composability of data aggregation networks. In 15th International Conference on Information Fusion, FUSION 2012 (pp. 997-1004). [6289911] (15th International Conference on Information Fusion, FUSION 2012).
    Saremi, Fatemeh ; Jayachandran, Praveen ; Iandola, Forrest ; Uddin, Md Yusuf Sarwar ; Abdelzaher, Tarek ; Yener, Aylin. / On schedulability and time composability of data aggregation networks. 15th International Conference on Information Fusion, FUSION 2012. 2012. pp. 997-1004 (15th International Conference on Information Fusion, FUSION 2012).
    @inproceedings{71176485d4e4498caec4a31977395d82,
    title = "On schedulability and time composability of data aggregation networks",
    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 sensor 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, inaccurate and useless. We extend results developed by the authors recently and 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. 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.",
    author = "Fatemeh Saremi and Praveen Jayachandran and Forrest Iandola and Uddin, {Md Yusuf Sarwar} and Tarek Abdelzaher and Aylin Yener",
    year = "2012",
    month = "10",
    day = "24",
    language = "English (US)",
    isbn = "9780982443859",
    series = "15th International Conference on Information Fusion, FUSION 2012",
    pages = "997--1004",
    booktitle = "15th International Conference on Information Fusion, FUSION 2012",

    }

    Saremi, F, Jayachandran, P, Iandola, F, Uddin, MYS, Abdelzaher, T & Yener, A 2012, On schedulability and time composability of data aggregation networks. in 15th International Conference on Information Fusion, FUSION 2012., 6289911, 15th International Conference on Information Fusion, FUSION 2012, pp. 997-1004, 15th International Conference on Information Fusion, FUSION 2012, Singapore, Singapore, 9/7/12.

    On schedulability and time composability of data aggregation networks. / Saremi, Fatemeh; Jayachandran, Praveen; Iandola, Forrest; Uddin, Md Yusuf Sarwar; Abdelzaher, Tarek; Yener, Aylin.

    15th International Conference on Information Fusion, FUSION 2012. 2012. p. 997-1004 6289911 (15th International Conference on Information Fusion, FUSION 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - On schedulability and time composability of data aggregation networks

    AU - Saremi, Fatemeh

    AU - Jayachandran, Praveen

    AU - Iandola, Forrest

    AU - Uddin, Md Yusuf Sarwar

    AU - Abdelzaher, Tarek

    AU - Yener, Aylin

    PY - 2012/10/24

    Y1 - 2012/10/24

    N2 - 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 sensor 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, inaccurate and useless. We extend results developed by the authors recently and 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. 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.

    AB - 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 sensor 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, inaccurate and useless. We extend results developed by the authors recently and 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. 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.

    UR - http://www.scopus.com/inward/record.url?scp=84867652304&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84867652304&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 9780982443859

    T3 - 15th International Conference on Information Fusion, FUSION 2012

    SP - 997

    EP - 1004

    BT - 15th International Conference on Information Fusion, FUSION 2012

    ER -

    Saremi F, Jayachandran P, Iandola F, Uddin MYS, Abdelzaher T, Yener A. On schedulability and time composability of data aggregation networks. In 15th International Conference on Information Fusion, FUSION 2012. 2012. p. 997-1004. 6289911. (15th International Conference on Information Fusion, FUSION 2012).