Sciweavers

73 search results - page 11 / 15
» Idempotent work stealing
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
SPAA
2005
ACM
14 years 1 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
SPAA
2010
ACM
14 years 17 days ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
ICCS
2007
Springer
13 years 11 months ago
Unusual Event Recognition for Mobile Alarm System
This paper proposes an unusual event recognition algorithm, which is a part of a mobile alarm system. Our systems focus on unusual event. When the system detects the unusual event,...
Soo Yeong Kwak, Guntae Bae, Kil-Cheon Kim, Hyeran ...
ESORICS
2006
Springer
13 years 11 months ago
SessionSafe: Implementing XSS Immune Session Handling
With the growing trend towards the use of web applications the danger posed by cross site scripting vulnerabilities gains severity. The most serious threats resulting from cross si...
Martin Johns