37 search results - page 5 / 8 » Bounds for Mutual Exclusion with only Processor Consistency |
82
Voted
HPCA
2009
IEEE
16 years 8 days 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...
105
click to vote
SPAA
2004
ACM
15 years 5 months 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
15 years 3 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...
110
click to vote
ECRTS
2002
IEEE
15 years 4 months 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
15 years 3 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...