Mohamed Bamakhrama
ABSTRACT
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to modern embedded streaming applications. This is because a modern streaming application is typically modeled as a directed graph where nodes represent actors (i.e. tasks) and edges represent data-dependencies. The actors in such graphs have data-dependency constraints and do not necessarily conform to the periodic or sporadic task models. Therefore, in this paper we investigate the applicability of hard-real-time scheduling theory for periodic tasks to streaming applications modeled as acyclic Cyclo-Static Dataflow (CSDF) graphs. In such graphs, the actors are data-dependent, however, we analytically prove that they (i.e. the actors) can be scheduled as implicit-deadline periodic tasks. As a result, a variety of hard-real-time scheduling algorithms for periodic tasks can be applied to schedule such applications with a certain guaranteed throughput. We compare the throughput resulting from such scheduling approach to the maximum achievable throughput of an application for a set of 19 real streaming applications. We find that in more than 80% of the cases, the throughput resulting from our approach is equal to the maximum achievable throughput.
- J. H. Anderson and A. Srinivasan. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proc. of ECRTS, pages 76--85, 2001. Google Scholar
Digital Library
- B. Andersson and E. Tovar. Multiprocessor Scheduling with Few Preemptions. In Proc. of RTCSA, pages 322--334, 2006. Google ScholarDigital Library
- M. Bekooij, R. Hoes, O. Moreira, P. Poplavko, M. Pastrnak, B. Mesman, J. Mol, S. Stuijk, V. Gheorghita, and J. Meerbergen. Dataflow Analysis for Real-Time Embedded Multiprocessor System Design. In Dynamic and Robust Streaming in and between Connected Consumer-Electronic Devices, volume 3, pages 81--108. Springer Netherlands, 2005.Google ScholarCross Ref
- G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. Cyclo-Static Dataflow. IEEE Transactions on Signal Processing, 44(2):397--408, 1996. Google ScholarDigital Library
- J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. Baruah. A Categorization of Real-time Multiprocessor Scheduling Problems and Algorithms. In J. Y. T. Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, 2004.Google Scholar
- H. Cho, B. Ravindran, and E. D. Jensen. T-L plane-based real-time scheduling for homogeneous multiprocessors. Journal of Parallel and Distributed Computing, 70(3):225--236, 2010. Google ScholarDigital Library
- R. I. Davis and A. Burns. A Survey of Hard Real-Time Scheduling for Multiprocessor Systems. Accepted for publication in ACM Computing Surveys. Pre-print available at: http://www-users.cs.york.ac.uk/~robdavis/papers/MPSurveyv5.0.pdf. Google ScholarDigital Library
- M. L. Dertouzos. Control Robotics: The Procedural Control of Physical Processes. In Proc. of IFIP Congress, pages 807--813, 1974.Google Scholar
- A. Gerstlauer, C. Haubelt, A. D. Pimentel, T. P. Stefanov, D. D. Gajski, and J. Teich. Electronic System-Level Synthesis Methodologies. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28(10):1517--1530, 2009. Google ScholarDigital Library
- S. Goddard. On the Management of Latency in the Synthesis of Real-Time Signal Processing Systems from Processing Graphs. PhD thesis, University of North Carolina at Chapel Hill, 1998. Google ScholarDigital Library
- K. Jeffay, D. Stanat, and C. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In Proc. of RTSS, pages 129--139, 1991.Google Scholar
- L. Karam, I. AlKamal, A. Gatherer, G. Frantz, D. Anderson, and B. Evans. Trends in multicore DSP platforms. IEEE Signal Processing Magazine, 26(6):38--49, 2009.Google ScholarCross Ref
- E. A. Lee and S. Ha. Scheduling strategies for multiprocessor real-time DSP. In Proc. of GLOBECOM, volume 2, pages 1279--1283, 1989.Google ScholarCross Ref
- E. A. Lee and D. G. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9):1235--1245, 1987.Google ScholarCross Ref
- G. Levin, S. Funk, C. Sadowski, I. Pye, and S. Brandt. DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling. In Proc. of ECRTS, pages 3--13, 2010. Google ScholarDigital Library
- J. M. López, J. L. Díaz, and D. F. García. Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems. Real-Time Systems, 28:39--68, 2004. Google ScholarDigital Library
- G. Martin. Overview of the MPSoC design challenge. In Proc. of DAC, pages 274--279, 2006. Google ScholarDigital Library
- A. Moonen, M. Bekooij, R. van den Berg, and J. van Meerbergen. Cache aware mapping of streaming applications on a multiprocessor system-on-chip. In Proc. of DATE, pages 300--305, 2008. Google ScholarDigital Library
- O. Moreira, J.-D. Mol, M. Bekooij, and J. van Meerbergen. Multiprocessor Resource Allocation for Hard-Real-Time Streaming with a Dynamic Job-Mix. In Proc. of RTAS, pages 332--341, 2005. Google ScholarDigital Library
- O. Moreira, F. Valente, and M. Bekooij. Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor. In Proc. of EMSOFT, pages 57--66, 2007. Google ScholarDigital Library
- O. M. Moreira and M. J. G. Bekooij. Self-Timed Scheduling Analysis for Real-Time Applications. EURASIP Journal on Advances in Signal Processing, 2007:1--15, 2007.Google ScholarCross Ref
- V. Nollet, D. Verkest, and H. Corporaal. A Safari Through the MPSoC Run-Time Management Jungle. Journal of Signal Processing Systems, 60:251--268, 2010. Google ScholarDigital Library
- H. Oh and S. Ha. Fractional Rate Dataflow Model for Efficient Code Synthesis. The Journal of VLSI Signal Processing, 37:41--51, 2004. Google ScholarDigital Library
- T. Parks and E. Lee. Non-preemptive real-time scheduling of dataflow systems. In Proc. of ICASSP, volume 5, pages 3235--3238, 1995.Google ScholarCross Ref
- R. Pellizzoni, P. Meredith, M.-Y. Nam, M. Sun, M. Caccamo, and L. Sha. Handling mixed-criticality in SoC-based real-time embedded systems. In Proc. of EMSOFT, pages 235--244, 2009. Google ScholarDigital Library
- S. Sriram and S. S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. CRC Press, 2nd edition, 2009. Google ScholarDigital Library
- S. Stuijk, M. Geilen, and T. Basten. SDF3: SDF For Free. In Proc. of ACSD, pages 276--278, 2006. Google ScholarDigital Library
- W. Thies and S. Amarasinghe. An empirical characterization of stream programs and its implications for language and compiler design. In Proc. of PACT, pages 365--376, 2010. Google ScholarDigital Library
Index Terms
- Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Recommendations
Managing latency in embedded streaming applications under hard-real-time scheduling
CODES+ISSS '12: Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesisIn this paper, we consider the problem of hard-real-time scheduling of embedded streaming applications, modeled using dataflow graphs, while minimizing the application latency. Recently, it has been shown that the actors in an acyclic Cyclo-Static ...
On the hard-real-time scheduling of embedded streaming applications
In this paper, we consider the problem of hard-real-time (HRT) multiprocessor scheduling of embedded streaming applications modeled as acyclic dataflow graphs. Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent ...
A Hybrid Scheduling Algorithm Based on Self-Timed and Periodic Scheduling for Embedded Streaming Applications
PDP '15: Proceedings of the 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based ProcessingIn this paper, we consider the problem of multiprocessor scheduling for safety-critical streaming applications modeled as acyclic data-flow graphs. To the best of our knowledge, most existing works have proposed periodic scheduling that ignore latency ...
Comments