By Topic

A Satisficing MOMIP Framework for Reliable Real-time Application Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sivanthi, T. ; Inst. of Commun. Networks, Hamburg Univ. of Technol. ; Killat, U.

In a networked embedded system a real-time application is distributed and scheduled over a set of nodes, which are connected by means of heterogeneous networks. The application designer for such a system is often confronted with the challenge of providing better response time and low failure probability for the distributed application. These objectives are conflicting with each other hence some trade-off between these two design objectives is needed to ensure a satisfactory application schedule. More often the designer's satisfaction can be expressed as a set of aspiration bounds on the design objectives, that if attained will be a good schedule. This paper proposes a satisfying multiobjective mixed integer programming (MOMIP) framework for deriving such a schedule

Published in:

Dependable, Autonomic and Secure Computing, 2nd IEEE International Symposium on

Date of Conference:

Sept. 29 2006-Oct. 1 2006