Sciweavers

634 search results - page 127 / 127
» Modeling Parallel System Workloads with Temporal Locality
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
ATAL
2003
Springer
13 years 9 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ISCA
1996
IEEE
99views Hardware» more  ISCA 1996»
13 years 8 months ago
High-Bandwidth Address Translation for Multiple-Issue Processors
In an effort to push the envelope of system performance, microprocessor designs are continually exploiting higher levels of instruction-level parallelism, resulting in increasing ...
Todd M. Austin, Gurindar S. Sohi
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 4 months ago
Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
Animashree Anandkumar, Ting He, Chatschik Bisdikia...