7133 search results - page 1089 / 1427 » Communication algorithms with advice |
219
click to vote
HCW
1999
IEEE
15 years 12 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
207
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
196
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
212
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
205
click to vote
LCN
1996
IEEE
15 years 11 months ago
1996
IEEE
ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. ...