Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors

• For resource-constrained embedded real-time systems, resource-efficient approaches are very important. Such an approach is presented in this paper, targeting systems where a critical application is partitioned on a multi-core platform and the remaining capacity on each core is provided to a noncritical application using resource reservation techniques. To exploit the potential parallelism of the non-critical application, global scheduling is used for its constituent tasks. Previously, we enabled intra-application resource sharing for such a framework, i.e. each application has its own dedicated set of resources. In this paper, we enable inter-application resource sharing, in particular between the critical application and the non-critical application. This effectively enables resource sharing in a hybrid partitioned/global scheduling framework on multiprocessors. For resource sharing, we use a spin-based synchronization protocol. We derive blocking bounds and extend existing schedulability analysis for such a system.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)

Keyword

Job shop scheduling

Processor scheduling

Program processors

Protocols

Resource management

Servers

Synchronization

Embedded systems

Factory automation

Interactive computer systems

Multiprocessing systems

Network protocols

Optimization

Real time systems

Critical applications

Embedded real time systems

Resource reservations

Schedulability analysis

Scheduling frameworks

Synchronization protocols

Scheduling

Publication and Content Type

ref (subject category)

kon (subject category)