Buhr, P. A., Fortier, M., and Coffin, M. H. Monitor classi cation. ACM Comput. Surv. 27, 1 (Mar. 1995), 63-107. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Minimal Property for Characterizing Deadlock-Free Programs - Cholvi, Boronat (Correct)
.... execution, after the program s execution or prior to any program s execution [10] The rst approach (also called dynamic analysis) must be veri ed by monitoring the execution as it evolves [2] However and even though several ecient algorithms have been developed to detect deadlocks dynamically [4, 5], conclusions that they may draw are not about all possible executions of the program but This work is partially supported by the CICYT under grant TEL99 0582. race condition (a) Race condition. P 1 access resource acquire resource release resource release resource access resource ....
P.A. Buhr, M. Fortier, and M.H. Con. Monitor classi cation. ACM Computing Surveys, 27(1):63-107, March 1995.
Verification for Java's Reentrant Multithreading.. - Abraham-Mumm, de.. (2002) (1 citation) (Correct)
....integration for a more concrete version of Java by incorporating Java s reentrant synchronization mechanism. This requires a non trivial extension of the proof method by a more re ned mechanism for the identi cation of threads. Most papers in the literature focus on sequential subsets of Java [26, 10, 9, 24, 25, 11, 29, 1, 30, 31]. Formal semantics of Java, including multithreaded execution, and its virtual machine in terms of abstract state machines is given in [27] A structural operational semantics of multithreaded Java can be found in [12] Future work In the context of the bilateral NWO DFG project MobiJ and the ....
P. A. Buhr, M. Fortier, and M. H. Con. Monitor classi cation. ACM Computing Surveys, 27(1):63-107, Mar. 1995.
Analysis and Solution of Non-preemptive Policies for Scheduling.. - Kang, Lee (1998) (2 citations) (Correct)
....the readers writers problem. Therefore, it needs to reconsider two subproblems in the view of implementation. Usually, the reader writer lock supported in operating system or user de ned library is usually implemented with four procedures: EnterReader, EnterWriter, ExitReader and ExitWriter 6 [13, 17, 2]. Those procedures represent entrance and exit of readers and writers respectively as shown in Figure 4. Scheduling of readers and writers is done at the points executing those procedures. We de ne those points executing procedures as scheduling points and assume that they are atomic. That is, at ....
P. A. Buhr, M. Fortier, and M. H. Con. Monitor classication. ACM Comput. Surveys, 27(1):64-107, 1995.
Object-Oriented Real-Time Concurrency - Buhr, Harji, Lim, Chen Self-citation (Buhr) (Correct)
....called Figure 1: Internal Scheduling nism for synchronization, via special statements in the mutex methods to block and unblock task execution, e.g. signal and wait. As well, a monitor has an implicit scheduling mechanism to keep the monitor active, which varies depending on the kind of monitor [9]. A monitor instance is used for indirect task synchronization and communication. Much of the theoretical work on real time scheduling deals with CPU scheduling and mutual exclusion of resources protected with semaphores, with the suggestion that monitors follow directly [32, p. 16] However, ....
....on these queues are blocked. The order these three queues are considered during implicit scheduling determines the kind of monitor, where a queue can have priority less than, equal to, or greater than another queue. This semantics describes explicit and implicit scheduling in all extant monitors [9]. For example, in Java [18] the signaller queue has highest priority, and the signalled and entry queues have equal priority so the choice is arbitrary. For equal priority queues, the implementation may merge these queues, providing FIFO order across them. Not all orderings for selecting among ....
[Article contains additional citation context not shown here]
P. A. Buhr, M. Fortier, and M. H. Con. Monitor classication. ACM Comput. Surv., 27(1):63-107, Mar. 1995.
High-Level Real-Time Concurrency - Harji (2000) (Correct)
No context found.
Buhr, P. A., Fortier, M., and Coffin, M. H. Monitor classi cation. ACM Comput. Surv. 27, 1 (Mar. 1995), 63-107.
Unknown - Cation For Java's (Correct)
No context found.
P. A. Buhr, M. Fortier, and M. H. Con. Monitor classi cation. ACM Computing Surveys, 27(1):63-107, 1995.
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