Skip to main content
  • 214 Accesses

Abstract

In this chapter we present an approach to mapping and scheduling for time-driven systems where processes are scheduled according to a non-preemptive static cyclic scheduling scheme, and communication uses a time division multiple access (TDMA) protocol. We accurately take into consideration the communication costs and consider, during the mapping and scheduling process, the particular requirements of the communication protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Pop, P., Eles, P., Peng, Z. (2004). Incremental Mapping for Time-Driven Systems. In: Analysis and Synthesis of Distributed Real-Time Embedded Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4020-2873-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-2873-1_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5257-8

  • Online ISBN: 978-1-4020-2873-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics