59 search results - page 10 / 12 » Confidence-Based Work Stealing in Parallel Constraint Progra... |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
ICDCS
2002
IEEE
14 years 13 days ago
2002
IEEE
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
ICPP
1999
IEEE
13 years 11 months ago
1999
IEEE
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
IEICET
2006
13 years 7 months ago
2006
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
ISCA
2009
IEEE
14 years 2 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...