Sanjoy Baruah
Abstract
Most prior theoretical research on real-time partitioning algorithms for multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks assigned to each processor does not exceed the processor's processing power. However, computing capacity is often not the only limiting resource: on many multiprocessor platforms each individual computing unit may have limited amounts of multiple additional types of resources (such as local memory) in addition to having limited processing power. We present algorithms for partitioning a collection of sporadic tasks, each characterized by a WCET, a relative deadline, and a period, upon a multiprocessor platform in a manner that is cognizant of such additional constraints as well as the processing capacity constraints.
- Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Spaccamela, A. M., and Protasi, M. 1999. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer Verlag, New York, NY. Google Scholar
Digital Library
- Baruah, S. and Fisher, N. 2004. A dynamic-programming approach to task partitioning among memory-constrained multiprocessors. In Proceedings of the International Conference on Real-time Computing Systems and Applications.Google Scholar
- Baruah, S. and Fisher, N. 2007. The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Systems: The International Journal of Time-Critical Computing 36, 3, 199--226. Google ScholarDigital Library
- Baruah, S., Mok, A., and Rosier, L. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium. 182--190.Google Scholar
- Buttazzo, G. 2005. Rate-monotonic vs. EDF: Judgement day. Real-Time Systems: The International Journal of Time-Critical Computing 29, 1, 5--26. Google ScholarDigital Library
- Chattopadhyay, B. and Baruah, S. 2011. A lookup-table driven approach to partitioned scheduling. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). Google ScholarDigital Library
- Chekuri, C. and Khanna, S. 1999. On multi-dimensional packing problems. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. 185--194. Google ScholarDigital Library
- Chekuri, C. and Khanna, S. 2004. On multidimensional packing problems. SIAM J. Comput. 33, 4, 837--851. Google ScholarDigital Library
- Dertouzos, M. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress. 807--813.Google Scholar
- Fisher, N. 2007. The multiprocessor real-time scheduling of general task systems. Ph.D. dissretation Department of Computer Science, The University of North Carolina at Chapel Hill.Google Scholar
- Fisher, N., Anderson, J., and Baruah, S. 2005. Task partitioning upon memory-constrained multiprocessors. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 416--421. Google ScholarDigital Library
- Hochbaum, D. S. and Shmoys, D. B. 1987. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM 34, 1, 144--162. Google ScholarDigital Library
- Jung, S., Shrivastava, A., and Bai, K. 2010. Dynamic code mapping for limited local memory systems. In Proceedings of the International Conference on Application-Specific Systems Architectures and Processors (ASAP). 13--20.Google Scholar
- Kalyanasundaram, B. and Pruhs, K. 2000. Speed is as powerful as clairvoyance. Journal of the ACM 37, 4, 617--643. Google ScholarDigital Library
- Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1, 46--61. Google ScholarDigital Library
- Lopez, J. M., Garcia, M., Diaz, J. L., and Garcia, D. F. 2000. Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In Proceedings of the EuroMicro Conference on Real-Time Systems. 25--34. Google ScholarDigital Library
- Mok, A. K. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. dissertation, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Tech. Rep. No. MIT/LCS/TR-297. Google ScholarDigital Library
- Oh, D.-I. and Baker, T. P. 1998. Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems: The International Journal of Time-Critical Computing 15, 183--192. Google ScholarDigital Library
Index Terms
- Partitioning sporadic task systems upon memory-constrained multiprocessors
Recommendations
Task Partitioning upon Memory-Constrained Multiprocessors
RTCSA '05: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsMost prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks assigned to each processor does not exceed the processor s processing ...
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. ...
A Norm Approach for the Partitioned EDF Scheduling of Sporadic Task Systems
ECRTS '09: Proceedings of the 2009 21st Euromicro Conference on Real-Time SystemsIn this paper, we propose a new approach for the partitioned Earliest Deadline First (EDF) scheduling of sporadic task systems. We consider the case of constrained task deadlines where the deadlines of the tasks are less than or equal to their periods. ...
Comments