Abstract
Process and workflow technology have traditionally not allowed for the specification of, nor run-time enforcement of, real-time requirements, despite the fact that time-to-market and other real-time constraints are more stringent than ever. Without specification of timing constraints, process designers cannot effectively reason about real-time constraints on process programs and the efficacy of their process programs in satisfying those constraints. Furthermore, without executable semantics for those timing specifications, such reasoning might not be applicable to the process as actually executed. We seek to support reasoning about the real-time requirements of software processes. In this paper, we describe work in which we have added real-time specications to a process programming language, and in which we have added deadline timers and task scheduling to enforce the real-time requirements of processes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Bandinelli, A. Fuggetta, and S. Grigolli. Process modeling in-the-large with SLANG. In Proc. of the Second Int. Conf. on the Soft. Process, pages 75–83. IEEE Computer Society Press, 1993.
L. Baresi, F. Casati, S. Castano, M. G. Fugini, I. Mirbel, and B. Pernici. WIDE workflow development methodology. In Proc. of the Int. Joint Conf. on Work Activities, Coordination, and Collaboration, 1999. San Francisco, CA.
F. Casati, S. Ceri, S. Paraboschi, and G. Pozzi. Specification and implementation of exceptions in workflow management systems. ACM Trans. on Database Systems, 24(3):405–451, Sept. 1999.
A. G. Cass, B. S. Lerner, E. K. McCall, L. J. Osterweil, and A. Wise. Logically central, physically distributed control in a process runtime environment. Technical Report 99-65, U. of Massachusetts, Dept. of Comp. Sci., Nov. 1999.
A. G. Cass, K. Ramamritham, and L. J. Osterweil. Exploiting hierarchy for planning and scheduling. Technical Report 2000-064, U. of Massachusetts, Dept. of Comp. Sci., Dec. 2000.
A. L. Liestman and R. H. Campbell. A fault-tolerant scheduling problem. IEEE Trans. on Soft. Eng., 12(11):1089-95, Nov. 1986.
J. W. Liu, K. Lin, W. Shih, A. C. Yu, J. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58–68, May 1991.
K. Ramamritham, J. A. Stankovic, and P. Shiah. Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 1(2):184–194, Apr. 1990.
A. Wise. Little-JIL 1.0 Language Report. Technical Report 98-24, U. of Massachusetts, Dept. of Comp. Sci., Apr. 1998.
A. Wise, A. G. Cass, B. S. Lerner, E. K. McCall, L. J. Osterweil, and S. M. Sutton, Jr. Using Little-JIL to coordinate agents in software engineering. In Proc. of the Automated Software Engineering Conf., Sept. 2000. Grenoble, France.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cass, A.G., Osterweil, L.J. (2001). Applying Real-Time Scheduling Techniques to Software Processes: A Position Paper. In: Ambriola, V. (eds) Software Process Technology. EWSPT 2001. Lecture Notes in Computer Science, vol 2077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45752-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-45752-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42264-8
Online ISBN: 978-3-540-45752-7
eBook Packages: Springer Book Archive