Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Book cover Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manabe Y, Aoyagi S: A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling. Real-Time Systems. Vol. 14. (1998) 170–181

    Article  Google Scholar 

  2. Audsley NC, Burns A.: On fixed priority scheduling, offsets and co-prime task periods. Information Processing Letters. Vol. 67. (1998) 65–69

    Article  MathSciNet  Google Scholar 

  3. Krishna CM, Shin KG.: Real-time Systems. McGraw-Hill. (1997)

    Google Scholar 

  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–192

    Article  Google Scholar 

  5. Bampis E, Delorme C, Konig JC.: Optimal schedules for d-D grid graphs with communication delays. Parallel Computing. Vol. 24. (1998) 1653–1664

    Article  MathSciNet  Google Scholar 

  6. Campos LM, Scherson ID.: Rate of change load balancing in distributed and parallel systems. Parallel Computing. Vol. 26. (2000) 1213–1230

    Article  MATH  Google Scholar 

  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–169

    Article  Google Scholar 

  8. Deogun JS, Kieckhafer RM, Krings AW.: Stability and Performance of List Scheduling With External Process Delays. Real-Time Systems. Vol. 15. (1998) 5–38

    Article  Google Scholar 

  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–315

    Article  MathSciNet  MATH  Google Scholar 

  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–199

    Article  Google Scholar 

  11. Sadeh NM, Nakakuki Y.: Focused Simulted Annealing Search: An Application to Job Shop Scheduling. Annals of Operation Research. Vol. 60. (1996) 77–103

    Article  Google Scholar 

  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–252

    Chapter  Google Scholar 

  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. Xu J, Parnas DL.: On Satisfying Timing Constraints in Hard-Real-Time Systems. IEEE Trans. On Software Engineering. Vol. 19. (1993) 70–84

    Article  Google Scholar 

  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. 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. 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–114

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Department. Systems and Automation Division, University Miguel Hernandez, Spain

    C. Fernández

  2. Physics, Systems Engineering and Signal Theory Department, University of Alicante, Spain

    F. Torres & S. T. Puente

Authors
  1. C. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Torres
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. T. Puente
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, C., Torres, F., Puente, S.T. (2002). SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation