Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Task Partitioning Upon Heterogeneous Multiprocessor Platforms
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Partitioning Real-Time Tasks among Heterogeneous Multiprocessors
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Sporadic Multiprocessor Scheduling with Few Preemptions
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Task assignment algorithms for two-type heterogeneous multiprocessors
Real-Time Systems
Hi-index | 0.00 |
Consider the problem of partitioned scheduling of an implicit-deadline sporadic task set on heterogeneous multiprocessors to meet all deadlines. Each processor is either of type-1 or type-2. We present a new algorithm, FF-3C, for this problem. FF-3C offers low time-complexity and provably good performance. Specifically, FF-3C offers (i) a time-complexity of O(n驴max(m,logn)+m驴logm), where n is the number of tasks and m is the number of processors and (ii) the guarantee that if a task set can be scheduled by an optimal partitioned-scheduling algorithm to meet all deadlines then FF-3C meets all deadlines as well if given processors at most $\frac{1}{1-\alpha}$ times as fast (referred to as speed competitive ratio) and tasks are scheduled using EDF; where 驴 is a property of the task set. The parameter 驴 is in the range (0,0.5] and for each task, it holds that its utilization is no greater than 驴 or greater than 1驴驴 on each processor type. Thus, the speed competitive ratio of FF-3C can never exceed 2.We also present several extensions to FF-3C; these offer the same performance guarantee and time-complexity but with improved average-case performance. Via simulations, we compare the performance of our new algorithms and two state-of-the-art algorithms (and variations of the latter). We evaluate algorithms based on (i) running time and (ii) the necessary multiplication factor, i.e., the amount of extra speed of processors that the algorithm needs, for a given task set, so as to succeed, compared to an optimal task assignment algorithm. Overall, we observed that our new algorithms perform significantly better than the state-of-the-art. We also observed that our algorithms perform much better in practice, i.e., the necessary multiplication factor of the algorithms is much smaller than their speed competitive ratio. Finally, we also present a clustered version of the new algorithm.