Giuseppe Lipari's publications

Disclaimer

The copyrights to most of the publications listed here belong to the publishers. Due to copyright regulations, I am unable to make electronic copies available on the Web in an unrestricted manner. If you are interested in accessing the paper in electronic format, please send me an e-mail and, if possible, I will provide you with download rights – I believe fair use provisions of copyright law permit me to distribute individual copies for academic/research purposes.

The list of publications is updated to Nov 2014. In addition to looking at the list below, you can also:

Paper list

(By clicking on a paper, the link to the corresponding abstract and bibtex citation will appear)

Journals, Conferences: 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997,

Journals

  1. Houssam-Eddine Zahaf, Abou El Hassen Benyamina, Richard Olejnik, Giuseppe Lipari, Energy-Efficient Scheduling for Moldable Real-Time Tasks on Heterogeneous Computing Platforms, Journal of Systems Architecture, 2017
    @article {houssam2017energy,
        publisher = {Elsevier}, 
        title = {{E}nergy-{E}fficient {S}cheduling for {M}oldable {R}eal-{T}ime {T}asks on {H}eterogeneous {C}omputing {P}latforms}, 
        journal = {Journal of Systems Architecture}, 
        author = {Zahaf, Houssam-Eddine and Benyamina, Abou El Hassen and Olejnik, Richard and Lipari, Giuseppe}, 
        year = {2017}, 
    }
    
  2. Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari, Robert I. Davis, Cache related pre-emption delays in hierarchical scheduling, Real-Time Systems, vol. 52, n. 2, pp. 201--238 2016 ISSN: 1573-1383
    [DOI] [link]
    Abstract: Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.
    @article {Lunniss2016,
        doi = {10.1007/s11241-015-9228-x}, 
        author = {Lunniss, Will and Altmeyer, Sebastian and Lipari, Giuseppe and Davis, Robert I.}, 
        abstract = {Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.}, 
        issn = {1573-1383}, 
        number = {2}, 
        pages = {201--238}, 
        volume = {52}, 
        link = {http://dx.doi.org/10.1007/s11241-015-9228-x}, 
        year = {2016}, 
        title = {{C}ache related pre-emption delays in hierarchical scheduling}, 
        journal = {Real-Time Systems}, 
    }
    
  3. Youcheng Sun, Giuseppe Lipari, A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling, Real-Time Systems, vol. 52, n. 3, pp. 323--355 2016 ISSN: 1573-1383
    [DOI] [link]
    Abstract: In this paper we present an exact schedulability test for sporadic real-time tasks scheduled by the Global Fixed Priority Fully Preemptive Scheduler on a multiprocessor system. The analysis consists in modeling the system as a Linear Hybrid Automaton, and in performing a reachability analysis for states representing deadline miss conditions. To mitigate the problem of state space explosion, we propose a pre-order relationship over the symbolic states of the model: states that are simulated by others can be safely eliminated from the state space. We also formulate the concept of decidability interval with respect to a set of constrained-deadline sporadic tasks on multiprocessor. The decidability interval is a bounded time interval such that, if a deadline miss occurs in the schedule, then it is possible to find a configuration of arrival times for the tasks such that the deadline miss happens within the bounded interval. Vice versa, if no configuration of arrival times produces a deadline miss in the bounded interval, then no deadline miss is ever possible in the schedule. Hence we prove that the schedulability analysis problem is decidable, and we provide a formula for computing the decidability interval. To our knowledge, this is the first time such a time interval is proposed for sporadic tasks running on multiprocessor. The proposed schedulability analysis has been implemented in a software tool. For the first time we assess the pessimism of the state-of-the-art approximate schedulability test through experiments. Moreover, we show that the use of the proposed model permits to analyse tasks with more general parameter values than other exact algorithms in the literature. Nevertheless, even with our approach the complexity remains too high for analysing practical task sets with more than seven tasks.
    @article {Sun2016,
        doi = {10.1007/s11241-015-9245-9}, 
        author = {Sun, Youcheng and Lipari, Giuseppe}, 
        abstract = {In this paper we present an exact schedulability test for sporadic real-time tasks scheduled by the Global Fixed Priority Fully Preemptive Scheduler on a multiprocessor system. The analysis consists in modeling the system as a Linear Hybrid Automaton, and in performing a reachability analysis for states representing deadline miss conditions. To mitigate the problem of state space explosion, we propose a pre-order relationship over the symbolic states of the model: states that are simulated by others can be safely eliminated from the state space. We also formulate the concept of decidability interval with respect to a set of constrained-deadline sporadic tasks on multiprocessor. The decidability interval is a bounded time interval such that, if a deadline miss occurs in the schedule, then it is possible to find a configuration of arrival times for the tasks such that the deadline miss happens within the bounded interval. Vice versa, if no configuration of arrival times produces a deadline miss in the bounded interval, then no deadline miss is ever possible in the schedule. Hence we prove that the schedulability analysis problem is decidable, and we provide a formula for computing the decidability interval. To our knowledge, this is the first time such a time interval is proposed for sporadic tasks running on multiprocessor. The proposed schedulability analysis has been implemented in a software tool. For the first time we assess the pessimism of the state-of-the-art approximate schedulability test through experiments. Moreover, we show that the use of the proposed model permits to analyse tasks with more general parameter values than other exact algorithms in the literature. Nevertheless, even with our approach the complexity remains too high for analysing practical task sets with more than seven tasks.}, 
        issn = {1573-1383}, 
        number = {3}, 
        pages = {323--355}, 
        volume = {52}, 
        link = {http://dx.doi.org/10.1007/s11241-015-9245-9}, 
        year = {2016}, 
        title = {{A} pre-order relation for exact schedulability test of sporadic tasks on multiprocessor {G}lobal {F}ixed-{P}riority scheduling}, 
        journal = {Real-Time Systems}, 
    }
    
  4. Stefano Bocchino, Matteo Petracca, Paolo Pagano, Marco Ghibaudi, Giuseppe Lipari, SPEED-3D: a geographic routing protocol for 6LoWPAN networks, Int. J. Ad Hoc and UbiquitousComputing, vol. , 2014
    @article {Bocchino2014,
        date-modified = {2014-11-05T08:09:47.305410}, 
        title = {S{P}EE{D}-3{D}: a geographic routing protocol for 6{L}oW{P}AN networks}, 
        journal = {Int. J. Ad Hoc and UbiquitousComputing}, 
        author = {Bocchino, Stefano and Petracca, Matteo and Pagano, Paolo and Ghibaudi, Marco and Lipari, Giuseppe}, 
        volume = {}, 
        year = {2014}, 
        booktitle = {Int. J. Ad Hoc and Ubiquitous Computing}, 
        date-added = {2014-11-05T08:09:47.305430}, 
    }
    
  5. Salvatore Benedetto, Giuseppe Lipari, ADOK: a Minimal Object Oriented Real-Time Operating System in C++, SIGBED} Review, vol. 11, n. 1, pp. 74--79 2014
    [DOI] [link]
    @article {Benedetto2013,
        doi = {10.1145/2597457.2597468}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/journals/sigbed/BenedettoL14}, 
        date-modified = {2014-11-05T08:09:46.353730}, 
        author = {Benedetto, Salvatore and Lipari, Giuseppe}, 
        timestamp = {Sun, 04 May 2014 12:52:54 +0200}, 
        booktitle = {Proceedings of the 3rd Embedded Operating Systems Workshop}, 
        title = {A{D}OK: a {M}inimal {O}bject {O}riented {R}eal-{T}ime {O}perating {S}ystem in {C}++}, 
        year = {2014}, 
        number = {1}, 
        month = {8}, 
        volume = {11}, 
        link = {http://doi.acm.org/10.1145/2597457.2597468}, 
        pages = {74--79}, 
        organization = {SIGOPS France}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        journal = {{SIGBED} Review}, 
        date-added = {2014-11-05T08:09:46.353750}, 
    }
    
  6. Rodrigo Santos, Giuseppe Lipari, Enrico Bini, Tommaso Cucinotta, On-line schedulability tests for adaptive reservations in fixed priority scheduling, Real-Time Systems, vol. 48, n. 5, pp. 601--634 2012
    [DOI] [pdf]
    @article {DBLP:journals/rts/SantosLBC12,
        doi = {10.1007/s11241-012-9156-y}, 
        date-modified = {2014-10-31T10:00:50.209700}, 
        author = {Santos, Rodrigo and Lipari, Giuseppe and Bini, Enrico and Cucinotta, Tommaso}, 
        journal = {Real-Time Systems}, 
        title = {{O}n-line schedulability tests for adaptive reservations in fixed priority scheduling}, 
        number = {5}, 
        volume = {48}, 
        year = {2012}, 
        pages = {601--634}, 
        localfile = {papers/spare-pot-final-rtsj.pdf}, 
        date-added = {2014-10-28T13:09:48.168660}, 
    }
    
  7. Dario Faggioli, Giuseppe Lipari, Tommaso Cucinotta, Analysis and Implementation of the Multiprocessor Bandwidth Inheritance Protocol, Real-Time Systems, vol. 48, n. 6, 2012
    [DOI]
    @article {Faggioli2012,
        doi = {10.1007/s11241-012-9162-0}, 
        date-modified = {2014-11-05T08:17:15.485830}, 
        author = {Faggioli, Dario and Lipari, Giuseppe and Cucinotta, Tommaso}, 
        journal = {Real-Time Systems}, 
        title = {{A}nalysis and {I}mplementation of the {M}ultiprocessor {B}andwidth {I}nheritance {P}rotocol}, 
        number = {6}, 
        volume = {48}, 
        year = {2012}, 
        owner = {lipari}, 
        date-added = {2012-09-14T00:00:00}, 
    }
    
  8. Anna Lina Ruscelli, Gabriele Cecchetti, Angelo Alifano, Giuseppe Lipari, Enhancement of QoS support of HCCA schedulers using EDCA function in IEEE 802.11e networks, Ad Hoc Networks, vol. 10, n. 2, pp. 147--161 2012
    [DOI] [pdf] [link]
    @article {DBLP:journals/adhoc/RuscelliCAL12,
        doi = {10.1016/j.adhoc.2010.09.014}, 
        author = {Ruscelli, Anna Lina and Cecchetti, Gabriele and Alifano, Angelo and Lipari, Giuseppe}, 
        timestamp = {Fri, 23 Sep 2011 13:59:26 +0200}, 
        journal = {Ad Hoc Networks}, 
        title = {{E}nhancement of {Q}oS support of {H{C}CA} schedulers using {E{D}CA} function in {I{E}EE} 802.11e networks}, 
        number = {2}, 
        volume = {10}, 
        link = {http://dx.doi.org/10.1016/j.adhoc.2010.09.014; http://dblp.uni-trier.de/rec/bib/journals/adhoc/RuscelliCAL12}, 
        year = {2012}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {147--161}, 
        localfile = {papers/Cecchetti-AHJ_2011.pdf}, 
    }
    
  9. Juri Lelli, Dario Faggioli, Tommaso Cucinotta, Giuseppe Lipari, An experimental comparison of different real-time schedulers on multicore systems, Journal of Systems and Software, vol. 85, n. 10, pp. 2405--2416 2012
    [DOI] [pdf] [link]
    @article {DBLP:journals/jss/LelliFCL12,
        doi = {10.1016/j.jss.2012.05.048}, 
        author = {Lelli, Juri and Faggioli, Dario and Cucinotta, Tommaso and Lipari, Giuseppe}, 
        timestamp = {Thu, 18 Oct 2012 15:20:58 +0200}, 
        journal = {Journal of Systems and Software}, 
        title = {{A}n experimental comparison of different real-time schedulers on multicore systems}, 
        number = {10}, 
        volume = {85}, 
        link = {http://dx.doi.org/10.1016/j.jss.2012.05.048; http://dblp.uni-trier.de/rec/bib/journals/jss/LelliFCL12}, 
        year = {2012}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {2405--2416}, 
        localfile = {papers/ElsevierJSS-2012.pdf}, 
    }
    
  10. Michal Sojka, Pavel P{í}sa, Dario Faggioli, Tommaso Cucinotta, Fabio Checconi, Zdenek Hanzálek, Giuseppe Lipari, Modular software architecture for flexible reservation mechanisms on heterogeneous resources, Journal of Systems Architecture - Embedded Systems Design, vol. 57, n. 4, pp. 366--382 2011
    [DOI] [link]
    @article {DBLP:journals/jsa/SojkaPFCCHL11,
        doi = {10.1016/j.sysarc.2011.02.005}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/journals/jsa/SojkaPFCCHL11}, 
        author = {Sojka, Michal and P{í}sa, Pavel and Faggioli, Dario and Cucinotta, Tommaso and Checconi, Fabio and Hanzálek, Zdenek and Lipari, Giuseppe}, 
        timestamp = {Tue, 26 Apr 2011 21:03:28 +0200}, 
        journal = {Journal of Systems Architecture - Embedded Systems Design}, 
        title = {{M}odular software architecture for flexible reservation mechanisms on heterogeneous resources}, 
        number = {4}, 
        volume = {57}, 
        link = {http://dx.doi.org/10.1016/j.sysarc.2011.02.005}, 
        year = {2011}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {366--382}, 
    }
    
  11. Tommaso Cucinotta, Luca Abeni, Luigi Palopoli, Giuseppe Lipari, A robust mechanism for adaptive scheduling of multimedia applications, ACM Transactions on Embedded Computing Systems (TECS), vol. 10, n. 4, pp. 46 2011
    [DOI]
    @article {cucinotta2011robust,
        publisher = {ACM}, 
        doi = {10.1145/2043662.2043670}, 
        date-modified = {2014-11-05T08:09:47.026830}, 
        author = {Cucinotta, Tommaso and Abeni, Luca and Palopoli, Luigi and Lipari, Giuseppe}, 
        journal = {ACM Transactions on Embedded Computing Systems (TECS)}, 
        title = {{A} robust mechanism for adaptive scheduling of multimedia applications}, 
        number = {4}, 
        volume = {10}, 
        year = {2011}, 
        pages = {46}, 
        date-added = {2014-11-05T08:09:47.026850}, 
    }
    
  12. Paolo Pagano, Mangesh Chitnis, Giuseppe Lipari, Christian Nastasi, Yao Liang, Simulating Real-Time Aspects of Wireless Sensor Networks, EURASIP J. Wireless Comm. and Networking, 2010
    [DOI] [pdf]
    @article {DBLP:journals/ejwcn/PaganoCLNL10,
        doi = {10.1155/2010/107946}, 
        date-modified = {2014-10-31T10:00:50.372260}, 
        keyword = {wireless network scheduling}, 
        author = {Pagano, Paolo and Chitnis, Mangesh and Lipari, Giuseppe and Nastasi, Christian and Liang, Yao}, 
        journal = {EURASIP J. Wireless Comm. and Networking}, 
        title = {{S}imulating {R}eal-{T}ime {A}spects of {W}ireless {S}ensor {N}etworks}, 
        year = {2010}, 
        localfile = {papers/Simulating_WSN.pdf}, 
        date-added = {2014-10-28T13:09:47.454990}, 
    }
    
  13. Tommaso Cucinotta, Luigi Palopoli, Luca Abeni, Dario Faggioli, Giuseppe Lipari, On the Integration of Application Level and Resource Level QoS Control for Real-time Applications, IEEE Transactions on Industrial Informatics, vol. 5, n. 4, pp. 479--491 2010
    [DOI]
    Abstract: We consider a dynamic set of soft real-time applications using a set of shared resources. Each application can execute in different modes, each one associated with a level of Quality-of-Service (QoS). Resources, in their turn, have different modes, each one with a speed and a power consumption, and are managed by a Reservation-Based scheduler enabling a dynamic allocation of the fraction of resources (bandwidth) assigned to each application. To cope with dynamic changes of the application, we advocate an adaptive resource allocation policy organized in two nested feedback loops. The internal loop operates on the scheduling parameter to obtain a resource allocation that meets the temporal constraints of the applications. The external loop operates on the QoS level of the applications and on the power level of the resources to strike a good tradeoff between the global QoS and the energy consumption. This loop comes into play whenever the workload of the application exceeds the bounds that permit the internal loop to operate correctly, or whenever it decreases below a level that permit more aggressive choices for the QoS or substantial energy saving.
    @article {DBLP:journals/tii/CucinottaPAFL10,
        doi = {10.1109/TII.2010.2072962}, 
        date-modified = {2014-11-05T08:22:48.239110}, 
        author = {Cucinotta, Tommaso and Palopoli, Luigi and Abeni, Luca and Faggioli, Dario and Lipari, Giuseppe}, 
        journal = {IEEE Transactions on Industrial Informatics}, 
        title = {{O}n the {I}ntegration of {A}pplication {L}evel and {R}esource {L}evel {Q}oS {C}ontrol for {R}eal-time {A}pplications}, 
        number = {4}, 
        pages = {479--491}, 
        volume = {5}, 
        year = {2010}, 
        abstract = {We consider a dynamic set of soft real-time applications using a set of shared resources. Each application can execute in different modes, each one associated with a level of Quality-of-Service (QoS). Resources, in their turn, have different modes, each one with a speed and a power consumption, and are managed by a Reservation-Based scheduler enabling a dynamic allocation of the fraction of resources (bandwidth) assigned to each application. To cope with dynamic changes of the application, we advocate an adaptive resource allocation policy organized in two nested feedback loops. The internal loop operates on the scheduling parameter to obtain a resource allocation that meets the temporal constraints of the applications. The external loop operates on the QoS level of the applications and on the power level of the resources to strike a good tradeoff between the global QoS and the energy consumption. This loop comes into play whenever the workload of the application exceeds the bounds that permit the internal loop to operate correctly, or whenever it decreases below a level that permit more aggressive choices for the QoS or substantial energy saving.}, 
        date-added = {2014-10-28T13:09:35.633810}, 
    }
    
  14. Antonio Mancina, Dario Faggioli, Giuseppe Lipari, Jorrit N. Herder, Ben Gras, Andrew S. Tanenbaum, Enhancing a dependable multiserver operating system with temporal protection via resource reservations, Real-Time Systems, vol. 43, n. 2, pp. 177--210 2009
    [DOI] [pdf]
    @article {DBLP:journals/rts/MancinaFLHGT09,
        publisher = {Springer}, 
        doi = {10.1007/s11241-009-9086-5}, 
        date-modified = {2014-11-05T08:11:44.846480}, 
        author = {Mancina, Antonio and Faggioli, Dario and Lipari, Giuseppe and Herder, Jorrit N. and Gras, Ben and Tanenbaum, Andrew S.}, 
        journal = {Real-Time Systems}, 
        title = {{E}nhancing a dependable multiserver operating system with temporal protection via resource reservations}, 
        number = {2}, 
        volume = {43}, 
        year = {2009}, 
        pages = {177--210}, 
        localfile = {papers/mancina.pdf}, 
        date-added = {2014-10-28T13:09:47.125190}, 
    }
    
  15. Enrico Bini, Giorgio C. Buttazzo, Giuseppe Lipari, Minimizing CPU energy in real-time systems with discrete speed management, ACM Transactions on Embedded Computing Systems (TECS), vol. 8, n. 4, pp. 1--23 2009
    [DOI] [pdf]
    Abstract: This article presents a general framework to analyze and design embedded systems minimizing the energy consumption without violating timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical real-time applications. The processor is assumed to have as a set of discrete operating modes, each characterized by speed and power consumption. The energy overhead and the transition delay incurred during mode switches are considered. Task computation times are modeled with a part that scales with the speed and a part having a fixed duration, to take I/O operations into account.\par The proposed method allows to compute the optimal sequence of voltage/speed changes that approximates the minimum continuous speed, which guarantees the feasibility of a given set of real-time tasks, without violating the deadline constraints. The analysis is performed both under fixed and dynamic priority assignments.
    @article {DBLP:journals/tecs/BiniBL09,
        publisher = {ACM}, 
        doi = {10.1145/1550987.1550994}, 
        date-modified = {2014-11-05T08:16:24.677450}, 
        keyword = {CPU energy, Real-time systems}, 
        author = {Bini, Enrico and Buttazzo, Giorgio C. and Lipari, Giuseppe}, 
        journal = {ACM Transactions on Embedded Computing Systems (TECS)}, 
        title = {{M}inimizing {C{P}U} energy in real-time systems with discrete speed management}, 
        number = {4}, 
        month = {7}, 
        volume = {8}, 
        pages = {1--23}, 
        year = {2009}, 
        abstract = {This article presents a general framework to analyze and design embedded systems minimizing the energy consumption without violating timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical real-time applications. The processor is assumed to have as a set of discrete operating modes, each characterized by speed and power consumption. The energy overhead and the transition delay incurred during mode switches are considered. Task computation times are modeled with a part that scales with the speed and a part having a fixed duration, to take I/O operations into account.\par The proposed method allows to compute the optimal sequence of voltage/speed changes that approximates the minimum continuous speed, which guarantees the feasibility of a given set of real-time tasks, without violating the deadline constraints. The analysis is performed both under fixed and dynamic priority assignments.}, 
        localfile = {papers/2009BinButLip.pdf}, 
        date-added = {2014-10-28T13:09:33.934800}, 
    }
    
  16. Luca Abeni, Luigi Palopoli, Claudio Scordino, Giuseppe Lipari, Resource Reservations for General Purpose Applications, IEEE Transactions on Industrial Informatics, vol. 5, n. 1, pp. 12--21 2009
    [DOI] [pdf]
    Abstract: Resource reservations are an effective technique to support hard and soft real-time applications in open systems. However, they generally focus on providing guarantees to real-time applications, without paying too much attention to the performance of non-real-time activities. In this paper, the main limitations encountered when using a conventional reservation-based scheduler for serving non-real-time tasks are described and formally analyzed. Then, a novel algorithm that overcomes these problems (called HGRUB) is proposed, and both theoretical and experimental evidence of its effectiveness is provided.
    @article {DBLP:journals/tii/AbeniPSL09,
        doi = {10.1109/TII.2009.2013633}, 
        date-modified = {2014-11-05T08:13:51.862260}, 
        author = {Abeni, Luca and Palopoli, Luigi and Scordino, Claudio and Lipari, Giuseppe}, 
        journal = {IEEE Transactions on Industrial Informatics}, 
        title = {{R}esource {R}eservations for {G}eneral {P}urpose {A}pplications}, 
        number = {1}, 
        pages = {12--21}, 
        volume = {5}, 
        year = {2009}, 
        abstract = {Resource reservations are an effective technique to support hard and soft real-time applications in open systems. However, they generally focus on providing guarantees to real-time applications, without paying too much attention to the performance of non-real-time activities. In this paper, the main limitations encountered when using a conventional reservation-based scheduler for serving non-real-time tasks are described and formally analyzed. Then, a novel algorithm that overcomes these problems (called HGRUB) is proposed, and both theoretical and experimental evidence of its effectiveness is provided.}, 
        localfile = {papers/tii09.pdf}, 
        date-added = {2014-10-28T13:09:32.700130}, 
    }
    
  17. Tommaso Cucinotta, Antonio Mancina, Gaetano F. Anastasi, Giuseppe Lipari, Leonardo Mangeruca, Roberto Checcozzo, Fulvio Rusina, A Real-time Service-Oriented Architecture for Industrial Automation, Industrial Informatics, IEEE Transactions on, vol. 5, n. 3, pp. 267--277 2009 ISSN: 1551-3203
    [DOI]
    @article {DBLP:journals/tii/CucinottaMALMCR09,
        publisher = {IEEE}, 
        doi = {10.1109/TII.2009.2027013}, 
        date-modified = {2014-11-05T08:12:29.753690}, 
        author = {Cucinotta, Tommaso and Mancina, Antonio and Anastasi, Gaetano F. and Lipari, Giuseppe and Mangeruca, Leonardo and Checcozzo, Roberto and Rusina, Fulvio}, 
        journal = {Industrial Informatics, IEEE Transactions on}, 
        issn = {1551-3203}, 
        number = {3}, 
        volume = {5}, 
        year = {2009}, 
        title = {{A} Real-time {S}ervice-{O}riented {A}rchitecture for {I}ndustrial {A}utomation}, 
        pages = {267--277}, 
        date-added = {2014-10-28T13:09:35.038000}, 
    }
    
  18. Marko Bertogna, Michele Cirinei, Giuseppe Lipari, Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms, IEEE Transactions on Parallel and Distributed Systems, vol. 20, n. 4, pp. 553--566 2009
    [DOI] [pdf]
    Abstract: This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.
    @article {DBLP:journals/tpds/BertognaCL09,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/TPDS.2008.129}, 
        date-modified = {2014-11-05T08:21:33.603160}, 
        author = {Bertogna, Marko and Cirinei, Michele and Lipari, Giuseppe}, 
        journal = {IEEE Transactions on Parallel and Distributed Systems}, 
        title = {{S}chedulability {A}nalysis of {G}lobal {S}cheduling {A}lgorithms on {M}ultiprocessor {P}latforms}, 
        number = {4}, 
        pages = {553--566}, 
        volume = {20}, 
        year = {2009}, 
        abstract = {This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.}, 
        localfile = {papers/TPDS_bertogna_cirinei_lipari_cr.pdf}, 
        date-added = {2014-10-28T13:09:33.280270}, 
    }
    
  19. Luigi Palopoli, Tommaso Cucinotta, Luca Marzario, Giuseppe Lipari, AQuoSA - adaptive quality of service architecture, Software: Practice and Experience, vol. 39, n. 1, pp. 1--31 2009 ISSN: 1097-024X
    [DOI] [pdf]
    @article {DBLP:journals/spe/PalopoliCML09,
        publisher = {Wiley Online Library}, 
        doi = {10.1002/spe.v39:1}, 
        date-modified = {2014-10-31T10:00:51.810630}, 
        author = {Palopoli, Luigi and Cucinotta, Tommaso and Marzario, Luca and Lipari, Giuseppe}, 
        journal = {Software: Practice and Experience}, 
        issn = {1097-024X}, 
        number = {1}, 
        volume = {39}, 
        year = {2009}, 
        title = {A{Q}uo{S}A - adaptive quality of service architecture}, 
        pages = {1--31}, 
        localfile = {papers/SPE_acquosa.pdf}, 
        date-added = {2014-10-28T13:09:47.657390}, 
    }
    
  20. Rodrigo Santos, Giuseppe Lipari, Jorge Santos, Improving the schedulability of soft real-time open dynamic systems: The inheritor is actually a debtor, The Journal of Systems and Software, vol. 81, n. 7, pp. 1093--1104 2008 ISSN: 0164-1212
    [DOI] [pdf]
    @article {Santos:2008:ISS,
        doi = {10.1016/j.jss.2007.07.004}, 
        date-modified = {2014-10-31T10:00:49.813160}, 
        author = {Santos, Rodrigo and Lipari, Giuseppe and Santos, Jorge}, 
        journal = {The Journal of Systems and Software}, 
        issn = {0164-1212}, 
        number = {7}, 
        month = {7}, 
        volume = {81}, 
        year = {2008}, 
        title = {{I}mproving the schedulability of soft real-time open dynamic systems: {The} inheritor is actually a debtor}, 
        pages = {1093--1104}, 
        localfile = {papers/debtor_santos_lipari.pdf}, 
        date-added = {2014-10-28T13:09:48.059760}, 
    }
    
  21. Giuseppe Lipari, Guest Editorial, Real-Time Systems, 2008 ISSN: 1573-1383
    @article {oai:oai.columbia.edu:epic/nsdl/1/394741,
        publisher = {Springer US}, 
        date-modified = {2014-10-31T10:00:48.972950}, 
        author = {Lipari, Giuseppe}, 
        journal = {Real-Time Systems}, 
        issn = {1573-1383}, 
        year = {2008}, 
        title = {{G}uest {E}ditorial}, 
        date-added = {2014-10-28T13:09:45.985300}, 
    }
    
  22. Rodolfo Pellizzoni, Giuseppe Lipari, Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling, Journal of Computer and System Sciences, vol. 73, n. 2, pp. 186--206 2007
    [DOI] [pdf]
    Abstract: In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task is statically allocated to a processor, and tasks allocated on the same processor are handled by a single-processor scheduling algorithm. Precedence constraints among tasks of the same transaction are modeled by properly assigning scheduling parameters as offsets, jitters and intermediate deadlines. In this paper we address the problem of schedulability analysis of distributed real-time transactions under the earliest deadline first scheduling algorithm. We propose a novel methodology that reduces the pessimism introduced by previous methods by explicitly taking into account the offsets of the tasks. Moreover, we extend the analysis to account for blocking time due to shared resources. In particular, we propose two kinds of schedulability tests, CDO-TO and MDO-TO, and show, with an extensive set of simulations, that they provides improved schedulability conditions with respect to classical algorithms. Finally, we apply the methodology to an important class of systems: heterogeneous multiprocessor systems, with a general purpose processor and one or more coprocessors (DSPs).
    @article {PelLip07,
        publisher = {Elsevier}, 
        doi = {10.1016/j.jcss.2006.04.002}, 
        date-modified = {2014-11-05T08:19:56.423710}, 
        keyword = {real-time systems, scheduling algorithms}, 
        author = {Pellizzoni, Rodolfo and Lipari, Giuseppe}, 
        journal = {Journal of Computer and System Sciences}, 
        title = {{H}olistic analysis of asynchronous real-time transactions with earliest deadline scheduling}, 
        number = {2}, 
        month = {3}, 
        volume = {73}, 
        pages = {186--206}, 
        year = {2007}, 
        abstract = {In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task is statically allocated to a processor, and tasks allocated on the same processor are handled by a single-processor scheduling algorithm. Precedence constraints among tasks of the same transaction are modeled by properly assigning scheduling parameters as offsets, jitters and intermediate deadlines. In this paper we address the problem of schedulability analysis of distributed real-time transactions under the earliest deadline first scheduling algorithm. We propose a novel methodology that reduces the pessimism introduced by previous methods by explicitly taking into account the offsets of the tasks. Moreover, we extend the analysis to account for blocking time due to shared resources. In particular, we propose two kinds of schedulability tests, CDO-TO and MDO-TO, and show, with an extensive set of simulations, that they provides improved schedulability conditions with respect to classical algorithms. Finally, we apply the methodology to an important class of systems: heterogeneous multiprocessor systems, with a general purpose processor and one or more coprocessors (DSPs).}, 
        localfile = {papers/holistic_lipari_pellizzoni.pdf}, 
        date-added = {2014-10-28T13:09:47.753550}, 
    }
    
  23. Claudio Scordino, Giuseppe Lipari, A Resource Reservation Algorithm for Power-Aware Scheduling of Periodic and Aperiodic Real-Time Tasks, IEEE Transactions on Computers, vol. 55, n. 12, pp. 1509--1522 2006
    [DOI] [pdf] [link]
    Abstract: Power consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by batteries, the goal is to extend the autonomy of the system as much as possible. To reduce power consumption, modern processors can change their voltage and frequency at runtime. A power-aware scheduling algorithm can exploit this capability to reduce power consumption while preserving the timing constraints of real-time tasks. In this paper, we present GRUB-PA, a novel power-aware scheduling algorithm based on a resource reservation technique. In addition to providing temporal isolation and time guarantees and, unlike most of the power-aware algorithms proposed in the literature, GRUB-PA can efficiently handle systems consisting of both hard and soft, aperiodic, sporadic, and periodic tasks. We compared our algorithm with existing power-aware scheduling algorithms on an extensive set of simulation experiments on synthetic task sets. The results show that the performance of our algorithm is in line with the state-of-the-art power-aware algorithms. We also present the implementation of our algorithm in the Linux operating system and discuss practical implementation issues like switching overhead and power models. Finally, we show the results of experiments performed on a real testbed application
    @article {journals/tc/ScordinoL06,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/TC.2006.190}, 
        date-modified = {2014-11-05T08:17:27.716310}, 
        author = {Scordino, Claudio and Lipari, Giuseppe}, 
        journal = {IEEE Transactions on Computers}, 
        abstract = {Power consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by batteries, the goal is to extend the autonomy of the system as much as possible. To reduce power consumption, modern processors can change their voltage and frequency at runtime. A power-aware scheduling algorithm can exploit this capability to reduce power consumption while preserving the timing constraints of real-time tasks. In this paper, we present GRUB-PA, a novel power-aware scheduling algorithm based on a resource reservation technique. In addition to providing temporal isolation and time guarantees and, unlike most of the power-aware algorithms proposed in the literature, GRUB-PA can efficiently handle systems consisting of both hard and soft, aperiodic, sporadic, and periodic tasks. We compared our algorithm with existing power-aware scheduling algorithms on an extensive set of simulation experiments on synthetic task sets. The results show that the performance of our algorithm is in line with the state-of-the-art power-aware algorithms. We also present the implementation of our algorithm in the Linux operating system and discuss practical implementation issues like switching overhead and power models. Finally, we show the results of experiments performed on a real testbed application}, 
        title = {{A} Resource {R}eservation {A}lgorithm for {P}ower-{A}ware {S}cheduling of {P}eriodic and {A}periodic {R}eal-{T}ime {T}asks}, 
        number = {12}, 
        pages = {1509--1522}, 
        volume = {55}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.190}, 
        year = {2006}, 
        booktitle = {IEEE Transactions on Computers}, 
        localfile = {papers/TC_scordino_lipari.pdf}, 
        date-added = {2014-10-28T13:09:48.277270}, 
    }
    
  24. Giuseppe Lipari, Paolo Gai, Michael Trimarchi, Giacomo Guidi, P. Ancilotti, A hierarchical framework for component-based real-time systems, Electronic Notes in Theoretical Computer Science (ENTCS), vol. 116, pp. 253--266 2005 ISSN: 1571-0661
    Abstract: In this paper, we describe a methodology for the design and the development of component-based real-time systems. In our model, a component consists of a set of concurrent real-time threads that communicate by means of synchronous and asynchronous operations. In addition, each component can specify its own local scheduling algorithm. We also discuss the support that must be provided at the operating system level, and present an implementation in the SHaRK operating system.
    @article {Lip05-comp,
        publisher = {Elsevier}, 
        date-modified = {2014-11-05T08:29:55.438070}, 
        keyword = {component-based design, hierarchical scheduling, real-time}, 
        author = {Lipari, Giuseppe and Gai, Paolo and Trimarchi, Michael and Guidi, Giacomo and Ancilotti, P.}, 
        journal = {Electronic Notes in Theoretical Computer Science (ENTCS)}, 
        issn = {1571-0661}, 
        pages = {253--266}, 
        volume = {116}, 
        year = {2005}, 
        title = {{A} hierarchical framework for component-based real-time systems}, 
        abstract = {In this paper, we describe a methodology for the design and the development of component-based real-time systems. In our model, a component consists of a set of concurrent real-time threads that communicate by means of synchronous and asynchronous operations. In addition, each component can specify its own local scheduling algorithm. We also discuss the support that must be provided at the operating system level, and present an implementation in the SHaRK operating system.}, 
        date-added = {2014-10-28T13:09:46.795260}, 
    }
    
  25. Luca Abeni, Tommaso Cucinotta, Giuseppe Lipari, Luca Marzario, Luigi Palopoli, QoS management through adaptive reservations, Real-Time Systems, vol. 29, n. 2, pp. 131--155 2005 ISSN: 0922-6443
    @article {abeni2005qos,
        publisher = {Springer}, 
        date-modified = {2014-11-05T08:10:58.509260}, 
        author = {Abeni, Luca and Cucinotta, Tommaso and Lipari, Giuseppe and Marzario, Luca and Palopoli, Luigi}, 
        journal = {Real-Time Systems}, 
        issn = {0922-6443}, 
        number = {2}, 
        volume = {29}, 
        year = {2005}, 
        title = {{Q}oS management through adaptive reservations}, 
        pages = {131--155}, 
        date-added = {2014-10-28T13:09:32.057120}, 
    }
    
  26. Paul Caspi, Alberto Sangiovanni-Vincentelli, Luis Almeida, Albert Benveniste, B. Bouyssounouse, Giorgio C. Buttazzo, I. Crnkovic, W. Damm, Jacob Engblom, G. Folher, others, Guidelines for a graduate curriculum on embedded software and systems, ACM Transactions on Embedded Computing Systems (TECS), vol. 4, n. 3, pp. 587--611 2005 ISSN: 1539-9087
    @article {caspi2005guidelines,
        publisher = {ACM}, 
        date-modified = {2014-11-05T08:11:02.834180}, 
        author = {Caspi, Paul and Sangiovanni-Vincentelli, Alberto and Almeida, Luis and Benveniste, Albert and Bouyssounouse, B. and Buttazzo, Giorgio C. and Crnkovic, I. and Damm, W. and Engblom, Jacob and Folher, G. and others}, 
        journal = {ACM Transactions on Embedded Computing Systems (TECS)}, 
        issn = {1539-9087}, 
        number = {3}, 
        volume = {4}, 
        year = {2005}, 
        title = {{G}uidelines for a graduate curriculum on embedded software and systems}, 
        pages = {587--611}, 
        date-added = {2014-10-28T13:09:34.487120}, 
    }
    
  27. Giuseppe Lipari, Enrico Bini, A methodology for designing hierarchical scheduling systems, Journal of Embedded Computing, vol. 1, n. 2, pp. 257--269 2005 ISSN: 1740-4460
    [link]
    @article {journals/jec/LipariB05,
        publisher = {IOS Press}, 
        date-modified = {2014-11-05T08:11:53.228760}, 
        author = {Lipari, Giuseppe and Bini, Enrico}, 
        journal = {Journal of Embedded Computing}, 
        issn = {1740-4460}, 
        number = {2}, 
        volume = {1}, 
        link = {http://iospress.metapress.com/content/a60keb3bb9c9cptn/}, 
        year = {2005}, 
        title = {{A} methodology for designing hierarchical scheduling systems}, 
        pages = {257--269}, 
        date-added = {2014-10-28T13:09:46.579300}, 
    }
    
  28. Rodolfo Pellizzoni, Giuseppe Lipari, Feasibility Analysis of Real-Time Periodic Tasks with Offsets, Real-Time Systems, vol. 30, n. 1-2, pp. 105--128 2005
    [DOI] [pdf]
    @article {journals/rts/PellizzoniL05,
        publisher = {Springer}, 
        doi = {10.1007/s11241-005-0506-x}, 
        date-modified = {2014-11-05T08:13:29.256350}, 
        author = {Pellizzoni, Rodolfo and Lipari, Giuseppe}, 
        journal = {Real-Time Systems}, 
        title = {{F}easibility {A}nalysis of {R}eal-{T}ime {P}eriodic {T}asks with {O}ffsets}, 
        number = {1-2}, 
        volume = {30}, 
        year = {2005}, 
        pages = {105--128}, 
        localfile = {papers/rtsj_pellizzoni_lipari_edf_offsets.pdf}, 
        date-added = {2014-10-28T13:09:47.795030}, 
    }
    
  29. Giuseppe Lipari, Gerardo Lamastra, Luca Abeni, Task synchronization in reservation-based real-time systems, IEEE Transactions on Computers, vol. 53, n. 12, pp. 1591--1601 2004
    [DOI]
    Abstract: In this paper, we present the BandWidth Inheritance (BWI) protocol, a new strategy for scheduling real-time tasks in dynamic systems, which extends the resource reservation framework to systems where tasks can interact through shared resources. The proposed protocol provides temporal isolation between independent groups of tasks and enables a schedulability analysis for guaranteeing the performance of hard real-time tasks. We show that BWI is the natural extension of the well-known priority inheritance protocol to dynamic reservation systems. A formal analysis of the protocol is presented and a guarantee test for hard real-time tasks is proposed that takes into account the case in which hard real-time tasks interact with soft real-time tasks.
    @article {lipari2004task,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/TC.2004.120}, 
        date-modified = {2014-11-05T08:18:18.775030}, 
        author = {Lipari, Giuseppe and Lamastra, Gerardo and Abeni, Luca}, 
        journal = {IEEE Transactions on Computers}, 
        title = {{T}ask synchronization in reservation-based real-time systems}, 
        number = {12}, 
        pages = {1591--1601}, 
        volume = {53}, 
        year = {2004}, 
        abstract = {In this paper, we present the BandWidth Inheritance (BWI) protocol, a new strategy for scheduling real-time tasks in dynamic systems, which extends the resource reservation framework to systems where tasks can interact through shared resources. The proposed protocol provides temporal isolation between independent groups of tasks and enables a schedulability analysis for guaranteeing the performance of hard real-time tasks. We show that BWI is the natural extension of the well-known priority inheritance protocol to dynamic reservation systems. A formal analysis of the protocol is presented and a guarantee test for hard real-time tasks is proposed that takes into account the case in which hard real-time tasks interact with soft real-time tasks.}, 
        date-added = {2014-10-28T13:09:46.941990}, 
    }
    
  30. Giuseppe Lipari, Enrico Bini, G. Folher, A framework for composing real-time schedulers, Electronic Notes in Theoretical Computer Science, vol. 82, n. 6, pp. 133--146 2003
    @article {lipari2003framework,
        publisher = {Elsevier}, 
        date-modified = {2014-11-05T08:09:43.492700}, 
        author = {Lipari, Giuseppe and Bini, Enrico and Folher, G.}, 
        journal = {Electronic Notes in Theoretical Computer Science}, 
        title = {{A} framework for composing real-time schedulers}, 
        number = {6}, 
        volume = {82}, 
        year = {2003}, 
        pages = {133--146}, 
        date-added = {2014-11-05T08:09:43.492720}, 
    }
    
  31. Luigi Palopoli, Luca Abeni, Giuseppe Lipari, On the application of hybrid control to cpu reservations, Hybrid Systems: Computation and Control, pp. 389--404 2003
    @article {palopoli2003application,
        publisher = {Springer}, 
        date-modified = {2014-11-05T08:10:28.967180}, 
        author = {Palopoli, Luigi and Abeni, Luca and Lipari, Giuseppe}, 
        journal = {Hybrid Systems: Computation and Control}, 
        title = {{O}n the application of hybrid control to cpu reservations}, 
        year = {2003}, 
        pages = {389--404}, 
        date-added = {2014-10-28T13:09:47.612800}, 
    }
    
  32. Giorgio C. Buttazzo, Giuseppe Lipari, Marco Caccamo, Luca Abeni, Elastic scheduling for flexible workload management, IEEE Transactions on Computers, vol. 51, n. 3, pp. 289--302 2002
    [DOI]
    Abstract: An increasing number of real-time applications related to multimedia and adaptive control systems require greater flexibility than classical real-time theory usually permits. We present a novel scheduling framework in which tasks are treated as springs with given elastic coefficients to better conform to the actual load conditions. Under this model, periodic tasks can intentionally change their execution rate to provide different quality of service and the other tasks can automatically adapt their periods to keep the system underloaded. The proposed model can also be used to handle overload conditions in a more flexible way and to provide a simple and efficient mechanism for controlling a system's performance as a function of the current load
    @article {buttazzo2002elastic,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/12.990127}, 
        date-modified = {2014-11-05T08:18:05.300310}, 
        author = {Buttazzo, Giorgio C. and Lipari, Giuseppe and Caccamo, Marco and Abeni, Luca}, 
        journal = {IEEE Transactions on Computers}, 
        title = {{E}lastic scheduling for flexible workload management}, 
        number = {3}, 
        pages = {289--302}, 
        volume = {51}, 
        year = {2002}, 
        abstract = {An increasing number of real-time applications related to multimedia and adaptive control systems require greater flexibility than classical real-time theory usually permits. We present a novel scheduling framework in which tasks are treated as springs with given elastic coefficients to better conform to the actual load conditions. Under this model, periodic tasks can intentionally change their execution rate to provide different quality of service and the other tasks can automatically adapt their periods to keep the system underloaded. The proposed model can also be used to handle overload conditions in a more flexible way and to provide a simple and efficient mechanism for controlling a system's performance as a function of the current load}, 
        date-added = {2014-10-28T13:09:34.129590}, 
    }
    
  33. Paolo Gai, Giuseppe Lipari, Marco Di Natale, Stack Size Minimization for Embedded Real-Time Systems-on-a-Chip, Design Automation for Embedded Systems, vol. 7, n. 1-2, pp. 53--87 2002 ISSN: 1572-8080
    [DOI]
    Abstract: he primary goal for real-time kernel software for single and multiple-processor on a chip systems is to support the design of timely and cost effective systems. The kernel must provide time guarantees, in order to predict the timely behaviorof the application, an extremely fast response time, in order not to waste computing power outside of the application cycles and save as much RAM space as possible in order to reduce the overall cost of the chip. The research on real-time software systems has produced algorithms that allow to effectively schedule system resources while guaranteeing the deadlines of the application and to group tasks in a very small number of non-preemptive sets which require much less RAM memory for stack. Unfortunately, up to now the research focus has been on time guarantees rather than on the optimization of RAM usage.Furthermore, these techniques do not apply to multiprocessor architectures which are likely to be widely used in future microcontrollers. This paper presents innovative scheduling and optimization algorithms that effectively solve the problem of guaranteeing schedulability with an extremely little operating system overhead and minimizing RAM usage. We developed a fast and simple algorithm for sharing resources in multiprocessor systems, together with an innovative procedure for assigning a preemption threshold to tasks. These allow the use of a single user stack. The experimental part shows the effectiveness of a simulated annealing-based tool that allows to find a schedulable system configuration starting from the selection of a near-optimal task allocation. When used in conjunction with our preemption threshold assignment algorithm, our tool further reduces the RAM usage in multiprocessor systems.
    @article {gai2002stack,
        publisher = {Springer}, 
        doi = {10.1023/A:1019795414875}, 
        date-modified = {2014-11-05T08:09:46.976620}, 
        author = {Gai, Paolo and Lipari, Giuseppe and {Di Natale}, Marco}, 
        abstract = {he primary goal for real-time kernel software for single and multiple-processor on a chip systems is to support the design of timely and cost effective systems. The kernel must provide time guarantees, in order to predict the timely behaviorof the application, an extremely fast response time, in order not to waste computing power outside of the application cycles and save as much RAM space as possible in order to reduce the overall cost of the chip. The research on real-time software systems has produced algorithms that allow to effectively schedule system resources while guaranteeing the deadlines of the application and to group tasks in a very small number of non-preemptive sets which require much less RAM memory for stack. Unfortunately, up to now the research focus has been on time guarantees rather than on the optimization of RAM usage.Furthermore, these techniques do not apply to multiprocessor architectures which are likely to be widely used in future microcontrollers. This paper presents innovative scheduling and optimization algorithms that effectively solve the problem of guaranteeing schedulability with an extremely little operating system overhead and minimizing RAM usage. We developed a fast and simple algorithm for sharing resources in multiprocessor systems, together with an innovative procedure for assigning a preemption threshold to tasks. These allow the use of a single user stack. The experimental part shows the effectiveness of a simulated annealing-based tool that allows to find a schedulable system configuration starting from the selection of a near-optimal task allocation. When used in conjunction with our preemption threshold assignment algorithm, our tool further reduces the RAM usage in multiprocessor systems.}, 
        issn = {1572-8080}, 
        number = {1-2}, 
        pages = {53--87}, 
        volume = {7}, 
        year = {2002}, 
        title = {{S}tack {S}ize {M}inimization for {E}mbedded {R}eal-{T}ime {S}ystems-on-a-{C}hip}, 
        journal = {Design Automation for Embedded Systems}, 
        date-added = {2014-11-05T08:09:46.976640}, 
    }
    
  34. Luigi Palopoli, Giuseppe Lipari, Gerardo Lamastra, Luca Abeni, Gabriele Bolognini, P. Ancilotti, An object-oriented tool for simulating distributed real-time control systems, Software: Practice and Experience, vol. 32, n. 9, pp. 907--932 2002 ISSN: 1097-024X
    @article {palopoli2002object,
        publisher = {Wiley Online Library}, 
        date-modified = {2014-11-05T08:11:00.194980}, 
        author = {Palopoli, Luigi and Lipari, Giuseppe and Lamastra, Gerardo and Abeni, Luca and Bolognini, Gabriele and Ancilotti, P.}, 
        journal = {Software: Practice and Experience}, 
        issn = {1097-024X}, 
        number = {9}, 
        volume = {32}, 
        year = {2002}, 
        title = {{A}n object-oriented tool for simulating distributed real-time control systems}, 
        pages = {907--932}, 
        date-added = {2014-10-28T13:09:47.705130}, 
    }
    
  35. Giuseppe Lipari, Giorgio C. Buttazzo, Schedulability Analysis of Periodic and Aperiodic Tasks with Resource Constraints, Journal of System Architectures, vol. 46, n. 4, pp. 327--338 2000 ISSN: 1383-7621
    @article {Lip01-ape,
        publisher = {Elsevier}, 
        date-modified = {2014-11-05T08:13:18.864610}, 
        author = {Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        journal = {Journal of System Architectures}, 
        issn = {1383-7621}, 
        number = {4}, 
        volume = {46}, 
        year = {2000}, 
        title = {{S}chedulability {A}nalysis of {P}eriodic and {A}periodic {T}asks with {R}esource {C}onstraints}, 
        pages = {327--338}, 
        date-added = {2014-10-28T13:09:36.103230}, 
    }
    

Conferences and workshops

2016

  1. Houssam-Eddine Zahaf, Abou El Hassan Benyamina, G. Lipari, R. Olejnik, P. Boulet, Modeling Parallel Real-time Tasks with Di-Graphs, Proceedings of the 24th International Conference on Real-Time Networks and Systems 2016
    [DOI] [link]
    @inproceedings {Zahaf:RTNS:2016,
        numpages = {10}, 
        publisher = {ACM}, 
        doi = {10.1145/2997465.2997475}, 
        isbn = {978-1-4503-4787-7}, 
        author = {Zahaf, Houssam-Eddine and Benyamina, Abou El Hassan and Lipari, G. and Olejnik, R. and Boulet, P.}, 
        series = {RTNS '16}, 
        booktitle = {Proceedings of the 24th International Conference on Real-Time Networks and Systems}, 
        acmid = {2997475}, 
        year = {2016}, 
        link = {http://doi.acm.org/10.1145/2997465.2997475}, 
        location = {Brest, France}, 
        address = {New York, NY, USA}, 
        title = {{M}odeling {P}arallel {R}eal-time {T}asks with {D}i-{G}raphs}, 
        pages = {339--348}, 
    }
    
  2. Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun, Multicore CPU Reclaiming: Parallel or Sequential?, Proceedings of the 31st Annual ACM Symposium on Applied Computing 2016
    [DOI] [link]
    @inproceedings {Abeni:2016,
        numpages = {8}, 
        publisher = {ACM}, 
        doi = {10.1145/2851613.2851743}, 
        isbn = {978-1-4503-3739-7}, 
        keyword = {multiprocessor; real-time scheduling; reclaiming unused bandwidth}, 
        author = {Abeni, Luca and Lipari, Giuseppe and Parri, Andrea and Sun, Youcheng}, 
        series = {SAC '16}, 
        booktitle = {Proceedings of the 31st Annual ACM Symposium on Applied Computing}, 
        acmid = {2851743}, 
        year = {2016}, 
        link = {http://doi.acm.org/10.1145/2851613.2851743}, 
        location = {Pisa, Italy}, 
        address = {New York, NY, USA}, 
        title = {{M}ulticore {C}PU {R}eclaiming: {P}arallel or {S}equential?}, 
        pages = {1877--1884}, 
    }
    
  3. Houssam eddine ZAHAF, Richard Olejnik, Giuseppe Lipari, Abou El Hassen Benyamina, Modelling the Energy Consumption of Soft Real-Time Tasks on Heterogeneous Computing Architectures, Energy Efficiency with Heterogenous Computing 2016
    [link]
    @inproceedings {zahaf2016modelling,
        hal_id = {hal-01242681}, 
        title = {{M}odelling the {E}nergy {C}onsumption of {S}oft {R}eal-{T}ime {T}asks on {H}eterogeneous {C}omputing {A}rchitectures}, 
        booktitle = {Energy Efficiency with Heterogenous Computing}, 
        author = {ZAHAF, Houssam eddine and Olejnik, Richard and Lipari, Giuseppe and Benyamina, Abou El Hassen}, 
        year = {2016}, 
        hal_version = {v1}, 
        month = {jan}, 
        link = {https://hal.archives-ouvertes.fr/hal-01242681}, 
        address = {prague, Czech Republic}, 
        pdf = {https://hal.archives-ouvertes.fr/hal-01242681/file/EEHCO16_paper_1.pdf}, 
    }
    

2015

  1. Étienne André, Giuseppe Lipari, Hoang Gia Nguyen, Youcheng Sun, Reachability Preservation Based Parameter Synthesis for Timed Automata, NASA} Formal Methods - 7th International Symposium, {NFM} 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings 2015
    [DOI] [link]
    @inproceedings {AndreLNS15,
        doi = {10.1007/978-3-319-17524-9_5}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/nfm/AndreLNS15}, 
        author = {André, Étienne and Lipari, Giuseppe and Nguyen, Hoang Gia and Sun, Youcheng}, 
        timestamp = {Wed, 08 Apr 2015 14:02:16 +0200}, 
        booktitle = {{NASA} Formal Methods - 7th International Symposium, {NFM} 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings}, 
        title = {{R}eachability {P}reservation {B}ased {P}arameter {S}ynthesis for {T}imed {A}utomata}, 
        link = {http://dx.doi.org/10.1007/978-3-319-17524-9_5}, 
        year = {2015}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {50--65}, 
        crossref = {DBLP:conf/nfm/2015}, 
    }
    
  2. Youcheng Sun, Giuseppe Lipari, Response Time Analysis with Limited Carry-in for Global Earliest Deadline First Scheduling, Proc. of the IEEE Real-Time Systems Symposium 2015
    [pdf]
    @inproceedings {Sun-RTSS2015,
        publisher = {IEEE Computer Society}, 
        title = {{R}esponse {T}ime {A}nalysis with {L}imited {C}arry-in for {G}lobal {E}arliest {D}eadline {F}irst {S}cheduling }, 
        booktitle = {Proc. of the IEEE Real-Time Systems Symposium}, 
        author = {Sun, Youcheng and Lipari, Giuseppe}, 
        month = {dec}, 
        year = {2015}, 
        localfile = {papers/rta-edf-rtss2015.pdf}, 
    }
    
  3. Youcheng Sun, Étienne André, Giuseppe Lipari, Verification of two real-time systems using parametric timed automata, Proceedings of the WATERS workshop 2015
    [url]
    @inproceedings {Sun-WATERS2015,
        title = {{V}erification of two real-time systems using parametric timed automata}, 
        booktitle = {Proceedings of the WATERS workshop}, 
        author = {Sun, Youcheng and André, Étienne and Lipari, Giuseppe}, 
        month = {jul}, 
        location = {Lund, Sweden}, 
        year = {2015}, 
        howpublished = {http://ecrts.eit.uni-kl.de/forum/viewtopic.php?f=22&t=33}, 
    }
    

2014

  1. Luca Abeni, Giuseppe Lipari, Juri Lelli, Constant Bandwidth Server Revisited, Proceedings of the Embed With Linux 2014 Workshop, Lisboa, Portugal, November 13-14, 2014. 2014
    [link]
    @inproceedings {DBLP:conf/ewili/AbeniLL14,
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/ewili/AbeniLL14}, 
        author = {Abeni, Luca and Lipari, Giuseppe and Lelli, Juri}, 
        timestamp = {Tue, 25 Nov 2014 17:53:56 +0100}, 
        booktitle = {Proceedings of the Embed With Linux 2014 Workshop, Lisboa, Portugal, November 13-14, 2014.}, 
        title = {{C}onstant {B}andwidth {S}erver {R}evisited}, 
        link = {http://ceur-ws.org/Vol-1291/ewili14_5.pdf}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        crossref = {DBLP:conf/ewili/2014}, 
    }
    
  2. Sunil Kumar, Giuseppe Lipari, Latency Analysis of Network-on-Chip Based Many-Core Processors, 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, {PDP} 2014, Torino, Italy, February 12-14, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/pdp/KumarL14,
        doi = {10.1109/PDP.2014.107}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/pdp/KumarL14}, 
        author = {Kumar, Sunil and Lipari, Giuseppe}, 
        timestamp = {Wed, 23 Apr 2014 17:46:20 +0200}, 
        booktitle = {22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, {PDP} 2014, Torino, Italy, February 12-14, 2014}, 
        title = {{L}atency {A}nalysis of {N}etwork-on-{C}hip {B}ased {M}any-{C}ore {P}rocessors}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/PDP.2014.107}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {432--439}, 
        crossref = {DBLP:conf/pdp/2014}, 
    }
    
  3. Youcheng Sun, Giuseppe Lipari, Nan Guan, Wang Yi, Improving the response time analysis of global fixed-priority multiprocessor scheduling, 2014 {IEEE} 20th International Conference on Embedded and Real-Time Computing Systems and Applications, Chongqing, China, August 20-22, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/rtcsa/SunLA014,
        doi = {10.1109/RTCSA.2014.6910543}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/rtcsa/SunLA014}, 
        author = {Sun, Youcheng and Lipari, Giuseppe and Guan, Nan and Yi, Wang}, 
        timestamp = {Wed, 01 Oct 2014 08:00:15 +0200}, 
        booktitle = {2014 {IEEE} 20th International Conference on Embedded and Real-Time Computing Systems and Applications, Chongqing, China, August 20-22, 2014}, 
        title = {{I}mproving the response time analysis of global fixed-priority multiprocessor scheduling}, 
        link = {http://dx.doi.org/10.1109/RTCSA.2014.6910543}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {1--9}, 
        crossref = {DBLP:conf/rtcsa/2014}, 
    }
    
  4. Youcheng Sun, Giuseppe Lipari, Romain Soulat, Laurent Fribourg, Nicolas Markey, Component-based analysis of hierarchical scheduling using linear hybrid automata, 2014 {IEEE} 20th International Conference on Embedded and Real-Time Computing Systems and Applications, Chongqing, China, August 20-22, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/rtcsa/SunLSFM14,
        doi = {10.1109/RTCSA.2014.6910502}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/rtcsa/SunLSFM14}, 
        author = {Sun, Youcheng and Lipari, Giuseppe and Soulat, Romain and Fribourg, Laurent and Markey, Nicolas}, 
        timestamp = {Tue, 30 Sep 2014 19:29:21 +0200}, 
        booktitle = {2014 {IEEE} 20th International Conference on Embedded and Real-Time Computing Systems and Applications, Chongqing, China, August 20-22, 2014}, 
        title = {{C}omponent-based analysis of hierarchical scheduling using linear hybrid automata}, 
        link = {http://dx.doi.org/10.1109/RTCSA.2014.6910502}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {1--10}, 
        crossref = {DBLP:conf/rtcsa/2014}, 
    }
    
  5. Youcheng Sun, Giuseppe Lipari, A Weak Simulation Relation for Real-Time Schedulability Analysis of Global Fixed Priority Scheduling Using Linear Hybrid Automata, 22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/rtns/SunL14,
        doi = {10.1145/2659787.2659814}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/rtns/SunL14}, 
        author = {Sun, Youcheng and Lipari, Giuseppe}, 
        timestamp = {Tue, 30 Sep 2014 12:35:31 +0200}, 
        booktitle = {22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014}, 
        title = {{A} Weak {S}imulation {R}elation for {R}eal-{T}ime {S}chedulability {A}nalysis of {G}lobal {F}ixed {P}riority {S}cheduling {U}sing {L}inear {H}ybrid {A}utomata}, 
        link = {http://doi.acm.org/10.1145/2659787.2659814}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {35}, 
        crossref = {DBLP:conf/rtns/2014}, 
    }
    
  6. Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari, Robert I. Davis, Accounting for Cache Related Pre-emption Delays in Hierarchical Scheduling, 22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/rtns/LunnissALD14,
        doi = {10.1145/2659787.2659797}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/rtns/LunnissALD14}, 
        author = {Lunniss, Will and Altmeyer, Sebastian and Lipari, Giuseppe and Davis, Robert I.}, 
        timestamp = {Tue, 30 Sep 2014 12:35:31 +0200}, 
        booktitle = {22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014}, 
        title = {{A}ccounting for {C}ache {R}elated {P}re-emption {D}elays in {H}ierarchical {S}cheduling}, 
        link = {http://doi.acm.org/10.1145/2659787.2659797}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {183}, 
        crossref = {DBLP:conf/rtns/2014}, 
    }
    
  7. Laura Carnevali, Alessandra Melani, Luca Santinelli, Giuseppe Lipari, Probabilistic Deadline Miss Analysis of Real-Time Systems Using Regenerative Transient Analysis, 22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014 2014
    [DOI] [link]
    @inproceedings {DBLP:conf/rtns/CarnevaliMSL14,
        doi = {10.1145/2659787.2659823}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/rtns/CarnevaliMSL14}, 
        author = {Carnevali, Laura and Melani, Alessandra and Santinelli, Luca and Lipari, Giuseppe}, 
        timestamp = {Tue, 30 Sep 2014 12:35:31 +0200}, 
        booktitle = {22nd International Conference on Real-Time Networks and Systems, {RTNS} '14, Versaille, France, October 8-10, 2014}, 
        title = {{P}robabilistic {D}eadline {M}iss {A}nalysis of {R}eal-{T}ime {S}ystems {U}sing {R}egenerative {T}ransient {A}nalysis}, 
        link = {http://doi.acm.org/10.1145/2659787.2659823}, 
        year = {2014}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {299}, 
        crossref = {DBLP:conf/rtns/2014}, 
    }
    
  8. Youcheng Sun, Giuseppe Lipari, Étienne André, Laurent Fribourg, Toward Parametric Timed Interfaces for Real-Time Components, Proceedings 1st International Workshop on Synthesis of Continuous Parameters, SynCoP 2014, Grenoble, France, 6th April 2014. 2014
    [DOI] [link]
    @inproceedings {Sun14,
        doi = {10.4204/EPTCS.145.6}, 
        date-modified = {2014-11-05T08:09:47.240080}, 
        author = {Sun, Youcheng and Lipari, Giuseppe and André, Étienne and Fribourg, Laurent}, 
        series = {Electronic Proceedings in Theoretical Computer Science}, 
        booktitle = {Proceedings 1st International Workshop on Synthesis of Continuous Parameters, SynCoP 2014, Grenoble, France, 6th April 2014.}, 
        title = {{T}oward {P}arametric {T}imed {I}nterfaces for {R}eal-{T}ime {C}omponents}, 
        year = {2014}, 
        month = {4}, 
        link = {http://dx.doi.org/10.4204/EPTCS.145.6}, 
        editor = {Springer}, 
        timestamp = {Fri, 02 May 2014 14:35:37 +0200}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        date-added = {2014-11-05T08:09:47.240110}, 
        pages = {49--64}, 
        crossref = {DBLP:journals/corr/AndreF14}, 
    }
    

2013

  1. Mario Bambagini, Juri Lelli, Giorgio C. Buttazzo, Giuseppe Lipari, On the Energy-Aware Partitioning of Real-Time Tasks on Homogeneous Multi-Processor Systems, Proceedings of the 4th International Conference on Energy Aware Computing Systems and Applications 2013
    @inproceedings {Bambagini-ICEAC-2013,
        date-modified = {2014-11-05T08:09:46.621730}, 
        title = {{O}n the {E}nergy-{A}ware {P}artitioning of {R}eal-{T}ime {T}asks on {H}omogeneous {M}ulti-{P}rocessor {S}ystems}, 
        booktitle = {Proceedings of the 4th International Conference on Energy Aware Computing Systems and Applications}, 
        author = {Bambagini, Mario and Lelli, Juri and Buttazzo, Giorgio C. and Lipari, Giuseppe}, 
        month = {12}, 
        year = {2013}, 
        date-added = {2014-11-05T08:09:46.621750}, 
    }
    
  2. Giuseppe Lipari, Giorgio C. Buttazzo, Resource reservation for Mixed Criticality Systems, Real-Time Sytems: the past, the present, and the future 2013
    @inproceedings {Lipari-MC-York-2013,
        date-modified = {2014-11-05T08:09:46.865990}, 
        author = {Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        booktitle = {Real-Time Sytems: the past, the present, and the future}, 
        title = {{R}esource reservation for {M}ixed {C}riticality {S}ystems}, 
        month = {3}, 
        year = {2013}, 
        pages = {60--74}, 
        date-added = {2014-11-05T08:09:46.866020}, 
    }
    
  3. Giuseppe Lipari, Laurent George, Enrico Bini, Marko Bertogna, On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling, Real-Time Sytems: the past, the present, and the future 2013
    [pdf]
    @inproceedings {Lipari-York-2013,
        date-modified = {2014-11-05T08:09:46.778380}, 
        author = {Lipari, Giuseppe and George, Laurent and Bini, Enrico and Bertogna, Marko}, 
        booktitle = {Real-Time Sytems: the past, the present, and the future}, 
        title = {{O}n the {A}verage {C}omplexity of the {P}rocessor {D}emand {A}nalysis for {E}arliest {D}eadline {S}cheduling}, 
        month = {3}, 
        year = {2013}, 
        pages = {75--86}, 
        localfile = {papers/complexity2013.pdf}, 
        date-added = {2014-11-05T08:09:46.778400}, 
    }
    
  4. Andrea Parri, Juri Lelli, Mauro Marinoni, Giuseppe Lipari, An implementation of the Bandwidth Inheritance Protocol in the Linux Kernel, Proceedings of the 15-th Real-Time Linux Workshop 2013
    @inproceedings {Parri-2013,
        date-modified = {2014-11-05T08:09:46.693260}, 
        title = {{A}n implementation of the {B}andwidth {I}nheritance {P}rotocol in the {L}inux {K}ernel}, 
        booktitle = {Proceedings of the 15-th Real-Time Linux Workshop}, 
        author = {Parri, Andrea and Lelli, Juri and Marinoni, Mauro and Lipari, Giuseppe}, 
        month = {10}, 
        year = {2013}, 
        date-added = {2014-11-05T08:09:46.693290}, 
    }
    
  5. Youcheng Sun, Romain Soulat, Giuseppe Lipari, Étienne André, Laurent Fribourg, Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems, Second International Workshop on Formal Techniques for Safety-Critical Systems 2013
    @inproceedings {Sun-FTSCS-2013,
        date-modified = {2014-11-05T08:09:46.492810}, 
        author = {Sun, Youcheng and Soulat, Romain and Lipari, Giuseppe and André, Étienne and Fribourg, Laurent}, 
        booktitle = {Second International Workshop on Formal Techniques for Safety-Critical Systems}, 
        title = {{P}arametric {S}chedulability {A}nalysis of {F}ixed {P}riority {R}eal-{T}ime {D}istributed {S}ystems}, 
        month = {10}, 
        year = {2013}, 
        pages = {212--228}, 
        date-added = {2014-11-05T08:09:46.492840}, 
    }
    
  6. Giorgio C. Buttazzo, Giuseppe Lipari, Ptask: an Educational C Library for Programming Real-Time Systems on Linux, 18th IEEE International Conference on Emerging Technologies and Factory Automation 2013
    @inproceedings {ptask-etfa-2013,
        date-modified = {2014-11-05T08:09:46.422080}, 
        title = {{P}task: an {E}ducational {C} Library for {P}rogramming {R}eal-{T}ime {S}ystems on {L}inux}, 
        booktitle = {18th IEEE International Conference on Emerging Technologies and Factory Automation}, 
        author = {Buttazzo, Giorgio C. and Lipari, Giuseppe}, 
        month = {9}, 
        year = {2013}, 
        date-added = {2014-11-05T08:09:46.422100}, 
    }
    

2012

  1. Gabriele Cecchetti, Anna Lina Ruscelli, Antonia Mastropaolo, Giuseppe Lipari, Dynamic TXOP HCCA reclaiming scheduler with transmission time estimation for IEEE 802.11e real-time networks, The 15th {ACM} International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM '12, Paphos, Cyprus, October 21-25, 2012 2012
    [DOI] [link]
    @inproceedings {DBLP:conf/mswim/CecchettiRML12,
        doi = {10.1145/2387238.2387279}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/mswim/CecchettiRML12}, 
        author = {Cecchetti, Gabriele and Ruscelli, Anna Lina and Mastropaolo, Antonia and Lipari, Giuseppe}, 
        timestamp = {Fri, 26 Oct 2012 09:16:07 +0200}, 
        booktitle = {The 15th {ACM} International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM '12, Paphos, Cyprus, October 21-25, 2012}, 
        title = {{D}ynamic {T{X}OP} {H{C}CA} reclaiming scheduler with transmission time estimation for {I{E}EE} 802.11e real-time networks}, 
        link = {http://doi.acm.org/10.1145/2387238.2387279}, 
        year = {2012}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {239--246}, 
        crossref = {DBLP:conf/mswim/2012}, 
    }
    
  2. Gabriele Cecchetti, Anna Lina Ruscelli, Antonia Mastropaolo, Giuseppe Lipari, Providing variable TXOP for IEEE 802.11e HCCA real-time networks, 2012 {IEEE} Wireless Communications and Networking Conference, {WCNC} 2012, Paris, France, April 1-4, 2012 2012
    [DOI] [link]
    @inproceedings {DBLP:conf/wcnc/CecchettiRML12,
        doi = {10.1109/WCNC.2012.6214020}, 
        biburl = {http://dblp.uni-trier.de/rec/bib/conf/wcnc/CecchettiRML12}, 
        author = {Cecchetti, Gabriele and Ruscelli, Anna Lina and Mastropaolo, Antonia and Lipari, Giuseppe}, 
        timestamp = {Wed, 20 Jun 2012 10:05:03 +0200}, 
        booktitle = {2012 {IEEE} Wireless Communications and Networking Conference, {WCNC} 2012, Paris, France, April 1-4, 2012}, 
        title = {{P}roviding variable {T{X}OP} for {I{E}EE} 802.11e {H{C}CA} real-time networks}, 
        link = {http://dx.doi.org/10.1109/WCNC.2012.6214020}, 
        year = {2012}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        pages = {1508--1513}, 
        crossref = {DBLP:conf/wcnc/2012}, 
    }
    

2011

  1. Juri Lelli, Giuseppe Lipari, Dario Faggioli, Tommaso Cucinotta, An efficient and scalable implementation of global EDF in Linux, Proceedings of the international workshop on operating systems platforms for embedded real-time applications (OSPERT) 2011
    [pdf]
    @inproceedings {lelli2011efficient,
        date-modified = {2014-11-05T08:09:47.189150}, 
        title = {{A}n efficient and scalable implementation of global {E}DF in {L}inux}, 
        booktitle = {Proceedings of the international workshop on operating systems platforms for embedded real-time applications (OSPERT)}, 
        author = {Lelli, Juri and Lipari, Giuseppe and Faggioli, Dario and Cucinotta, Tommaso}, 
        year = {2011}, 
        localfile = {papers/OSPERT-2011.pdf}, 
        date-added = {2014-11-05T08:09:47.189170}, 
    }
    
  2. Sunil Kumar, Tommaso Cucinotta, Giuseppe Lipari, A latency simulator for many-core systems, Proceedings of the 44th Annual Simulation Symposium 2011
    [pdf]
    @inproceedings {kumar2011latency,
        title = {{A} latency simulator for many-core systems}, 
        booktitle = {Proceedings of the 44th Annual Simulation Symposium}, 
        author = {Kumar, Sunil and Cucinotta, Tommaso and Lipari, Giuseppe}, 
        year = {2011}, 
        organization = {Society for Computer Simulation International}, 
        pages = {151--158}, 
        localfile = {papers/ANSS-2011.pdf}, 
    }
    
  3. Laura Carnevali, Giuseppe Lipari, Alessandro Pinzuti, Enrico Vicario, A formal approach to design and verification of two-level Hierarchical Scheduling systems, Reliable Software Technologies-Ada-Europe 2011 2011
    [pdf]
    @inproceedings {carnevali2011formal,
        publisher = {Springer}, 
        title = {{A} formal approach to design and verification of two-level {H}ierarchical {S}cheduling systems}, 
        booktitle = {Reliable Software Technologies-Ada-Europe 2011}, 
        author = {Carnevali, Laura and Lipari, Giuseppe and Pinzuti, Alessandro and Vicario, Enrico}, 
        year = {2011}, 
        pages = {118--131}, 
        localfile = {papers/Carnevali_AdaEurope2011.pdf}, 
    }
    
  4. Giuseppe Lipari, Enrico Bini, On the Problem of Allocating Multicore Virtual Resources to Real-Time Task Pipelines, 4th Workshop on Compositional Theory and Technology for RealTime Embedded Systems 2011
    [pdf]
    @inproceedings {BiniLipariCRTS2011,
        title = {{O}n the {P}roblem of {A}llocating {M}ulticore {V}irtual {R}esources to {R}eal-{T}ime {T}ask {P}ipelines }, 
        booktitle = {4th Workshop on Compositional Theory and Technology for RealTime Embedded Systems}, 
        author = {Lipari, Giuseppe and Bini, Enrico}, 
        month = {nov}, 
        location = {Vienna}, 
        year = {2011}, 
        localfile = {papers/CRTS11.pdf}, 
    }
    

2010

  1. Gaetano F. Anastasi, Enrico Bini, Antonio Romano, Giuseppe Lipari, A service-oriented architecture for QoS configuration and management of Wireless Sensor Networks, Proc. IEEE Conf. Emerging Technologies and Factory Automation (ETFA) 2010
    [DOI] [pdf]
    Abstract: Software infrastructures for networked enterprises may need data coming from low-level pervasive devices, such as Wireless Sensor Networks (WSNs). However, the complex management of such tiny physical devices is not acceptable for high-level enterprise applications. Hence the need for a middleware layer that hides complexity and supports the management of heterogeneous real-time data coming from the environment. In our opinion, the Service Oriented Architecture (SOA) design paradigm is the most suitable for allowing a seamless and effective integration of pervasive technologies into enterprise information systems. In this paper we present a service-oriented, flexible and adaptable middleware that allows applications to configure WSN functionalities and exploit them in the form of Web Services.
    @inproceedings {Anastasi2010,
        doi = {10.1109/ETFA.2010.5641336}, 
        date-modified = {2014-11-05T08:09:39.563260}, 
        author = {Anastasi, Gaetano F. and Bini, Enrico and Romano, Antonio and Lipari, Giuseppe}, 
        abstract = {Software infrastructures for networked enterprises may need data coming from low-level pervasive devices, such as Wireless Sensor Networks (WSNs). However, the complex management of such tiny physical devices is not acceptable for high-level enterprise applications. Hence the need for a middleware layer that hides complexity and supports the management of heterogeneous real-time data coming from the environment. In our opinion, the Service Oriented Architecture (SOA) design paradigm is the most suitable for allowing a seamless and effective integration of pervasive technologies into enterprise information systems. In this paper we present a service-oriented, flexible and adaptable middleware that allows applications to configure WSN functionalities and exploit them in the form of Web Services.}, 
        title = {{A} service-oriented architecture for {Q}oS configuration and management of {W}ireless {S}ensor {N}etworks}, 
        pages = {1--8}, 
        year = {2010}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE Conf. Emerging Technologies and Factory Automation (ETFA)}, 
        localfile = {papers/2010AnaBinRomLip.pdf}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Dario Faggioli, Giuseppe Lipari, Tommaso Cucinotta, The Multiprocessor Bandwidth Inheritance Protocol, Proc. 22nd Euromicro Conf. Real-Time Systems (ECRTS) 2010
    [DOI] [pdf]
    Abstract: In this paper, the Multiprocessor Bandwidth Inheritance (M-BWI) protocol is presented, which constitutes an extension of the Bandwidth Inheritance (BWI) protocol to symmetric multiprocessor and multicore systems. Similarly to priority inheritance, M-BWI reduces priority inversion in reservation-based scheduling systems, it allows the coexistence of hard, soft and non-real-time tasks, it does not require any information on the temporal parameters of the tasks, hence, it is particularly suitable to open systems, where tasks can dynamically arrive and leave, and their temporal parameters are unknown or only partially known. Moreover, if it is possible to estimate such parameters as the worst-case execution time and the critical sections length, then it is possible to compute an upper bound to the task blocking time. Finally, the M-BWI protocol is neutral to the underlying scheduling scheme, since it can be implemented both in global and partitioned scheduling schemes.
    @inproceedings {DBLP:conf/ecrts/FaggioliLC10,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/ECRTS.2010.19}, 
        date-modified = {2014-11-05T08:17:38.025380}, 
        author = {Faggioli, Dario and Lipari, Giuseppe and Cucinotta, Tommaso}, 
        abstract = {In this paper, the Multiprocessor Bandwidth Inheritance (M-BWI) protocol is presented, which constitutes an extension of the Bandwidth Inheritance (BWI) protocol to symmetric multiprocessor and multicore systems. Similarly to priority inheritance, M-BWI reduces priority inversion in reservation-based scheduling systems, it allows the coexistence of hard, soft and non-real-time tasks, it does not require any information on the temporal parameters of the tasks, hence, it is particularly suitable to open systems, where tasks can dynamically arrive and leave, and their temporal parameters are unknown or only partially known. Moreover, if it is possible to estimate such parameters as the worst-case execution time and the critical sections length, then it is possible to compute an upper bound to the task blocking time. Finally, the M-BWI protocol is neutral to the underlying scheduling scheme, since it can be implemented both in global and partitioned scheduling schemes.}, 
        title = {{T}he {M}ultiprocessor {B}andwidth {I}nheritance {P}rotocol}, 
        pages = {90--99}, 
        year = {2010}, 
        booktitle = {Proc. 22nd Euromicro Conf. Real-Time Systems (ECRTS)}, 
        localfile = {papers/ECRTS-2010.pdf}, 
        date-added = {2014-10-28T13:09:35.931180}, 
    }
    
  3. Nicola Serreli, Giuseppe Lipari, Enrico Bini, The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF, Proc. 22nd Euromicro Conf. Real-Time Systems (ECRTS) 2010
    [DOI] [pdf]
    Abstract: In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end-to-end deadline. Each task of the chain is bound to execute on a particular processing element. The complexity of designing and analyzing a DRE can be reduced by applying a component-based methodology: each pipeline can be seen as a component with its temporal characteristic summarized in its interface. Analysis can be carried out in two different steps: 1) derivation of the temporal interface of a component pipeline, 2) analysis of the whole system by integrating the temporal interfaces of the components. In this paper, we propose to describe the temporal interface of a task pipeline by a set of demand bound functions, one per each node on which the pipeline executes, and we describe an algorithm for computing the dbfs. First, we show that the scenario of strictly periodic activations is not the worst when the pipelines are sporadically activated. Then, we propose an exact algorithm for computing the dbfs. We show by experimental analysis that the computation time of the algorithm on pipelines with reasonable size is below one second on common PCs. Finally, we estimate the pessimism introduced by our analysis with respect to holistic analysis by an extensive set of simulations.
    @inproceedings {DBLP:conf/ecrts/SerreliLB10,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/ECRTS.2010.17}, 
        date-modified = {2014-11-05T08:17:53.765050}, 
        author = {Serreli, Nicola and Lipari, Giuseppe and Bini, Enrico}, 
        abstract = {In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end-to-end deadline. Each task of the chain is bound to execute on a particular processing element. The complexity of designing and analyzing a DRE can be reduced by applying a component-based methodology: each pipeline can be seen as a component with its temporal characteristic summarized in its interface. Analysis can be carried out in two different steps: 1) derivation of the temporal interface of a component pipeline, 2) analysis of the whole system by integrating the temporal interfaces of the components. In this paper, we propose to describe the temporal interface of a task pipeline by a set of demand bound functions, one per each node on which the pipeline executes, and we describe an algorithm for computing the dbfs. First, we show that the scenario of strictly periodic activations is not the worst when the pipelines are sporadically activated. Then, we propose an exact algorithm for computing the dbfs. We show by experimental analysis that the computation time of the algorithm on pipelines with reasonable size is below one second on common PCs. Finally, we estimate the pessimism introduced by our analysis with respect to holistic analysis by an extensive set of simulations.}, 
        title = {{T}he {D}emand {B}ound {F}unction {I}nterface of {D}istributed {S}poradic {P}ipelines of {T}asks {S}cheduled by {E}DF}, 
        pages = {187--196}, 
        year = {2010}, 
        booktitle = {Proc. 22nd Euromicro Conf. Real-Time Systems (ECRTS)}, 
        localfile = {papers/2010SerLipBin.pdf}, 
        date-added = {2014-10-28T13:09:48.328590}, 
    }
    
  4. Christian Nastasi, Mauro Marinoni, Luca Santinelli, Paolo Pagano, Giuseppe Lipari, Gianluca Franchino, BACCARAT: a dynamic real-time bandwidth allocation policy for IEEE 802.15.4, Proc. 8th IEEE Int Pervasive Computing and Communications Workshops (PERCOM Workshops) Conf 2010
    [DOI]
    Abstract: Recently, researchers and engineers began considering the use of WSN in time-sensitive applications. For effective real-time communications, it is important to solve the problem of contention to the communication medium providing an efficient bandwidth allocation mechanism. In this paper we tackle with the problem of performing timely detection of events by a WSN. We propose a real-time bandwidth allocation mechanism for IEEE 802.15.4 that maximizes event detection efficiency and reduces statistical uncertainty under network overload conditions. On-line strategies complement off-line guarantees to enhance the confidence level of the measurements.
    @inproceedings {DBLP:conf/percom/NastasiMSPLF10,
        publisher = {IEEE}, 
        doi = {10.1109/PERCOMW.2010.5470635}, 
        date-modified = {2014-11-05T08:19:44.121350}, 
        author = {Nastasi, Christian and Marinoni, Mauro and Santinelli, Luca and Pagano, Paolo and Lipari, Giuseppe and Franchino, Gianluca}, 
        abstract = {Recently, researchers and engineers began considering the use of WSN in time-sensitive applications. For effective real-time communications, it is important to solve the problem of contention to the communication medium providing an efficient bandwidth allocation mechanism. In this paper we tackle with the problem of performing timely detection of events by a WSN. We propose a real-time bandwidth allocation mechanism for IEEE 802.15.4 that maximizes event detection efficiency and reduces statistical uncertainty under network overload conditions. On-line strategies complement off-line guarantees to enhance the confidence level of the measurements.}, 
        title = {B{A}CC{A}RA{T}: a dynamic real-time bandwidth allocation policy for {I}EE{E} 802.15.4}, 
        pages = {406--412}, 
        year = {2010}, 
        booktitle = {Proc. 8th IEEE Int Pervasive Computing and Communications Workshops (PERCOM Workshops) Conf}, 
        date-added = {2014-10-28T13:09:47.282650}, 
    }
    
  5. Mangesh Chitnis, Claudio Salvadori, Matteo Petracca, Giuseppe Lipari, Paolo Pagano, Traffic related observations by line sensing techniques, Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems 2010
    @inproceedings {DBLP:conf/sensys/ChitnisSPLP10,
        publisher = {ACM}, 
        date-modified = {2014-11-05T08:15:25.074880}, 
        author = {Chitnis, Mangesh and Salvadori, Claudio and Petracca, Matteo and Lipari, Giuseppe and Pagano, Paolo}, 
        booktitle = {Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems}, 
        title = {{T}raffic related observations by line sensing techniques}, 
        editor = {Beutel, Deepak Ganesan; Jack A. Stankovic; Jan}, 
        year = {2010}, 
        pages = {373--374}, 
        date-added = {2014-10-28T13:09:34.983890}, 
    }
    
  6. Luca Santinelli, Mangesh Chitnis, Christian Nastasi, Fabio Checconi, Giuseppe Lipari, Paolo Pagano, A Component-Based Architecture for Adaptive Bandwidth Allocation in Wireless Sensor Networks, Proc. Int Industrial Embedded Systems (SIES) Symp 2010
    [DOI]
    Abstract: In this paper we investigate the problem of reactive on-line bandwidth allocation in adaptive Wireless Sensor Networks. In adaptive WSN for monitoring applications, nodes can react to physical events by adapting their behavior, for instance increasing the amount of computation to be performed, or reducing the amount of consumed energy. Accordingly, the nodes may increase or decrease their bandwidth requirements. Hence, a reconfiguration algorithm is needed to reallocate the bandwidth to the different nodes, to maximize a certain global quality index. To address this problem, we first present a component-based methodology to model nodes and cluster of nodes as components. Then, we use this methodology to decompose the global optimization problem into simpler local problems, so to enable the design of scalable heuristic algorithms. We propose two different heuristic algorithms, and we compare their performance by extensive simulations against a global optimization procedure based on the Simplex algorithm. We demonstrate that our proposed heuristics perform very well under almost all circumstances.
    @inproceedings {DBLP:conf/sies/SantinelliCNCLP10,
        publisher = {IEEE}, 
        doi = {10.1109/SIES.2010.5551381}, 
        date-modified = {2014-11-05T08:20:48.468540}, 
        author = {Santinelli, Luca and Chitnis, Mangesh and Nastasi, Christian and Checconi, Fabio and Lipari, Giuseppe and Pagano, Paolo}, 
        abstract = {In this paper we investigate the problem of reactive on-line bandwidth allocation in adaptive Wireless Sensor Networks. In adaptive WSN for monitoring applications, nodes can react to physical events by adapting their behavior, for instance increasing the amount of computation to be performed, or reducing the amount of consumed energy. Accordingly, the nodes may increase or decrease their bandwidth requirements. Hence, a reconfiguration algorithm is needed to reallocate the bandwidth to the different nodes, to maximize a certain global quality index. To address this problem, we first present a component-based methodology to model nodes and cluster of nodes as components. Then, we use this methodology to decompose the global optimization problem into simpler local problems, so to enable the design of scalable heuristic algorithms. We propose two different heuristic algorithms, and we compare their performance by extensive simulations against a global optimization procedure based on the Simplex algorithm. We demonstrate that our proposed heuristics perform very well under almost all circumstances.}, 
        title = {{A} Component-{B}ased {A}rchitecture for {A}daptive {B}andwidth {A}llocation in {W}ireless {S}ensor {N}etworks}, 
        pages = {174--183}, 
        year = {2010}, 
        booktitle = {Proc. Int Industrial Embedded Systems (SIES) Symp}, 
        date-added = {2014-10-28T13:09:47.931790}, 
    }
    
  7. Giuseppe Lipari, Enrico Bini, A Framework for Hierarchical Scheduling on Multiprocessors: From Application Requirements to Run-Time Allocation, Proc. IEEE 31st Real-Time Systems Symp. (RTSS) 2010
    [DOI]
    Abstract: Hierarchical scheduling is a promising methodology for designing and deploying real-time applications, since it enables component-based design and analysis, and supports temporal isolation among competing applications. In hierarchical scheduling an application is described by means of a temporal interface. The designer faces the problem of how to derive the interface parameters so to make the application schedulable, at the same time minimizing the waste of computational resources. The problem is particularly relevant in multiprocessor systems, where it is not clear yet how the interface parameters influence the schedulability of the application and allocation on the physical platform. In this paper we present three novel contributions to hierarchical scheduling for multiprocessor systems. First, we propose the Bounded-Delay Multipartition (BDM), a new interface specification model that allows the designer to balance resource usage versus flexibility in selecting the virtual platform parameters. Second, we explore the schedulability region of a real-time application on top of a generic virtual platform, and derive the interface parameter. Finally, we propose Fluid Best-Fit, an algorithm that takes advantage of the extra degree of flexibility provided by the BDM to compute the virtual platform parameters and allocate it on the physical platform. The performance of the algorithm is evaluated by simulations.
    @inproceedings {Lipari2010,
        doi = {10.1109/RTSS.2010.12}, 
        date-modified = {2014-11-05T08:09:43.281190}, 
        author = {Lipari, Giuseppe and Bini, Enrico}, 
        abstract = {Hierarchical scheduling is a promising methodology for designing and deploying real-time applications, since it enables component-based design and analysis, and supports temporal isolation among competing applications. In hierarchical scheduling an application is described by means of a temporal interface. The designer faces the problem of how to derive the interface parameters so to make the application schedulable, at the same time minimizing the waste of computational resources. The problem is particularly relevant in multiprocessor systems, where it is not clear yet how the interface parameters influence the schedulability of the application and allocation on the physical platform. In this paper we present three novel contributions to hierarchical scheduling for multiprocessor systems. First, we propose the Bounded-Delay Multipartition (BDM), a new interface specification model that allows the designer to balance resource usage versus flexibility in selecting the virtual platform parameters. Second, we explore the schedulability region of a real-time application on top of a generic virtual platform, and derive the interface parameter. Finally, we propose Fluid Best-Fit, an algorithm that takes advantage of the extra degree of flexibility provided by the BDM to compute the virtual platform parameters and allocate it on the physical platform. The performance of the algorithm is evaluated by simulations.}, 
        title = {{A} Framework for {H}ierarchical {S}cheduling on {M}ultiprocessors: {F}rom {A}pplication {R}equirements to {R}un-{T}ime {A}llocation}, 
        pages = {249--258}, 
        year = {2010}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE 31st Real-Time Systems Symp. (RTSS)}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  8. Anna L. Ruscelli, Gabriele Cecchetti, Satish Gopalakrishnan, Giuseppe Lipari, A model for the design of wireless sensor networks using geographic routing, Proc. IEEE GLOBECOM Workshops (GC Wkshps) 2010
    [DOI]
    Abstract: The design of a Wireless Sensor Network suitable to meet the applications requirements is particularly relevant in environments where it is not possible to operate after the deployment, modifying the network to respect the desired behavior. This paper proposes a model to allow performance evaluation of the network before its deployment, helping its design and the choice of the right value of the network parameters. In particular our model is tailored for wireless sensor networks using the geographic routing. The model has been both numerically analyzed and simulated showing its ability to set such parameters to meet the requirements expressed in terms of established service levels.
    @inproceedings {Ruscelli2010,
        doi = {10.1109/GLOCOMW.2010.5700234}, 
        date-modified = {2014-11-05T08:09:45.590360}, 
        author = {Ruscelli, Anna L. and Cecchetti, Gabriele and Gopalakrishnan, Satish and Lipari, Giuseppe}, 
        abstract = {The design of a Wireless Sensor Network suitable to meet the applications requirements is particularly relevant in environments where it is not possible to operate after the deployment, modifying the network to respect the desired behavior. This paper proposes a model to allow performance evaluation of the network before its deployment, helping its design and the choice of the right value of the network parameters. In particular our model is tailored for wireless sensor networks using the geographic routing. The model has been both numerically analyzed and simulated showing its ability to set such parameters to meet the requirements expressed in terms of established service levels.}, 
        title = {{A} model for the design of wireless sensor networks using geographic routing}, 
        pages = {1712--1717}, 
        year = {2010}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE GLOBECOM Workshops (GC Wkshps)}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  9. Nicola Serreli, Giuseppe Lipari, Enrico Bini, The Distributed Deadline Synchronization Protocol for real-time systems scheduled by EDF, Proc. IEEE Conf. Emerging Technologies and Factory Automation (ETFA) 2010
    [DOI] [pdf]
    Abstract: Many distributed and multiprocessor real-time applications consist of pipelines of tasks that must complete before their end-to-end deadlines. Different schedulability analyses have been proposed for both Fixed Priority and Earliest Deadline First scheduling. All the schedulability analyses proposed so far assume that a global clock synchronization protocol is used to synchronize the deadlines of jobs allocated on different processors. This assumption may limit the applicability of EDF to such systems. In this paper, we propose the Distributed Deadline Synchronization Protocol (DDSP) for computing the absolute deadlines of jobs. The protocol is a non-trivial extension of the Release Guard Protocol proposed for fixed priority systems. DDSP does not require a global clock synchronization, yet existing schedulability analyses are valid for schedules generated by DDSP.
    @inproceedings {serreli2010distributed,
        doi = {10.1109/ETFA.2010.5641357}, 
        date-modified = {2014-11-05T08:19:30.965340}, 
        author = {Serreli, Nicola and Lipari, Giuseppe and Bini, Enrico}, 
        abstract = {Many distributed and multiprocessor real-time applications consist of pipelines of tasks that must complete before their end-to-end deadlines. Different schedulability analyses have been proposed for both Fixed Priority and Earliest Deadline First scheduling. All the schedulability analyses proposed so far assume that a global clock synchronization protocol is used to synchronize the deadlines of jobs allocated on different processors. This assumption may limit the applicability of EDF to such systems. In this paper, we propose the Distributed Deadline Synchronization Protocol (DDSP) for computing the absolute deadlines of jobs. The protocol is a non-trivial extension of the Release Guard Protocol proposed for fixed priority systems. DDSP does not require a global clock synchronization, yet existing schedulability analyses are valid for schedules generated by DDSP.}, 
        title = {{T}he {D}istributed {D}eadline {S}ynchronization {P}rotocol for real-time systems scheduled by {E}DF}, 
        pages = {1--8}, 
        year = {2010}, 
        organization = {IEEE}, 
        booktitle = {Proc. IEEE Conf. Emerging Technologies and Factory Automation (ETFA)}, 
        localfile = {papers/2010SerLipBin_a.pdf}, 
        date-added = {2014-10-28T13:09:48.422900}, 
    }
    

