847 search results - page 54 / 170 » Monitoring the connectivity of a grid |
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
CCGRID
2007
IEEE
14 years 3 months ago
2007
IEEE
Shared machines in opportunistic grids typically have large quantities of unused disk space. These resources could be used to store application and checkpointing data when the mac...
GD
2009
Springer
14 years 1 months ago
2009
Springer
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling curves which are based on a geometric embeddi...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...