Skip to main navigation Skip to search Skip to main content

Cost-efficient synthesis of real-time systems upon heterogeneous multiprocessor platforms

  • Sanjoy Baruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a collection of recurring tasks or processes that comprise the software for an embedded system, and a number of different types of available processing units, the minimum cost synthesis problem is concerned with obtaining an implementation of the embedded system upon a multiprocessor platform comprised of processing units from among the available types, such that the total cost of the platform is minimized. It is shown that this problem is intractable (NP-hard in the strong sense). Approximation algorithms are presented that guarantee to obtain implementations with cost no more than a constant amount greater than twice the cost of an optimal implementation.

Original languageEnglish
Title of host publicationProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Pages1685-1692
Number of pages8
StatePublished - 2004
EventProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) - Santa Fe, NM, United States
Duration: Apr 26 2004Apr 30 2004

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Volume18

Conference

ConferenceProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Country/TerritoryUnited States
CitySanta Fe, NM
Period04/26/0404/30/04

Keywords

  • Approximation algorithms
  • Embedded systems
  • Multiprocessors
  • Periodic tasks

Fingerprint

Dive into the research topics of 'Cost-efficient synthesis of real-time systems upon heterogeneous multiprocessor platforms'. Together they form a unique fingerprint.

Cite this