2009

  1. Tommaso Cucinotta, Giuseppe Lipari, Luigi Palopoli, Luca Abeni, Rodrigo Santos, Multi-level feedback control for Quality of Service Management, Proc. IEEE Conf. Emerging Technologies & Factory Automation ETFA 2009 2009
    [DOI]
    Abstract: We consider the problem of power-aware quality of service (QoS) control for soft real-time embedded systems. Applications can have time-varying and scarcely known resource requirements, and can be activated and terminated at any time. However, they have the capability to switch among a discrete set of operation modes with different QoS levels and resource requirements. In addition, the platform provides resources with power-scaling capabilities and may be subject to power constraints. We present a QoS control architecture achieving optimum trade-offs between overall QoS and power consumption of the system, based on two nested control loops. The external one decides dynamically the optimum configuration for the system, in terms of application QoS modes and resource power modes, while the internal one modulates the resource allocations on a job by job basis, so as to respect timing constraints. We demonstrate the effectiveness of the approach by extensive simulations with trace data of real multimedia applications.
    @inproceedings {Cucinotta2009,
        doi = {10.1109/ETFA.2009.5347100}, 
        date-modified = {2014-11-05T08:09:41.747390}, 
        author = {Cucinotta, Tommaso and Lipari, Giuseppe and Palopoli, Luigi and Abeni, Luca and Santos, Rodrigo}, 
        abstract = {We consider the problem of power-aware quality of service (QoS) control for soft real-time embedded systems. Applications can have time-varying and scarcely known resource requirements, and can be activated and terminated at any time. However, they have the capability to switch among a discrete set of operation modes with different QoS levels and resource requirements. In addition, the platform provides resources with power-scaling capabilities and may be subject to power constraints. We present a QoS control architecture achieving optimum trade-offs between overall QoS and power consumption of the system, based on two nested control loops. The external one decides dynamically the optimum configuration for the system, in terms of application QoS modes and resource power modes, while the internal one modulates the resource allocations on a job by job basis, so as to respect timing constraints. We demonstrate the effectiveness of the approach by extensive simulations with trace data of real multimedia applications.}, 
        title = {{M}ulti-level feedback control for {Q}uality of {S}ervice {M}anagement}, 
        pages = {1--8}, 
        year = {2009}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE Conf. Emerging Technologies & Factory Automation ETFA 2009}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Mangesh Chitnis, Paolo Pagano, Giuseppe Lipari, Yao Liang, A Survey on Bandwidth Resource Allocation and Scheduling in Wireless Sensor Networks, Proc. Int. Conf. Network-Based Information Systems NBIS '09 2009
    [DOI]
    Abstract: Bandwidth resource allocation and scheduling has posed a challenging problem in wireless sensor networks. This paper provides a survey on the current state-of-the-art researches in this important area. Bandwidth reservation is considered in terms of time slot allocation in a pure TDMA or TDMA/CSMA based networks. We first overview different approaches for time slot allocation in a star network topology, and then elaborate the problem of time slot allocation and scheduling in a multihop wireless communication network in the presence of interference. Since the problem in multihop wireless network is proved to be NP-complete, most of the exiting solutions use different heuristics to resolve this problem. We address some of these heuristics and algorithms and their impact in wireless sensor networks. Finally, we provide some of the advantages, limitations and possible extensions in the context of IEEE 802.15.4 communications protocol which is being widely used for wireless sensor networks.
    @inproceedings {DBLP:conf/nbis/ChitnisPLL09,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/NBiS.2009.77}, 
        date-modified = {2014-11-05T08:22:21.655390}, 
        author = {Chitnis, Mangesh and Pagano, Paolo and Lipari, Giuseppe and Liang, Yao}, 
        abstract = {Bandwidth resource allocation and scheduling has posed a challenging problem in wireless sensor networks. This paper provides a survey on the current state-of-the-art researches in this important area. Bandwidth reservation is considered in terms of time slot allocation in a pure TDMA or TDMA/CSMA based networks. We first overview different approaches for time slot allocation in a star network topology, and then elaborate the problem of time slot allocation and scheduling in a multihop wireless communication network in the presence of interference. Since the problem in multihop wireless network is proved to be NP-complete, most of the exiting solutions use different heuristics to resolve this problem. We address some of these heuristics and algorithms and their impact in wireless sensor networks. Finally, we provide some of the advantages, limitations and possible extensions in the context of IEEE 802.15.4 communications protocol which is being widely used for wireless sensor networks.}, 
        title = {{A} Survey on {B}andwidth {R}esource {A}llocation and {S}cheduling in {W}ireless {S}ensor {N}etworks}, 
        pages = {121--128}, 
        editor = {Enokido, Arjan Durresi; Elhadi Shakshuki; Leonard Barolli; Makoto Takizawa; Minoru Uehara; Tomoya}, 
        year = {2009}, 
        booktitle = {Proc. Int. Conf. Network-Based Information Systems NBIS '09}, 
        date-added = {2014-10-28T13:09:34.912630}, 
    }
    
  3. Mangesh Chitnis, Yao Liang, Jiang Yu Zheng, Paolo Pagano, Giuseppe Lipari, Wireless line sensor network for distributed visual surveillance, PE-WASUN 2009
    @inproceedings {DBLP:conf/pe-wasun/ChitnisLZPL09,
        publisher = {ACM}, 
        date-modified = {2014-10-31T10:00:51.851300}, 
        author = {Chitnis, Mangesh and Liang, Yao and Zheng, Jiang Yu and Pagano, Paolo and Lipari, Giuseppe}, 
        booktitle = {PE-WASUN}, 
        title = {{W}ireless line sensor network for distributed visual surveillance}, 
        editor = {Olariu, Stephan and Boukerche, Azzedine and Lassous, Isabelle Guérin}, 
        year = {2009}, 
        pages = {71--78}, 
        date-added = {2014-10-28T13:09:34.775210}, 
    }
    
  4. Christian Nastasi, Paolo Pagano, Mauro Marinoni, Giuseppe Lipari, Francesco Focacci, Paolo Gai, Simone Mannori, Roberto Bucher, Model based Real-Time networked applications for Wireless Sensor Networks, Proc. IEEE Int. Conf. Pervasive Computing and Communications PerCom 2009 2009
    [DOI]
    Abstract: In industrial contexts it might be useful to deploy Wireless Sensor Networks to constantly monitor the status of a plant. At early design stage of any monitoring application, it is envisaged to reinforce real-time paradigms both for task execution and node- to-node communication. Model driven applications are usually seamless provided the system description is complete and robust, and the code generation (platform specific) appropriately complies with the model. We present a demo where acceleration measurements gathered by sensor nodes are conveyed to a fixed location devoted to surveillance. A higher level control system or an operator can take action whenever these readings deviate from the expected behavior. We follow a model-based implementation of the system exploiting the Scilab/Scicos support for the ERIKA Enterprise real-time kernel. Timeliness at the node level is reinforced by the features of the kernel scheduler; moreover the recent implementation of the IEEE 802.15.4 wireless communication standard permits time bounded communications among the nodes.
    @inproceedings {DBLP:conf/percom/NastasiPMLFGMB09,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/PERCOM.2009.4912798}, 
        date-modified = {2014-11-05T08:21:19.239360}, 
        author = {Nastasi, Christian and Pagano, Paolo and Marinoni, Mauro and Lipari, Giuseppe and Focacci, Francesco and Gai, Paolo and Mannori, Simone and Bucher, Roberto}, 
        abstract = {In industrial contexts it might be useful to deploy Wireless Sensor Networks to constantly monitor the status of a plant. At early design stage of any monitoring application, it is envisaged to reinforce real-time paradigms both for task execution and node- to-node communication. Model driven applications are usually seamless provided the system description is complete and robust, and the code generation (platform specific) appropriately complies with the model. We present a demo where acceleration measurements gathered by sensor nodes are conveyed to a fixed location devoted to surveillance. A higher level control system or an operator can take action whenever these readings deviate from the expected behavior. We follow a model-based implementation of the system exploiting the Scilab/Scicos support for the ERIKA Enterprise real-time kernel. Timeliness at the node level is reinforced by the features of the kernel scheduler; moreover the recent implementation of the IEEE 802.15.4 wireless communication standard permits time bounded communications among the nodes.}, 
        title = {{M}odel based {R}eal-{T}ime networked applications for {W}ireless {S}ensor {N}etworks}, 
        pages = {1--3}, 
        year = {2009}, 
        booktitle = {Proc. IEEE Int. Conf. Pervasive Computing and Communications PerCom 2009}, 
        date-added = {2014-10-28T13:09:47.359450}, 
    }
    
  5. Paolo Pagano, Mangesh Chitnis, Antonio Romano, Giuseppe Lipari, Ricardo Severino, Mário Alves, Paulo G. Sousa, Eduardo Tovar, ERIKA and open-ZB: an implementation for real-time wireless networking, SAC 2009
    @inproceedings {DBLP:conf/sac/PaganoCRLSAST09,
        publisher = {ACM}, 
        date-modified = {2014-10-31T10:00:50.660870}, 
        author = {Pagano, Paolo and Chitnis, Mangesh and Romano, Antonio and Lipari, Giuseppe and Severino, Ricardo and Alves, Mário and Sousa, Paulo G. and Tovar, Eduardo}, 
        booktitle = {SAC}, 
        title = {E{R}IK{A} and open-{Z}B: an implementation for real-time wireless networking}, 
        editor = {Shin, Sung Y. and Ossowski, Sascha}, 
        year = {2009}, 
        pages = {1687--1688}, 
        date-added = {2014-10-28T13:09:47.502790}, 
    }
    
  6. Paolo Pagano, Francesco Piga, Giuseppe Lipari, Yao Liang, Visual tracking using sensor networks, SimuTools 2009
    @inproceedings {DBLP:conf/simutools/PaganoPLL09,
        publisher = {ICST}, 
        date-modified = {2014-10-31T10:00:51.470250}, 
        author = {Pagano, Paolo and Piga, Francesco and Lipari, Giuseppe and Liang, Yao}, 
        booktitle = {SimuTools}, 
        title = {{V}isual tracking using sensor networks}, 
        editor = {Dalle, Olivier and Wainer, Gabriel A. and Perrone, L. Felipe and Stea, Giovanni}, 
        year = {2009}, 
        pages = {28}, 
        date-added = {2014-10-28T13:09:47.559290}, 
    }
    
  7. Fabio Checconi, Tommaso Cucinotta, Dario Faggioli, Giuseppe Lipari, Hierarchical multiprocessor CPU reservations for the linux kernel, Proceedings of the 5th international workshop on operating systems platforms for embedded real-time applications (OSPERT 2009), Dublin, Ireland 2009
    @inproceedings {checconi2009hierarchical,
        date-modified = {2014-10-31T10:00:51.683830}, 
        title = {{H}ierarchical multiprocessor {C}PU reservations for the linux kernel}, 
        booktitle = {Proceedings of the 5th international workshop on operating systems platforms for embedded real-time applications (OSPERT 2009), Dublin, Ireland}, 
        author = {Checconi, Fabio and Cucinotta, Tommaso and Faggioli, Dario and Lipari, Giuseppe}, 
        year = {2009}, 
        date-added = {2014-10-28T13:09:34.562280}, 
    }
    

