Dynamic resource allocation for real-time priority processing applications

Abstract

Document VersionPublisher's PDF, also known as Version of Record (includes final page, issue and volume numbers)Please check the document version of this publication:• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research.• You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Constant-bandwidth supply for priority processing

“…It therefore divides the available resources within a period into fixed-sized quanta, termed time slots, and dynamically allocates these time slots to the algorithms. Strategies and mechanisms for dynamic resource allocation have been addressed in [2]. In this paper we map a priority-processing application on an embedded, reservation-based platform [3].…”

Real-time priority processing on the Cell platform

“…In [4] three mechanisms for dynamic resource allocation have been identified: preliminary termination, resource allocation, and monitoring. The first mechanism is intrinsic for priority processing, i.e.…”

“…Moreover, [4] describes how priority processing applications, implemented in MatLab/Simulink, are executed under Microsoft Windows XP on a general-purpose platform. In this paper we describe the mapping of a priority processing application on an embedded platform, i.e.…”

“…Strategies and mechanisms for dynamic resource allocation have been addressed in [3] and [4], respectively. Moreover, [4] describes how priority processing applications, implemented in MatLab/Simulink, are executed under Microsoft Windows XP on a general-purpose platform.…”

A dual-band priority assignment algorithm for dynamic QoS resource management

“…Some solutions rely on the extensive use of a real-time operating system (RTOS) that provides the basics for controlling the execution (i.e., preemptive priority-based scheduling). Over this baseline, different algorithms have been developed such as resource reservations [3], budget scheduling [4][5][6], or constant bandwidth servers [7,8]. Other solutions introduce extra intelligence over the basic primitives of an RTOS in the form of a quality of service resource manager entity (QoSRM); the QoSRM is an intermediate software level with higher abstraction management policies, such as quality level management, system wide optimization strategies for maximizing the offered output quality, high-level adaptation protocols, and mode change algorithms, and real-time reconfiguration algorithms [9].…”