Restrict to: Header Title Order by: Expected citations Hubs Usage Date Try: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
627 documents found. Only retrieving 500 documents (System busy - maximum reduced).
Retrieving documents...
Order: number of citations.
Applying New Scheduling Theory to Static Priority.. - Audsley, Burns.. (1993)
(Correct) (148 citations)
of computation C i ,and to lock and unlock semaphores from a bounded set s (i )according to the
internal blocking is assumed to be the result of semaphore use (other synchronisation primitives also
section of lower priority tasks accessing semaphores with ceilings higher than (or equal to) the
ftp.cs.york.ac.uk/pub/realtime/papers/SEJ_sep_93.ps.Z
Eraser: A Dynamic Data Race Detector for.. - Savage, Burrows.. (1997)
(Correct) (135 citations)
and unlock(mu)Thus it is essentially a binary semaphore used for mutual exclusion, but differs from a
used for mutual exclusion, but differs from a semaphore in that only the owner of a lock is allowed to
The most common example is the use of semaphores to synchronize execution between a thread and
www.cs.washington.edu/homes/savage/papers/Tocs97.pdf
Eraser: A Dynamic Data Race Detector for.. - Savage, Burrows.. (1997)
(Correct) (135 citations)
and unlock(mu)Thus it is essentially a binary semaphore used for mutual exclusion, but differs from a
used for mutual exclusion, but differs from a semaphore in that only the owner of a lock is allowed to
The most common example is the use of semaphores to synchronize execution between a thread and
www.cs.washington.edu/homes/savage/papers/sosp97.ps
Basic Techniques for the Efficient Coordination of.. - Gottlieb.. (1981)
(Correct) (80 citations)
then use the replace-add operation to implement semaphores (section 3) and to solve the readers/writers
A presents a proof of correctness for our semaphore implementation. 2. Computational Model The
contains 13, which 16, and which 19. 3. Semaphores Having reviewed the basic replace-add
ftp.nyu.edu/pub/ultra/ucn/001-050/ucn16.ps.Z
On Interprocess Communication - Lamport (1985)
(Correct) (66 citations)
"conventional" synchronization mechanism (e.g. a semaphore) for a multiprocessor system. A more exciting
language may provide a P operation to a semaphore as an atomic operation, but this operation must
Viewed at the machine-language level, the semaphore operation is not atomic. Moreover, the
www.research.digital.com/SRC/personal/lamport/pubs/interprocess.ps.Z
A Lock-Free Multiprocessor OS Kernel - Massalin, Pu (1991)
(Correct) (58 citations)
implemented as spinlocks or waiting semaphores. We have implemented a complete multiprocessor
lock-based synchronization (e.g.spin-locks and semaphores)such as Mach [3] and Psyche [11]The version
than other synchronization mechanisms such as semaphores, its use is widespread. For example, 112 of the
www.cs.columbia.edu/~library/TR-repository/reports/reports-1991/cucs-005-91.ps.gz
Efficient Synchronization on Multiprocessors with Shared.. - Kruskal, Rudolph, Snir (1986)
(Correct) (56 citations)
and synchronization. Constructs such as the semaphore introduced by Dijkstra in [Di]and the many
ftp.nyu.edu/pub/ultra/ucn/101-150/ucn105.ps.Z
Continuation-Based Multiprocessing - Wand (1980)
(Correct) (56 citations)
expect to find inside the kernel, such as semaphore management [2]may be completely decentralized
V resets the car of x to t, thus releasing the semaphore. There is no way to access the variable x
we shall consider better ways to build a semaphore in Section 6. 4. Process saving with catch
ftp.ccs.neu.edu/pub/people/wand/papers/hosc-99.ps
Implementing a Generalized Tool for Network Monitoring - Ranum (1997)
(Correct) (44 citations)
per packet we'd like to reduce it to a single semaphore check. When a packet is collected by a packet
staff.washington.edu/dittrich/papers/netmonitor.ps
Virtual Network Transport Protocols for Myrinet - Chun (1998)
(Correct) (38 citations)
and clear event masks to control whether or not semaphores associated with endpoints are posted whenever a
endpoint. By setting the mask and waiting on the semaphore, multi-threaded applications have the option of
endpoint. Each server thread waits on a binary semaphore posted by the communication subsystem upon a
www.cs.berkeley.edu/~culler/hoti97/ucb.ps
STRESS: A Simulator for Hard Real-time Systems - Audsley, Burns, Richardson.. (1994)
(Correct) (35 citations)
interact in a number of ways. The provision of semaphores, to enable mutually exclusive access to shared
(proc_1)The processor contains a single binary semaphore (S0) and two periodic tasks (J0 and J1)Each
consumes processor time, and locks and unlocks semaphores. The notation [n,m] indicates that the task
ftp.cs.york.ac.uk/pub/realtime/papers/SPE_Jul_1994_ABRW.ps.Z
Mach Threads and the Unix Kernel: The Battle for Control - Tevanian, Jr., Rashid.. (1987)
(Correct) (34 citations)
For example, to implement P and V style semaphores with shared memory, one could use:
semaphores with shared memory, one could use: P(semaphore) lock(semaphore)while (semaphore-inuse)
memory, one could use: P(semaphore) lock(semaphore)while (semaphore-inuse)
www.ee.umd.edu/courses/enee647/threads/published.threads87.ps
The Shared Regions Approach to Software Cache Coherence on.. - Harjinder Sandhu (1993)
(Correct) (29 citations)
for other synchronization mechanisms (such as semaphores or monitors) in many cases. However, this
specification and contrasts this with the use of semaphores. In this example, an array of regions r is
is associated implicitly with a row of A in the semaphore version. 1 A process requesting WriteAccess
ftp.cs.toronto.edu/pub/parallel/Sandhu_et_al_PPOPP.ps.Z
Realtime Scheduling in SunOS 5.0 - Khanna, Sebree, Zolnowsky (1992)
(Correct) (29 citations)
to examine some shared information. A counting semaphore permits synchronization from a thread that does
access holders. For condition variables and semaphores, priority inheritance is not possible. The
ftp.stna.dgac.fr/pub/pthreads/opcom.sun.ca/solaris2.0_realtime_features.ps.gz
IA-64 Application Developer's Architecture Guide - Intel (1999)
(Correct) (27 citations)
4-12 4.4.3 Semaphore Instructions
C-47 C.4.3 Semaphores
C-26 Integer Load/Store/Semaphore/Get FR 1-bit Opcode Extensions
download.intel.com/design/IA64/Downloads/ADAG.pdf
RCANE: A Resource Controlled Framework for Active Network Services - Menage (1999)
(Correct) (27 citations)
(working on computation)blocked (e.g. on a semaphore, or awaiting more resources to become
www.cl.cam.ac.uk/~pbm1001/papers/iwan99.ps
An Object-Oriented Operating System - Russo (1991)
(Correct) (26 citations)
: 130 7.8.2 Semaphores
: 130 7.8.3 Alternate Semaphore Implementations
133 7.8.4 Semaphore Performance :
choices.cs.uiuc.edu/Papers/Theses/PhD.Obj.Orient.OS.ps.Z
Synchronization Primitives for a Multiprocessor: A.. - Birrell, Guttag.. (1987)
(Correct) (24 citations)
use three main types: Mutex, Condition, and Semaphore. As far as clients of Threads are concerned,
waiting threads need not all be the same. Semaphores: P, V The Threads package also provides binary
P, V The Threads package also provides binary semaphores with their traditional P and V operations. The
gatekeeper.dec.com/pub/DEC/SRC/research-reports/SRC-020.ps.Z
Analyzing Traces with Anonymous Synchronization - David Helmbold (1990)
(Correct) (23 citations)
from a sequential trace with anonymous semaphore-style synchronization. We view a program
of anonymous communication include locks, semaphores, and monitors. Emrath, Ghosh, and Padua [EGP89]
fork/join parallelism and synchronization using semaphores. They distinguish between an actual data race,
ftp.cse.ucsc.edu/pub/tr/ucsc-crl-89-42.ps.Z
First 20 documents Next 20
Try your query at:
Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC