Prospects of Collaboration between Compute Providers by Means of Job Interchange

Grimme, Christian; Lepping, Joachim; Papaspyrou, Alexander

doi:10.1007/978-3-540-78699-3_8

Cited by 25 publications

(20 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance metrics that we consider in all simulation scenarios are the Average Weighted Response Time (AWRT) [67] and the Bounded Slowdown (BS) [68]. The AWRT for N given jobs is defined by:…”

Section: Performance Metricsmentioning

confidence: 99%

The Failure Trace Archive: Enabling the comparison of failure measurements and models of distributed systems

Javadi

Kondo

Iosup

et al. 2013

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

With the increasing presence, scale, and complexity of distributed systems, resource failures are becoming an important and practical topic of computer science research. While numerous failure models and failure-aware algorithms exist, their comparison has been hampered by the lack of public failure data sets and data processing tools. To facilitate the design, validation, and comparison of fault-tolerant models and algorithms, we have created the Failure Trace Archive (FTA)-an online, public repository of failure traces collected from diverse parallel and distributed systems. In this work, we first describe the design of the archive, in particular of the standard FTA data format, and the design of a toolbox that facilitates automated analysis of trace data sets. We also discuss the use of the FTA for various current and future purposes. Second, after applying the toolbox to nine failure traces collected from distributed systems used in various application domains (e.g., HPC, Internet operation, and various online applications), we present a comparative analysis of failures in various distributed systems. underline the need for public availability of trace data from different distributed systems. Last, we show how different interpretations of the meaning of failure data can result in different conclusions for failure modeling and job scheduling in distributed systems. Our results for different interpretations show evidence that there may be a need for further revisiting existing failureaware algorithms, when applied for general rather than for domain-specific distributed systems.

show abstract

Section: Performance Metricsmentioning

confidence: 99%

The Failure Trace Archive: Enabling the comparison of failure measurements and models of distributed systems

Javadi

Kondo

Iosup

et al. 2013

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Another required parameter is the coefficient of variance of the cluster' service time (i.e. C Ss ) which is nothing but Equation (9). This makes our brokering strategy failure-aware and consequently adaptive to the system's failure pattern [13].…”

Section: A Runtime Model For Local Clustermentioning

confidence: 99%

“…The performance metrics related to response times of requests that are considered in all simulation scenarios are the Average Weighted Response Time (AWRT) [9] and the bounded slowdown [8]. The AWRT for N given requests is defined by the following equation:…”

Section: Performance Evaluationmentioning

confidence: 99%

Cloud Resource Provisioning to Extend the Capacity of Local Resources in the Presence of Failures

Javadi

Thulasiraman

Buyya

2012

2012 IEEE 14th International Conference on High Performance Computing and Communication &Amp; 2012 IEEE 9th International Confe

View full text Add to dashboard Cite

Abstract-In this paper, we investigate Cloud computing resource provisioning to extend the computing capacity of local clusters in the presence of failures. We consider three steps in the resource provisioning including resource brokering, dispatch sequences, and scheduling. The proposed brokering strategy is based on the stochastic analysis of routing in distributed parallel queues and takes into account the response time of the Cloud provider and the local cluster while considering computing cost of both sides. Moreover, we propose dispatching with probabilistic and deterministic sequences to redirect requests to the resource providers. We also incorporate checkpointing in some well-known scheduling algorithms to provide a fault-tolerant environment. We propose two cost-aware and failure-aware provisioning policies that can be utilized by an organization that operates a cluster managed by virtual machine technology and seeks to use resources from a public Cloud provider. Simulation results demonstrate that the proposed policies improve the response time of users' requests by a factor of 4.10 under a moderate load with a limited cost on a public Cloud.

show abstract

“…England and Weissman [12] give an estimation of load sharing costs and benefits relying on synthetic workloads only. Grimme et al [20] analyze the prospects of collaborative job sharing and compare their results to the non-cooperative scenario of the same machines. Recent work of Fölling et al [16,17] proposes a fuzzy-based, evolutionary-optimized exchange policy for a fully decentralized scenario, which shows robustness even in changing environments and automatically adapts to the current local load.…”

Section: Capacity Planning In Modern DCI Environmentsmentioning

confidence: 99%

Infrastructure Federation Through Virtualized Delegation of Resources and Services

et al. 2011

Self Cite

View full text Add to dashboard Cite

Infrastructure federation is becoming an increasingly important issue for modernDistributed Computing Infrastructures (DCIs): Dynamic elasticity of quasi-static Grid environments, incorporation of special-purpose resources into commoditized Cloud infrastructures, crosscommunity collaboration for increasingly diverging areas of modern e-Science, and Cloud Bursting pose major challenges on the technical level for many resource and middleware providers. Especially with respect to increasing costs of operating data centers, the intelligent yet automated and secure sharing of resources is a key factor for success. With the D-Grid Scheduler Interoperability (DGSI) project within the German D-Grid Initiative, we provide a strategic technology for the automatically negotiated, SLAsecured, dynamically provisioned federation of resources and services for Grid-and Cloud-type infrastructures. This goal is achieved by complementing current DCI schedulers with the ability to federate infrastructure for the temporary leasing of resources and rechanneling of workloads. In this work, we describe the overall architecture and SLA-secured negotiation protocols within DGSI and depict an advanced mechanism for resource delegation through means of dynamically provisioned, virtualized middleware. Through this methodology, we provide the technological foundation for intelligent capacity planning and workload management in a cross-infrastructure fashion. 356 G. Birkenheuer et al.

show abstract

Prospects of Collaboration between Compute Providers by Means of Job Interchange

Cited by 25 publications

References 19 publications

The Failure Trace Archive: Enabling the comparison of failure measurements and models of distributed systems

The Failure Trace Archive: Enabling the comparison of failure measurements and models of distributed systems

Cloud Resource Provisioning to Extend the Capacity of Local Resources in the Presence of Failures

Infrastructure Federation Through Virtualized Delegation of Resources and Services

Contact Info

Product

Resources

About