ISSN:
1573-1383
Keywords:
real-time
;
distributed systems
;
multitask-multiprocessor
;
RM-scheduling
;
heuristic
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract A heuristic approach to the problem of assigning a set of preemptible resource-sharing and blockable real-time tasks to be executed in a set of heterogeneous processors communicated through an interprocessor network, is presented. The problem is NP-hard. The empty-slots method is used to test the RM schedulability in each processor. There are placement, time, memory, communication and precedence constraints. A general expression for the modification of hard-precedence deadlines of related tasks executing in the same or in different processors is given. The effects of the Average Processor Utilization Factor and the Network Bandwidth on the number of solutions found are shown and discussed through systematic sets of examples. Also, Success Ratios are obtained and plotted vs. Average Processor Utilization Factors for different Network Bandwidths. Results obtained are compared to those obtained by other methods.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1007933607293
Permalink
