Use of Supercomputing towards the Generation of a Process Execution Plan in Distributed Real-Time Systems

This work consider the scheduling of periodic tasks or processes with real-time constraints in a distributed environment. Each task must be executed meeting deadlines, precedence relationships and resources constraints. The problem of scheduling tasks on a distributed environment can be viewed as a...

Full description

Saved in:
Bibliographic Details
Main Authors: de Leon Luis Alberto, Gutierrez Diaz, Carlos Alberto, Franco Reboreda, de Leon Carlos Adrian, Gutierrez Diaz
Format: Conference Proceeding
Language:English
Subjects:
Classification algorithms
Processor scheduling
Program processors
Proposals
Real time systems
Resource management
Time factors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work consider the scheduling of periodic tasks or processes with real-time constraints in a distributed environment. Each task must be executed meeting deadlines, precedence relationships and resources constraints. The problem of scheduling tasks on a distributed environment can be viewed as a problem of assigning processes to the processors but keeping the schedulability in local environments. Thus, the problem can be divided in two phases: the first phase is assigning processes to processors and the second is to schedule assigned processes in each processor in the distributed environment. This paper focuses in the first phase. It introduces a heuristic mechanism for assigning processes in a distributed environment with real-time constraints. The heuristic mechanism has two alternative ways to perform: one takes into account the utilization factor and the other considers period. The performance of both alternatives proposed is evaluated via simulation on a high performance-computing platform.
DOI:10.1109/CERMA.2010.97