Operations research: an introduction, 4th ed.
Operations research: an introduction, 4th ed.
Modeling, assignment and scheduling of tasks in distributed real-time systems
Modeling, assignment and scheduling of tasks in distributed real-time systems
Discrete Mathematical Structures with Applications to Computer Science
Discrete Mathematical Structures with Applications to Computer Science
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Combined Task and Message Scheduling in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Multimedia task scheduling on OLSR enabled ad hoc networks
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
A security-oriented task scheduler for heterogeneous distributed systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
Preemptive (resume) scheduling of cooperative tasks that have been preassigned to a set of processing nodes in a distributed system, when each task is assumed to consist of several modules is discussed. During the course of their execution, the tasks communicate with each other to collectively accomplish a common goal. Such intertask communications lead to precedence constraints between the modules of different tasks. The objective of this scheduling is to minimize the maximum normalized task response time, called the system hazard. Real-time tasks and the precedence constraints among them are expressed in a PERT/CPM form with activity on arc (AOA), called the task graph (TG), in which the dominance relationship between simultaneously schedulable modules is derived and used to reduce the size of the set of active schedules to be searched for an optimal schedule. Lower-bound costs are estimated, and are used to bound the search. An example of the task scheduling problem and some computational experiences are presented.