Sciweavers

5553 search results - page 390 / 1111
» Parallel Implementation of Sch
Sort
View
PODC
2003
ACM
15 years 10 months ago
Software transactional memory for dynamic-sized data structures
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
Maurice Herlihy, Victor Luchangco, Mark Moir, Will...
EDOC
2002
IEEE
15 years 10 months ago
The LEAF Platform: Incremental Enhancements for the J2EE
LEAF, the Lean and Extensible Architectural Framework, is an enhancement wrapper for J2EE implementations. Basically, LEAF fixes some identified J2EE issues and extends, as well a...
Philipp Oser, Christian Gasser, Daniel Gorostidi, ...
145
Voted
HPCA
1999
IEEE
15 years 9 months ago
Using Lamport Clocks to Reason about Relaxed Memory Models
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...
Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J....
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
139
Voted
CP
2006
Springer
15 years 8 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck