Optimal Priority Assignment to Control Tasks - ACM Digital Library [PDF]

Dec 15, 2014 - Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. re

2 downloads 29 Views 123KB Size

Recommend Stories


digital library digital library services services
Suffering is a gift. In it is hidden mercy. Rumi

Optimal Control
Respond to every call that excites your spirit. Rumi

Optimal Control
You have to expect things of yourself before you can do them. Michael Jordan

Optimal Open-Loop Control of Vacations, Polling and Service Assignment
If you are irritated by every rub, how will your mirror be polished? Rumi

e-0146-6,64 - Adventist Digital Library [PDF]
Officers: President, T. F. Judd. Secretary-Treasurer, J. J. Dever. Ordained Ministers: T. F. Judd, Cyril Pascoe, Patavaki,. Ragopitu, Simi, Tati. Licensed Ministers: Are, Baugasi, Beni, J. J. Dever, H. A. Dickens, Ereman, R. A. Harrison, ...... Direc

PASS: Priority Assignment of Real-Time Tasks with Dynamic Suspending Behavior under Fixed
Ask yourself: When was the last time I said I love you to someone? Next

Untitled - IDRC Digital Library
Stop acting so small. You are the universe in ecstatic motion. Rumi

Assignment pdf
Keep your face always toward the sunshine - and shadows will fall behind you. Walt Whitman

Untitled - IDRC Digital Library
And you? When will you begin that long journey into yourself? Rumi

Idea Transcript


SIGN IN SIGN UP

Tools and Resources

Optimal Priority Assignment to Control Tasks Full Text: Authors:

PDF

Get this Article

Buy this Article

2014 Article

Giulio M. Mancuso Scuola Superiore Sant'Anna, Pisa, Italy Enrico Bini Lund University, Lund, Sweden Gabriele Pannocchia University of Pisa, Italy

Recommend the ACM DL

Research

to your organization

Refereed

Request Permissions

Published in: · Journal ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Risk and Trust in Embedded Critical Systems, Special Issue on Real-Time, Embedded and Cyber-Physical Systems, Special Issue on Virtual Prototyping of Parallel and Embedded Systems (ViPES) TECS Homepage archive Volume 13 Issue 5s, November 2014 Article No. 161 ACM New York, NY, USA table of contents doi> 10.1145/2660496

Bibliometrics

TOC Service:

· Citation Count: 1 · Downloads (cumulative): 131 · Downloads (12 Months): 19 · Downloads (6 Weeks): 0

Email

RSS

Save to Binder Export Formats: BibTeX EndNote ACM Ref Share:

| Author Tags

Contact Us | Switch to single page view (no tabs) Abstract

Authors

References

Cited By

Index Terms

Publication

Reviews

Comments

Table of Contents

In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence; rather, it has a quantifiable impact in the control performance achieved by the task. In this article, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over a shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm that can be further speeded up by allowing for a small degree of suboptimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall algorithm effectiveness, and its scalability with the number of tasks.

ADVERTISEMENTS AD

FullContact The Leading Open Platform for 360° Customer, Company & Relationship Insights

AD

Microsoft Azure Engage with global customers with personalized digital marketing experiences.

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us

Smile Life

When life gives you a hundred reasons to cry, show life that you have a thousand reasons to smile

Get in touch

© Copyright 2015 - 2024 PDFFOX.COM - All rights reserved.