T. Decker, "Virtual data space - load balancing for irregular applications, " Parallel Computing, vol. 26, no. 13-14, pp. 1825--1860, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On-Chip Interconnects for Next Generation System-on-Chips - Brinkmann, Niemann.. (2002) (Correct)
....model is based on the assumption that several programs are split into smaller tasks or processes and distributed among the device and communicate via messagepassing interfaces. This enables the use of efficient scheduling protocols, which can evenly balance the load among the processing modules [7]. The requirements on the switch box architecture are discussed in section II. This includes, for example, that each switch box has to be able to store a small amount of packets to cope with sudden traffic overloads inside the communication network. In section III, we present an analytic model ....
T. Decker, "Virtual data space - load balancing for irregular applications, " Parallel Computing, vol. 26, no. 13-14, pp. 1825--1860, 2000.
The Natural Work-Stealing Algorithm is Stable - Berenbrink, Friedetzky, Goldberg (2001) (3 citations) (Correct)
....work stealing in its kernel. There are numerous examples of practical applications of work stealing. In [Fel94] Feldmann, Monien and Mysliwietz investigate the behaviour of parallel MIN MAX tree evaluation in the context of parallel game (chess) programs employing work stealing strategies. In [Dec00] Decker introduces VDS (Virtual Data Space) a load balancing system for irregular applications that makes use of work stealing and other strategies. In [MD98] Dutt and Mahapatra use work stealing for parallel branch bound type algorithms. Despite the practical usefulness of work stealing, ....
T. Decker. Virtual Data Space -- Load balancing for irregular applications. Parallel Computing, 26(13-14):1825--1860, Nov. 2000.
Towards Optimal Load Balancing Topologies - Decker, Monien, Preis (2000) (1 citation) Self-citation (Decker) (Correct)
....Hoffmann Singleton [1] graphs with very low values for our measures, but they do not belong to a scalable graph class with similar small values. Thus, our investigations are a first step to develop optimal load balancing topologies. We integrated the algorithms into the load balancing library VDS [5]. We consider two platforms in order to cover the characteristics of closely as well as loosely coupled systems. The Cray T3E captures the typical properties of massively parallel systems and the MPI implementation offers very short message startup times and small latency. Secondly, we consider a ....
T. Decker. Virtual Data Space -- Load balancing for irregular applications. Parallel Computing, 2000. To appear.
A Parallel Tabu Search Algorithm For Short-Term Lot Sizing.. - Brockmann, Decker (2000) Self-citation (Decker) (Correct)
....with load balancing problems are described in the following section. IMPLEMENTATION PLATFORM The implementation of the parallel algorithm is based upon Virtual Data Space (VDS) developed at the University of Paderborn. VDS is a general load balancing library for irregular applications [1, 2]. The library shields the programmer from the need to implement functions that do not strictly concern her application. Load balancing, termination detection, and data management are done completely automatically. VDS supports various parallel programming paradigms such as parallel independent ....
Decker, T. (1999). Virtual Data Space -- Load Balancing for Irregular Applications. Technical report tr-rsfb-99-067, Universtity of Paderborn. See also: http://www.unipaderborn. de/ SFB376/projects/a2/vds.html
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC