5448 search results - page 52 / 1090 » Breakpoints and Time in Distributed Computations |
APPINF
2003
15 years 1 months ago
2003
We develop a memory-efficient off-line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requir...
91
Voted
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper discusses the implementation using mobile agent and the performance of the market computing to allocate network quality of service most efficiently, based on users'...
147
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dyna...
125
click to vote
HIPC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
130
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Clustering is an important characteristic of most sensor applications. In this paper we define COSMOS, the Cluster-based, heterOgeneouS MOdel for Sensor networks. The model assum...