Fast heuristic scheduling based on neural networks for real-time systems

Ruck Thawonmas, Goutam Chakraborty, Norio Shiratori

    Research output: Contribution to journalArticle

    3 Citations (Scopus)

    Abstract

    As most of the real-time scheduling problems are known as hard problems, approximate or heuristic scheduling approaches are extremely required for solving these problems. This paper presents a new heuristic scheduling approach based on a modified Hopfield-Tank neural network to schedule tasks with deadlines and resource requirements in a multiprocessor system. In this approach, fast heuristic scheduling is achieved by performing a heuristic scheduling policy in conjunction with backtracking on the neural network. The results from our previous work, using the same neural network architecture without backtracking, are included here as a case with zero backtracking. Extensive simulation, which includes comparison with the conventional heuristic approach, is used to validate the effectiveness of our approach.

    Original languageEnglish
    Pages (from-to)289-304
    Number of pages16
    JournalReal-Time Systems
    Volume9
    Issue number3
    Publication statusPublished - 1995 Nov

    Fingerprint

    Real time systems
    Scheduling
    Heuristics
    Neural Networks
    Backtracking
    Neural networks
    Real-time
    Scheduling Policy
    Multiprocessor Systems
    Deadline
    Network Architecture
    Network architecture
    Scheduling Problem
    Schedule
    Resources
    Requirements
    Zero
    Simulation

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Theoretical Computer Science

    Cite this

    Thawonmas, R., Chakraborty, G., & Shiratori, N. (1995). Fast heuristic scheduling based on neural networks for real-time systems. Real-Time Systems, 9(3), 289-304.

    Fast heuristic scheduling based on neural networks for real-time systems. / Thawonmas, Ruck; Chakraborty, Goutam; Shiratori, Norio.

    In: Real-Time Systems, Vol. 9, No. 3, 11.1995, p. 289-304.

    Research output: Contribution to journalArticle

    Thawonmas, R, Chakraborty, G & Shiratori, N 1995, 'Fast heuristic scheduling based on neural networks for real-time systems', Real-Time Systems, vol. 9, no. 3, pp. 289-304.
    Thawonmas R, Chakraborty G, Shiratori N. Fast heuristic scheduling based on neural networks for real-time systems. Real-Time Systems. 1995 Nov;9(3):289-304.
    Thawonmas, Ruck ; Chakraborty, Goutam ; Shiratori, Norio. / Fast heuristic scheduling based on neural networks for real-time systems. In: Real-Time Systems. 1995 ; Vol. 9, No. 3. pp. 289-304.
    @article{27f097df5b3545a8bad4b9f656a7eae1,
    title = "Fast heuristic scheduling based on neural networks for real-time systems",
    abstract = "As most of the real-time scheduling problems are known as hard problems, approximate or heuristic scheduling approaches are extremely required for solving these problems. This paper presents a new heuristic scheduling approach based on a modified Hopfield-Tank neural network to schedule tasks with deadlines and resource requirements in a multiprocessor system. In this approach, fast heuristic scheduling is achieved by performing a heuristic scheduling policy in conjunction with backtracking on the neural network. The results from our previous work, using the same neural network architecture without backtracking, are included here as a case with zero backtracking. Extensive simulation, which includes comparison with the conventional heuristic approach, is used to validate the effectiveness of our approach.",
    author = "Ruck Thawonmas and Goutam Chakraborty and Norio Shiratori",
    year = "1995",
    month = "11",
    language = "English",
    volume = "9",
    pages = "289--304",
    journal = "Real-Time Systems",
    issn = "0922-6443",
    publisher = "Springer Netherlands",
    number = "3",

    }

    TY - JOUR

    T1 - Fast heuristic scheduling based on neural networks for real-time systems

    AU - Thawonmas, Ruck

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1995/11

    Y1 - 1995/11

    N2 - As most of the real-time scheduling problems are known as hard problems, approximate or heuristic scheduling approaches are extremely required for solving these problems. This paper presents a new heuristic scheduling approach based on a modified Hopfield-Tank neural network to schedule tasks with deadlines and resource requirements in a multiprocessor system. In this approach, fast heuristic scheduling is achieved by performing a heuristic scheduling policy in conjunction with backtracking on the neural network. The results from our previous work, using the same neural network architecture without backtracking, are included here as a case with zero backtracking. Extensive simulation, which includes comparison with the conventional heuristic approach, is used to validate the effectiveness of our approach.

    AB - As most of the real-time scheduling problems are known as hard problems, approximate or heuristic scheduling approaches are extremely required for solving these problems. This paper presents a new heuristic scheduling approach based on a modified Hopfield-Tank neural network to schedule tasks with deadlines and resource requirements in a multiprocessor system. In this approach, fast heuristic scheduling is achieved by performing a heuristic scheduling policy in conjunction with backtracking on the neural network. The results from our previous work, using the same neural network architecture without backtracking, are included here as a case with zero backtracking. Extensive simulation, which includes comparison with the conventional heuristic approach, is used to validate the effectiveness of our approach.

    UR - http://www.scopus.com/inward/record.url?scp=0029410944&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0029410944&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0029410944

    VL - 9

    SP - 289

    EP - 304

    JO - Real-Time Systems

    JF - Real-Time Systems

    SN - 0922-6443

    IS - 3

    ER -