Data-Flow Hard Real-Time Programs: Scheduling Processors and Communication Channels in a Distributed Environment

This work concentrates on periodic Data-Flow programs having Hard Real-Time constraints. They are represented by precedence DAGs, able to express control dependencies and communication flows among the composing nodes. A mathematical model to compute a feasible schedule is proposed, taking into account the exchanging of data between nodes using a deterministic transmission network. The model is then transformed into an optimization problem and a solution based on Simulated annealing technique is presented.

[1]  Richard Gerber,et al.  Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes , 1995, IEEE Trans. Software Eng..

[2]  Edward A. Lee,et al.  Declustering: A New Multiprocessor Scheduling Technique , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  R. B. Patil,et al.  SALO: COMBINING SIMULATED ANNEALING AND LOCAL OPTIMIZATION FOR EFFICIENT GLOBAL OPTIMIZATION , 1996 .

[4]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[5]  R. Davoli,et al.  A Schedulability Algorithm for Data Flow, Hard-Real-Time Distributed Programs , 1994 .

[6]  Lorenzo Alvisi,et al.  Parallel Computing in Networks of Workstations with Paralex , 1996, IEEE Trans. Parallel Distributed Syst..

[7]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[8]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[10]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[11]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  R. Davoli,et al.  Schedulability Checking of Data Flow Tasks in Hard-Real-Time Distributed Systems , 1994 .

[13]  L. Ingber.  Very fast simulated re-annealing , 1989 .

[14]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[15]  B. Rosen,et al.  Function Optimization Based On Advanced Simulated Annealing , 1992, Workshop on Physics and Computation.

[16]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[17]  Ted G. Lewis,et al.  Scheduling in Hard Real-Time Applications , 1995, IEEE Softw..