2008

  1. Luigi Palopoli, Luca Abeni, Tommaso Cucinotta, Giuseppe Lipari, Sanjoy K. Baruah, Weighted feedback reclaiming for multimedia applications, Proceedings of the 6th {IEEE/ACM/IFIP} Workshop on Embedded Systems for Real-Time Multimedia, ESTIMedia 2008
    [DOI] [link]
    Abstract: Resource reservations are a very popular choice to schedule multimedia tasks. However, the high variability of the resource requirements hinders a static choice of the scheduling parameters. In this paper we address this problem by a combination of two strategies: adaptive reservations and resource reclaiming. The first one operates ldquolocallyrdquo (using the information of a single task), the second one operates ldquogloballyrdquo distributing unused bandwidth between the tasks. In this paper, we show by analytical results and by extensive simulations that the two techniques can be safely and usefully combined.
    @inproceedings {Palopoli2008,
        doi = {10.1109/ESTMED.2008.4697009}, 
        date-modified = {2014-11-05T08:09:44.888400}, 
        author = {Palopoli, Luigi and Abeni, Luca and Cucinotta, Tommaso and Lipari, Giuseppe and Baruah, Sanjoy K.}, 
        timestamp = {Fri, 23 Jan 2009 14:01:43 +0100}, 
        abstract = {Resource reservations are a very popular choice to schedule multimedia tasks. However, the high variability of the resource requirements hinders a static choice of the scheduling parameters. In this paper we address this problem by a combination of two strategies: adaptive reservations and resource reclaiming. The first one operates ldquolocallyrdquo (using the information of a single task), the second one operates ldquogloballyrdquo distributing unused bandwidth between the tasks. In this paper, we show by analytical results and by extensive simulations that the two techniques can be safely and usefully combined.}, 
        title = {{W}eighted feedback reclaiming for multimedia applications}, 
        month = {October}, 
        link = {http://dx.doi.org/10.1109/ESTMED.2008.4697009}, 
        pages = {121--126}, 
        year = {2008}, 
        owner = {lipari}, 
        bibsource = {dblp computer science bibliography, http://dblp.org}, 
        date-added = {2011-05-12T00:00:00}, 
        booktitle = {Proceedings of the 6th {IEEE/ACM/IFIP} Workshop on Embedded Systems for Real-Time Multimedia, ESTIMedia}, 
        crossref = {DBLP:conf/estimedia/2008}, 
    }
    
  2. Rodrigo Santos, Giuseppe Lipari, Enrico Bini, Efficient On-line Schedulability Test for Feedback Scheduling of Soft Real-Time Tasks under Fixed-Priority, IEEE Real-Time and Embedded Technology and Applications Symposium 2008
    [link]
    @inproceedings {conf/rtas/SantosLB08,
        publisher = {IEEE Computer Society}, 
        date-modified = {2014-10-31T10:00:49.857970}, 
        author = {Santos, Rodrigo and Lipari, Giuseppe and Bini, Enrico}, 
        booktitle = {IEEE Real-Time and Embedded Technology and Applications Symposium}, 
        title = {{E}fficient {O}n-line {S}chedulability {T}est for {F}eedback {S}cheduling of {S}oft {R}eal-{T}ime {T}asks under {F}ixed-{P}riority}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2008.26}, 
        year = {2008}, 
        pages = {227--236}, 
        date-added = {2014-10-28T13:09:31.560820}, 
    }
    
  3. Dario Faggioli, Giuseppe Lipari, Tommaso Cucinotta, An efficient implementation of the bandwidth inheritance protocol for handling hard and soft real-time applications in the Linux kernel, Workshop on Operating System Platforms for Embedded Real-Time Systems (OSPERT) 2008
    @inproceedings {faggioli2008efficient,
        date-modified = {2014-11-05T08:10:24.924640}, 
        author = {Faggioli, Dario and Lipari, Giuseppe and Cucinotta, Tommaso}, 
        journal = {OSPERT 2008}, 
        title = {{A}n efficient implementation of the bandwidth inheritance protocol for handling hard and soft real-time applications in the {L}inux kernel}, 
        year = {2008}, 
        organization = {Euromicro}, 
        booktitle = {Workshop on Operating System Platforms for Embedded Real-Time Systems (OSPERT)}, 
        date-added = {2014-10-28T13:09:35.988340}, 
    }
    

2007

  1. Mangesh Chitnis, Paolo Gai, Giuseppe Lipari, Paolo Pagano, Antonio Romano, Rapid prototyping suite of IEEE 802.15.4-compliant Sensor Networks, Proc. IEEE Internatonal Conf. Mobile Adhoc and Sensor Systems MASS 2007 2007
    [DOI] [pdf]
    Abstract: This paper presents a toolsuite for rapid prototyping and implementation of real-time applications on Wireless Sensor Networks. The work is motivated by the need to use WSNs in industrial control contexts, where the sampling rate, the workload is much higher than typical current applications of WSNs, and the real-time constraints are much tighter. We present a simulator for early evaluation of the real-time behavior of a WSN application; and a realtime operating system that implement appropriate real-time scheduling policies to allow timing analysis and guarantee timing constraints. We provide a demo based on a simple but realistic network scenario showing that simulation is in agreement with experimental results.
    @inproceedings {Chitnis2007,
        doi = {10.1109/MOBHOC.2007.4428694}, 
        date-modified = {2014-11-05T08:09:41.547020}, 
        author = {Chitnis, Mangesh and Gai, Paolo and Lipari, Giuseppe and Pagano, Paolo and Romano, Antonio}, 
        abstract = {This paper presents a toolsuite for rapid prototyping and implementation of real-time applications on Wireless Sensor Networks. The work is motivated by the need to use WSNs in industrial control contexts, where the sampling rate, the workload is much higher than typical current applications of WSNs, and the real-time constraints are much tighter. We present a simulator for early evaluation of the real-time behavior of a WSN application; and a realtime operating system that implement appropriate real-time scheduling policies to allow timing analysis and guarantee timing constraints. We provide a demo based on a simple but realistic network scenario showing that simulation is in agreement with experimental results.}, 
        title = {{R}apid prototyping suite of {I}EE{E} 802.15.4-compliant {S}ensor {N}etworks}, 
        pages = {1--3}, 
        year = {2007}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE Internatonal Conf. Mobile Adhoc and Sensor Systems MASS 2007}, 
        localfile = {papers/chitnis_pagano_lipari.pdf}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Michele Cirinei, Enrico Bini, Giuseppe Lipari, Alberto Ferrari, A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors, Proc. IEEE Int. Parallel and Distributed Processing Symp. IPDPS 2007 2007
    [DOI]
    Abstract: The recent introduction of multicore system-on-a-chip architectures for embedded systems opens a new range of possibilities for both increasing the processing power and improving the fault-robustness of real-time embedded applications. Fault-tolerance and performance are often contrasting requirements. Techniques to improve robustness to hardware faults are based on replication of hardware and/or software. Conversely, techniques to improve performance are based on exploiting inherent parallelism of multiprocessor architectures. In this paper, we propose a technique that allows the user to trade-off parallelism with fault-tolerance in a multicore hardware architecture. Our technique is based on a combination of hardware mechanisms and real-time operating system mechanisms. In particular, we apply hierarchical scheduling techniques to efficiently support fault-tolerant, fault-silent and non-fault-tolerant tasks in the same system.
    @inproceedings {Cirinei2007,
        doi = {10.1109/IPDPS.2007.370342}, 
        date-modified = {2014-11-05T08:09:41.691210}, 
        author = {Cirinei, Michele and Bini, Enrico and Lipari, Giuseppe and Ferrari, Alberto}, 
        abstract = {The recent introduction of multicore system-on-a-chip architectures for embedded systems opens a new range of possibilities for both increasing the processing power and improving the fault-robustness of real-time embedded applications. Fault-tolerance and performance are often contrasting requirements. Techniques to improve robustness to hardware faults are based on replication of hardware and/or software. Conversely, techniques to improve performance are based on exploiting inherent parallelism of multiprocessor architectures. In this paper, we propose a technique that allows the user to trade-off parallelism with fault-tolerance in a multicore hardware architecture. Our technique is based on a combination of hardware mechanisms and real-time operating system mechanisms. In particular, we apply hierarchical scheduling techniques to efficiently support fault-tolerant, fault-silent and non-fault-tolerant tasks in the same system.}, 
        title = {{A} Flexible {S}cheme for {S}cheduling {F}ault-{T}olerant {R}eal-{T}ime {T}asks on {M}ultiprocessors}, 
        pages = {1--8}, 
        year = {2007}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE Int. Parallel and Distributed Processing Symp. IPDPS 2007}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  3. Paolo Pagano, Prashant Batra, Giuseppe Lipari, A Framework for Modeling Operating System Mechanisms in the Simulation of Network Protocols for Real-Time Distributed Systems, Proc. IEEE Int. Parallel and Distributed Processing Symp. IPDPS 2007 2007
    [DOI]
    Abstract: In this paper we present a software tool for the simulation of distributed real-time embedded systems. Our tool is based on the popular NS-2 package for simulating the networking aspects, and on the RTSim package for the realtime operating system aspects. By reusing much of the existing code, our simulator covers a very wide range of network protocols and real-time mechanisms. After describing the architecture of our tool, we tested it in a simple wireless sensor networks scenario, and we measured the latency in transmitting and receiving messages due to the concurrent activities in the nodes. These effects have been tested against two node scheduling policies, and under different load conditions in the CPU of the nodes.
    @inproceedings {pagano2007framework,
        doi = {10.1109/IPDPS.2007.370350}, 
        date-modified = {2014-11-05T08:24:59.472200}, 
        author = {Pagano, Paolo and Batra, Prashant and Lipari, Giuseppe}, 
        abstract = {In this paper we present a software tool for the simulation of distributed real-time embedded systems. Our tool is based on the popular NS-2 package for simulating the networking aspects, and on the RTSim package for the realtime operating system aspects. By reusing much of the existing code, our simulator covers a very wide range of network protocols and real-time mechanisms. After describing the architecture of our tool, we tested it in a simple wireless sensor networks scenario, and we measured the latency in transmitting and receiving messages due to the concurrent activities in the nodes. These effects have been tested against two node scheduling policies, and under different load conditions in the CPU of the nodes.}, 
        title = {{A} Framework for {M}odeling {O}perating {S}ystem {M}echanisms in the {S}imulation of {N}etwork {P}rotocols for {R}eal-{T}ime {D}istributed {S}ystems}, 
        pages = {1--8}, 
        year = {2007}, 
        organization = {IEEE}, 
        booktitle = {Proc. IEEE Int. Parallel and Distributed Processing Symp. IPDPS 2007}, 
        date-added = {2014-10-28T13:09:47.410050}, 
    }
    

2006

  1. M. Aldea, Guillem Bernat, Ian Broster, Alan Burns, Radu Dobrin, J. M. Drake, G. Fohler, Paolo Gai, M. G. Harbour, Giacomo Guidi, J. J. Gutierrez, Tomas Lennvall, Giuseppe Lipari, J. M. Martinez, Julio L. Medina, J. C. Palencia, Michael Trimarchi, FSF: A Real-Time Scheduling Architecture Framework, Proc. 12th IEEE Real-Time and Embedded Technology and Applications Symp 2006
    [DOI]
    Abstract: Scheduling theory generally assumes that real-time systems are mostly composed of activities with hard real-time requirements. Many systems are built today by composing different applications or components in the same system, leading to a mixture of many different kinds of requirements with small parts of the system having hard real-time requirements and other larger parts with requirements for more flexible scheduling and for quality of service. Hard real-time scheduling techniques are extremely pessimistic for the latter part of the application, and consequently it is necessary to use techniques that let the system resources be fully utilized to achieve the highest possible quality. This paper presents a framework for a scheduling architecture that provides the ability to compose several applications or components into the system, and to flexibly schedule the available resources while guaranteeing hard real-time requirements. The framework (called FSF) is independent of the underlying implementation, and can run on different underlying scheduling strategies. It is based on establishing service contracts that represent the complex and flexible requirements of the applications, and which are managed by the underlying system to provide the required level of service.
    @inproceedings {Aldea2006,
        doi = {10.1109/RTAS.2006.18}, 
        date-modified = {2014-11-05T08:09:39.345350}, 
        author = {Aldea, M. and Bernat, Guillem and Broster, Ian and Burns, Alan and Dobrin, Radu and Drake, J. M. and Fohler, G. and Gai, Paolo and Harbour, M. G. and Guidi, Giacomo and Gutierrez, J. J. and Lennvall, Tomas and Lipari, Giuseppe and Martinez, J. M. and Medina, Julio L. and Palencia, J. C. and Trimarchi, Michael}, 
        abstract = {Scheduling theory generally assumes that real-time systems are mostly composed of activities with hard real-time requirements. Many systems are built today by composing different applications or components in the same system, leading to a mixture of many different kinds of requirements with small parts of the system having hard real-time requirements and other larger parts with requirements for more flexible scheduling and for quality of service. Hard real-time scheduling techniques are extremely pessimistic for the latter part of the application, and consequently it is necessary to use techniques that let the system resources be fully utilized to achieve the highest possible quality. This paper presents a framework for a scheduling architecture that provides the ability to compose several applications or components into the system, and to flexibly schedule the available resources while guaranteeing hard real-time requirements. The framework (called FSF) is independent of the underlying implementation, and can run on different underlying scheduling strategies. It is based on establishing service contracts that represent the complex and flexible requirements of the applications, and which are managed by the underlying system to provide the required level of service.}, 
        title = {F{S}F: {A} Real-{T}ime {S}cheduling {A}rchitecture {F}ramework}, 
        pages = {113--124}, 
        year = {2006}, 
        owner = {lipari}, 
        booktitle = {Proc. 12th IEEE Real-Time and Embedded Technology and Applications Symp}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Cesare Bartolini, Antonella Bertolino, G. De Angelis, Giuseppe Lipari, A UML Profile and a Methodology for Real-Time Systems Design, Proc. 32nd EUROMICRO Conf. Software Engineering and Advanced Applications SEAA '06 2006
    [DOI] [pdf]
    Abstract: Modern real-time systems are increasingly complex and pervasive. Model Driven Engineering is the emerging approach for the design of complex systems, strongly based on the usage of abstract models as key artifacts, from which an implementation is derived through a series of well-defined (automated) transformations. The widely adopted input notation in MDE is the Unified Modelling Language. To express models in a particular domain, and notably for the modelling of real-time embedded systems, UML profiles have been proposed, which enrich the set of UML native elements with a consistent set of extensions. In this trend, this paper develops an approach to the design of real-time systems, based on a UML profile which is obtained from the OMG standard SPT-Profile, with a few necessary modifications. The profile also incorporates a methodology for automatically mapping the UML model into a task set with periods and deadlines, in line with the MDE philosophy. An illustrative example is provided.
    @inproceedings {Bartolini2006,
        doi = {10.1109/EUROMICRO.2006.14}, 
        date-modified = {2014-11-05T08:28:26.464720}, 
        author = {Bartolini, Cesare and Bertolino, Antonella and {De Angelis}, G. and Lipari, Giuseppe}, 
        abstract = {Modern real-time systems are increasingly complex and pervasive. Model Driven Engineering is the emerging approach for the design of complex systems, strongly based on the usage of abstract models as key artifacts, from which an implementation is derived through a series of well-defined (automated) transformations. The widely adopted input notation in MDE is the Unified Modelling Language. To express models in a particular domain, and notably for the modelling of real-time embedded systems, UML profiles have been proposed, which enrich the set of UML native elements with a consistent set of extensions. In this trend, this paper develops an approach to the design of real-time systems, based on a UML profile which is obtained from the OMG standard SPT-Profile, with a few necessary modifications. The profile also incorporates a methodology for automatically mapping the UML model into a task set with periods and deadlines, in line with the MDE philosophy. An illustrative example is provided.}, 
        title = {{A} U{M}L {P}rofile and a {M}ethodology for {R}eal-{T}ime {S}ystems {D}esign}, 
        pages = {108--117}, 
        year = {2006}, 
        booktitle = {Proc. 32nd EUROMICRO Conf. Software Engineering and Advanced Applications SEAA '06}, 
        localfile = {papers/bartolini_bertolino_deangelis_lipari.pdf}, 
        date-added = {2014-10-28T13:09:33.667440}, 
    }
    
  3. Marko Bertogna, Michele Cirinei, Giuseppe Lipari, New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors, Principles of Distributed Systems 2006
    @inproceedings {bertogna2006new,
        publisher = {Springer}, 
        date-modified = {2014-11-05T08:10:19.962240}, 
        author = {Bertogna, Marko and Cirinei, Michele and Lipari, Giuseppe}, 
        booktitle = {Principles of Distributed Systems}, 
        title = {{N}ew schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors}, 
        year = {2006}, 
        pages = {306--321}, 
        date-added = {2014-10-28T13:09:33.367040}, 
    }
    
  4. J. L. Lorente, Giuseppe Lipari, Enrico Bini, A hierarchical scheduling model for component-based real-time systems, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium 2006
    [DOI]
    @inproceedings {lorente2006hierarchical,
        doi = {10.1109/IPDPS.2006.1639405}, 
        date-modified = {2014-11-05T08:12:12.373030}, 
        author = {Lorente, J. L. and Lipari, Giuseppe and Bini, Enrico}, 
        booktitle = {Proceedings 20th IEEE International Parallel & Distributed Processing Symposium}, 
        title = {{A} hierarchical scheduling model for component-based real-time systems}, 
        year = {2006}, 
        organization = {IEEE}, 
        pages = {148}, 
        date-added = {2014-10-28T13:09:47.073620}, 
    }
    
  5. G Lipari, C Scordino, Linux and real-time: Current approaches and future opportunities, IEEE International Congress ANIPLA 2006
    [pdf]
    @inproceedings {lipari2006linux,
        title = {{L}inux and real-time: {C}urrent approaches and future opportunities}, 
        booktitle = {IEEE International Congress ANIPLA}, 
        author = {Lipari, G and Scordino, C}, 
        volume = {6}, 
        year = {2006}, 
        localfile = {papers/ANIPLA_scordino_lipari.pdf}, 
    }
    

2005

  1. Paolo Gai, Giuseppe Lipari, Marco Di Natale, Matteo Duranti, Alberto Ferrari, Support for multiprocessor synchronization and resource sharing in system-on-programmable chips with softcores, Proc. IEEE Int. SOC Conf 2005
    [DOI]
    Abstract: In this paper we present an arbitrator implementation for enabling multiprocessor synchronization and resource sharing primitives with guaranteed maximum latency in real-time operating systems (RTOS). The arbitrator has been developed for use in conjunction with the NIOS II softcore in the Altera family of system on programmable chips.
    @inproceedings {Gai2005,
        doi = {10.1109/SOCC.2005.1554472}, 
        date-modified = {2014-11-05T08:09:42.490230}, 
        author = {Gai, Paolo and Lipari, Giuseppe and {Di Natale}, Marco and Duranti, Matteo and Ferrari, Alberto}, 
        abstract = {In this paper we present an arbitrator implementation for enabling multiprocessor synchronization and resource sharing primitives with guaranteed maximum latency in real-time operating systems (RTOS). The arbitrator has been developed for use in conjunction with the NIOS II softcore in the Altera family of system on programmable chips.}, 
        title = {{S}upport for multiprocessor synchronization and resource sharing in system-on-programmable chips with softcores}, 
        pages = {109--110}, 
        year = {2005}, 
        owner = {lipari}, 
        booktitle = {Proc. IEEE Int. SOC Conf}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Cesare Bartolini, Giuseppe Lipari, Marco Di Natale, From functional blocks to the synthesis of the architectural model in embedded real-time applications, 11th IEEE Real Time and Embedded Technology and Applications Symposium 2005 ISSN: 1080-1812
    [DOI]
    Abstract: The development of software for complex reactive embedded systems requires automated support for the verification of functional and non-functional properties. Currently, a language (or a design methodology) that can provide both at the same time without incurring in excessive inefficiencies is not available and separation of concerns is the solution advocated by many. Most research and commercial languages and tools focus on providing support for the design and validation of functional properties. At a different level, models and theory have been developed for supporting the description of the threads and resources composing the software architecture, and schedulability analysis provides support for the validation of timing constraints. However, the design of the concurrent structure of the application is still done manually. The system designer has to decide the number of threads, their structure and interactions, without the possibility of evaluating the trade-off between different solutions. This paper presents a solution towards what we believe to be a key objective, that is the synthesis of the architecture-level design and the automated logical-to-architectural mapping. Our proposal tries to reduce the overheads and excessive priority inversions of existing solutions that map all functional blocks (or reactions) into a single thread or assign a thread of execution to each action or possibly to each active object. After presenting our algorithm, we compare it with existing solutions and provide a schedulability analysis of the resulting system.
    @inproceedings {bartolini2005functional,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/RTAS.2005.24}, 
        date-modified = {2014-11-05T08:24:37.171400}, 
        author = {Bartolini, Cesare and Lipari, Giuseppe and {Di Natale}, Marco}, 
        abstract = {The development of software for complex reactive embedded systems requires automated support for the verification of functional and non-functional properties. Currently, a language (or a design methodology) that can provide both at the same time without incurring in excessive inefficiencies is not available and separation of concerns is the solution advocated by many. Most research and commercial languages and tools focus on providing support for the design and validation of functional properties. At a different level, models and theory have been developed for supporting the description of the threads and resources composing the software architecture, and schedulability analysis provides support for the validation of timing constraints. However, the design of the concurrent structure of the application is still done manually. The system designer has to decide the number of threads, their structure and interactions, without the possibility of evaluating the trade-off between different solutions. This paper presents a solution towards what we believe to be a key objective, that is the synthesis of the architecture-level design and the automated logical-to-architectural mapping. Our proposal tries to reduce the overheads and excessive priority inversions of existing solutions that map all functional blocks (or reactions) into a single thread or assign a thread of execution to each action or possibly to each active object. After presenting our algorithm, we compare it with existing solutions and provide a schedulability analysis of the resulting system.}, 
        issn = {1080-1812}, 
        pages = {458--467}, 
        year = {2005}, 
        title = {{F}rom functional blocks to the synthesis of the architectural model in embedded real-time applications}, 
        booktitle = {11th IEEE Real Time and Embedded Technology and Applications Symposium}, 
        date-added = {2014-10-28T13:09:32.750390}, 
    }
    
  3. Marko Bertogna, Michele Cirinei, Giuseppe Lipari, Improved schedulability analysis of EDF on multiprocessor platforms, Proc. 17th Euromicro Conf. Real-Time Systems (ECRTS 2005) 2005
    [DOI] [pdf]
    Abstract: Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor systems. When scheduling real-time applications on multiprocessor platforms, a possibility is to use global scheduling, where a scheduling algorithm dynamically assign tasks to processors, and tasks can migrate from one processor to another during their execution. In this paper, we tackle the problem of schedulability analysis of sporadic tasks in global scheduling systems, where the scheduler is the earliest deadline first (EDF) algorithm. We provide two main contributions. First, we show that two recently proposed tests perform poorly when the task set contains heavy tasks (i.e. tasks with high utilization). We also show that neither test dominates the other. As a second contribution, we introduce a new schedulability test that improves significantly the percentage of accepted task sets, especially when considering task sets containing heavy tasks. We show the effectiveness of the proposed test through an extensive set of experiments.
    @inproceedings {bertogna2005improved,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/ECRTS.2005.18}, 
        date-modified = {2014-11-05T08:21:52.824730}, 
        author = {Bertogna, Marko and Cirinei, Michele and Lipari, Giuseppe}, 
        abstract = {Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor systems. When scheduling real-time applications on multiprocessor platforms, a possibility is to use global scheduling, where a scheduling algorithm dynamically assign tasks to processors, and tasks can migrate from one processor to another during their execution. In this paper, we tackle the problem of schedulability analysis of sporadic tasks in global scheduling systems, where the scheduler is the earliest deadline first (EDF) algorithm. We provide two main contributions. First, we show that two recently proposed tests perform poorly when the task set contains heavy tasks (i.e. tasks with high utilization). We also show that neither test dominates the other. As a second contribution, we introduce a new schedulability test that improves significantly the percentage of accepted task sets, especially when considering task sets containing heavy tasks. We show the effectiveness of the proposed test through an extensive set of experiments.}, 
        title = {{I}mproved schedulability analysis of {E}DF on multiprocessor platforms}, 
        pages = {209--218}, 
        year = {2005}, 
        booktitle = {Proc. 17th Euromicro Conf. Real-Time Systems (ECRTS 2005)}, 
        localfile = {papers/ECRTS_BCL.pdf}, 
        date-added = {2014-10-28T13:09:33.452330}, 
    }
    
  4. Enrico Bini, Giorgio C. Buttazzo, Giuseppe Lipari, Speed modulation in energy-aware real-time systems, Proc. 17th Euromicro Conf. Real-Time Systems (ECRTS 2005) 2005
    [DOI] [pdf]
    Abstract: This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical realtime applications. For example, the processor is assumed to have as a set of discrete operating modes, each characterized by speed, power consumption. The transition delay between modes is considered. To take I/O operations into account, task computation times are modeled with a part that scales with the speed and a part having a fixed duration. Given a set of real-time tasks, the proposed method allows to compute the optimal sequence of voltage/speed changes that approximates the minimum continuous speed which guarantees the feasibility of the system. The analysis is performed both under fixed and dynamic priority assignments.
    @inproceedings {bini2005speed,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/ECRTS.2005.29}, 
        date-modified = {2014-11-05T08:22:08.047170}, 
        author = {Bini, Enrico and Buttazzo, Giorgio C. and Lipari, Giuseppe}, 
        abstract = {This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical realtime applications. For example, the processor is assumed to have as a set of discrete operating modes, each characterized by speed, power consumption. The transition delay between modes is considered. To take I/O operations into account, task computation times are modeled with a part that scales with the speed and a part having a fixed duration. Given a set of real-time tasks, the proposed method allows to compute the optimal sequence of voltage/speed changes that approximates the minimum continuous speed which guarantees the feasibility of the system. The analysis is performed both under fixed and dynamic priority assignments.}, 
        title = {{S}peed modulation in energy-aware real-time systems}, 
        pages = {3--10}, 
        year = {2005}, 
        booktitle = {Proc. 17th Euromicro Conf. Real-Time Systems (ECRTS 2005)}, 
        localfile = {papers/bini_speed_modulation_conference.pdf}, 
        date-added = {2014-10-28T13:09:33.728240}, 
    }
    
  5. Rodolfo Pellizzoni, Giuseppe Lipari, Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling, IEEE Real-Time and Embedded Technology and Applications Symposium 2005
    [link]
    @inproceedings {conf/rtas/PellizzoniL05,
        publisher = {IEEE Computer Society}, 
        date-modified = {2014-11-05T08:28:58.306640}, 
        author = {Pellizzoni, Rodolfo and Lipari, Giuseppe}, 
        booktitle = {IEEE Real-Time and Embedded Technology and Applications Symposium}, 
        title = {{I}mproved {S}chedulability {A}nalysis of {R}eal-{T}ime {T}ransactions with {E}arliest {D}eadline {S}cheduling}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2005.28}, 
        year = {2005}, 
        pages = {65--75}, 
        date-added = {2014-10-28T13:09:31.068030}, 
    }
    
  6. Paolo Valente, Giuseppe Lipari, An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors, RTSS 2005 ISSN: 1052-8725
    [link]
    @inproceedings {conf/rtss/ValenteL05,
        publisher = {IEEE Computer Society}, 
        date-modified = {2014-10-31T10:00:50.080020}, 
        author = {Valente, Paolo and Lipari, Giuseppe}, 
        booktitle = {RTSS}, 
        issn = {1052-8725}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/RTSS.2005.8}, 
        year = {2005}, 
        title = {{A}n {U}pper {B}ound to the {L}ateness of {S}oft {R}eal-{T}ime {T}asks {S}cheduled by {E{D}F} on {M}ultiprocessors}, 
        pages = {311--320}, 
        date-added = {2014-10-28T13:09:31.742220}, 
    }
    

2004

  1. Sanjoy K. Baruah, Giuseppe Lipari, Executing Aperiodic Jobs in a Multiprocessor Constant-Bandwidth Server Implementation, Proc. 16th Euromicro Conf. Real-Time Systems ECRTS 2004 2004
    [DOI] [link]
    Abstract: The constant bandwidth server (CBS) framework can be implemented on a preemptive uniprocessor platform to make full use of the computing capacity of the platform; when implemented upon a preemptive multiprocessor platform, however, it is known that the schedulable utilization is strictly less than the capacity of the platform. The issue of using the excess processing capacity is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.
    @inproceedings {conf/ecrts/BaruahL04,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/EMRTS.2004.1311012}, 
        date-modified = {2014-11-05T08:25:30.891160}, 
        author = {Baruah, Sanjoy K. and Lipari, Giuseppe}, 
        abstract = {The constant bandwidth server (CBS) framework can be implemented on a preemptive uniprocessor platform to make full use of the computing capacity of the platform; when implemented upon a preemptive multiprocessor platform, however, it is known that the schedulable utilization is strictly less than the capacity of the platform. The issue of using the excess processing capacity is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.}, 
        title = {{E}xecuting {A}periodic {J}obs in a {M}ultiprocessor {C}onstant-{B}andwidth {S}erver {I}mplementation}, 
        pages = {109--116}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2004.11}, 
        year = {2004}, 
        booktitle = {Proc. 16th Euromicro Conf. Real-Time Systems ECRTS 2004}, 
        date-added = {2014-10-28T13:09:30.198260}, 
    }
    
  2. Rodolfo Pellizzoni, Giuseppe Lipari, A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets, Proc. 16th Euromicro Conf. Real-Time Systems 2004
    [DOI] [pdf] [link]
    Abstract: The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah et al., which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0) for which a pseudo-polynomial test is known. If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive answer can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets. In this paper, we present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by considering the value of the offsets and obtaining a set of critical arrival patterns. We show, with a set of extensive simulations, that our test outperforms the previous sufficient test.
    @inproceedings {conf/ecrts/PellizzoniL04,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/EMRTS.2004.1311022}, 
        date-modified = {2014-11-05T08:29:10.700960}, 
        author = {Pellizzoni, Rodolfo and Lipari, Giuseppe}, 
        abstract = {The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah et al., which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0) for which a pseudo-polynomial test is known. If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive answer can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets. In this paper, we present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by considering the value of the offsets and obtaining a set of critical arrival patterns. We show, with a set of extensive simulations, that our test outperforms the previous sufficient test.}, 
        title = {{A} New {S}ufficient {F}easibility {T}est for {A}synchronous {R}eal-{T}ime {P}eriodic {T}ask {S}ets}, 
        pages = {204--211}, 
        link = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2004.1}, 
        year = {2004}, 
        booktitle = {Proc. 16th Euromicro Conf. Real-Time Systems}, 
        localfile = {papers/ECRTS_pellizzioni_lipari_edf.pdf}, 
        date-added = {2014-10-28T13:09:31.258120}, 
    }
    
  3. Claudio Scordino, Giuseppe Lipari, Using resource reservation techniques for power-aware scheduling, Proceedings of the 4th ACM international conference on Embedded software 2004
    [link]
    @inproceedings {conf/emsoft/ScordinoL04,
        publisher = {ACM}, 
        date-modified = {2014-11-05T08:15:06.318990}, 
        author = {Scordino, Claudio and Lipari, Giuseppe}, 
        booktitle = {Proceedings of the 4th ACM international conference on Embedded software}, 
        title = {{U}sing resource reservation techniques for power-aware scheduling}, 
        link = {http://doi.acm.org/10.1145/1017753.1017761}, 
        editor = {Buttazzo, Giorgio C.}, 
        year = {2004}, 
        organization = {ACM}, 
        pages = {16--25}, 
        date-added = {2014-10-28T13:09:48.223630}, 
    }
    
  4. Sanjoy K. Baruah, Giuseppe Lipari, A Multiprocessor Implementation of the Total Bandwidth Server, Proc. 18th Int. Parallel and Distributed Processing Symp 2004
    [DOI] [link]
    Abstract: Summary form only given. If a periodic task system is scheduled upon an identical multiprocessor platform using the earliest deadline first scheduling algorithm, it is known that the "schedulable utilization" - the largest bound such that any periodic task system with cumulative utilization no larger than this bound is guaranteed to be successfully scheduled - is strictly less than the capacity of the platform. The issue of using the excess processing capacity (the difference between the platform capacity and the schedulable utilization) is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.
    @inproceedings {conf/ipps/BaruahL04,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/IPDPS.2004.1302955}, 
        date-modified = {2014-11-05T08:28:43.483080}, 
        author = {Baruah, Sanjoy K. and Lipari, Giuseppe}, 
        abstract = {Summary form only given. If a periodic task system is scheduled upon an identical multiprocessor platform using the earliest deadline first scheduling algorithm, it is known that the "schedulable utilization" - the largest bound such that any periodic task system with cumulative utilization no larger than this bound is guaranteed to be successfully scheduled - is strictly less than the capacity of the platform. The issue of using the excess processing capacity (the difference between the platform capacity and the schedulable utilization) is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.}, 
        title = {{A} Multiprocessor {I}mplementation of the {T}otal {B}andwidth {S}erver}, 
        link = {http://csdl.computer.org/comp/proceedings/ipdps/2004/2132/01/213210040aabs.htm}, 
        year = {2004}, 
        booktitle = {Proc. 18th Int. Parallel and Distributed Processing Symp}, 
        date-added = {2014-10-28T13:09:30.450760}, 
    }
    
  5. Tommaso Cucinotta, Luigi Palopoli, Luca Marzario, Giuseppe Lipari, Luca Abeni, Adaptive reservations in a Linux environment, Real-Time and Embedded Technology and Applications Symposium, IEEE 2004
    [DOI]
    @inproceedings {cucinotta2004adaptive,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/RTTAS.2004.1317269}, 
        date-modified = {2014-11-05T08:23:15.417410}, 
        author = {Cucinotta, Tommaso and Palopoli, Luigi and Marzario, Luca and Lipari, Giuseppe and Abeni, Luca}, 
        booktitle = {Real-Time and Embedded Technology and Applications Symposium, IEEE}, 
        title = {{A}daptive reservations in a {L}inux environment}, 
        year = {2004}, 
        address = {Los Alamitos, CA, USA}, 
        date-added = {2014-10-28T13:09:35.787710}, 
    }
    
  6. Luca Marzario, Giuseppe Lipari, Patricia Balbastre, Alfons Crespo, IRIS: A new reclaiming algorithm for server-based real-time systems, Proc. 10th IEEE Real-Time and Embedded Technology and Applications Symp RTAS 2004 2004
    [DOI]
    Abstract: In this paper we present a new algorithm for CPU resource reservation in real-time systems that allows the coexistence of hard, soft and non real-time tasks. The proposed algorithm is specifically designed to handle computational overload. A task that needs more CPU-time than reserved can reuse the spare bandwidth, without interfering with the others tasks. With respect to other reclamation schemes, the novelty of the proposed algorithm is that the spare bandwidth is fairly distributed among the needing servers. The effectiveness of the algorithm is demonstrated with an extensive set of experiments. We also propose a methodology to set scheduling parameters depending on the type of the task and on the time constraints needed.
    @inproceedings {marzario2004iris,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/RTTAS.2004.1317266}, 
        date-modified = {2014-11-05T08:24:18.156030}, 
        author = {Marzario, Luca and Lipari, Giuseppe and Balbastre, Patricia and Crespo, Alfons}, 
        abstract = {In this paper we present a new algorithm for CPU resource reservation in real-time systems that allows the coexistence of hard, soft and non real-time tasks. The proposed algorithm is specifically designed to handle computational overload. A task that needs more CPU-time than reserved can reuse the spare bandwidth, without interfering with the others tasks. With respect to other reclamation schemes, the novelty of the proposed algorithm is that the spare bandwidth is fairly distributed among the needing servers. The effectiveness of the algorithm is demonstrated with an extensive set of experiments. We also propose a methodology to set scheduling parameters depending on the type of the task and on the time constraints needed.}, 
        title = {I{R}IS: {A} new reclaiming algorithm for server-based real-time systems}, 
        pages = {211--218}, 
        year = {2004}, 
        booktitle = {Proc. 10th IEEE Real-Time and Embedded Technology and Applications Symp RTAS 2004}, 
        date-added = {2014-10-28T13:09:47.171790}, 
    }
    
  7. Rodrigo Santos, Giuseppe Lipari, Jorge Santos, Scheduling open dynamic systems: The clearing fund algorithm, Proceedings of the IEEE Real-Time Computing Systems and Applications 2004
    @inproceedings {santos2004scheduling,
        date-modified = {2014-11-05T08:10:11.559030}, 
        title = {{S}cheduling open dynamic systems: {T}he clearing fund algorithm}, 
        booktitle = {Proceedings of the IEEE Real-Time Computing Systems and Applications}, 
        author = {Santos, Rodrigo and Lipari, Giuseppe and Santos, Jorge}, 
        year = {2004}, 
        date-added = {2014-10-28T13:09:48.107860}, 
    }
    

