Abstract
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 algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.
- 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. 2013. AMD accelerated processing units. http://www.amd.com/fusion.Google Scholar
- James Anderson and Anand Srinivasan. 2000. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-time Systems (RTS'00). 35--43. Google Scholar
Digital Library
- Apple. 2013. 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 (ICPP'04). 467--474. Google Scholar
Digital Library
- Sanjoy Baruah. 2004b. Task partitioning upon heterogeneous multiprocessor platforms. In Proceedings of the 10th International Real-Time and Embedded Technology and Applications Symposium (RTAS'04). 536--543. Google Scholar
Digital Library
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms 2nd Ed. McGraw-Hill. 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 (IFIP'74). 807--813.Google Scholar
- Michael Garey and David Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co. Google Scholar
Digital Library
- W. A. Horn. 1974. Some simple scheduling algorithms. Naval Res. Logist. Quart. 21, 1, 177--185.Google Scholar
Cross Ref
- Ellis Horowitz and Sartaj Sahni. 1976. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 2, 317--327. Google Scholar
Digital Library
- IBM. 2013. CPLEX optimizer. http://www.ibm.com/developerworks/downloads/ws/ilogcplex/.Google Scholar
- INTEL. 2013a. Bay trail: Multicore soc family for mobile devices. http://www.intel.com/newsroom/kits/idf/2013 fall/pdfs/bay trail factsheet.pdf.Google Scholar
- INTEL. 2013b. Intel atom processor. http://ark.intel.com/products/family/75023.Google Scholar
- INTEL. 2013c. The 4th generation core i7 processors. http://ark.intel.com/products/family/75023.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 (STOC'99). 408--417. Google Scholar
Digital Library
- David Johnson. 1973. Near-optimal bin packing algorithm. Ph.D. dissertation, Department of Mathematics, MIT.Google Scholar
- Narendra Karmakar. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 4, 373--395. Google Scholar
Digital Library
- Jan Lenstra, David Shmoys, and Eva 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 (RTS'10). 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
- David Luenberger and Yinyu Ye. 2008. Linear and Nonlinear Programming 3rd Ed. International Series in Operations Research Management Science, Springer.Google Scholar
- Geoffrey Nelissen, Vandy Berten, Vincent Nelis, Joel Goossens, and Milojevic Milojevic. 2012. U-EDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks. In Proceedings of the 24th Euromicro Conference on Real-time Systems (RTS'12). 13--23. Google Scholar
Digital Library
- Nvidia. 2013. Tegra 4: Mobility at the speed of life. 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 (STOC'97). 140--149. Google Scholar
Digital Library
- Qualcomm. 2013. Snapdragon processors: All-in-one mobile processor. http://www.qualcomm.com/snapdragon.Google Scholar
- Gurulingesh Raravi, Bjorn 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, Bjorn 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 (RTS'12). 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 (RTSS'12). 117--126. Google Scholar
Digital Library
- Samsung. 2013. Exynos 5 octa processor. www.samsung.com/exynos/.Google Scholar
- Texas Instruments. 2013. OMAP applications processors. http://www.ti.com/omap.Google Scholar
- Douglas B. West. 2000. Introduction to Graph Theory 2nd Ed. Prentice Hall.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
Task Assignment Algorithms for Heterogeneous Multiprocessors
Recommendations
Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes
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 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 ...
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-...
Real-time scheduling with resource sharing on heterogeneous multiprocessors
Consider the problem of scheduling a task set of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k ...






Comments