-
...several algorithms have been proposed for computing the optimal rectilinear partitioning of data to a linear array of processors. we...goal of this paper is to compare our heuristics to an optimal partitioning, both in terms of execution time and accuracy of the partition. we give some very interesting...
-
...shows how they can lead a system to a load balanced configuration. the paper evaluates and compares the effectiveness of several...parameters. all presented policies show a robust and scalable behaviour: they are able to reach a good load balancing quality with promptness, low intrusion and little dependence on the system...
Published in 1996.
-
...ordering is investigated. both asymptotically and run time efficient exact algorithms are proposed and implemented for one dimensional (1d) striping and two dimensional (2d) jagged partitioning. binary search method is successfully...value of an optimal solution. a binary search algorithm is proposed for 2d jagged partitioning by introducing a new 2d probing scheme. a new iterative refinement scheme is...
-
...frequently retrieve data stored on a distributed storage subsystem interconnected by a high-speed local network. to meet the quality-of-service (qos) imposed by...much attention from researchers due to its effectiveness and low cost. in this paper, we propose a novel load-balancing and performance oriented static data placement...
-
...the so-called r-tree and its variants, as they have emerged as practically efficient indexing methods for spatial data. our method uses...most cases it allows us to perform a batch of updates and queries simultaneously. to be able to do so is essential in...
-