Abstract
Data Flow is a natural paradigm representing distributed programs able to express data and control dependencies between composing nodes. Our work concentrates on periodic Data-Flow programs having Hard Real-Time constraints. We propose a model and a stringbased representation for a relevant class of Data-Flow programs and present a two-phase algorithm able to compute a schedule for a given set of programs to be executed. The first phase computes a feasible solution (mapping and time assignments) using a Simulated Annealing technique, the second phase takes the mapping as input and computes the optimal solution, in terms of resource allocation, using a recursive descent Quasi-Newton method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Davoli, R., Giachini, L.A., Babaoglu, O., Amoroso, A., Alvisi, L.: Parallel Computing in Networks of Workstations with Paralex. IEEE Transactions on Parallel and Distributed Systems 7(4) (1996) 371–384
Davoli, R., Giachini, L.A.: Schedulability checking of Data-Flow Tasks in Hard Real-Time Distributed Systems. UBLCS Technical Report Series 94-4 (1994)
Davoli, R., Giachini, L.A.: A Schedulability Algorithm for Data Flow Hard-Real-Time Distributed Programs. Proc. IFAC Real Time Programming, Lake Constance, (1994) 39–43
Ferrari, D., Verma, D.C.: A scheme for Real-Time Channel establishment in Wide Area Networks. IEEE Journal of Selected Areas in Communications 8(3) (1990) 368–379
Fletcher, R.: Practical methods of optimization. J. Wiley and Sons (1986)
Gerber, R., Hong, S., Sakena, M.: Guaranteeing Real-Time Requirements With Resource Calibration of Periodic Processes. IEEE Trans. on Software Engineering 21(7) (1995) 579–592
Ingber, L.: Very Fast Simulated Re-Annealing. Mathl. Comput. Modelling 12(8) (1989) 967–973
Ingber, L.: Adaptive Simulated Annealing. Technical Report, Lester Ingber Research, McLean, VA (1993)
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in Hard-Real Time environment. Journal of ACM 20(1) (1973) 46–61
Martinez, J.M.: Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations. Journal of Computational and Applied Mathematics 34 (1991)
McNaughton, R.: Scheduling with Deadline and loss Functions. Management Science 6(1) (1969) 1–12
Mok, A.K.: Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. PhD Thesis, Dept. of Electrical Engeneering and Computer Science, MIT Cambridge-Mass. (1983)
Muntz, R.R., Coffman, E.G. Jr: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems. Journal of the ACM 17(2) (1970) 324–338
El-Rewini, H., Lewis, T.G.: Scheduling Parallel Program Tasks onto Arbitrary Target Machines. Journal of Parallel and Distributed Computing 9 (1990) 138–153
Rosen, B.: Function Optimization based on Advanced Simulated Annealing. IEEE Workshop on Physics and Computation — PhysComp 92 (1992) 289–293
Sih, G.C., Lee, E.A.: Declustering: A New Multiprocessing Scheduling Technique. IEEE Transaction on Parallel and Distributed Systems 4(6) (1993) 625–637
Sih, G.C., Lee, E.A.: A Compile Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Transaction on Parallel and Distributed Systems 4(2) (1993) 175–187
Stankovic, J.A., Spuri, M., Di Natale, M., Buttazzo, G.C.: Implications of Classical Scheduling Results for Real-Time Systems. IEEE Computer 28(6) (1995) 16–25
Stollnitz, E.J., DeRose, T.D., Salesin, D.H.: Wavelets for Computer Graphics: A Primer. IEEE Computer Graphics and Application (1995) 76–84
Tindell, K., Burns, A., Wellings, A.: Allocating Hard Real Time Tasks (An NP-Hard Problem Made Easy). Journal of Real-Time Systems 4(2) (1992) 145–165
Whao, W., Ramamritham, K., Stankovic, J.A.: Scheduling Tasks with Resource Requirements in Hard Real-Time Systems. IEEE Trans. on Software Engineering 13(5) (1987) 564–577
Zhu, J., Lewis, T., Jackson, W., Wilson, R.: Scheduling In Hard Real-Time Applications. IEEE Software 12(3) (1995) 54–63
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davoli, R., Tamburini, F., Giachini, L.A. (1996). Scheduling Data Flow programs in Hard Real-Time environments. In: Jonsson, B., Parrow, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1996. Lecture Notes in Computer Science, vol 1135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61648-9_45
Download citation
DOI: https://doi.org/10.1007/3-540-61648-9_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61648-1
Online ISBN: 978-3-540-70653-3
eBook Packages: Springer Book Archive