Task Allocation for Maximizing Reliability of Distributed Computer Systems
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal combined task and message scheduling in distributed real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Deadline Assignment in Distributed Hard Real-Time Systems with Relaxed Locality Constraints
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Effective Compilation Support for Variable Instruction Set Architecture
Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques
Evaluation of Search Heuristics for Embedded System Scheduling Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Variable Instruction Set Architecture and Its Compiler Support
IEEE Transactions on Computers
ICC'05 Proceedings of the 9th International Conference on Circuits
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Multibody structure-and-motion segmentation by branch-and-bound model selection
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
In this paper we experimentally evaluate the performance of a parametrized branch-and-bound (B&B) algorithm for scheduling real-time tasks on a multiprocessor system. The objective of the B&B algorithm is to minimize the maximum task lateness in the system. We show that a last-in-first-out (LIFO) vertex selection rule clearly outperforms the commonly used least-lower-bound (LLB) rule for the scheduling problem. We also present a new adaptive lower-bound cost function that greatly improves the performance of the B&B algorithm when parallelism in the application cannot be fully exploited on the multiprocessor architecture. Finally, we evaluate a set of heuristic strategies, one of which generates near-optimal results with performance guarantees and another of which generates approximate results without performance guarantees.