Sciweavers

9842 search results - page 1951 / 1969
» Compositional timing analysis
Sort
View
PPOPP
2010
ACM
13 years 6 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
PVLDB
2010
167views more  PVLDB 2010»
13 years 6 months ago
Runtime Measurements in the Cloud: Observing, Analyzing, and Reducing Variance
One of the main reasons why cloud computing has gained so much popularity is due to its ease of use and its ability to scale computing resources on demand. As a result, users can ...
Jörg Schad, Jens Dittrich, Jorge-Arnulfo Quia...
QUESTA
2010
112views more  QUESTA 2010»
13 years 6 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
RAID
2010
Springer
13 years 6 months ago
Detecting the Onset of Infection for Secure Hosts
Abstract. Software flaws in applications such as a browser may be exploited by attackers to launch drive-by-download (DBD), which has become the major vector of malware infection....
Kui Xu, Qiang Ma, Danfeng (Daphne) Yao
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
« Prev « First page 1951 / 1969 Last » Next »