In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as end-to-end release-times and deadlines. This paper describes algorithms to schedule a class of systems where all the tasks execute on different processors in turn in the same order. This end-to-end scheduling problem is known as the flow-shop problem. We present two cases where the problem is tractable and evaluate a heuristic for the NP-hard general case. We generalize the traditional flow-shop model in two directions. First, we present an algorithm for scheduling flow shops where tasks can be serviced more than once by some processors. Second, we describe a heuristic algorithm to schedule flow shops that consist of periodic tasks. Some considerations are made about scheduling systems with more than one flow shop.
|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
2168
|
Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, Layland
- 1973
|
|
804
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
640
|
ªPriority Inheritance Protocols: An Approach to Real-Time Synchronization,º
– Sha, Rajkumar, et al.
- 1990
|
|
254
|
Aperiodic Task Scheduling for Hard Real-Time Systems
– Sprunt, Sha, et al.
- 1989
|
|
239
|
On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks, Performance Evaluation 2
– Leung, Whitehead
- 1982
|
|
235
|
Sequencing and scheduling: algorithms and complexity
– Lawler, Lenstra, et al.
- 1993
|
|
211
|
Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment
– Mok
- 1993
|
|
143
|
Real-Time Communication in Multi-Hop Networks
– Kandlur, Shin, et al.
- 1994
|
|
90
|
Guaranteeing synchronous message deadlines with the timed token protocol
– Agrawal, Chen, et al.
- 1994
|
|
76
|
Real-time communication in an internetwork
– Ferrari
- 1992
|
|
70
|
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
– French
- 1982
|
|
64
|
Scheduling with deadlines and loss functions
– McNaughton
- 1959
|
|
58
|
The complexity of flowshop and jobshop scheduling
– Garey, Johnson, et al.
- 1976
|
|
56
|
PERTS: A Prototyping Environment for Real-Time Systems
– Liu, Redondo, et al.
- 1993
|
|
55
|
Two-processor scheduling with start-times and deadlines
– Garey, Johnson
- 1977
|
|
48
|
A multi-access window protocol for transmission of time constrained messages
– Zhao, Stankovic, et al.
- 1988
|
|
46
|
Algorithmic Graph Theory
– McHugh
- 1990
|
|
44
|
Performance of Real-Time Bus Scheduling Algorithms
– Lehoczky, Sha
- 1986
|
|
41
|
Mode Change Protocols for Priority-Driven Preemptive Scheduling
– Sha, Rajkumar, et al.
- 1989
|
|
39
|
Data structures and network algorithms, volume 44
– Tarjan
- 1983
|
|
34
|
Solutions for some practical problems in prioritized preemptive scheduling
– Sha, Lehoczky, et al.
- 1986
|
|
33
|
Scheduling time-critical instructions on risc machines
– Palem, Simons
- 1993
|
|
28
|
Intelligent Backtracking Techniques for Job Shop Scheduling
– Xiong, Sadeh, et al.
- 1992
|
|
27
|
Fixed priority scheduling theory for hard real-time systems,” Foundations of RealTime Computing: Scheduling and Resource Management
– Lehoczky, Sha, et al.
- 1991
|
|
26
|
Allocating and Scheduling Hard Real-Time Tasks on a Point-to-Point Distributed System
– Burns, Nicholson, et al.
|
|
26
|
Flow- shop and job-shop scheduling: Complexity and approximation
– Gonzalez, Sahni
- 1978
|
|
25
|
Scheduling unit-time tasks with arbitrary release times and deadlines
– Garey, Johnson, et al.
- 1981
|
|
22
|
Scheduling tasks with nonuniform deadlines on two processors
– Garey, Johnson
- 1976
|
|
17
|
real-time scheduling: The deadline-monotonic approach
– Hard
- 1991
|
|
16
|
Deterministic Scheduling with Pipelined Processors
– Bruno, Jones, et al.
- 1980
|
|
16
|
On some variants of the bandwidth minimization problem
– Leung, Vornberger, et al.
- 1984
|
|
15
|
Performance of Local Area Network Protocols for Hard Real-Time Applications
– Ng, Liu
- 1991
|
|
14
|
End-to-End Scheduling to Meet Deadlines
– Bettati, Liu
- 1990
|
|
12
|
A Stack-Based Allocation Policy for Realtime Processes
– Baker
- 1990
|
|
9
|
Enhanced Aperiodic Scheduling in Hard Real-Time Environments
– Lehoczky, Sha, et al.
- 1987
|
|
9
|
A Data Interactive Architecture (DIA) for Real-time Embedded multiprocessor Systems
– Simpson
- 1990
|
|
8
|
One-machine sequencing to minimize certain functions of job tardiness
– Emmons
- 1969
|
|
7
|
Pipeline scheduling: A survey
– Lawler, Lenstra, et al.
- 1987
|
|
7
|
A new performance measure for scheduling independent real-time tasks
– Peng, Shin
- 1989
|
|
7
|
Variable and Value Ordering Heuristics for Hard Constraint Satisfaction Problems: An Application to Job Shop Scheduling
– Sadeh, Fox
- 1991
|
|
6
|
Schedulability analyzer tool
– Redondo
- 1993
|
|
5
|
Multiple access protocols and time constraint communications
– Kurose, Schwartz, et al.
- 1984
|
|
5
|
Local non-preemptive scheduling policies for hard real-time distributed systems
– Woodside, Craig
- 1987
|
|
4
|
Sriskandarajah No-wait shop scheduling: Computational complexity and approximate algorithms
– Goyal, Sriskandarajah
- 1988
|
|
3
|
On flow shop scheduling with release and due dates to minimize maximum lateness
– Grabowski, Skubalska, et al.
- 1983
|
|
3
|
Real-Time Synchronization of Multiprocessors
– Rajkumar, Sha, et al.
- 1988
|
|
2
|
Job scheduling with separation constraints
– Han, Lin
- 1990
|
|
1
|
A new algorithm of solving the flow-shop problem
– Grabowski
- 1982
|
|
1
|
Improved dominance conditions for the three-machine flowshop scheduling problem
– Gupta, Reddi
- 1978
|
|
