Abstract
We consider the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a supertask, which is then scheduled as an ordinary Pfair task. Whenever a supertask is scheduled, its processor time is allocated to its component tasks according to an internal scheduling algorithm. Hence, supertasking is an example of hierarchal (or group-based) scheduling.
In this paper, we present a generalized framework for “reweighting” supertasks. The goal of reweighting is to assign a fraction of a processor to a given supertask so that all timing requirements of its component tasks are met. We consider the use of both fully preemptive and quantum-based scheduling within a supertask.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abeni, L. and Buttazzo, G. 1998. Integrating multimedia applications in hard real-time systems. In Proceedings of the 19th IEEE Real-time Systems Symposium.
Anderson, J. and Srinivasan, A. 2000. Pfair scheduling: Beyond periodic task systems. In Proceedings of the Seventh International Conference on Real-time Computing Systems and Applications, pp. 297–306.
Anderson, J. and Srinivasan, A. 2001. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proceedings of the 13th Euromicro Conference on Real-time Systems, pp. 76–85.
Baruah, S. Cohen, N., Plaxton, C.G., and Varvel, D. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15: 600–625.
Baruah, S., Gehrke, J., and Plaxton, C.G. 1995. Fast scheduling of periodic tasks on multiple resources. In Proceedings of the 9th International Parallel Processing Symposium, pp. 280–288.
Bollella G. et al. 2000. The Real-time Specification for Java. Addison Wesley.
Caccamo, M. and Sha, L. 2001. Aperiodic servers with resource constraints. In Proceedings of the 22nd IEEE Real-time Systems Symposium, pp. 161–170.
Feng, X. and Mok, A. 2002. A model of hierarchical real-time virtual resources. In Proceedings of the 23rd IEEE Real-time Systems Symposium, pp. 26–35.
Holman, P. 2004. On the implementation of Pfair-scheduled multiprocessor systems, Ph.D. Thesis, University of North Carolina at Chapel Hill.
Holman, P. and Anderson, J. 2001. Guaranteeing Pfair supertasks by reweighting. In Proceedings of the 22nd IEEE Real-time Systems Symposium, pp. 203–212.
Holman, P. and Anderson, J. 2002. Object sharing in Pfair-scheduled multiprocessor systems. In Proceedings of the 14th Euromicro Conference on Real-time Systems, pp. 111–120.
Holman, P. and Anderson, J. 2002. Locking in Pfair-scheduled multiprocessor systems. In Proceedings of the 23rd IEEE Real-time Systems Symposium, pp. 149–158.
Holman, P. and Anderson, J. 2003. Using hierarchal scheduling to improve resource utilization in multiprocessor real-time systems. In Proceedings of the 15th Euromicro Conference on Real-time Systems, pp. 41–50.
Lamastra, G., Lipari, G., and Abeni, L. 2001. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proceedings of the 22nd IEEE Real-time Systems Symposium, pp. 151–160.
Lipari, G. and Bini, E. 2003. Resource partitioning among real-time applications. In Proceedings of the 15th Euromicro Conference on Real-time Systems, pp. 35–43.
Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real–time environment. Journal of the ACM 30: 46–61.
Moir, M. and Ramamurthy, S. 1999. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In Proceedings of the Twentieth IEEE Real-time Systems Symposium, pp. 294–303.
Mok, A. 1983. Fundamental design problems for the hard real-time environment, Ph.D. Thesis, Massachussetts Institute of Technology.
Mok, A. and Feng, X. 2001. Towards compositionality in real-time resource partitioning based on regularity bounds. In Proceedings of the 22nd IEEE Real-time Systems Symposium, pp. 128–138.
Mok, A., Feng, X., and Chen, D. 2001. Resource partition for real-time systems. In Proceedings of the Real-time Technology and Applications Symposium, pp. 75–84.
Shin I. and Lee, I. 2003. Periodic resource model for compositional real-time guarantees. In Proceedings of the 24th IEEE Real-time Systems Symposium, pp. 2–13.
Srinivasan A. and Anderson, J. 2003. Efficient scheduling of soft real-time applications on multiprocessors. In Proceedings of the 15th Euromicro Conference on Real-time Systems, pp. 51–59.
Tucker, A. and Gupta, A. 1989. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, pp. 159–166.
Author information
Authors and Affiliations
Corresponding author
Additional information
Work supported by NSF grants CCR 9732916, CCR 9972211, CCR 9988327, ITR 0082866, CCR 0204312, and CCR 0309825. Preliminary versions of some content appeared previously in (Holman and Anderson, 2001, 2003).
Rights and permissions
About this article
Cite this article
Holman, P., Anderson, J.H. Group-Based Pfair Scheduling. Real-Time Syst 32, 125–168 (2006). https://doi.org/10.1007/s11241-006-4687-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-006-4687-8