Partitioning sporadic task systems upon memory-constrained multiprocessors

Transactions on Embedded Computing Systems

Volumn 12, Issue 3, 2013, Pages

  Baruah, Sanjoy ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Approximation algorithm; Memory constrained systems; Multiprocessor systems; Partitioned scheduling

Indexed keywords

COMPUTING CAPACITY; INDIVIDUAL COMPUTING; MULTI PROCESSOR SYSTEMS; MULTI-PROCESSOR PLATFORMS; PROCESSING CAPACITIES; REAL-TIME PARTITIONING; SPORADIC TASK SYSTEMS; THEORETICAL RESEARCH;

APPROXIMATION ALGORITHMS;

MULTIPROCESSING SYSTEMS;

EID: 84878490262     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/2442116.2442128     Document Type: Article

References (18)

1. 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.
2. BARUAH, S. AND FISHER, N. 2004. A dynamic-programming approach to task partitioning among memoryconstrained multiprocessors. In Proceedings of the International Conference on Real-time Computing Systems and Applications
3. 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.
4. 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.
5. BUTTAZZO, G. 2005. Rate-monotonic vs. EDF: Judgement day. Real-Time Systems: The International Journal of Time-Critical Computing 29, 1, 5-26.
6. 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).
7. 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.
8. CHEKURI, C. AND KHANNA, S. 2004. On multidimensional packing problems. SIAM J. Comput. 33, 4, 837-851.
9. DERTOUZOS, M. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress. 807-813.
10. 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.
11. 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.
12. 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.
13. 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.
14. KALYANASUNDARAM, B. AND PRUHS, K. 2000. Speed is as powerful as clairvoyance. Journal of the ACM 37, 4, 617-643.
15. LIU, C. AND LAYLAND, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1, 46-61.
16. 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.
17. 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.
18. 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.