Results 1  10
of
13
A stochastic approach to measuring the robustness of resource allocations in distributed systems
 in: International Conference on Parallel Processing (ICPP06
, 2006
"... Often, parallel and distributed computing systems must operate in an environment replete with uncertainty. Determining a resource allocation that accounts for this uncertainty in a way that can provide a probabilistic guarantee that a given level of quality of service (QoS) is achieved is an importa ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Often, parallel and distributed computing systems must operate in an environment replete with uncertainty. Determining a resource allocation that accounts for this uncertainty in a way that can provide a probabilistic guarantee that a given level of quality of service (QoS) is achieved is an important research problem. This paper defines a stochastic methodology for quantifiably determining a resource allocation’s ability to satisfy QoS constraints in the midst of uncertainty in system parameters. Uncertainty in system parameters and its impact on system performance are modeled stochastically. This stochastic model is then used to derive a quantitative expression for the robustness of a resource allocation. The paper investigates the utility of the proposed stochastic robustness metric by applying the metric to resource allocations in a simulated distributed system. The simulation results are then compared with deterministically defined metrics from the literature. 1.
Greedy approaches to static stochastic robust resource allocation for periodic sensor driven distributed systems
 In Proceedings the 2006 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’06
, 2006
"... Abstract — This research investigates the problem of robust resource allocation for a large class of systems operating on periodically updated data sets under an imposed quality of service (QoS) constraint. Such systems are expected to function in an environment replete with uncertainty where the wo ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract — This research investigates the problem of robust resource allocation for a large class of systems operating on periodically updated data sets under an imposed quality of service (QoS) constraint. Such systems are expected to function in an environment replete with uncertainty where the workload is likely to fluctuate substantially. Determining a resource allocation that accounts for this uncertainty in a way that can provide a probabilistic guarantee that a given level of QoS is achieved is an important research problem. First, this paper defines a methodology for quantifiably determining a resource allocation’s ability to satisfy QoS constraint in the midst of uncertainty in system parameters. Uncertainty in system parameters and its impact on system performance are modeled stochastically. Second, the established stochastic model is employed to develop greedy resource allocation heuristics. Finally, the utility of the proposed stochastic robustness metric and the performance of the heuristics are evaluated in a simulated environment that replicates a heterogeneous clusterbased radar system. Index Terms — heterogeneous distributed systems, resource allocation, stochastic optimization, greedy heuristics. I.
A stochastic model for heterogeneous computing and its application in data relocation scheme development
 IEEE Transactions on Parallel and Distributed Systems
, 1998
"... into subtasks, then each subtask assigned to the machine where it is best suited for execution. Data relocation is defined as selecting the sources for needed data items. It is assumed that multiple independent subtasks of an application program can be executed concurrently on different machines whe ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
into subtasks, then each subtask assigned to the machine where it is best suited for execution. Data relocation is defined as selecting the sources for needed data items. It is assumed that multiple independent subtasks of an application program can be executed concurrently on different machines whenever possible. A theoretical stochastic model for HC is proposed, in which the computation times of subtasks and communication times for intermachine data transfers can be random variables. The optimization problem for finding the optimal matching, scheduling, and data relocation schemes to minimize the total execution time of an application program is defined based on this stochastic HC model. The global optimization criterion and search space for the above optimization problem are described. It is validated that a greedy algorithmbased approach can establish a local optimization criterion for developing data relocation heuristics. The validation is provided by a theoretical proof based on a set of common assumptions about the underlying HC system and application program. The local optimization criterion established by the greedy approach, coupled with the search space defined for choosing valid data relocation schemes, can help developers of future practical data relocation heuristics.
StochasticBased Robust Dynamic Resource Allocation in a Heterogeneous Computing System
 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING
, 2009
"... This research investigates the problem of robust dynamic resource allocation for heterogeneous distributed computing systems operating under imposed constraints. Often, such systems are expected to function in an environment where uncertainty in system parameters is common. In such an environment, t ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
This research investigates the problem of robust dynamic resource allocation for heterogeneous distributed computing systems operating under imposed constraints. Often, such systems are expected to function in an environment where uncertainty in system parameters is common. In such an environment, the amount of processing required to complete an application may fluctuate substantially. Determining a resource allocation that accounts for this uncertainty—in a way that can provide a probability that a given level of service is achieved—is an important area of research. We define a mathematical model of stochastic robustness appropriate for a dynamic environment that can be used during resource allocation to aid heuristic decision making. In addition, we design a novel technique for maximizing stochastic robustness in this environment. Our performance results for this technique are compared with several well known resource allocation techniques in a simulated environment that models a heterogeneous distributed computing system.
Iterative algorithms for stochastically robust static resource allocation in periodic sensor driven clusters
 in: 8th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2006
, 2006
"... This research investigates the problem of robust static resource allocation for a large class of clusters processing periodically updated data sets under an imposed quality of service constraint. The target hardware platform consists of a number of sensors generating input for heterogeneous applicat ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This research investigates the problem of robust static resource allocation for a large class of clusters processing periodically updated data sets under an imposed quality of service constraint. The target hardware platform consists of a number of sensors generating input for heterogeneous applications continuously executing on a set of heterogeneous compute nodes. In practice such systems are expected to function in a physical environment replete with uncertainty, which causes the amount of processing required over time to fluctuate substantially. Determining a resource allocation that accounts for this uncertainty in a way that can provide a probabilistic guarantee that a given level of QoS is achieved is an important research problem. The stochastic robustness metric is based on a mathematical model where the relationship between uncertainty in system parameters and its impact on system performance is described stochastically. The established metric is then used in the design of several resource allocation algorithms utilizing evolutionary approaches. The performance results and comparison analysis are presented for a simulated environment that replicates a heterogeneous clusterbased processing center for a radar system. KEY WORDS Heterogeneous systems, resource allocation, stochastic optimization, iterative algorithms, computer clusters. 1
Comparison and analysis of greedy energyefficient scheduling algorithms for computational grids
 in Energy Aware Distributed Computing Systems
, 2012
"... A computational grid is a distributed computational network, enabled with software that allows cooperation and the sharing of resources. The energy consumption of these largescale distributed systems is an important problem. As our society becomes more technologically advanced, the size of these co ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A computational grid is a distributed computational network, enabled with software that allows cooperation and the sharing of resources. The energy consumption of these largescale distributed systems is an important problem. As our society becomes more technologically advanced, the size of these computational grids and energy consumption continue to increase. In this paper, we study the problem of optimizing energy consumption and makespan by focusing on different techniques to schedule the tasks to the computational grid. A computational grid is simulated using a wide range of task heterogeneity and size variety. The heuristics are used with the simulated computational grid and the results are compared extensively against each other. 1.1
Stochastically robust static resource allocation for energy minimization with a makespan constraint in a heterogeneous computing environment
 9th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA ‘11
, 2011
"... ldbricen, ..."
Batch Mode StochasticBased Robust Dynamic Resource Allocation in a Heterogeneous Computing System
"... Abstract—Heterogeneous, parallel and distributed computing systems frequently must operate in environments where uncertainty in system parameters is common. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assum ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—Heterogeneous, parallel and distributed computing systems frequently must operate in environments where uncertainty in system parameters is common. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assumed. In such an environment, the amount of processing required to complete any given task may fluctuate substantially due to variations in data size and content. Determining a resource allocation that accounts for this uncertainty is an important area of research. In this study, we define a stochastic robustness measure to facilitate batchmode resource allocation decisions in a dynamic environment where tasks are subject to individual deadlines and design a novel resource allocation technique that attempts to maximize our new stochastic robustness measure. We compare the performance of our technique against some commonly used approaches taken from the literature and adapted to our environment. Our performance results demonstrate the viability of our new technique in a dynamic heterogeneous computing system.
Iterative Techniques for Maximizing Stochastic Robustness of a Static Resource Allocation in Periodic Sensor Driven Clusters
"... Abstract This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, such systems are expected to function in an environment where uncertainties in system parameters is common. In s ..."
Abstract
 Add to MetaCart
Abstract This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, such systems are expected to function in an environment where uncertainties in system parameters is common. In such an environment, the amount of processing required to complete a task may fluctuate substantially. Determining a resource allocation that accounts for this uncertainty—in a way that can provide a probability that a given level of QoS is achieved—is an important area of research. We present two techniques for maximizing the probability that a given level of QoS is achieved. The performance results for our techniques are presented for a simulated environment that models a heterogeneous clusterbased radar data processing center.