6105 search results - page 924 / 1221 » A Parallel Algorithm for Bound-Smoothing |
191
click to vote
IPPS
2006
IEEE
16 years 21 days 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...
184
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we present the design and implementation of Ovid, a browser for Grid-related information. The key goal of Ovid is to support the seamless navigation of users in the...
187
click to vote
ISCC
2006
IEEE
16 years 20 days ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
159
click to vote
SKG
2006
IEEE
16 years 20 days ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
189
click to vote
PODC
2006
ACM
16 years 19 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...