Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of systems integration 9 (1999), S. 207-222 
    ISSN: 1573-8787
    Keywords: Validation ; Schedulability Analysis ; Distributed Real-Time Systems ; Heterogeneous Systems ; Dynamic Systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1573-1383
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we investigate the problem of scheduling soft aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the response time of every aperiodic request and guarantee that the deadlines of the periodic tasks are met when the periodic tasks are scheduled on a fixed-priority, preemptive basis. We then develop two algorithms: Algorithm $$\mathcal{L}$$ is locally optimal in that it minimizes the response time of the aperiodic request at the head of the aperiodic service queue. Algorithm $$\mathcal{G}$$ is globally optimal in that it completes the current backlog of work in the aperiodic service queue as early as possible.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Real-time systems 16 (1999), S. 155-185 
    ISSN: 1573-1383
    Keywords: open-system ; real-time application ; two-level scheduler
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper describes an open system architecture that allows independently developed hard real-time applications to run together and supports their reconfiguration at run-time. In the open system, each real-time application is executed by a server. At the lower level, the OS scheduler schedules all the servers on the EDF basis. At the upper level, the server scheduler of each server schedules the ready jobs of the application executed by the server according to the algorithm chosen for the application. The paper describes the two-level CPU scheduling scheme used by the open system and the design and implementation of a uniprocessor open system within the framework of the Windows NT operating system. The implementation consists of three key components: the two-level hierarchical kernel scheduler, common system service providers, and real-time application programming interface.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...