37 search results - page 5 / 8 » Bounds for Mutual Exclusion with only Processor Consistency |
HPCA
2009
IEEE
14 years 8 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
SPAA
2004
ACM
14 years 29 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
ECRTS
2002
IEEE
14 years 14 days ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
Multiple-pursuer multiple-evader games raise fundamental and novel problems in control theory and robotics. In this paper, we propose a distributed solution to this problem that si...