A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers
IEEE Transactions on Computers
Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Scheduling Algorithm for Dependent Tasks
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Resource Allocation vs. Business Process Improvement: How They Impact on Each Other
BPM '08 Proceedings of the 6th International Conference on Business Process Management
| Hi-index | 0.00 |
We present a new task scheduling problem in which tasks have a non-preemptive processing time and a rigid deadline for completion. For the solution to the problem, we propose a mathematical formulation and a two-phased algorithm to minimize total transition cost between tasks. In the first phase, the algorithm generates feasible allocations satisfying the deadline constraint using dynamic programming, and then in the second phase it finds optimal solution through a matching procedure. Performance evaluation shows that the proposed algorithm has good execution time efficiency for parallel and distributed systems composed of large quantity of processors.