2438 search results - page 193 / 488 » Scheduling problems for parallel and distributed systems |
134
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
144
click to vote
ISORC
2005
IEEE
15 years 10 months ago
2005
IEEE
We argue that the key underpinning of the current state-of-the real-time practice — the priority artifact — and that of the current state-of-the real-time art — deadline-bas...
128
click to vote
DCOSS
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
176
click to vote
ICS
2007
Tsinghua U.
15 years 11 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
176
Voted
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...