On fixed priority scheduling, offsets and co-prime task periods
Information Processing Letters
Stability and Performance of List Scheduling With ExternalProcess Delays
Real-Time Systems
Information Processing Letters
Optimal schedules for d-D grid graphs with communication delays
Parallel Computing
Rate of change load balancing in distributed and parallel systems
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Real-Time Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Simulation and Scheduling of Real-Time Computer Vision Algorithms
ICVS '99 Proceedings of the First International Conference on Computer Vision Systems
Distributed Simulated Annealing for Job Shop Scheduling
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Static scheduling with interruption costs for computer vision applications
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Hi-index | 0.00 |
An algorithm for allocating and scheduling tasks in multiprocessor environments is presented. Its main characteristic is its orientation towards machine vision applications. In this sense it deals with the peculiarities of systems which combine generic-type processors with Image Acquisition and Processing Boards. The main goal of the algorithm is total processing time reduction; such are the requirements when we deal with automated industrial inspection applications. By simultaneously tackling the phases of allocation and scheduling, the results obtained are better than those offered by traditional algorithms. The system is applied to a process of citrus fruit inspection, and its performances are also evaluated over randomly generated task graphs.