423 search results - page 11 / 85 » Predicting Queue Times on Space-Sharing Parallel Computers |
EUROPAR
2001
Springer
13 years 12 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
TC
2002
13 years 7 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
DSRT
2008
IEEE
13 years 9 months ago
2008
IEEE
This paper proposes a novel Lightweight Time Warp (LTW) protocol for high-performance parallel optimistic simulation of large-scale DEVS and CellDEVS models. By exploiting the cha...
ICDCS
1997
IEEE
13 years 11 months ago
1997
IEEE
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...