Methods of Mathematical Forecasting of the Time of Execution of Complex Sets of Jobs in Parallel Distributed Computer Systems

Authors:
A. M. Enaliev;V. V. Ignatushchenko;E. V. Pomazov;E. A. Sluchanko
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2002

Citing 3
Cited 2

Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Probabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation

IEEE Transactions on Computers
Dynamic Task Scheduling Using Online Optimization

IEEE Transactions on Parallel and Distributed Systems

Static Forecasting of the Execution Times of Complexes of Interrelated Jobs in the Multiprocessor Computer Systems

Automation and Remote Control
Determination of exact upper estimates of time taken to perform complex sets of problems in control, parallel computing systems

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

A procedure of mathematical forecasting of the time of executing complex sets of interrelated software modules (tasks and/or their fragments) in parallel idistributed computer systems which takes into account the fact that the time of interprocessor data exchange can be commensurable with that of executing a software module was described for the first time. The times of both interprocessor data exchanges and software module executions were regarded as random variables. Both static planning and dynamic task scheduling were studied. A procedure was proposed for determining with regard for high dimensionality of the mathematical models at hand the upper bound of the number of states of the terminating Markov process describing the model that realizes each user-defined set of interrelated tasks.