skip to main content
research-article

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Published:06 October 2014Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle Scholar
  2. AMD. 2014. AMD embedded processors. http://www.amd.com/en-us/products/embedded.Google ScholarGoogle Scholar
  3. James Anderson and Anand Srinivasan. 2000. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-Time Systems. 35--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. Björn Andersson and Gurulingesh Raravi. 2014. Real-time scheduling with resource sharing on heterogeneous multiprocessors. Real-Time Syst. 50, 2, 270--314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Apple. 2012. Apple a5x: Dual-core cpu and quad-core GPU. http://www.apple.com/ipad/specs/.Google ScholarGoogle Scholar
  7. Sanjoy Baruah. 2004a. Partitioning real-time tasks among heterogeneous multiprocessors. In Proceedings of the 33rd International Conference on Parallel Processing. 467--474. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. Michael Dertouzos. 1974. Control robotics: The procedural control of physical processes. In Proceedings of the IFIP Congress. 807--813.Google ScholarGoogle Scholar
  11. Ellis Horowitz and Sartaj Sahni. 1976. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 2, 317--327. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle Scholar
  13. Intel. 2013b. Intel atom processor. http://ark.intel.com/products/family/29035.Google ScholarGoogle Scholar
  14. Intel. 2014. 4th generation Intel core processor (code name Haswell). https://software.intel.com/enus/haswell.Google ScholarGoogle Scholar
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. Narendra Karmakar. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 4, 373--395. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Bernhard Korte and Jens Vygen. 2006. Combinatorial Optimization: Theory and Algorithms 3rd Ed. Springer.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Jan Lenstra, David Shmoys, and Éva Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 3, 259--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. Chang L. Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 46--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Nvidia. 2013. Tegra 4 super processors. http://www.nvidia.com/object/tegra.html.Google ScholarGoogle Scholar
  22. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  23. Chris N. Potts. 1985. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discr. Appl. Math. 10, 155--164.Google ScholarGoogle ScholarCross RefCross Ref
  24. Qualcomm. 2013. Quad-core for next generation devices. http://www.qualcomm.com/snapdragon/specs.Google ScholarGoogle Scholar
  25. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  28. Samsung. 2013. Samsung Exynos processor. www.samsung.com/exynos.Google ScholarGoogle Scholar
  29. Texas Instruments. 2012. OMAP mobile processors. http://www.ti.com/omap.Google ScholarGoogle Scholar
  30. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!