Sciweavers

275 search results - page 9 / 55
» A Markovian Concurrency Measure
Sort
View
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
15 years 1 months ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
73
Voted
FATES
2005
Springer
15 years 3 months ago
A Novel Test Coverage Metric for Concurrently-Accessed Software Components
We propose a novel, practical coverage metric called “location pairs” (LP) for concurrently-accessed software components. The LP metric captures well common concurrency errors ...
Serdar Tasiran, Tayfun Elmas, Guven Bolukbasi, M. ...
85
Voted
CIKM
2008
Springer
14 years 11 months ago
Structural relevance: a common basis for the evaluation of structured document retrieval
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
Mir Sadek Ali, Mariano P. Consens, Gabriella Kazai...
TIT
1998
78views more  TIT 1998»
14 years 9 months ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...
FOCS
2005
IEEE
15 years 3 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit