检索结果-内蒙古大学图书馆

ON ARCHITECTURE FOR SLA-AWARE WORKFLOWS IN GRID ENVIRONMENTS

Journal of Interconnection Networks 2005年第3期6卷 245-263页

作者： Dang Minh Quan Odej Kao Paderborn Center for Parallel Computing (PC2) University of Paderborn Fuerstenalle 11 Paderborn 33102 Germany Department of Computer Science and Paderborn Center for Parallel Computing (PC2) University of Paderborn Fuerstenalle 11 Paderborn 33102 Germany

Service Level Agreements (SLAs) are currently one of the major research topics in Grid computing, as they serve as a foundation for reliable and predictable Grids. SLAs define an explicit statement of expectations and obligations in a business relationship between provider and customer. Thus, SLAs should guarantee the desired and a-priori negotiated Quality of Service (QoS), which is a mandatory prerequisite for the Next Generation Grids. This development is proved by a manifold research work about SLAs and architectures for implementing SLAs in Grid environments. However, this work is mostly related to SLAs for standard, monolithic Grid jobs and neglects the dependencies between different steps of operation. The complexity of an SLA-specification for workflows grows significantly, as characteristics of correlated sub-jobs, the data transfer phases, the deadline constraints and possible failures have to be considered. Thus, an architecture for an SLA-aware workflow implementation needs sophisticated mechanisms for specification and management, sub-job mapping, data transfer optimization and fault reaction. Therefore, this paper presents an architecture for SLA-aware Grid workflows. The main contributions are an improved specification language for SLA-aware workflows, a mapping and optimization algorithm for sub-job assignment to Grid resources and a prototype implementation using standard middleware. Experimental measurements prove the quality of the development.

关键词： Service Level Agreement (SLA) workflow Grid computing

来源：评论

学校读者我要写书评

暂无评论

Lonestar: An Energy-Aware Disk Based Long-Term Archival Storage System

Lonestar: An Energy-Aware Disk Based Long-Term Archival Stor...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Matthias Grawinkel Markus Pargmann Hubert Domer Andre Brinkmann Paderborn Center of Parallel Computing PC2 University of Paderborn Germany

We present the architecture for an disk based archival storage system and propose a new RAID scheme that is designed for "write once, read sometimes" workloads. By intertwining parity groups into a multi-dimensional RAID and improving the single disk reliability with intra-disk redundancy, the system achieves an elastic fault tolerance that can at least recover from all 3-disk failures. We do not stripe data to multiple disks and store related information to the same disks. Typically, all disks of the RAID are powered off, and for a read request, only a single disk has to be spun up, while write and rebuild processes require multiple disks. We analyzed our RAID scheme and showed that it provides a MTTDL that is orders of magnitudes higher than a set of RAID6 systems with a similar amount of disk drives. We also present and evaluate our prototype and show that it is well suited for archival scenarios.

关键词： Energy consumption Redundancy Arrays Servers Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

Non-intrusive virtualization management using libvirt 10

Non-intrusive virtualization management using libvirt

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Matthias Bolte Michael Sievers Georg Birkenheuer Oliver Niehörster André Brinkmann Paderborn Center of Parallel Computing PC2 University of Paderborn Paderborn Germany

ISBN: (纸本)9783981080162

The success of server virtualization has let to the deployment of a huge number of virtual machines in today's data centers, making a manual virtualization management very labor-intensive. The development of appropriate management solutions is hindered by the various management interfaces of different hypervisors. Therefore, a uniform management can be simplified by a layer abstracting from these dedicated hypervisor interfaces. The libvirt management library provides such an interface to different hypervisors. Unfortunately, remote hypervisor management using libvirt has not been possible without altering the managed servers. To overcome this limitation, we have integrated remote hypervisor management facilities into the libvirt driver infrastructure for VMware ESX and Microsoft Hyper-V. This paper presents the resulting architecture as well as experiences gained during the implementation process.

关键词： Virtual machine monitors Virtual machining Operating systems Environmental management Platform virtualization Libraries Resource management Hardware parallel processing Isolation technology

来源：评论

学校读者我要写书评

暂无评论

SkewCCC+: A heterogeneous distributed hash table

SkewCCC+: A heterogeneous distributed hash table

引用

14th International Conference on Principles of Distributed Systems, OPODIS 2010

作者： Bienkowski, Marcin Brinkmann, André Klonowski, Marek Korzeniowski, Miroslaw Institute of Computer Science University of Wroclaw Poland Paderborn Center for Parallel Computing PC2 University of Paderborn Germany Inst. of Mathematics and Computer Science Wroclaw Univ. of Technology Poland

ISBN: (纸本)3642176526

Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that consider heterogeneity of nodes inside the construction process or properly serve data of different load. To our best knowledge, there is no construction which smoothly addresses both these issues. We propose a Peer-to-Peer construction that explicitly uses heterogeneity to simplify the routing and maintenance process even in the presence of an adaptive adversary. Using a hypercube and cube connected cycles networks as a backbone, we show how to cope with two types of heterogeneity: one for nodes and one for data. © 2010 Springer-Verlag.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Reservation-Based Overbooking for Hpc Clusters

Reservation-Based Overbooking for HPC Clusters

引用

IEEE International Conference on Cluster computing

作者： Georg Birkenheuer Andre Brinkmann Paderborn Center of Parallel Computing (PC2) University of Paderborn Germany

