M. Hohmuth and H. H artig. Pragmatic nonblocking synchronization for real-time systems. In 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Atomic Instructions in Java - Hovemeyer, Pugh, Spacco (2002) (4 citations) (Correct)
.... swap instructions yields better scalability on a large multiprocessor than a queue implemented with lock based synchronization. 1 Introduction Wait free data structures and algorithms have been an active area of research in recent years[3, 6, 12, 18] and have spawned a variety of applications[4, 8, 9]. They have the desirable property that when multiple threads access a waitfree data structure, stalled threads cannot prevent other threads from making progress. This avoids a variety of problems encountered with lock based (blocking) synchronization, such as priority inversion and formation of ....
....A variety of applications have been implemented using wait free algorithms and data structures. For example, because wait free data structures do not block, they are ideal for communication between execution contexts that run at di#erent priorities. This makes them useful for operating systems [8, 9], where high priority system threads (such as interrupt handlers) may need to access data structures that are also accessed by low priority threads. A wait free double ended queue has also been used successfully in a work stealing parallel fork join framework[4] Ad hoc implementations of atomic ....
[Article contains additional citation context not shown here]
Michael Hohmuth and Hermann Hartig. Pragmatic Nonblocking Synchronization for Real-Time Systems. In Proceedings of the USENIX Annual Technical Conference, pages 217--230, 2001.
Extended Abstract: Applying source-code verification to a .. - Hohmuth, Tews, Stephens (2002) (Correct)
....store that is based on a hardware model that closely resembles the IA32 virtual memory architecture, and on guarantees provided by the kernel itself. 1 Introduction The VFiasco project aims at the mechanical verification of security relevant properties of the L4 compatible Fiasco microkernel [3]. The goal of the project is an operating system kernel that provides verified security guarantees. Such a kernel could be used as a basis for building applications with high level security requirements. Verification is a very expensive process (both in man power and time) for success it is ....
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) Self-citation (Hohmuth) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) Self-citation (Hohmuth) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) Self-citation (Hohmuth) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) Self-citation (Hohmuth) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
Robust Non-Classical Embedded Real-Time Systems - Härtig Self-citation (Hartig) (Correct)
....memory. The main abstractions are threads and data spaces. An important property of the basic resource 2 management is that it is a resource manager with the ability of mandatory and optional reservation. More details and a list of conference publication on DROPS are available on our Web Pages. [5, 3, 4, 8, 7, 6] 2.2 Security Architecture For a platform with much stricter security requirements, the DROPS architecture is not sufficient. Rather, a careful implementation of a small secure platform (to avoid the infected term of a trusted computing base) is needed that enforces separation of secure and ....
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
Cost and Benefit of Separate Address Spaces in Real-Time .. - Mehnert, Hohmuth, Härtig (2002) (5 citations) Self-citation (Hohmuth Artig) (Correct)
....[23] It is not clear to us which level of fault tolerance this architecture provides. We have not considered these separate space systems because no comparable shared space system exists and because we did not have access to their source code. Instead, we used the Fiasco real time microkernel [9] and L [6] a user level Linux operating system server that runs on top of the Fiasco microkernel. There are several systems with a design similar to our Linux. User mode Linux [25] Linux a386 [14] and MkLinux [4] are ports of the Linux kernel to user mode that run on top of various ....
....Fiasco microkernel as its base. The Fiasco microkernel is a fully preemptible real time kernel supporting static priorities. It uses non blocking synchronization for its kernel objects. This ensures that runnable high priority threads never block waiting for lower priority threads or the kernel [9]. For time sharing applications, DROPS comes with Linux, a Linux server that runs as an application program on top of the Fiasco microkernel [6] L Linux supports standard, unmodified Linux programs. We have modified app Linux app Dynamic load module L4Linux server RT task RT library ....
M. Hohmuth and H. H artig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
Applying source-code verification to a microkernel - The.. - Hohmuth, Tews, Stephens (2002) (12 citations) Self-citation (Hohmuth) (Correct)
....object store is based on a hardware model that closely resembles the IA32 virtual memory architecture, and on guarantees provided by the kernel itself. 1 Introduction The VFiasco project aims at the mechanical verification of security relevant properties of the L4 compatible Fiasco microkernel [12]. The goal of the project is an operating system kernel that provides verified security guarantees. Such a kernel could be used as a basis for building applications with high level security requirements. Verification is very expensive (both in man power and time) for success it is crucial to ....
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
Helping in a Multiprocessor Environment - Hohmuth, Peter (2001) Self-citation (Hohmuth) (Correct)
....CPU time donation scheme known as locking with helping. Helping occurs when a thread A wants to lock an object that is already locked by another thread B. Instead of blocking, A donates time to B, helping it to finish its critical section. Helping is an implementation of priority inheritance. In [1], we described an efficient implementation of locking with helping for uniprocessor systems. However, we only hinted on how to extend helping for a multiprocessor environment. Indeed, there are a number of interesting problems: Where should thread manipulating locked operations execute on the ....
M. Hohmuth and H. H artig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
RTLinux with Address Spaces - Mehnert, Hohmuth, Schönberg, Härtig (2001) (2 citations) Self-citation (Hohmuth Hartig) (Correct)
....the Fiasco microkernel as its base. The Fiasco microkernel is a fully preemptible realtime kernel supporting hard priorities. It uses nonblocking synchronization for its kernel objects. This ensures that runnable high priority threads never block waiting for lower priority threads or the kernel [5]. For time sharing applications, Drops comes with L 4 Linux, a Linux server that runs as an application program on top of the Fiasco microkernel [3] L 4 Linux supports standard, unmodified Linux programs (binary compatibility) The Linux server never disables interrupts for synchronization ....
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
Real-Time Programming and L4 Microkernels - Sergio Ruocco National (Correct)
No context found.
M. Hohmuth and H. H artig. Pragmatic nonblocking synchronization for real-time systems. In 2001.
An Almost Non-Blocking Stack - Boehm (2004) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In Proceedings of the 2001.
Theorem Proving in Higher Order Logics - Basin, (eds.) (2003) (Correct)
No context found.
M. Hohmuth and H. Hartig. Pragmatic nonblocking synchronization for real-time systems. In USENIX Annual Technical Conference, Boston, MA, June 2001.
An I/O Architecture for Microkernel-Based Operating.. - Haertig, Loeser.. (2003) (Correct)
No context found.
Michael Hohmuth. Pragmatic nonblocking synchronization for real-time systems. PhD thesis, TU Dresden, Fakult at Informatik, September 2002.
Connecting Real-Time and Non-Real-Time - Components Martin Pohlack (Correct)
No context found.
M. Hohmuth. Pragmatic nonblocking synchronization for real-time systems. PhD thesis, TU Dresden, Fakultt Informatik, Sept. 2002.
Towards Scalable Multiprocessor Virtual Machines - Uhlig, LeVasseur, Skoglund.. (2004) (1 citation) (Correct)
No context found.
Michael Hohmuth and Hermann Hartig. Pragmatic nonblocking synchronization for Real-Time systems. In Proc. of the 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