A Heuristic Approach to the Multitask-Multiprocessor AssignmentProblem using the Empty-Slots Method and Rate Monotonic Scheduling

Authors:
J. Santos;E. Ferro;J. Orozco;R. Cayssials
Affiliations:
Dep. Ing. Eléctrica, Instituto de Ciencias e Ingeniería de Computacion, Universidad Nacional del Sur, Bahía Blanca, Argentina;Dep. Ing. Eléctrica, Instituto de Ciencias e Ingeniería de Computacion, Universidad Nacional del Sur, Bahía Blanca, Argentina;Dep. Ing. Eléctrica, Instituto de Ciencias e Ingeniería de Computacion, Universidad Nacional del Sur, Bahía Blanca, Argentina;Dep. Ing. Eléctrica, Instituto de Ciencias e Ingeniería de Computacion, Universidad Nacional del Sur, Bahía Blanca, Argentina
Venue:
Real-Time Systems
Year:
1997

Citing 14
Cited 7

Preemptive scheduling under time and resource constraints

IEEE Transactions on Computers - Special Issue on Real-Time Systems
Misconceptions About Real-Time Computing: A Serious Problem for Next-Generation Systems

Computer
Dynamic scheduling of real-time tasks under precedence constraints

Real-Time Systems
Priorities and protocols in hard real-time LANs: implementing a crisis-free system

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

Real-Time Systems
Rate monotonic scheduling in hard real-time systems

Information Processing Letters
Issues in the static allocation and scheduling of complex periodic tasks

RTOSS '93 Proceedings of the tenth IEEE workshop on Real-time operating systems and software
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Journal of the ACM (JACM)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Rate Monotonic Analysis for Real-Time Systems

Computer
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations

IEEE Transactions on Software Engineering
Analysis of Real-Time Rule-Based Systems with Behavioral Constraint Assertions Specified in Estella

IEEE Transactions on Software Engineering
Engineering and Analysis of Fixed Priority Schedulers

IEEE Transactions on Software Engineering

The Slack Method: A New Method for Static Allocation ofHard Real-Time Tasks

Real-Time Systems
Automation support for software performance engineering

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Metric and Mixed-Integer-Programming-Based Approach for Resource Allocation in Dynamic Real-Time Systems

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
MIP formulation for robust resource allocation in dynamic real-time systems

Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Solving a real-time allocation problem with constraint programming

Journal of Systems and Software
Static scheduling with interruption costs for computer vision applications

VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic approach to the problem of assigning a setof preemptible resource-sharing and blockable real-time tasksto be executed in a set of heterogeneous processors communicatedthrough an interprocessor network, is presented. The problemis NP-hard. The empty-slots method is used to test the RM schedulabilityin each processor. There are placement, time, memory, communicationand precedence constraints. A general expression for the modificationof hard-precedence deadlines of related tasks executing in thesame or in different processors is given. The effects of theAverage Processor Utilization Factor and the Network Bandwidthon the number of solutions found are shown and discussed throughsystematic sets of examples. Also, Success Ratios are obtainedand plotted vs. Average Processor Utilization Factors for differentNetwork Bandwidths. Results obtained are compared to those obtainedby other methods.