Hpc environments are not only used in research and academia anymore, but are also becoming commercially available and successful. Hpc resource providers, which offer Hpc services over the Internet, have to ensure a very high utilization rate to be competitive and profitable. One solution to improve utilization is the use of overbooking. This paper shows an improved overbooking approach for Hpc providers that serves this purpose. Resources are not assigned to a job until it actually starts. This enhances the scheduler's degree of freedom and therefore improves the overbooking performance. We evaluated the potential of this approach using real-world job traces. Given a sufficient expected demand, overbooking is applicable and provides additional profit.

关键词： Runtime Estimation Schedules Probability density function parallel processing Conferences

来源：评论

学校读者我要写书评

暂无评论

PadFEM: A portable parallel FEM-tool

PadFEM: A portable parallel FEM-tool

引用

International Conference and Exhibition on High-Performance computing and Networking, HpcN EUROPE 1996

作者： Diekmann, Ralf Dralle, Uwe Neugebauer, Friedhelm Römke, Thomas Department of Computer Science University of Paderborn Paderborn33095 Germany Paderborn Center for Parallel Computing PC 2 University of Paderborn Paderborn33095 Germany

ISBN: (纸本)9783540611424

We present a modular toolbox for parallel finite element simulations on distributed memory systems. The library named PadFEM includes a graphical editor for specifying domains with boundary conditions, automatic mesh generation, automatic mesh partitioning and mapping onto the processors of a MIMD-system. The parallel FEM-simulation uses the preconditioned conjugate gradient method. The parallelization is based on PVM which guarantees portable parallel code. The current implementation is able to solve the two-dimensional Poisson equation in arbitrary domains with mixed Dirichlet- and Neumann-type boundary conditions using triangular meshes. The modular structure based on the idea of programming frames allows an easy extension to other problems. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

On architecture for SLA-aware workflows in grid environments

On architecture for SLA-aware workflows in grid environments

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： D.M. Quan O. Kao Paderborn Center for Parallel Computing (PC2) University of Paderborn Paderborn Germany

Service level agreements (SLAs) are currently one of the major research topics in grid computing resulting in a language definition for specification of SLAs and corresponding system architectures. However, previous work solely addresses problems for monolithic grid jobs. The description of a workflow (job flow) considers characteristics of correlated sub-jobs, thus the problem grows more complex in terms of management, SLA specification, fault reaction etc. Therefore, this paper presents system architecture to ensure SLAs for grid-based workflows and a corresponding language for the SLA specification.

关键词： Weather forecasting Web services Computer architecture Grid computing Predictive models parallel processing Quality of service Moisture Convergence Data visualization

来源：评论

学校读者我要写书评

暂无评论

Evaluation of an unfair decider mechanism for the self-tuning dynP job scheduler

Evaluation of an unfair decider mechanism for the self-tunin...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： A. Streit PC2-Paderborn Center for Parallel Computing Paderborn University Paderborn Germany

Summary form only given. We present a new decider mechanism for the self-tuning dynP job scheduler for modern resource management systems. This scheduler switches the active scheduling policy dynamically during run time, in order to reject changing characteristics of waiting jobs. The new decider explicitly prefers a single scheduling policy instead of being fair to all available policies. We use discrete event simulations to evaluate the achieved slowdown and utilization and compare the results with the fair decider mechanism and the static basic scheduling policies. The evaluation shows that the self-tuning dynP scheduler in combination with the preferred decider achieves good results and that it is superior to common static scheduling approaches, which use only a single policy.

关键词： Processor scheduling Resource management Dynamic scheduling Delay parallel processing Switches Discrete event simulation High performance computing Costs Testing

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Mechanisms for SLA-aware Resource Management

Fault Tolerance Mechanisms for SLA-aware Resource Management

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： M. Hovestadt Paderborn Center for Parallel Computing (PC2) Universität Paderborn Germany

Future grid systems will demand for properties like runtime responsibility, predictability, and a guaranteed service quality level. In this context, service level agreements have central importance. Many ongoing research projects already focus on the realization of required mechanisms at grid middleware layer. However, only concentrating on grid middleware is not enough. Also the underlying resource management systems have to provide an increased QoS level, since they provide their resources to grid environments. The EU-funded project Hpc4U aims at realizing an SLA-aware resource management system. It allows the grid user to negotiate on SLAs, assuring the adherence with agreed SLAs by means of application-transparent checkpointing, snapshotting, and migration

关键词： Fault tolerance Resource management Middleware Quality of service Checkpointing Runtime Context-aware services Grid computing Business parallel processing

来源：评论

学校读者我要写书评

暂无评论

Virtual Execution Environments for ensuring SLA-compliant Job Migration in Grids

Virtual Execution Environments for ensuring SLA-compliant Jo...

引用

IEEE International Conference on Services computing (SCC)

作者： Dominic Battre Matthias Hovestadt Odej Kao Axel Keller Kerstin Voss Technische Universität Berlin Germany Paderborn Center for Parallel Computing (PC2) Universität Paderborn Germany

OpenCCS is an SLA-aware resource management system which uses transparent checkpointing of applications and migration of checkpoint datasets for ensuring SLA-compliance also in case of resource outages. Migration of checkpoints presumes a high grade of compatibility between source and target resource. Hence, even in large Grid systems only a small number of resources are eligible migration targets. This short paper describes the concept of virtual execution environments and how they increase the number of potential migration targets. It will also outline an implementation within OpenCCS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：