Cart (Loading....) | Create Account
Close category search window
 

Tuning parameters to improve a heuristic method: more and better solutions to an NP-hard real-time problem

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

4 Author(s)
Ferro, E. ; Inst. de Ciencias e Ingenieria de Computacion, Univ. Nacional del Sur, Bahia Blanca, Argentina ; Santos, J. ; Orozce, J. ; Cayssials, R.

The paper presents a tuned heuristic method to solve the NP-hard problem of assigning a set of preemptible tasks with placement, resource, communication, time and precedence constraints to a set of heterogeneous processors. Depending on the tuning parameters, two versions are described. They produce more and better (e.g. with a less loaded communication network) solutions than the untuned version. Time to obtain the first solution and the number of solutions found for different known problems are given

Published in:

Real-Time Systems, 1996., Proceedings of the Eighth Euromicro Workshop on

Date of Conference:

12-14 Jun 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.