Synthesizing a Multiprocessor System for Scheduling with Interruptions and Execution Intervals


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

A problem of finding processor performances in a multiprocessor system is studied such that an admissible schedule with interruptions exists for the given set of jobs with execution intervals. Cases are considered when (1) the amounts of jobs are fixed and (2) linearly depend on the amount of extra resources allocated for them; (3) processor performances are bounded above and below. In all three cases, the original problem is reduced to the system of linear inequalities. The algorithm for finding Pareto optimal solutions is described.

About the authors

M. G. Furugyan

Dorodnicyn Computing Center, Federal Research Center Computer Science and Control,
Russian Academy of Sciences

Author for correspondence.
Email: rtsccas@ya.ru
Russian Federation, Moscow, 119991


Copyright (c) 2019 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies