549 search results - page 13 / 110 » Computing All the Best Swap Edges Distributively |
AMC
2007
14 years 9 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
86
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
106
click to vote
MIDDLEWARE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. While Web Services ensure interoperability and extensibility for networked applications, they also complicate the deployment of highly collaborative systems, such as virt...
CIAC
2000
Springer
15 years 1 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...