Sciweavers

5562 search results - page 402 / 1113
» Implementing Parallel Cell-DEVS
Sort
View
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 9 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
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
MIDDLEWARE
2000
Springer
15 years 8 months ago
Customization of Object Request Brokers by Application Specific Policies
This paper presents an architectural framework for customizing Object Request Broker (ORB) implementations to application-specific preferences for various non-functional requiremen...
Bo Nørregaard Jørgensen, Eddy Truyen...
SIGSOFT
2009
ACM
16 years 5 months ago
Asserting and checking determinism for multithreaded programs
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...
Jacob Burnim, Koushik Sen