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

5th international workshop on Grid Computing

作者： Bouteiller, A Botiziane, HL Herault, T Lemarinier, P Cappello, F Univ Paris 11 LRI INRIA Orsay France

ISBN: (纸本)0769522564

Time sharing between cluster resources in Grid is a major issue in cluster and Grid integration. Classical Grid architecture involves a higher level scheduler which submits non overlapping jobs to the independent batch schedulers of each cluster of the Grid. The sequentiality induced by this approach does not fit with the expected number of users and job heterogeneity of the Grids. Time sharing techniques address this issue by allowing simultaneous executions of many applications on the same resources. Co-scheduling and gang scheduling are the two best known techniques for time sharing cluster resources. Co-scheduling relies on the operating system of each node to schedule the processes of every application. Gang scheduling ensures that the same application is scheduled on all nodes simultaneously. Previous work has proven that co-scheduling techniques outperforms gang scheduling when physical memory is not exhausted. In this paper, we introduce a new hybrid sharing technique providing checkpoint based explicit memory management. It consists in co-scheduling parallel applications within a set, until the memory capacity of the node is reached, and using gang scheduling related techniques to switch from one set to another one. We compare experimentally the merits of the three solutions: Co, Gang and Hybrid scheduling, in the context of out-of-core computing, which is likely to occur in the Grid context, where many users share the same resources. The experiments show that the hybrid solution is as efficient as the co-scheduling technique when the physical memory is not exhausted, and is more efficient than gang scheduling and co-scheduling when physical memory is exhausted.

关键词： Switches Processor scheduling Time sharing computer systems resource management Operating systems Memory management Grid computing Concurrent computing Portals Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

The robustness of resource allocation in parallel and distributed computing systems

The robustness of resource allocation in parallel and distri...

引用

Proceedings - ISPDC 2004: Third international Symposium on parallel and distributed Computing/HeteroPar '04: Third international workshop on Algorithms, Models and Tools for parallel Computing on Heterogeneous Networks

作者： Ali, Shoukat Siegel, Howard Jay Maciejewski, Anthony A. University of Missouri-Rolla Department of Electrical and Computer Engineering Rolla MO 65409-0040 Colorado State University Department of Electrical and Computer Engineering Fort Collins CO 80523-1373 Colorado State University Department of Computer Science Fort Collins CO 80523-1373

ISBN: (纸本)0769522106

This paper gives an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel;it summarizes our research in [1]. Performing computing and communication tasks on parallel and distributed systems involves the coordinated use of different types of machines, networks, interfaces, and other resources. Decisions about how best to allocate resources are often based on estimated values of task and system parameters, due to uncertainties in the system environment. An important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. We have designed a methodology for deriving the degree of robustness of a resource allocation - the maximum amount of collective uncertainty in system parameters within which a user-specified level of system performance (QoS) can be guaranteed. Our four-step procedure for deriving a robustness metric for an arbitrary system will be presented. We will illustrate this procedure and its usefulness by deriving robustness metrics for some example distributed systems. © 2004 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

On hierarchical configuration of distributed systems on mesh and hypercube

引用

international JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2004年第3期15卷 517-534页

作者： Wang, DJ Cao, JN Montclair State Univ Dept Comp Sci Montclair NJ 07043 USA Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

We study hierarchical configuration of distributed systems for achieving optimized system performance. A distributed system consists of a collection of local processes which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels, so as to coordinate the local computation/control activities to improve the overall system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. The optimization problem considered in this paper is concerned with finding an optimal hierarchical partition of the processors, so that the total traffic flow over the network is minimized. The problem in its general form has been known to be NP-hard. Therefore, we just focus on distributed computing jobs which require collecting and processing information from all processors. By limiting levels of the hierarchy to two, we will establish the analytically optimal hierarchical configurations for two popular interconnection networks: mesh and hypercube. Based on analytical results, partitioning algorithms are proposed to achieve minimal communication cost (network traffic flow). We will also present and discuss heuristic algorithms for multiple-level hierarchical partitions.

关键词： distributed processing hierarchical architecture hierarchical configuration hypercube interconnection networks mesh

来源：评论

学校读者我要写书评

暂无评论

Memory conscious task partition and scheduling in grid environments 04

Memory conscious task partition and scheduling in grid envir...

引用

Proceedings - Fifth IEEE/ACM international workshop on Grid Computing

作者： Wu, Ming Sun, Xian-He Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States

ISBN: (纸本)0769522564

While resource management and task scheduling are identified challenges of Grid computing, current Grid scheduling systems mainly focus on CPU and network availability. Recent performance improvement of CPU and computer network has made memory usage a significant factor of overall performance. In this study, we consider memory availability as a performance factor and introduce memory conscious task partition and scheduling. Three task partition policies are discussed. They are CPU-based, memory-based, and CPU-memory combined partition. We first investigate the three task partition policies on dedicated resources and verify the effectiveness of the CPU-memory combined partition algorithm in finding an optimal solution. We then extend the task partition policies in non-dedicated environments with the consideration of resource sharing. Analytical and experimental results show that the CPU-memory combined scheduling approach outperforms either the CPU-based or memory-based scheduling approach considerably for memory-intensive applications in Grid environments. © 2004 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Proceedings - 18th international parallel and distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Streit, Achim Paderborn Ctr. for Parallel Comp. Paderborn University 33102 Paderborn Germany

ISBN: (纸本)0769521320

In this paper 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.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

Cluster-to-cluster communications: A consistent communication paradigm for distributed clusters

Cluster-to-cluster communications: A consistent communicatio...

引用

Proceedings of the 16th IASTED international Conference on parallel and distributed Computing and systems

作者： Fide, Sevin Jenks, Stephen F. Elec. Eng. and Computer Science University of California Irvine Irvine CA 92697

High performance computing systems and cluster computers are becoming so cost-effective that even small research groups can afford them. Hence, efforts to take advantage of these widely distributed resources are becoming popular. Although recent projects provide resource management and job scheduling to support groups of computational resources across the country working together on massive problems, they have not yet fully addressed how distributed parallel programs will communicate. Therefore, we propose a new paradigm to support cluster-to-cluster (C2C) communications, which handles run-time communications between parallel programs running on distributed clusters.

关键词： Computer supported cooperative work

来源：评论

学校读者我要写书评

暂无评论

GridAdmin: Decentralising Grid administration using trust management

GridAdmin: Decentralising Grid administration using trust ma...

引用

作者： Quillinan, Thomas B. Clayton, Brian C. Foley, Simon N. Department of Computer Science University College Cork Ireland

ISBN: (纸本)0769522106

Administration of Grid resources is a time consuming and often tedious job. Most administrative requests are predictable, and in general, handling them requires knowledge of the local resources and the requester. In this paper we discuss a system to provide automated support for administrative requests, such as resource reservation and user account management. We propose using trust metrics to help judge the merits and suitability of each request. We outline how these metrics can be implemented using trust management techniques into a practical system we call GridAdmin. © 2004 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A service-oriented accounting architecture on the grid

引用

5th international Conference on parallel and distributed Computing

作者： Yu, JD Li, ML Li, Y Hong, F Du, YJ Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China Xian Inst Technol Dept Photoelect Engn Xian 710032 Peoples R China

ISBN: (纸本)3540240136

The Computational Grid is a promising computing platform for solving the problem of large-scale resource allocation. In order to build large-scale of the grid computing systems, some obvious problems of grid computing, such as: security, resource scheduling and management, authentication and authorization, have attracted more attention and research. Charging and accounting is an important part of grid computing, and will lead to develop the grid computing systems. The aim of this paper is to propose a service-oriented accounting architecture that involves many services interaction on the grid. In this paper, we describe firstly architecture of charging and accounting and its support system. Then, we give briefly an introduction to pricing schemes and accounting policies.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A synthetic workload generator for cluster computing

A synthetic workload generator for cluster computing

引用

Proceedings - 18th international parallel and distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Denneulin, Yves Romagnoli, Emmanuel Trystram, Denis ID-IMAG Laboratory ZIRST 51 avenue Jean Kuntzmann 38330 Montbonnot Saint Martin France

ISBN: (纸本)0769521320

The major issue today on cluster and grid computing is the efficient resource management. The evaluation of scheduling strategies is hard because of the generation of jobs under realistic scenario. This is true for rigid jobs (where the number of processors is fixed) and even more for moldable ones. This paper presents an approach to generate realistic workloads for this kind of jobs. The model we propose is based on the analysis of one year of utilization of the I-cluster, a 225 processors cluster. From this log we extract a typical load for this kind of parallel machines and introduce a way to generate synthetic realistic workloads in an automatic way. This work was done as a way to test scheduling strategies taking into account both rigid and moldable jobs so as the workload generator may handle moldable jobs.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Information management for grid-based remote sensing problem solving environment

Information management for grid-based remote sensing problem...

引用

international Conference on parallel and distributed Processing Techniques and Applications

作者： Aloisio, G Cafaro, M Epicoco, I Quarta, G Univ Lecce Ctr Adv Computat Technol ISUFI I-73100 Lecce Italy

ISBN: (纸本)1932415262

The aim of this work is to design and then implement a Configuration Repository for a grid-based Problem Solving Environment (PSE), specialized to describe applications and data belonging to the remote sensing field. In a distributed environment the information system plays a central role in order to enhance scheduling algorithms and, more generally, to address grid-aware application requirements. Taking into account that the grid is inherently dynamic, i.e. machine load and availability, network latency and bandwidth change continually, we present the design of a Configuration Repository for retrieving, storing and handling information. In particular, the proposed solution has been designed having in mind all of the specific characteristics belonging to the remote sensing systems.

关键词： remote sensing problem solving environment grid computing resource discovery grid information system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：