SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

  • C. Fernández
  • F. Torres
  • S. T. Puente
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


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.


Machine Vision Precedence Relation Task Graph Machine Vision System Processing Board 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Manabe Y, Aoyagi S: A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling. Real-Time Systems. Vol. 14. (1998) 170–181CrossRefGoogle Scholar
  2. 2.
    Audsley NC, Burns A.: On fixed priority scheduling, offsets and co-prime task periods. Information Processing Letters. Vol. 67. (1998) 65–69MathSciNetCrossRefGoogle Scholar
  3. 3.
    Krishna CM, Shin KG.: Real-time Systems. McGraw-Hill. (1997)Google Scholar
  4. 4.
    Donk-Ik O, Baker TP.: Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. Real-Time Systems. Vol. 15. (1998) 183–192CrossRefGoogle Scholar
  5. 5.
    Bampis E, Delorme C, Konig JC.: Optimal schedules for d-D grid graphs with communication delays. Parallel Computing. Vol. 24. (1998) 1653–1664MathSciNetCrossRefGoogle Scholar
  6. 6.
    Campos LM, Scherson ID.: Rate of change load balancing in distributed and parallel systems. Parallel Computing. Vol. 26. (2000) 1213–1230zbMATHCrossRefGoogle Scholar
  7. 7.
    Sebastián JM, Torres F, Aracil R, Reinoso O, Jiménez LM, García D.: Job-Shop Scheduling applied to Computer Vision. Proc. SPIE. Vol. 3166. (1997) 158–169CrossRefGoogle Scholar
  8. 8.
    Deogun JS, Kieckhafer RM, Krings AW.: Stability and Performance of List Scheduling With External Process Delays. Real-Time Systems. Vol. 15. (1998) 5–38CrossRefGoogle Scholar
  9. 9.
    Kyunghee C, Gihyun J, Taegeun K, Seunhum J.: Real-time scheduling algorithm for minimizing maximum weighted error with O(N logN + cN) complexity. Information Processing Letters. Vol. 67. (1998) 311–315MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Santos J, Ferro E, Orozco J, Cayssials R.: A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling. Real-Time Systems. Vol. 13. (1997) 167–199CrossRefGoogle Scholar
  11. 11.
    Sadeh NM, Nakakuki Y.: Focused Simulted Annealing Search: An Application to Job Shop Scheduling. Annals of Operation Research. Vol. 60. (1996) 77–103CrossRefGoogle Scholar
  12. 12.
    Albrecht A, Steinhofel K, Wong CK.: Distributed Simulated Annealing for Job Shop Scheduling. Schonauer et al. (eds): Parallel Problem Solving from Nature PPSN VI, Vol. 1917. Springer-Verlag (LNCS). (2000) 243–252CrossRefGoogle Scholar
  13. 13.
    Takeshi Y, Ryohei N.: Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search. Information Processing Society of Japan (IPSJ) Journal. Vol. 37. nž 04–014 (1996)Google Scholar
  14. 14.
    Xu J, Parnas DL.: On Satisfying Timing Constraints in Hard-Real-Time Systems. IEEE Trans. On Software Engineering. Vol. 19. (1993) 70–84CrossRefGoogle Scholar
  15. 15.
    Torres F.: Arquitectura paralela para el procesado de imágenes de alta resolución. Aplicación a la inspección de impresiones en tiempo real. PD, ETSII, Polytechnic University of Madrid. (1995)Google Scholar
  16. 16.
    Fernández C, Torres F, Puente ST.: SASEPA. Simultaneous allocation and scheduling with exclusion and precedence relations algorithm. Internal Report. Systems and Automation Division. Miguel Hernandez University. (2001)Google Scholar
  17. 17.
    Torres F, Candelas FA, Puente ST, Jiménez LM, Fernández C, Agulló RJ.: Computer Vision Systems-Simulation and Scheduling of Real-Time Computer Vision Algorithms. Lecture Notes in Computer Science. Vol 1542. (1999) 98–114Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • C. Fernández
    • 1
  • F. Torres
    • 2
  • S. T. Puente
    • 2
  1. 1.Engineering Department. Systems and Automation DivisionUniversity Miguel HernandezSpain
  2. 2.Physics, Systems Engineering and Signal Theory DepartmentUniversity of AlicanteSpain

Personalised recommendations