D. Niz, L. Abeni, S. Saewong, and R. Rajkumar, "Resource sharing in reservation-based systems," in Proc. of 22nd IEEE Real-Time Systems Symposium, Dec. 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 ....
D. de Niz, L. Abeni, S. Saewong, and R. Rajkumar. Resource sharing in reservation-based systems. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 171--180. December 2001. 19
Aperiodic Servers with Resource Constraints - Caccamo, Sha (2001) (5 citations) (Correct)
....server. Recently, in [9] an algorithm (BWI) has been presented which extends the bandwidth reservation approach to systems where tasks can share resources. This approach is particularly suited for open systems, where the time a task can spend inside a critical section cannot be easily bounded. In [14], the resource sharing problem has been investigated in the context of a reservation based system such as the Resource Kernel (RK) in particular, classical techniques based on inheritance and resource ceiling have been modi ed to correctly work in an environment based on resource reservation. ....
D. de Niz, L. Abeni, S. Saewong, and R. R. Rajkumar. \Resource sharing in reservation-based systems," Proceedings of IEEE Real-Time Systems Symposium, London. UK, 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 ....
D. de Niz, L. Abeni, S. Saewong, and R. Rajkumar. Resource sharing in reservation-based systems. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 171--180. December 2001.
Implementing Resource Reservations in Linux - Luca Abeni And (2002) Self-citation (Abeni) (Correct)
No context found.
D. de Niz, L. Abeni, S. Saewong, and R. Rajkumar. Resource sharing in reservation-based systems. In Proceedings of the IEEE Real-Time Systems Symposium, London. UK, December 2001.
Resource Sharing in Reservation-Based Systems - de Niz,, Saewong, Rajkumar.. (2001) (4 citations) Self-citation (De niz Abeni Saewong Rajkumar) (Correct)
....schedulability of the system is no different from PCP (or PCP emulation) but needs to add some ability to the server to track and switch the reserves dynamically. We refer to this scheme as the multi reserve server. Exact schedulability tests for all the proposed schemes and the proof is shown in [1]. ....
D. de Niz, L. Abeni, S. Saewong, and R. R. Rajkumar. Resource sharing in reservation-based systems. Technical report, CMU, 2001.
Protecting Resources with Resource Control Lists - Miyoshi, Rajkumar (2001) (1 citation) Self-citation (Rajkumar) (Correct)
....is not very effective. It also indicates that without reservation propagation, the resource usage of an important activity can easily be disrupted by other (potentially hostile) activities. Some of the theoretical implication on using propagation with regards to schedulability is discussed in [4]. 5.3 Applying RCLs to a Web Server In this section, we apply RCLs to provide various web server models using unmodified Apache httpd server. Web hosting services are very common today. A server may host multiple logical web servers (e.g. www.A.com and www.B.com) on the same physical machine. In ....
D. de Niz, L. Abeni, S. Saewong, and R. Rajkumar. Resource Sharing in Reservation-BasedSystems. In The 7th IEEE RealTime Technology and Applications Symposium (WiP), May 2001.
A Bandwidth Inheritance Algorithm for Real-Time Task.. - Lamastra, Lipari, Abeni (2001) (2 citations) Self-citation (Abeni) (Correct)
....SRP cannot be directly used in an Open System. For example, the CBS algorithm assumes a very simple task model (the Liu and Layland task model [14] where no task can suspend itself or block on a critical section. If tasks are allowed to suspend, inconsistencies can arise in the CBS algorithm. In [8], similar problems have been investigated in the context of a reservation based system such as the RK; in particular, the inheritance and ceiling techniques have been modi ed to correctly work in a reservation system, and one of the proposed solutions (namely, the Reserve Inheritance approach) ....
D. de Niz, L. Abeni, S. Saewong, and R. R. Rajkumar. Resource sharing in reservation-based systems. In Proceedings of the IEEE Real-Time Systems Symposium, London. UK, December 2001.
Process Group Management in Cross-Layer Adaptation - Yuan, Nahrstedt (2004) (3 citations) (Correct)
No context found.
D. Niz, L. Abeni, S. Saewong, and R. Rajkumar, "Resource sharing in reservation-based systems," in Proc. of 22nd IEEE Real-Time Systems Symposium, Dec. 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