Abstract
Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.
- Jonah Alben. 2013. NVIDIA brings Kepler, world's most advanced graphics architecture, to mobile devices. http://blogs.nvidia.com/blog/2013/07/24/kepler-to-mobile/.Google Scholar
- AMD. 2014. AMD embedded processors. http://www.amd.com/en-us/products/embedded.Google Scholar
- James Anderson and Anand Srinivasan. 2000. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-Time Systems. 35--43. Google Scholar
Digital Library
- Björn Andersson and Konstantinos Bletsas. 2008. Sporadic multiprocessor scheduling with few preemptions. In Proceedings of the 20th Euromicro Conference on Real-Time Systems. 243--252. Google Scholar
Digital Library
- Björn Andersson and Gurulingesh Raravi. 2014. Real-time scheduling with resource sharing on heterogeneous multiprocessors. Real-Time Syst. 50, 2, 270--314. Google Scholar
Digital Library
- Apple. 2012. Apple a5x: Dual-core cpu and quad-core GPU. http://www.apple.com/ipad/specs/.Google Scholar
- Sanjoy Baruah. 2004a. Partitioning real-time tasks among heterogeneous multiprocessors. In Proceedings of the 33rd International Conference on Parallel Processing. 467--474. Google Scholar
Digital Library
- Sanjoy Baruah. 2004b. Task partitioning upon heterogeneous multiprocessor platforms. In Proceedings of the 10th IEEE International Real-Time and Embedded Technology and Applications Symposium. 536--543. Google Scholar
Digital Library
- Jose Correa, Martin Skutella, and Jose Verschae. 2012. The power of preemption on unrelated machines and applications to scheduling orders. Math. Oper. Res. 37, 2, 379--398. Google Scholar
Digital Library
- Michael Dertouzos. 1974. Control robotics: The procedural control of physical processes. In Proceedings of the IFIP Congress. 807--813.Google Scholar
- Ellis Horowitz and Sartaj Sahni. 1976. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 2, 317--327. Google Scholar
Digital Library
- Intel. 2013a. Bay trail: Multicore SOC family for mobile devices. http://www.intel.com/newsroom/kits/idf/2013fall/pdfs/bay trail fact sheet.pdf.Google Scholar
- Intel. 2013b. Intel atom processor. http://ark.intel.com/products/family/29035.Google Scholar
- Intel. 2014. 4th generation Intel core processor (code name Haswell). https://software.intel.com/enus/haswell.Google Scholar
- Klaus Jansen and Lorant Porkolab. 1999. Improved approximation schemes for scheduling unrelated parallel machines. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing. 408--417. Google Scholar
Digital Library
- Narendra Karmakar. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 4, 373--395. Google Scholar
Digital Library
- Bernhard Korte and Jens Vygen. 2006. Combinatorial Optimization: Theory and Algorithms 3rd Ed. Springer.Google Scholar
Digital Library
- Jan Lenstra, David Shmoys, and Éva Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 3, 259--271. Google Scholar
Digital Library
- Greg Levin, Shelby Funk, Caitlin Sadowskin, Ian Pye, and Scott Brandt. 2010. DP-FAIR: A simple model for understanding optimal multiprocessor scheduling. In Proceedings of the 22nd Euromicro Conference on Real-Time Systems. 3--13. Google Scholar
Digital Library
- Chang L. Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 46--61. Google Scholar
Digital Library
- Nvidia. 2013. Tegra 4 super processors. http://www.nvidia.com/object/tegra.html.Google Scholar
- Cynthia A. Phillips, Cliff Stein, Eric Torng, and Joel Wein. 1997. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th ACM Symposium on Theory of Computing. Google Scholar
Digital Library
- Chris N. Potts. 1985. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discr. Appl. Math. 10, 155--164.Google Scholar
Cross Ref
- Qualcomm. 2013. Quad-core for next generation devices. http://www.qualcomm.com/snapdragon/specs.Google Scholar
- Gurulingesh Raravi, Björn Andersson, and Konstantinos Bletsas. 2013. Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. Real-Time Syst. 49, 1, 29--72. Google Scholar
Digital Library
- Gurulingesh Raravi, Björn Andersson, Konstantinos Bletsas, and Vincent Nelis. 2012. Task assignment algorithms for two-type heterogeneous multiprocessors. In Proceedings of the 24th Euromicro Conference on Real-Time Systems. 34--43. Google Scholar
Digital Library
- Gurulingesh Raravi and Vincent Nelis. 2012. A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors. In Proceedings of the 33rd IEEE Real-Time Systems Symposium. 117--126. Google Scholar
Digital Library
- Samsung. 2013. Samsung Exynos processor. www.samsung.com/exynos.Google Scholar
- Texas Instruments. 2012. OMAP mobile processors. http://www.ti.com/omap.Google Scholar
- Andreas Wiese, Vincenzo Bonifaci, and Sanjoy Baruah. 2013. Partitioned EDF scheduling on a few types of unrelated multiprocessors. Real-Time Syst. 49, 2, 219--238. Google Scholar
Digital Library
Index Terms
Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes
Recommendations
Task Assignment Algorithms for Heterogeneous Multiprocessors
Special Issue on Risk and Trust in Embedded Critical Systems, Special Issue on Real-Time, Embedded and Cyber-Physical Systems, Special Issue on Virtual Prototyping of Parallel and Embedded Systems (ViPES)Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two ...
Task assignment algorithms for two-type heterogeneous multiprocessors
Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors--such a platform is referred to as two-type platform . We present two low degree polynomial time-...
A PTAS for Assigning Sporadic Tasks on Two-type Heterogeneous Multiprocessors
RTSS '12: Proceedings of the 2012 IEEE 33rd Real-Time Systems SymposiumConsider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomial-time approximation ...






Comments