Abstract
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of \(\left|R\right|\) shared resources. There are m 1 processors of type-1 and m 2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3C-vpr also meets deadlines if given processors \(2+ 3 \cdot \left\lceil \frac{|R|}{\min(m_1,m_2)}\right\rceil\) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.
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.
Similar content being viewed by others
References
AMD Inc.: The AMD Fusion Family of APUs, http://sites.amd.com/us/fusion/apu/Pages/fusion.aspx
Andersson, B., Easwaran, A.: Provably good multiprocessor scheduling with resource sharing. Real-Time System 46(2), 153–159 (2010)
Andersson, B., Easwaran, A., Lee, J.: Finding an Upper Bound on the Increase in Execution Time Due to Contention on the Memory Bus in COTS-Based Multicore Systems. In: WiP of 30th IEEE Real-Time Systems Symposium (2009)
Andersson, B., Raravi, G., Bletsas, K.: Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. In: 31st IEEE Real-Time Systems Symposium, pp. 239–248 (2010)
Baruah, S.: Task partitioning upon heterogeneous multiprocessor platforms. In: Proceedings of the 10th IEEE International Real-Time and Embedded Technology and Applications Symposium, pp. 536–543 (2004)
Baruah, S.: Partitioning real-time tasks among heterogeneous multiprocessors. In: Proc. of the 33rd International Conference on Parallel Processing (2004)
Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: IEEE Real-Time Systems Symposium (1990)
Bletsas, K.: Worst-case and Best-case Timing Analysis for Real-time Embedded Systems with Limited Parallelism. Ph.D. thesis, The University of York (2007)
Gai, P., Abeni, L., Buttazzo, G.C.: Multiprocessor DSP scheduling in system-on-a-chip architectures. In: 14th Euromicro Conference on Real-Time Systems (ECRTS 2002), Vienna, Austria, pp. 231–238 (June 2002)
Gschwind, M., Hofstee, H.P., Flachs, B., Hopkins, M., Watanabe, Y., Yamazaki, T.: Synergistic Processing in Cell’s Multicore Architecture. IEEE Micro 26(2) (2006)
IBM Corp.: The Cell Project, http://www.research.ibm.com/cell/
IEEE Spectrum: With Denver Project NVIDIA and ARM Join CPU-GPU Integration Race, http://spectrum.ieee.org/tech-talk/semiconductors/processors/with-denver-project-nvidia-and-arm-join-cpugpu-integration-race
Intel Corporation: The 2nd generation Intel Core processor family, http://www.intel.com/en_IN/consumer/products/processors/core-family.htm
Bletsas, K., Andersson, B.: Notional Processors: An Approach for Multiprocessor Scheduling. In: Proceedings of the 15th IEEE International Real-Time and Embedded Technology and Applications Symposium, pp. 3–12 (2009)
Li, Y., Suhendra, V., Liang, Y., Mitra, T., Roychoudhury, A.: Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores. In: Proceedings of the 30th IEEE Real-Time Systems Symposium, pp. 57–67 (2009)
Lv, M., Guan, N., Yi, W., Yu, G.: Combining Abstract Interpretation with Model Checking for Timing Analysis of Multicore Software. In: Proceedings of the 31st IEEE Real-Time Systems Symposium, pp. 339–349 (2010)
NVIDIA: Dell and NVIDIA Workstation Solutions, http://www.nvidia.com/object/IO_16084.html
Rajkumar, R., Sha, L., Lehoczky, J.: Real-Time Synchronization Protocols for Multiprocessors. In: 9th IEEE Real-Time Systems Symposium, pp. 259–269 (1988)
Raravi, G., Andersson, B.: Calculating an upper bound on the finishing time of a group of threads executing on a GPU: A preliminary case study. In: 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications – WiP Session, pp. 5–8 (2010)
Baruah, S.: Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms. In: 25th IEEE Real-Time Systems Symposium (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raravi, G., Andersson, B., Bletsas, K. (2011). Provably Good Scheduling of Sporadic Tasks with Resource Sharing on a Two-Type Heterogeneous Multiprocessor Platform. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds) Principles of Distributed Systems. OPODIS 2011. Lecture Notes in Computer Science, vol 7109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25873-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-25873-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25872-5
Online ISBN: 978-3-642-25873-2
eBook Packages: Computer ScienceComputer Science (R0)