2003

  1. Silvia Mazzini, Massimo D'Alessandro, Marco Di Natale, Giuseppe Lipari, Tullio Vardanega, Issues in mapping HRT-HOOD to UML, Proc. 15th Euromicro Conf. Real-Time Systems 2003
    [DOI]
    Abstract: HRT-HOOD has methodological strengths that deserve to be preserved in the face of the commercial decline of HOOD technology. The UML (Unified Modeling Language) meta-model, on the other hand, has a level of flexibility that makes it an especially attractive platform to express the specific real-time design minded features of the HRT-HOOD method. The object-oriented connotation of the method that results from mapping HRT-HOOD onto UML raises methodological issues that we deem of interest to the real-time community at large. This paper discusses three such issues in particular: the prevalence of objects over classes in real-time design, with the consequent inversion of the standard object-oriented development paradigm; the need to derive classes "by example", which arises from the demand to allow multiple, yet static, instances of real-time objects initially designed as singleton; the opportunity of reuse-oriented component-based real-time development, which descends from using interfaces instead of classes as the target of associations among objects.
    @inproceedings {Mazzini2003,
        doi = {10.1109/EMRTS.2003.1212747}, 
        date-modified = {2014-11-05T08:09:44.481490}, 
        author = {Mazzini, Silvia and D'Alessandro, Massimo and {Di Natale}, Marco and Lipari, Giuseppe and Vardanega, Tullio}, 
        abstract = {HRT-HOOD has methodological strengths that deserve to be preserved in the face of the commercial decline of HOOD technology. The UML (Unified Modeling Language) meta-model, on the other hand, has a level of flexibility that makes it an especially attractive platform to express the specific real-time design minded features of the HRT-HOOD method. The object-oriented connotation of the method that results from mapping HRT-HOOD onto UML raises methodological issues that we deem of interest to the real-time community at large. This paper discusses three such issues in particular: the prevalence of objects over classes in real-time design, with the consequent inversion of the standard object-oriented development paradigm; the need to derive classes "by example", which arises from the demand to allow multiple, yet static, instances of real-time objects initially designed as singleton; the opportunity of reuse-oriented component-based real-time development, which descends from using interfaces instead of classes as the target of associations among objects.}, 
        title = {{I}ssues in mapping {H}RT-{H}OO{D} to {U}ML}, 
        pages = {221--228}, 
        year = {2003}, 
        owner = {lipari}, 
        booktitle = {Proc. 15th Euromicro Conf. Real-Time Systems}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Giuseppe Lipari, Enrico Bini, Resource Partitioning among Real-Time Applications, Proc. 15th Euromicro Conf. Real-Time Systems 2003
    [DOI] [pdf] [link]
    Abstract: When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are not violated. A possible way of composing applications is through the resource reservation approach. Each application is handled by a dedicated server that is assigned a fraction of the processor. Using this approach, the system can be seen as a two-level hierarchical scheduler. A considerable amount of work has been recently addressed to the analysis of this kind of hierarchical systems. However, a question is still unanswered: given a set of real-time tasks to be handled by a server, how to assign the server parameters so that the task set is feasible? In this paper, we answer to the previous question for the case of fixed priority local scheduler by presenting a methodology for computing the class of server parameters that make the task set feasible.
    @inproceedings {conf/ecrts/LipariB03,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/EMRTS.2003.1212738}, 
        date-modified = {2014-11-05T08:29:24.975140}, 
        author = {Lipari, Giuseppe and Bini, Enrico}, 
        abstract = {When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are not violated. A possible way of composing applications is through the resource reservation approach. Each application is handled by a dedicated server that is assigned a fraction of the processor. Using this approach, the system can be seen as a two-level hierarchical scheduler. A considerable amount of work has been recently addressed to the analysis of this kind of hierarchical systems. However, a question is still unanswered: given a set of real-time tasks to be handled by a server, how to assign the server parameters so that the task set is feasible? In this paper, we answer to the previous question for the case of fixed priority local scheduler by presenting a methodology for computing the class of server parameters that make the task set feasible.}, 
        title = {{R}esource {P}artitioning among {R}eal-{T}ime {A}pplications}, 
        pages = {151--158}, 
        link = {http://csdl.computer.org/comp/proceedings/ecrts/2003/1936/00/19360151abs.htm}, 
        year = {2003}, 
        booktitle = {Proc. 15th Euromicro Conf. Real-Time Systems}, 
        localfile = {papers/2003LipBin.pdf}, 
        date-added = {2014-10-28T13:09:30.986830}, 
    }
    
  3. Paolo Gai, Marco Di Natale, Giuseppe Lipari, Alberto Ferrari, Claudio Gabellini, Paolo Marceca, A comparison of MPCP and MSRP when sharing resources in the Janus multiple-processor on a chip platform, Real-Time and Embedded Technology and Applications Symposium, IEEE 2003
    [DOI]
    @inproceedings {gai2003comparison,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/RTTAS.2003.1203051}, 
        date-modified = {2014-11-05T08:23:44.123240}, 
        author = {Gai, Paolo and {Di Natale}, Marco and Lipari, Giuseppe and Ferrari, Alberto and Gabellini, Claudio and Marceca, Paolo}, 
        booktitle = {Real-Time and Embedded Technology and Applications Symposium, IEEE}, 
        title = {{A} comparison of {M}PC{P} and {M}SR{P} when sharing resources in the {J}anus multiple-processor on a chip platform}, 
        year = {2003}, 
        date-added = {2014-10-28T13:09:36.210420}, 
    }
    
  4. Silvia Mazzini, Massimo D'Alessandro, Marco Di Natale, Andrea Domenici, Giuseppe Lipari, Tullio Vardanega, Hrt-uml: Taking hrt-hood onto uml, Reliable Software Technologies Ada-Europe 2003 2003
    @inproceedings {mazzini2003hrt,
        publisher = {Springer}, 
        date-modified = {2014-11-05T08:11:26.132770}, 
        author = {Mazzini, Silvia and D'Alessandro, Massimo and {Di Natale}, Marco and Domenici, Andrea and Lipari, Giuseppe and Vardanega, Tullio}, 
        booktitle = {Reliable Software Technologies Ada-Europe 2003}, 
        title = {{H}rt-uml: {T}aking hrt-hood onto uml}, 
        year = {2003}, 
        pages = {637--637}, 
        date-added = {2014-10-28T13:09:47.217910}, 
    }
    
  5. Liesbeth Steffens, G. Fohler, Giuseppe Lipari, Giorgio C. Buttazzo, Resource reservation in real-time operating systems-a joint industrial and academic position, ARTOSS 2003
    @inproceedings {steffens2003resource,
        date-modified = {2014-11-05T08:09:46.276610}, 
        title = {{R}esource reservation in real-time operating systems-a joint industrial and academic position}, 
        booktitle = {ARTOSS}, 
        author = {Steffens, Liesbeth and Fohler, G. and Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        volume = {3}, 
        year = {2003}, 
        pages = {25--30}, 
        date-added = {2014-11-05T08:09:46.276620}, 
    }
    

2002

  1. Sanjoy K. Baruah, Joël Goossens, Giuseppe Lipari, Implementing Constant-Bandwidth Servers upon Multiprocessor Platform, IEEE Real Time Technology and Applications Symposium 2002
    [DOI]
    Abstract: In constant-bandwidth server (CBS) systems, several different applications are executed upon a shared computing platform in such a manner that each application seems to be executing on a slower dedicated processor. CBS systems have thus far only been implemented upon uniprocessors; here, a multiprocessor extension, which can be implemented upon computing platforms comprised of several identical preemptable processors, is proposed and proven correct.
    @inproceedings {Baruah2002,
        doi = {10.1109/RTTAS.2002.1137390}, 
        date-modified = {2014-11-05T08:13:04.239950}, 
        author = {Baruah, Sanjoy K. and Goossens, Joël and Lipari, Giuseppe}, 
        abstract = {In constant-bandwidth server (CBS) systems, several different applications are executed upon a shared computing platform in such a manner that each application seems to be executing on a slower dedicated processor. CBS systems have thus far only been implemented upon uniprocessors; here, a multiprocessor extension, which can be implemented upon computing platforms comprised of several identical preemptable processors, is proposed and proven correct.}, 
        title = {{I}mplementing {C}onstant-{B}andwidth {S}ervers upon {M}ultiprocessor {P}latform}, 
        pages = {154--163}, 
        year = {2002}, 
        owner = {lipari}, 
        booktitle = {IEEE Real Time Technology and Applications Symposium}, 
        date-added = {2012-09-04T00:00:00}, 
    }
    
  2. Luca Abeni, Luigi Palopoli, Giuseppe Lipari, John Walpole, Analysis of a reservation-based feedback scheduler, Proc. 23rd IEEE Real-Time Systems Symp. RTSS 2002 2002
    [DOI]
    Abstract: When executing soft real-time tasks in a shared processor, it is important to properly allocate the computational resources such that the quality of service requirements of each task are satisfied. In this paper we propose Adaptive Reservations, based on applying a feedback scheme to a reservation based scheduler After providing a precise mathematical model of the scheduler, we describe how this model can be used for synthesising the controller by applying results from control theory. Finally, we show the effectiveness of our method by simulation and by experiments with an MPEG player running on a modified Linux kernel.
    @inproceedings {abeni2002analysis,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/REAL.2002.1181563}, 
        date-modified = {2014-11-05T08:20:28.089420}, 
        author = {Abeni, Luca and Palopoli, Luigi and Lipari, Giuseppe and Walpole, John}, 
        abstract = {When executing soft real-time tasks in a shared processor, it is important to properly allocate the computational resources such that the quality of service requirements of each task are satisfied. In this paper we propose Adaptive Reservations, based on applying a feedback scheme to a reservation based scheduler After providing a precise mathematical model of the scheduler, we describe how this model can be used for synthesising the controller by applying results from control theory. Finally, we show the effectiveness of our method by simulation and by experiments with an MPEG player running on a modified Linux kernel.}, 
        title = {{A}nalysis of a reservation-based feedback scheduler}, 
        pages = {71--80}, 
        year = {2002}, 
        booktitle = {Proc. 23rd IEEE Real-Time Systems Symp. RTSS 2002}, 
        date-added = {2014-10-28T13:09:32.652560}, 
    }
    
  3. Luca Abeni, Giuseppe Lipari, Implementing resource reservations in linux, Proceedings of Fourth Real-Time Linux Workshop 2002
    @inproceedings {abeni2002implementing,
        date-modified = {2014-11-05T08:10:13.670820}, 
        title = {{I}mplementing resource reservations in linux}, 
        booktitle = {Proceedings of Fourth Real-Time Linux Workshop}, 
        author = {Abeni, Luca and Lipari, Giuseppe}, 
        year = {2002}, 
        date-added = {2014-10-28T13:09:32.210440}, 
    }
    

2001

  1. Luca Abeni, Giuseppe Lipari, Compensating for interrupt process times in real-time multimedia systems, Third Real-Time Linux Workshop 2001
    @inproceedings {abeni2001compensating,
        date-modified = {2014-11-05T08:10:17.013590}, 
        title = {{C}ompensating for interrupt process times in real-time multimedia systems}, 
        booktitle = {Third Real-Time Linux Workshop}, 
        author = {Abeni, Luca and Lipari, Giuseppe}, 
        volume = {62}, 
        year = {2001}, 
        organization = {Citeseer}, 
        date-added = {2014-10-28T13:09:32.459870}, 
    }
    
  2. Paolo Gai, Giuseppe Lipari, Marco Di Natale, Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip, Proc. 22nd IEEE Real-Time Systems Symp. (RTSS 2001) 2001
    [DOI] [pdf]
    Abstract: The research on real-time software systems has produced algorithms that allow to effectively schedule system resources while guaranteeing the deadlines of the application and to group tasks in a very short number of non-preemptive sets which require much less RAM memory for stack. Unfortunately, up to now the research focus has been on time guarantees rather than the optimization of RAM usage. Furthermore, these techniques do not apply to multiprocessor architectures which are likely to be widely used in future microcontrollers. This paper presents a fast and simple algorithm for sharing resources in multiprocessor systems, together with an innovative procedure for assigning preemption thresholds to tasks. This allows to guarantee the schedulability of hard real-time task sets while minimizing RAM usage. The experimental part shows the effectiveness of a simulated annealing-based tool that allows to find a near-optimal task allocation. When used in conjunction with our preemption threshold assignment algorithm, our tool further reduces the RAM usage in multiprocessor systems.
    @inproceedings {gai2001minimizing,
        doi = {10.1109/REAL.2001.990598}, 
        date-modified = {2014-11-05T08:16:09.966180}, 
        author = {Gai, Paolo and Lipari, Giuseppe and {Di Natale}, Marco}, 
        abstract = {The research on real-time software systems has produced algorithms that allow to effectively schedule system resources while guaranteeing the deadlines of the application and to group tasks in a very short number of non-preemptive sets which require much less RAM memory for stack. Unfortunately, up to now the research focus has been on time guarantees rather than the optimization of RAM usage. Furthermore, these techniques do not apply to multiprocessor architectures which are likely to be widely used in future microcontrollers. This paper presents a fast and simple algorithm for sharing resources in multiprocessor systems, together with an innovative procedure for assigning preemption thresholds to tasks. This allows to guarantee the schedulability of hard real-time task sets while minimizing RAM usage. The experimental part shows the effectiveness of a simulated annealing-based tool that allows to find a near-optimal task allocation. When used in conjunction with our preemption threshold assignment algorithm, our tool further reduces the RAM usage in multiprocessor systems.}, 
        title = {{M}inimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip}, 
        pages = {73--83}, 
        year = {2001}, 
        organization = {Published by the IEEE Computer Society}, 
        booktitle = {Proc. 22nd IEEE Real-Time Systems Symp. (RTSS 2001)}, 
        localfile = {papers/2001_GaiLipariDiNatale_MSRP.pdf}, 
        date-added = {2014-10-28T13:09:36.305420}, 
    }
    
  3. Gerardo Lamastra, Giuseppe Lipari, Luca Abeni, A bandwidth inheritance algorithm for real-time task synchronization in open systems, Proc. 22nd IEEE Real-Time Systems Symp. (RTSS 2001) 2001
    [DOI]
    Abstract: In this paper, we present algorithm BandWidth Inheritance (BWI), a new scheduling strategy that extends the bandwidth reservation approach to systems where tasks can interact through shared resources. The proposed algorithm provides temporal isolation between independent groups of tasks, and enables a schedulability analysis for guaranteeing the performance of realtime tasks. After showing that BWI is the natural extension of the well-known Priority Inheritance Protocol to dynamic reservation systems, a formal analysis of the algorithm is presented, and simple guarantee tests for hard real-time tasks are proposed.
    @inproceedings {lamastra2001bandwidth,
        doi = {10.1109/REAL.2001.990606}, 
        date-modified = {2014-11-05T08:16:45.657820}, 
        author = {Lamastra, Gerardo and Lipari, Giuseppe and Abeni, Luca}, 
        abstract = {In this paper, we present algorithm BandWidth Inheritance (BWI), a new scheduling strategy that extends the bandwidth reservation approach to systems where tasks can interact through shared resources. The proposed algorithm provides temporal isolation between independent groups of tasks, and enables a schedulability analysis for guaranteeing the performance of realtime tasks. After showing that BWI is the natural extension of the well-known Priority Inheritance Protocol to dynamic reservation systems, a formal analysis of the algorithm is presented, and simple guarantee tests for hard real-time tasks are proposed.}, 
        title = {{A} bandwidth inheritance algorithm for real-time task synchronization in open systems}, 
        pages = {151--160}, 
        year = {2001}, 
        organization = {Published by the IEEE Computer Society}, 
        booktitle = {Proc. 22nd IEEE Real-Time Systems Symp. (RTSS 2001)}, 
        date-added = {2014-10-28T13:09:36.538430}, 
    }
    
  4. Giuseppe Lipari, Sanjoy K. Baruah, A hierarchical extension to the constant bandwidth server framework, Proc. Seventh IEEE Real-Time Technology and Applications Symp 2001
    [DOI]
    Abstract: The constant bandwidth server (CBS) framework of L. Abeni and G. Buttazzo (1998) guarantees timely execution to individual threads in certain kinds of real time environments. An extension to the CBS framework is proposed, which permits the partitioning of the set of threads comprising the system into subsets representing individual applications, and extends timeliness guarantees to these applications as well
    @inproceedings {lipari2001hierarchical,
        doi = {10.1109/RTTAS.2001.929863}, 
        date-modified = {2014-11-05T08:16:59.627660}, 
        author = {Lipari, Giuseppe and Baruah, Sanjoy K.}, 
        abstract = {The constant bandwidth server (CBS) framework of L. Abeni and G. Buttazzo (1998) guarantees timely execution to individual threads in certain kinds of real time environments. An extension to the CBS framework is proposed, which permits the partitioning of the set of threads comprising the system into subsets representing individual applications, and extends timeliness guarantees to these applications as well}, 
        title = {{A} hierarchical extension to the constant bandwidth server framework}, 
        pages = {26--35}, 
        year = {2001}, 
        organization = {Published by the IEEE Computer Society}, 
        booktitle = {Proc. Seventh IEEE Real-Time Technology and Applications Symp}, 
        date-added = {2014-10-28T13:09:46.136400}, 
    }
    

2000

  1. Giuseppe Lipari, Sanjoy K. Baruah, Greedy reclamation of unused bandwidth in constant-bandwidth servers, Proc. 12th Euromicro Conf. Real-Time Systems 2000
    [DOI] [pdf]
    Abstract: A framework for scheduling a number of different applications on a single shared pre-emptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeoff is identified and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs to have supported on the one hand, and the added context-switch costs imposed by our scheduling framework on the other
    @inproceedings {conf/ecrts/LipariB00,
        publisher = {IEEE Computer Society}, 
        doi = {10.1109/EMRTS.2000.854007}, 
        date-modified = {2014-11-05T08:23:59.604360}, 
        author = {Lipari, Giuseppe and Baruah, Sanjoy K.}, 
        abstract = {A framework for scheduling a number of different applications on a single shared pre-emptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeoff is identified and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs to have supported on the one hand, and the added context-switch costs imposed by our scheduling framework on the other}, 
        title = {{G}reedy reclamation of unused bandwidth in constant-bandwidth servers}, 
        pages = {193--200}, 
        year = {2000}, 
        organization = {IEEE}, 
        booktitle = {Proc. 12th Euromicro Conf. Real-Time Systems}, 
        localfile = {papers/lipariBaruah2000.pdf}, 
        date-added = {2014-10-28T13:09:30.801880}, 
    }
    
  2. Paolo Gai, Giuseppe Lipari, Luca Abeni, Marco Di Natale, Enrico Bini, Architecture for a portable open source real-time kernel environment, Proceedings of the Second Real-Time Linux Workshop and Handâs on Real-Time Linux Tutorial 2000
    @inproceedings {gai2000architecture,
        date-modified = {2014-11-05T08:10:52.458630}, 
        title = {{A}rchitecture for a portable open source real-time kernel environment}, 
        booktitle = {Proceedings of the Second Real-Time Linux Workshop and Handâs on Real-Time Linux Tutorial}, 
        author = {Gai, Paolo and Lipari, Giuseppe and Abeni, Luca and {Di Natale}, Marco and Bini, Enrico}, 
        year = {2000}, 
        date-added = {2014-10-28T13:09:36.260340}, 
    }
    
  3. Giuseppe Lipari, John Carpenter, Sanjoy K. Baruah, A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments, Proc. 21st IEEE Real-Time Systems Symp 2000
    [DOI]
    Abstract: A framework for scheduling a number of different real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the different applications, such that the behavior of each application is very similar to its behavior if it had been executing on a slower dedicated processor. A scheduling algorithm that implements this framework is presented and proved correct
    @inproceedings {lipari2000framework,
        doi = {10.1109/REAL.2000.896011}, 
        date-modified = {2014-11-05T08:15:46.389040}, 
        author = {Lipari, Giuseppe and Carpenter, John and Baruah, Sanjoy K.}, 
        abstract = {A framework for scheduling a number of different real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the different applications, such that the behavior of each application is very similar to its behavior if it had been executing on a slower dedicated processor. A scheduling algorithm that implements this framework is presented and proved correct}, 
        title = {{A} framework for achieving inter-application isolation in multiprogrammed, hard real-time environments}, 
        pages = {217--226}, 
        year = {2000}, 
        organization = {IEEE}, 
        booktitle = {Proc. 21st IEEE Real-Time Systems Symp}, 
        date-added = {2014-10-28T13:09:46.745810}, 
    }
    
  4. Giuseppe Lipari, Sanjoy K. Baruah, Efficient scheduling of real-time multi-task applications in dynamic systems, Proc. Sixth IEEE Real-Time Technology and Applications Symp. RTAS 2000 2000
    [DOI]
    Abstract: The Bandwidth Sharing Server (BSS) is a scheduling strategy for multi-task real time applications that provides the dual properties of performance guarantees and inter-application isolation. We describe the BSS-I algorithm, an evolution of the BSS, aimed at: (i) improving the run-time performance and (ii) generalizing the kinds of performance guarantees that can be offered
    @inproceedings {lipari2000efficient,
        doi = {10.1109/RTTAS.2000.852461}, 
        date-modified = {2014-11-05T08:14:27.691960}, 
        author = {Lipari, Giuseppe and Baruah, Sanjoy K.}, 
        abstract = {The Bandwidth Sharing Server (BSS) is a scheduling strategy for multi-task real time applications that provides the dual properties of performance guarantees and inter-application isolation. We describe the BSS-I algorithm, an evolution of the BSS, aimed at: (i) improving the run-time performance and (ii) generalizing the kinds of performance guarantees that can be offered}, 
        title = {{E}fficient scheduling of real-time multi-task applications in dynamic systems}, 
        pages = {166--175}, 
        year = {2000}, 
        organization = {IEEE}, 
        booktitle = {Proc. Sixth IEEE Real-Time Technology and Applications Symp. RTAS 2000}, 
        date-added = {2014-10-28T13:09:46.215090}, 
    }
    

1999

  1. Sanjoy K. Baruah, Giorgio C. Buttazzo, Sergej Gorinsky, Giuseppe Lipari, Scheduling periodic task systems to minimize output jitter, Proc. Sixth Int. Conf. Real-Time Computing Systems and Applications RTCSA '99 1999
    [DOI] [pdf]
    Abstract: Output jitter-the variation in the intercompletion times of successive jobs of the same task is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedules, and bounds proved for the maximum jitter in schedules generated by these algorithms
    @inproceedings {baruah1999scheduling,
        doi = {10.1109/RTCSA.1999.811194}, 
        date-modified = {2014-11-05T08:14:52.512500}, 
        author = {Baruah, Sanjoy K. and Buttazzo, Giorgio C. and Gorinsky, Sergej and Lipari, Giuseppe}, 
        abstract = {Output jitter-the variation in the intercompletion times of successive jobs of the same task is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedules, and bounds proved for the maximum jitter in schedules generated by these algorithms}, 
        title = {{S}cheduling periodic task systems to minimize output jitter}, 
        pages = {62--69}, 
        year = {1999}, 
        organization = {IEEE}, 
        booktitle = {Proc. Sixth Int. Conf. Real-Time Computing Systems and Applications RTCSA '99}, 
        localfile = {papers/bbgl99.pdf}, 
        date-added = {2014-10-28T13:09:32.931420}, 
    }
    
  2. Marco Caccamo, Giuseppe Lipari, Giorgio C. Buttazzo, Sharing resources among periodic and aperiodic tasks with dynamic deadlines, Proc. 20th IEEE Real-Time Systems Symp 1999
    [DOI]
    Abstract: In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. A tunable servicing technique is used to improve aperiodic responsiveness in the presence of resource constraints. The schedulability analysis is also extended to the case in which aperiodic deadlines vary at runtime. The results achieved in this paper can also be used for developing adaptive real-time systems, where task deadlines or periods can change to conform to new load conditions
    @inproceedings {caccamo1999sharing,
        doi = {10.1109/REAL.1999.818856}, 
        date-modified = {2014-11-05T08:14:39.931770}, 
        author = {Caccamo, Marco and Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        abstract = {In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. A tunable servicing technique is used to improve aperiodic responsiveness in the presence of resource constraints. The schedulability analysis is also extended to the case in which aperiodic deadlines vary at runtime. The results achieved in this paper can also be used for developing adaptive real-time systems, where task deadlines or periods can change to conform to new load conditions}, 
        title = {{S}haring resources among periodic and aperiodic tasks with dynamic deadlines}, 
        pages = {284--293}, 
        year = {1999}, 
        organization = {IEEE}, 
        booktitle = {Proc. 20th IEEE Real-Time Systems Symp}, 
        date-added = {2014-10-28T13:09:34.330580}, 
    }
    
  3. Giuseppe Lipari, Giorgio C. Buttazzo, Scheduling real-time multi-task applications in an open system, Proc. 11th Euromicro Conf. Real-Time Systems 1999
    [DOI]
    Abstract: This paper focuses on the problem of providing isolation and real-time execution in scheduling multi-thread applications on a single processor. The proposed scheduling algorithm can be applied in a wide range of different situations, such as in a multimedia real-time systems, where applications may require a guaranteed level of Quality of Service, or in a network link, where different flows of packets may require a certain level of service. This algorithm does not require the exact knowledge of the service times and interarrival times of the tasks: hence, it is especially suited for soft real-time and multimedia environments
    @inproceedings {lipari1999scheduling,
        publisher = {Published by the IEEE Computer Society}, 
        doi = {10.1109/EMRTS.1999.777470}, 
        date-modified = {2014-11-05T08:25:17.546540}, 
        author = {Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        abstract = {This paper focuses on the problem of providing isolation and real-time execution in scheduling multi-thread applications on a single processor. The proposed scheduling algorithm can be applied in a wide range of different situations, such as in a multimedia real-time systems, where applications may require a guaranteed level of Quality of Service, or in a network link, where different flows of packets may require a certain level of service. This algorithm does not require the exact knowledge of the service times and interarrival times of the tasks: hence, it is especially suited for soft real-time and multimedia environments}, 
        title = {{S}cheduling real-time multi-task applications in an open system}, 
        pages = {234--241}, 
        year = {1999}, 
        booktitle = {Proc. 11th Euromicro Conf. Real-Time Systems}, 
        date-added = {2014-10-28T13:09:46.698360}, 
    }
    
  4. Luca Abeni, Giuseppe Lipari, Giorgio C. Buttazzo, Constant bandwidth vs. proportional share resource allocation, Proc. IEEE Int Multimedia Computing and Systems Conf 1999 ISSN: 1530-2032
    [DOI]
    Abstract: Due to the success of new multimedia technologies, there is a great interest in providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in the literature are based on proportional share resource allocation, such as WFQ, WF2 Q, EEVDF or SFQ. In a previous paper we showed how to perform resource reservation according to a constant bandwidth allocation. In this paper we compare proportional share and constant bandwidth resource allocation strategies, by showing advantages and drawbacks of both techniques
    @inproceedings {abeni1999constant,
        doi = {10.1109/MMCS.1999.778154}, 
        date-modified = {2014-11-05T08:09:38.929790}, 
        author = {Abeni, Luca and Lipari, Giuseppe and Buttazzo, Giorgio C.}, 
        title = {{C}onstant bandwidth vs. proportional share resource allocation}, 
        abstract = {Due to the success of new multimedia technologies, there is a great interest in providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in the literature are based on proportional share resource allocation, such as WFQ, WF2 Q, EEVDF or SFQ. In a previous paper we showed how to perform resource reservation according to a constant bandwidth allocation. In this paper we compare proportional share and constant bandwidth resource allocation strategies, by showing advantages and drawbacks of both techniques}, 
        issn = {1530-2032}, 
        pages = {107--111}, 
        volume = {2}, 
        year = {1999}, 
        owner = {lipari}, 
        organization = {Published by the IEEE Computer Society}, 
        booktitle = {Proc. IEEE Int Multimedia Computing and Systems Conf}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    

1998

  1. Giuseppe Lipari, Giorgio C. Buttazzo, Luca Abeni, A bandwidth reservation algorithm for multi-application systems, Proc. Fifth Int Real-Time Computing Systems and Applications Conf 1998
    [DOI]
    Abstract: The paper focuses on the problem of providing efficient run time support for different applications running on a real time system. The goal of our research is to develop a scheduling algorithm to allow independent applications to coexist on the same system. In order to meet the requested QoS, we assign each application a minimum bandwidth and guarantee that it never demands more. This algorithm does not require the exact knowledge of the execution times and interarrival times of the application tasks: hence, it is especially suited for soft real time and multimedia applications
    @inproceedings {Lipari1998,
        doi = {10.1109/RTCSA.1998.726354}, 
        date-modified = {2014-11-05T08:09:43.745490}, 
        author = {Lipari, Giuseppe and Buttazzo, Giorgio C. and Abeni, Luca}, 
        abstract = {The paper focuses on the problem of providing efficient run time support for different applications running on a real time system. The goal of our research is to develop a scheduling algorithm to allow independent applications to coexist on the same system. In order to meet the requested QoS, we assign each application a minimum bandwidth and guarantee that it never demands more. This algorithm does not require the exact knowledge of the execution times and interarrival times of the application tasks: hence, it is especially suited for soft real time and multimedia applications}, 
        title = {{A} bandwidth reservation algorithm for multi-application systems}, 
        pages = {77--82}, 
        year = {1998}, 
        owner = {lipari}, 
        booktitle = {Proc. Fifth Int Real-Time Computing Systems and Applications Conf}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Giorgio C. Buttazzo, Giuseppe Lipari, Luca Abeni, Elastic task model for adaptive rate control, Proc. 19th IEEE Real-Time Systems Symp. 1998
    [DOI]
    Abstract: An increasing number of real time applications, related to multimedia and adaptive control systems, require greater flexibility than classical real time theory usually permits. We present a novel periodic task model, in which tasks' periods are treated as springs, with given elastic coefficients. Under this framework, periodic tasks can intentionally change their execution rate to provide different quality of service, and the other tasks can automatically adapt their periods to keep the system underloaded. The proposed model can also be used to handle overload conditions in a more flexible way, and provide a simple and efficient mechanism for controlling the quality of service of the system as a function of the current load
    @inproceedings {buttazzo1998elastic,
        doi = {10.1109/REAL.1998.739754}, 
        date-modified = {2014-11-05T08:14:14.249360}, 
        author = {Buttazzo, Giorgio C. and Lipari, Giuseppe and Abeni, Luca}, 
        abstract = {An increasing number of real time applications, related to multimedia and adaptive control systems, require greater flexibility than classical real time theory usually permits. We present a novel periodic task model, in which tasks' periods are treated as springs, with given elastic coefficients. Under this framework, periodic tasks can intentionally change their execution rate to provide different quality of service, and the other tasks can automatically adapt their periods to keep the system underloaded. The proposed model can also be used to handle overload conditions in a more flexible way, and provide a simple and efficient mechanism for controlling the quality of service of the system as a function of the current load}, 
        title = {{E}lastic task model for adaptive rate control}, 
        pages = {286--295}, 
        year = {1998}, 
        owner = {lipari}, 
        organization = {IEEE}, 
        booktitle = {Proc. 19th IEEE Real-Time Systems Symp.}, 
        date-added = {2014-10-28T13:09:34.059040}, 
    }
    
  3. Antonino Casile, Giorgio C. Buttazzo, Gerardo Lamastra, Giuseppe Lipari, Simulation and tracing of hybrid task sets on distributed systems, Proc. Fifth Int Real-Time Computing Systems and Applications Conf 1998
    [DOI]
    Abstract: This paper describes a tool for the design, simulation and analysis of real-time systems, ranging from simple scenarios with a few types of tasks on a single node to very complex architectures consisting of multiple nodes interconnected with a network and sharing a set of hardware and software resources. The tool is based on a discrete event simulation library, a scripting language describing the system load and the relevant measures, and a graphical interface providing user-friendly interaction with the simulator
    @inproceedings {casile1998simulation,
        doi = {10.1109/RTCSA.1998.726425}, 
        date-modified = {2014-11-05T08:15:35.674320}, 
        author = {Casile, Antonino and Buttazzo, Giorgio C. and Lamastra, Gerardo and Lipari, Giuseppe}, 
        abstract = {This paper describes a tool for the design, simulation and analysis of real-time systems, ranging from simple scenarios with a few types of tasks on a single node to very complex architectures consisting of multiple nodes interconnected with a network and sharing a set of hardware and software resources. The tool is based on a discrete event simulation library, a scripting language describing the system load and the relevant measures, and a graphical interface providing user-friendly interaction with the simulator}, 
        title = {{S}imulation and tracing of hybrid task sets on distributed systems}, 
        pages = {249--256}, 
        year = {1998}, 
        organization = {IEEE}, 
        booktitle = {Proc. Fifth Int Real-Time Computing Systems and Applications Conf}, 
        date-added = {2014-10-28T13:09:34.410900}, 
    }
    

1997

  1. Giorgio C. Buttazzo, Giuseppe Lipari, Scheduling analysis of hybrid real-time task sets, Proc. Ninth Euromicro Workshop Real-Time Systems 1997
    [DOI]
    Abstract: The authors present an integrated scheduling approach which allows to handle real-time task sets with different types of constraints and criticalness. Tasks are scheduled on-line in a dynamic environment based on the earliest deadline first algorithm. Schedulability conditions are derived for hybrid task sets consisting of hard periodic tasks and soft aperiodic activities, interacting through shared resources. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Aperiodic responsiveness is enhanced by an efficient servicing technique which assigns a suitable deadline to each aperiodic request. Moreover the feasibility conditions are extended to handle tasks with deadlines different than periods
    @inproceedings {Buttazzo1997,
        doi = {10.1109/EMWRTS.1997.613786}, 
        date-modified = {2014-11-05T08:09:41.068160}, 
        author = {Buttazzo, Giorgio C. and Lipari, Giuseppe}, 
        abstract = {The authors present an integrated scheduling approach which allows to handle real-time task sets with different types of constraints and criticalness. Tasks are scheduled on-line in a dynamic environment based on the earliest deadline first algorithm. Schedulability conditions are derived for hybrid task sets consisting of hard periodic tasks and soft aperiodic activities, interacting through shared resources. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Aperiodic responsiveness is enhanced by an efficient servicing technique which assigns a suitable deadline to each aperiodic request. Moreover the feasibility conditions are extended to handle tasks with deadlines different than periods}, 
        title = {{S}cheduling analysis of hybrid real-time task sets}, 
        pages = {200--206}, 
        year = {1997}, 
        owner = {lipari}, 
        booktitle = {Proc. Ninth Euromicro Workshop Real-Time Systems}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  2. Giorgio C. Buttazzo, Fabio Conticelli, Gerardo Lamastra, Giuseppe Lipari, Robot control in hard real-time environment, Proc. - Fourth Int. Workshop Real-Time Computing Systems and Applications 1997
    [DOI]
    Abstract: This paper describes a software architecture aimed at the development of complex robotic applications with stringent real-time constraints. The proposed methodology is based on a modular design approach, in which high-level processes are developed from elementary sensory-motor activities, carried our at lower layers of a hierarchical control system. The control software is organized in a number of layers, which add new capabilities to the robot system and allow the user to program an application at different levels of abstraction. At the lowest layer, the execution of all computational activities is supported by a hard real-time kernel, which provides predictable scheduling of periodic and aperiodic tasks. The flexibility of the proposed approach is shown through real robotic applications
    @inproceedings {Buttazzo1997a,
        doi = {10.1109/RTCSA.1997.629195}, 
        date-modified = {2014-11-05T08:09:40.984700}, 
        author = {Buttazzo, Giorgio C. and Conticelli, Fabio and Lamastra, Gerardo and Lipari, Giuseppe}, 
        abstract = {This paper describes a software architecture aimed at the development of complex robotic applications with stringent real-time constraints. The proposed methodology is based on a modular design approach, in which high-level processes are developed from elementary sensory-motor activities, carried our at lower layers of a hierarchical control system. The control software is organized in a number of layers, which add new capabilities to the robot system and allow the user to program an application at different levels of abstraction. At the lowest layer, the execution of all computational activities is supported by a hard real-time kernel, which provides predictable scheduling of periodic and aperiodic tasks. The flexibility of the proposed approach is shown through real robotic applications}, 
        title = {{R}obot control in hard real-time environment}, 
        pages = {152--159}, 
        year = {1997}, 
        owner = {lipari}, 
        booktitle = {Proc. - Fourth Int. Workshop Real-Time Computing Systems and Applications}, 
        date-added = {2011-05-12T00:00:00}, 
    }
    
  3. Gerardo Lamastra, Giuseppe Lipari, Giorgio C. Buttazzo, Antonino Casile, Fabio Conticelli, HARTIK 3.0: a portable system for developing real-time applications, Proc. - Fourth Int. Workshop Real-Time Computing Systems and Applications 1997
    [DOI]
    Abstract: This paper describes the features of the HARTIK system, a hard real-time kernel designed to help the development of real-time applications, ranging from classical hard control systems to soft multimedia, distributed systems. The portability, the predictability and the flexibility in expressing timing constraints allow the application designer to explore a broad set of solutions both from a hardware and software perspective. A toolkit has also been developed to support the design phase. The kernel supports 16-bit and 32-bit Intel 80×86 processors, DEC Alpha AXP-PCI-33, and can be easily ported to other different hardware architectures, such as microcontrollers and embedded systems. The relevant features offered by the kernel include direct specification of timing constraints, such us period and deadlines, coexistence of tasks with different criticalness, dynamic scheduling of periodic and aperiodic tasks, bounded blocking time on shared resources, prevention of deadlock and chained blocking; asynchronous, time bounded communication paradigm for exchanging data among tasks having different execution rates
    @inproceedings {lamastra1997hartik,
        doi = {10.1109/RTCSA.1997.629172}, 
        date-modified = {2014-11-05T08:21:05.810160}, 
        author = {Lamastra, Gerardo and Lipari, Giuseppe and Buttazzo, Giorgio C. and Casile, Antonino and Conticelli, Fabio}, 
        abstract = {This paper describes the features of the HARTIK system, a hard real-time kernel designed to help the development of real-time applications, ranging from classical hard control systems to soft multimedia, distributed systems. The portability, the predictability and the flexibility in expressing timing constraints allow the application designer to explore a broad set of solutions both from a hardware and software perspective. A toolkit has also been developed to support the design phase. The kernel supports 16-bit and 32-bit Intel 80×86 processors, DEC Alpha AXP-PCI-33, and can be easily ported to other different hardware architectures, such as microcontrollers and embedded systems. The relevant features offered by the kernel include direct specification of timing constraints, such us period and deadlines, coexistence of tasks with different criticalness, dynamic scheduling of periodic and aperiodic tasks, bounded blocking time on shared resources, prevention of deadlock and chained blocking; asynchronous, time bounded communication paradigm for exchanging data among tasks having different execution rates}, 
        title = {H{A}RT{I}K 3.0: a portable system for developing real-time applications}, 
        pages = {43--50}, 
        year = {1997}, 
        organization = {Published by the IEEE Computer Society}, 
        booktitle = {Proc. - Fourth Int. Workshop Real-Time Computing Systems and Applications}, 
        date-added = {2014-10-28T13:09:36.584680}, 
    }
    

Author: Giuseppe Lipari

Created: 2017-05-15 lun. 16:25

Validate