38 research outputs found

    Collective Value QoS: A Performance Measure Framework for Distributed Heterogeneous Networks

    Get PDF
    When users' tasks in a distributed heterogeneous computing environment are allocated resources, and the total demand placed on system resources by the tasks, for a given interval of time, exceeds the resources available, some tasks will receive degraded service, receive no service at all, or may be dropped from the system. One part of a measure to quantify the success of a resource management system (RMS) in such an environment is the collective value of the tasks completed during an interval of time, as perceived by the user, the application, or the policy maker. For the case where a task may be a data communication request, the collective value of data communication requests that are satisfied during an interval of time is measured. The Flexible Integrated System Capability (FISC) measure defined here is one way of obtaining a multi-dimensional measure for quantifying this collective value. While the FISC measure itself is not sufficient for scheduling purposes, it can be a critical part of a scheduler or a scheduling heuristic. The primary contribution of this work is providing a way to measure the collective value accrued by an RMS using a broad range of attributes and to construct a flexible framework that can be extended for particular problem domains.DARPA/ITO Quorum ProgramDARPA/ISO BADD ProgramOffice of Naval Research under ONR grant number N00014-97-1-0804DARPA/ITO AICE program under contract numbers DABT63-99-C-0010 and DABT63-99-C-0012DARPA/ITO Quorum ProgramDARPA/ISO BADD ProgramOffice of Naval Research under ONR grant number N00014-97-1-0804DARPA/ITO AICE program under contract numbers DABT63-99-C-0010 and DABT63-99-C-0012Approved for public release; distribution is unlimited

    Collective Value QoS: A Performance Measure Framework for Distributed Heterogeneous Networks

    Get PDF
    When users' tasks in a distributed heterogeneous computing environment are allocated resources, and the total demand placed on system resources by the tasks, for a given interval of time, exceeds the resources available, some tasks will receive degraded service, receive no service at all, or may be dropped from the system. One part of a measure to quantify the success of a resource management system (RMS) in such an environment is the collective value of the tasks completed during an interval of time, as perceived by the user, the application, or the policy maker. For the case where a task may be a data communication request, the collective value of data communication requests that are satisfied during an interval of time is measured. The Flexible Integrated System Capability (FISC) measure defined here is one way of obtaining a multi-dimensional measure for quantifying this collective value. While the FISC measure itself is not sufficient for scheduling purposes, it can be a critical part of a scheduler or a scheduling heuristic. The primary contribution of this work is providing a way to measure the collective value accrued by an RMS using a broad range of attributes and to construct a flexible framework that can be extended for particular problem domains.DARPA/ITO Quorum ProgramDARPA/ISO BADD ProgramOffice of Naval Research under ONR grant number N00014-97-1-0804DARPA/ITO AICE program under contract numbers DABT63-99-C-0010 and DABT63-99-C-0012DARPA/ITO Quorum ProgramDARPA/ISO BADD ProgramOffice of Naval Research under ONR grant number N00014-97-1-0804DARPA/ITO AICE program under contract numbers DABT63-99-C-0010 and DABT63-99-C-0012Approved for public release; distribution is unlimited

    Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems

    Get PDF
    This paper describes and compares eight heuristics that can be used in such an RMS for dynamically assigning independent tasks to machine

    A Flexible Multi-Dimensional QoS Performance Measure Framework for Distributed Heterogeneous Systems

    Get PDF
    When users' tasks in a distributed heterogeneous computing environment (e.g.cluster of heterogeneous computers) are allocated resources, the total demand placed on some system resources by the tasks, for a given interval of time, may exceed the availability of those resources. In such a case, some tasks may receive degraded service or be dropped from the system. One part of a measure to quantify the success of a resource management system (RMS) in such a distributed environment is the collective value of the tasks completed during an interval of time, as perceived by the user, application, or policy maker. The Flexible Integrated System Capability (FISC) measure presented here is a measure for quantifying this collective value. The FISC measure is a flexible multidimensional measure, and may include priorities, versions of a task or data, deadlines, situational mode, security, application- and domain-specific QoS, and task dependencies. For an environment where it is important to investigate how well data communication requests are satisfied, the data communication request satisfied can be the basis of the FISC measure instead of tasks completed

    A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems

    Get PDF
    Heterogeneous computing (HC) environments are well suited to meet the computational demands of large diverse groups of tasks (i. e., a meta- task). The prob lem of mapping (defi ned as matching and scheduling ) these tasks onto the machines of an HC environment has been shown in general to be NP- complete, requir ing the development of heuristic techniques. Selecting the best heuristic to use in a given environment , how ever, remains a di cult problem because comparisons are often clouded by di erent underlying assumptions in the original studies of each heuristic. Therefore, a collection of eleven heuristics from the literature has been selected implemented and analyzed under one set of common assumptions. The eleven heuristics exam ined are Opportunistic Load Balancing, User- Directed Assignment, Fast Greedy, Min min Max- min, Greedy, Genetic Algorithm, Simulated Annealing , Genetic Sim ulated Annealing, Tabu , and A*. This study provides one even basis for comparison and insights into circum stances where one technique will outperform another . The evaluation procedure is speci ed the heuristics are defined and then selected results are compared
    corecore