4586 search results - page 269 / 918 » Computing stable models in parallel |
132
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work dealing wi...
131
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
109
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
132
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
Heterogeneous users usually have different requirements as far as consistency of shared data is concerned. This paper proposes and investigates a mixed consistency model to meet t...
132
click to vote
ECOOPW
1997
Springer
15 years 8 months ago
1997
Springer
In this paper, we demonstrate how a precise semantics of object-oriented modeling techniques can be achieved, and what the possible bene ts are. We outline the main modeling techni...