13 research outputs found

    Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment

    Get PDF
    Includes bibliographical references (pages 7-8).An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated

    Classical wave experiments on chaotic scattering

    Full text link
    We review recent research on the transport properties of classical waves through chaotic systems with special emphasis on microwaves and sound waves. Inasmuch as these experiments use antennas or transducers to couple waves into or out of the systems, scattering theory has to be applied for a quantitative interpretation of the measurements. Most experiments concentrate on tests of predictions from random matrix theory and the random plane wave approximation. In all studied examples a quantitative agreement between experiment and theory is achieved. To this end it is necessary, however, to take absorption and imperfect coupling into account, concepts that were ignored in most previous theoretical investigations. Classical phase space signatures of scattering are being examined in a small number of experiments.Comment: 33 pages, 13 figures; invited review for the Special Issue of J. Phys. A: Math. Gen. on "Trends in Quantum Chaotic Scattering

    Ultrasonic Sensors for a K44DAS

    No full text

    Ultraschallsensorik

    No full text

    Ultraschallsensorik

    No full text

    Mapping subtasks with multiple versions on an ad hoc grid

    Get PDF
    Includes bibliographical references (pages 688-690).An ad hoc grid is a heterogeneous computing system composed of mobile devices. Each computing resource is constrained in battery energy. The problem being studied is to assign statically computing resources to the subtasks of an application that has an execution time constraint, when the resources are oversubscribed. All subtasks must be executed; to accommodate this in an oversubscribed environment, each subtask has two versions: the primary or full version, and the secondary or degraded version. The secondary version utilizes only 10%of the resources that the primary version requires, and produces only 10% of the data output for the subsequent children subtasks. Thus, the degraded version (secondary version) represents a reduced capability of lesser overall value, while consuming fewer resources. The goal is to assign resources so that the application meets an execution time constraint and the battery energy constraint while minimizing the number of degraded versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented, evaluated, and compared

    Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment,” 3rd Int’l Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (HeteroPar ’04

    No full text
    Abstract—An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated. Index Terms — ad hoc grid, communication scheduling, mapping, resource allocation, task scheduling. 1
    corecore