Sciweavers

365 search results - page 5 / 73
» Reconfigurations in Graphs and Grids
Sort
View
SKG
2006
IEEE
15 years 3 months ago
Service Search Strategy Based on Graph in Grid Environment
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...
Zilin Song, Weihua Ai, Yi Wang, Liang Wu
72
Voted
COMBINATORICA
2008
104views more  COMBINATORICA 2008»
14 years 9 months ago
Linearity of grid minors in treewidth with applications through bidimensionality
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
Erik D. Demaine, MohammadTaghi Hajiaghayi
105
Voted
ISCOPE
1998
Springer
15 years 1 months ago
Dynamic Reconfiguration and Virtual Machine Management in the Harness Metacomputing System
Metacomputing frameworks have received renewed attention of late, fueled both by advances in hardware and networking, and by novel concepts such as computational grids. However the...
Mauro Migliardi, Jack Dongarra, Al Geist, Vaidy S....
104
Voted
CCGRID
2008
IEEE
15 years 4 months ago
An Autonomic Workflow Management System for Global Grids
Workflow Management System is generally utilized to define, manage and execute workflow applications on Grid resources. However, the increasing scale complexity, heterogeneity and...
Mustafizur Rahman 0003, Rajkumar Buyya
83
Voted
DAM
2000
84views more  DAM 2000»
14 years 9 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides