منابع مشابه
An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
With the emergence of multicore processors, the research on multiprocessor real-time scheduling has caught more researchers’ attention recently. Although the topic has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks with quantum-based computation requirements and implicit deadlines, we propose a novel o...
متن کاملTechnical Report : CS - TR - 2009 - 005 An Optimal Boundary - Fair Scheduling Algorithm for Multiprocessor Real - Time Systems ∗
Although the scheduling problem for multiprocessor real-time systems has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks, we propose a novel optimal scheduling algorithm, namely boundary fair (Bfair), which follows the same line of research as the well-known Pfair scheduling algorithms and can also achi...
متن کاملFair Scheduling in an Optical Interconnection Network
Existing fair scheduling schemes have focused primarily on scheduling multiple ows to a single output. The limited work that has focused on scheduling multiple ows to multiple outputs has assumed a non-blocking, slotted-time, cell-based network with a centralized controller. This paper presents a fair scheduler suitable for use in bu erless circuit-switched blocking networks operating with dist...
متن کاملAn Optimal Discrete-Time Based Boundary Fair Scheduler for Sporadic Tasks in Multiprocessor Real-Time Systems∗
Several optimal scheduling algorithms have been studied recently for various real-time tasks running on multiprocessor systems with continuous as well as discrete time. However, the existing optimal schedulers for sporadic tasks may incur very high scheduling overhead due to either excessive number of scheduling points (e.g., for the Pfair-like scheduler) or arbitrarily small allocation for tas...
متن کاملFair Matching Algorithm: An Optimal Scheduling Algorithm for the AAPN network
The internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to perform efficient optical buffering introduces network scheduling challenges. In this technical report we focus on the problem of scheduling fixed-length frames in all-photonic star-topology networks with the goal of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2014
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-014-9201-0