G. Lamastra, G. Lipari, and Luca Abeni. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 151--160. December 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Locking in Pfair-scheduled Multiprocessor Systems - Holman, Anderson (2002) (Correct)
....implemented using non fair scheduling algorithms (or both) and thus cannot be directly applied in fair scheduled multiprocessor systems. Indeed, synchronization issues in fair scheduled uniprocessor systems and related bandwidth preserving server schemes were first considered only very recently [10, 11, 14, 16]. In recent work [13] we demonstrated the effectiveness of lock free algorithms for implementing shared objects in fair scheduled systems. Lock free algorithms do not use semaphores to synchronize tasks. Hence, tasks never block. Blocking can be particularly problematic in fair scheduled ....
G. Lamastra, G. Lipari, and Luca Abeni. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 151--160. December 2001.
Object Sharing in Pfair-scheduled Multiprocessor Systems - Holman, Anderson (2002) (Correct)
....synchronization has been directed at uniprocessor systems, or systems implemented using non fair scheduling algorithms (or both) and thus cannot be directly applied in fair scheduled multiprocessor systems. Indeed, fair scheduled uniprocessor systems were first considered only very recently [10, 11, 14, 16]. In this paper, we consider the problem of object sharing in fair scheduled multiprocessor systems. We primarily focus on the use of lock free objects, which are implemented without critical sections or related mechanisms. However, some lock based alternatives are briefly considered as well. We ....
....time slot 4, it inherits S s parameters. W executes within the quanta allocated to S in time slots 6 and 8. Allocation inheritance. In this approach, a lock holding task inherits all quanta allocated to all tasks that it blocks. This is similar to the concept of bandwidth inheritance, discussed in [14]. The e#ectiveness of this approach in multiprocessor systems is limited by the possibility that many of the inherited quanta may be allocated in parallel. As an example, consider Fig. 3(c) Notice that W receives allocations from both S in time slot 6 and U in time slot 7. Also, notice that two ....
G. Lamastra, G. Lipari, and Luca Abeni. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 151--160. December 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC