Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Partitioned scheduling"”.

  1. Resource-Efficient Scheduling Of Multiprocessor Mixed-Criticality Real-Time Systems

    … This dissertation focuses on resource-efficient scheduling techniques for mixed-criticality systems on multiprocessor platforms. While Mixed-Criticality (MC) scheduling has been extensively studied on uniprocessor plat- forms, the problem on multiprocessor platforms has been largely open. …

    penn Repository record for Resource-Efficient Scheduling Of Multiprocessor Mixed-Criticality Real-Time Systems (opens in a new tab)

  2. Federated Scheduling of Mixed-Criticality Sporadic DAG Tasks on Uniform Multiprocessors

    … scheduler is designed based on the federated scheduling paradigm. Tasks are categorized into heavy and light tasks according to their utilization. Each heavy task exclusively executes on a number of dedicated processors (cluster). Light tasks are treated as sequential tasks and share the …

    chalmers Repository record for Federated Scheduling of Mixed-Criticality Sporadic DAG Tasks on Uniform Multiprocessors (opens in a new tab)

  3. Multiprocessor Scheduling of Mixed-Criticality Parallel Systems

    … has been an increasing research interest in scheduling mixed-criticality (MC) systems. However, most existing efforts have concentrated on scheduling sequential mixed-criticality tasks and ignored intra-task parallelism. As MC systems are increasingly being implemented on multiprocessor …

    nebraska Repository record for Multiprocessor Scheduling of Mixed-Criticality Parallel Systems (opens in a new tab)

  4. Approximation algorithms for task allocation with QoS and energy considerations

    … aggregate QoS? Such questions apply to the partitioned scheduling of real-time tasks on multiprocessors and to other resource allocation problems. The basic questions are NP-Hard, and we present polynomial time approximation algorithms for certain special, but practical, cases. We make …

    ubc Repository record for Approximation algorithms for task allocation with QoS and energy considerations (opens in a new tab) Download PDF for Approximation algorithms for task allocation with QoS and energy considerations (opens in a new tab)

  5. Network flow optimization for distributed clouds

    … multiple performance requirements and temporally partitioned scheduling for scalability.

    uiuc Repository record for Network flow optimization for distributed clouds (opens in a new tab)

  6. Using Imprecise Computing for Improved Real-Time Scheduling

    Conventional hard real-time scheduling is often overly pessimistic due to the worst case execution time estimation. The pessimism can be mitigated by exploiting imprecise computing in applications where occasional small errors are acceptable. This leverage is investigated in a few previous works, …

    tamu Repository record for Using Imprecise Computing for Improved Real-Time Scheduling (opens in a new tab)

  7. Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling

    … implementation on multicore architectures with partitioned fixed-priority scheduling. In this thesis, we propose to judiciously assign task offset, task priority, and task communication mechanism, to avoid simultaneous access to shared memory by tasks on different cores, to preserve the model …

    vt Repository record for Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling (opens in a new tab)

  8. On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

    We consider the problem of scheduling real-time tasks on a multiprocessor system. Our primary focus is scheduling on multiprocessor systems where the total task utilization demand, U, is greater than m, the number of processors on a multiprocessor system---i.e., the total available processing …

    vt Repository record for On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors (opens in a new tab)