Skip to main content
  • 117 Accesses

Abstract

Traditionally, hand crafted solutions, multi-threading libraries [Schwan 91] or real-time operating systems [Ramamritham 94] have been used as backends at the lowest level to solve the software embedding problem in the software design of embedded systems. Additionally, new methodologies are emerging from the CAD domain in the field of hardware/software co-design. These techniques are part of what we have called the ‘processor architecture integration’ step, which is needed for integration of behavior distributed over different custom or general-purpose processor half-way the system design script (Section 4.1). They focus on providing a more integrated approach to the simultaneous design of both hardware and software. Finally, an overwhelming amount of work exists focusing on the ‘task concurrency management’ (i.e. task scheduling), typically originating from a software background; however, at the highest level in the system design script, they can be re-used for both software and hardware.

“The fundamental aspects of real-time embedded software are often not well understood by designers in a design community which is traditionally hardware oriented ...”

—[anonymous]

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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.

Notes

  1. a static scheduling algorithm is said to be optimal if, for any set of tasks, it finds a feasible schedule, whenever any other algorithm can do so [Dertouzos 74].

    Google Scholar 

  2. this lower bound is pessimistic and represents the absolute worst-case conditions. Later, [Lehoczky 87b] concluded from an exact characterization and stochastic analysis for a randomly generated set of periodic tasks that a good schedulability threshold approximation is 88%.

    Google Scholar 

  3. [Harbour 91] proves that increases in priority during the execution of a task can lead to better schedulability.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Thoen, F., Catthoor, F. (2000). Related Work and Contemporary Approaches. In: Thoen, F., Catthoor, F. (eds) Modeling, Verification and Exploration of Task-Level Concurrency in Real-Time Embedded Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4437-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4437-1_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6998-1

  • Online ISBN: 978-1-4615-4437-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics