Sciweavers

3192 search results - page 355 / 639
» The minimum latency problem
Sort
View
OPODIS
2003
15 years 5 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
PDSE
1998
126views more  PDSE 1998»
15 years 5 months ago
Validation and Test Generation for Object-Oriented Distributed Software
The development of correct OO distributed software is a daunting task as soon as the distributed interactions are not trivial. This is due to the inherent complexity of distribute...
Thierry Jéron, Jean-Marc Jézé...
ENTCS
2008
138views more  ENTCS 2008»
15 years 4 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo
SIGOPS
2008
145views more  SIGOPS 2008»
15 years 4 months ago
Towards distributed storage resource management using flow control
Deployment of shared storage systems is increasing with rapid adoption of virtualization technologies to provide isolation, better management and high utilization of resources. Qu...
Ajay Gulati, Irfan Ahmad
SIGMETRICS
2000
ACM
15 years 4 months ago
Minimizing the impact of orphan requests in e-commerce services
The most common problem of an overloaded electronic-commerce server is an increase in the response time perceived by customers, who may restart their requests hoping to get a fast...
E. Kraemer, Goedson T. Paixão, Dorgival Ola...