---
_id: '4561'
abstract:
- lang: eng
  text: 'We present a formalism for specifying component interfaces that expose component
    requirements on limited resources. The formalism permits an algorithmic check
    if two or more components, when put together, exceed the available resources.
    Moreover, the formalism can be used to compute the quantity of resources necessary
    for satisfying the requirements of a collection of components. The formalism can
    be instantiated in several ways. For example, several components may draw power
    from the same source. Then, the formalism supports compatibility checks such as:
    can two components, when put together, achieve their tasks without ever exceeding
    the available amount of peak power? or, can they achieve their tasks by using
    no more than the initially available amount of energy (i.e., power accumulated
    over time)? The corresponding quantitative questions that our algorithms answer
    are the following: what is the amount of peak power needed for two components
    to be put together? what is the corresponding amount of initial energy? To solve
    these questions, we model interfaces with resource requirements as games with
    quantitative objectives. The games are played on state spaces where each state
    is labeled by a number (representing, e.g., power consumption), and a play produces
    an infinite path of labels. The objective may be, for example, to minimize the
    largest label that occurs during a play. We illustrate our approach by modeling
    compatibility questions for the components of robot control software, and of wireless
    sensor networks.'
acknowledgement: This research was supported in part by the DARPA grant F33615-00-C-1693,
  the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949,
  CCR-0132780, CCR-0234690, and CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Arindam
  full_name: Chakrabarti, Arindam
  last_name: Chakrabarti
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Mariëlle
  full_name: Stoelinga, Mariëlle
  last_name: Stoelinga
citation:
  ama: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces.
    In: <i>Third International Conference on Embedded Software</i>. Vol 2855. ACM;
    2003:117-133. doi:<a href="https://doi.org/10.1007/978-3-540-45212-6_9">10.1007/978-3-540-45212-6_9</a>'
  apa: 'Chakrabarti, A., De Alfaro, L., Henzinger, T. A., &#38; Stoelinga, M. (2003).
    Resource interfaces. In <i>Third International Conference on Embedded Software</i>
    (Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. <a href="https://doi.org/10.1007/978-3-540-45212-6_9">https://doi.org/10.1007/978-3-540-45212-6_9</a>'
  chicago: Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle
    Stoelinga. “Resource Interfaces.” In <i>Third International Conference on Embedded
    Software</i>, 2855:117–33. ACM, 2003. <a href="https://doi.org/10.1007/978-3-540-45212-6_9">https://doi.org/10.1007/978-3-540-45212-6_9</a>.
  ieee: A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource
    interfaces,” in <i>Third International Conference on Embedded Software</i>, Philadelphia,
    PA, USA, 2003, vol. 2855, pp. 117–133.
  ista: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces.
    Third International Conference on Embedded Software. EMSOFT: Embedded Software
    , LNCS, vol. 2855, 117–133.'
  mla: Chakrabarti, Arindam, et al. “Resource Interfaces.” <i>Third International
    Conference on Embedded Software</i>, vol. 2855, ACM, 2003, pp. 117–33, doi:<a
    href="https://doi.org/10.1007/978-3-540-45212-6_9">10.1007/978-3-540-45212-6_9</a>.
  short: A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International
    Conference on Embedded Software, ACM, 2003, pp. 117–133.
conference:
  end_date: 2003-10-15
  location: Philadelphia, PA, USA
  name: 'EMSOFT: Embedded Software '
  start_date: 2003-10-13
date_created: 2018-12-11T12:09:29Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-08T10:48:11Z
day: '29'
doi: 10.1007/978-3-540-45212-6_9
extern: '1'
intvolume: '      2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 117 - 133
publication: Third International Conference on Embedded Software
publication_identifier:
  isbn:
  - '9783540202233'
publication_status: published
publisher: ACM
publist_id: '148'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resource interfaces
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...
---
_id: '4464'
abstract:
- lang: eng
  text: We introduce the paradigm of schedule-carrying code (SCC). A hard real-time
    program can be executed on a given platform only if there exists a feasible schedule
    for the real-time tasks of the program. Traditionally, a scheduler determines
    the existence of a feasible schedule according to some scheduling strategy. With
    SCC, a compiler proves the existence of a feasible schedule by generating executable
    code that is attached to the program and represents its schedule. An SCC executable
    is a real-time program that carries its schedule as code, which is produced once
    and can be revalidated and executed with each use. We evaluate SCC both in theory
    and practice. In theory, we give two scenarios, of nonpreemptive and distributed
    scheduling for Giotto programs, where the generation of a feasible schedule is
    hard, while the validation of scheduling instructions that are attached to the
    programs is easy. In practice, we implement SCC and show that explicit scheduling
    instructions can reduce the scheduling overhead up to 35% and can provide an efficient,
    flexible, and verifiable means for compiling Giotto programs on complex architectures,
    such as the TTA.
acknowledgement: This work was supported by the AFOSR MURI grant F49620-00-1-0327,
  the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant
  98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Christoph
  full_name: Kirsch, Christoph
  last_name: Kirsch
- first_name: Slobodan
  full_name: Matic, Slobodan
  last_name: Matic
citation:
  ama: 'Henzinger TA, Kirsch C, Matic S. Schedule-carrying code. In: <i>Proceedings
    of the 3rd International Conference on Embedded Software</i>. Vol 2855. ACM; 2003:241-256.
    doi:<a href="https://doi.org/10.1007/978-3-540-45212-6_16">10.1007/978-3-540-45212-6_16</a>'
  apa: 'Henzinger, T. A., Kirsch, C., &#38; Matic, S. (2003). Schedule-carrying code.
    In <i>Proceedings of the 3rd International Conference on Embedded Software</i>
    (Vol. 2855, pp. 241–256). Philadelphia, PA, USA: ACM. <a href="https://doi.org/10.1007/978-3-540-45212-6_16">https://doi.org/10.1007/978-3-540-45212-6_16</a>'
  chicago: Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Schedule-Carrying
    Code.” In <i>Proceedings of the 3rd International Conference on Embedded Software</i>,
    2855:241–56. ACM, 2003. <a href="https://doi.org/10.1007/978-3-540-45212-6_16">https://doi.org/10.1007/978-3-540-45212-6_16</a>.
  ieee: T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in <i>Proceedings
    of the 3rd International Conference on Embedded Software</i>, Philadelphia, PA,
    USA, 2003, vol. 2855, pp. 241–256.
  ista: 'Henzinger TA, Kirsch C, Matic S. 2003. Schedule-carrying code. Proceedings
    of the 3rd International Conference on Embedded Software. EMSOFT: Embedded Software
    , LNCS, vol. 2855, 241–256.'
  mla: Henzinger, Thomas A., et al. “Schedule-Carrying Code.” <i>Proceedings of the
    3rd International Conference on Embedded Software</i>, vol. 2855, ACM, 2003, pp.
    241–56, doi:<a href="https://doi.org/10.1007/978-3-540-45212-6_16">10.1007/978-3-540-45212-6_16</a>.
  short: T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International
    Conference on Embedded Software, ACM, 2003, pp. 241–256.
conference:
  end_date: 2003-10-15
  location: Philadelphia, PA, USA
  name: 'EMSOFT: Embedded Software '
  start_date: 2003-10-13
date_created: 2018-12-11T12:08:59Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-10T11:33:57Z
day: '29'
doi: 10.1007/978-3-540-45212-6_16
extern: '1'
intvolume: '      2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 241 - 256
publication: Proceedings of the 3rd International Conference on Embedded Software
publication_identifier:
  isbn:
  - '9783540202233'
publication_status: published
publisher: ACM
publist_id: '267'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Schedule-carrying code
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...