共查询到20条相似文献,搜索用时 15 毫秒
1.
Computational Grids and peer‐to‐peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large‐scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regulating the supply of and demand for resources and allocating them for applications based on the users' quality‐of‐service requirements. The framework requires economy‐driven deadline‐ and budget‐constrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users' requirements are met. In this paper, we propose a new scheduling algorithm, called the DBC cost–time optimization scheduling algorithm, that aims not only to optimize cost, but also time when possible. The performance of the cost–time optimization scheduling algorithm has been evaluated through extensive simulation and empirical studies for deploying parameter sweep applications on global Grids. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
2.
Grid computing technologies are now being largely deployed with the widespread adoption of the Globus Toolkit as the industrial standard Grid middleware. However, its inherent steep learning curve discourages the use of these technologies for non‐experts. Therefore, to increase the use of Grid computing, it is important to have high‐level tools that simplify the process of remote task execution. In this paper we introduce a middleware, developed on top of the Java Commodity Grid, which offers an object‐oriented, user‐friendly application programming interface, from the Java language, which eases remote task execution for computationally intensive applications. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
3.
Rafael Moreno-Vozmediano Srikumar Venugopal Hussein Gibbins 《Journal of Computer and System Sciences》2007,73(8):1164-1175
The financial services industry today produces and consumes huge amounts of data and the processes involved in analysing these data have large and complex resource requirements. The need to analyse the data using such processes and get meaningful results in time, can be met only up to a certain extent by current computer systems. Most service providers attempt to increase efficiency and quality of their service offerings by stacking up more hardware and employing better algorithms for data processing. However, there is a limit to the gains achieved by using such an approach. One viable alternative would be to use emerging technologies such as the Grid. Grid computing and its application to various domains have been actively studied by many groups for more than a decade now. In this paper we explore the use of the Grid in the financial services domain; an area which we believe has not been adequately looked into. 相似文献
4.
网格节点从大型主机扩展到小型智能设备,并要求支持语义和基于知识的互操作。该文提出一个适应这些发展趋势的两层网格节点中间件,其网格基础中间件增强本地操作系统,网格服务中间件支持复杂的网格应用。由于传统操作系统设计中的一些典型前提不适应网格的观点,将网格基础中间件设计为虚拟机监督程序、节点管理程序、策略管理程序和多个面向虚拟组织的虚拟机。讨论了网格服务中间件设计中把服务与主体技术结合的疗法。 相似文献
5.
Rosa M. Badia Jesús Labarta Raül Sirvent Josep M. Pérez José M. Cela Rogeli Grima 《Journal of Grid Computing》2003,1(2):151-170
The aim of GRID superscalar is to reduce the development complexity of Grid applications to the minimum, in such a way that writing an application for a computational Grid may be as easy as writing a sequential application. Our assumption is that Grid applications would be in a lot of cases composed of tasks, most of them repetitive. The granularity of these tasks will be of the level of simulations or programs, and the data objects will be files. GRID superscalar allows application developers to write their application in a sequential fashion. The requirements to run that sequential application in a computational Grid are the specification of the interface of the tasks that should be run in the Grid, and, at some points, calls to the GRID superscalar interface functions and link with the run-time library.GRID superscalar provides an underlying run-time that is able to detect the inherent parallelism of the sequential application and performs concurrent task submission. In addition to a data-dependence analysis based on those input/output task parameters which are files, techniques such as file renaming and file locality are applied to increase the application performance. This paper presents the current GRID superscalar prototype based on Globus Toolkit 2.x, together with examples and performance evaluation of some benchmarks. 相似文献
6.
Glenn Wasson Norm Beekwilder David Del Vecchio Mark Morgan Marty Humphrey 《Journal of Grid Computing》2008,6(2):177-194
Web services have changed the nature of distributed systems development and operation. The Grid community has begun architecting
Grid systems to leverage available commercial and open-source Web services technology through the definition of “stateful
resources.” These resource-oriented systems are an extension of service-oriented systems typically built using Web services
in that they treat state (and the management of state) as an architectural concern rather than an application-level concern.
We present the design, implementation, and evaluation of WSRF.NET, a toolkit for building resource-oriented services using
the Microsoft .NET platform. We describe the benefits WSRF.NET provides over “pure” .NET Web services for resource-oriented
systems development, in terms of programmability (both programming-language abstractions and compile-time tooling) and improved
run-time persistence/management of state. The run-time overhead of WSRF.NET is quantitatively evaluated against other technologies
that can be used to add state management to Web services. We argue the core WSRF.NET primitives incur negligible overhead
compared to typical domain-specific resource manipulation operations. For example, a computational simulation that lasts 10 min
and reads/writes 100 medium-sized resources over those 10 min incurs only 0.46% overhead in WSRF.NET operations. 相似文献
7.
Thomas Brady Jack Dongarra Michele Guidolin Alexey Lastovetsky Keith Seymour 《Concurrency and Computation》2010,22(18):2467-2487
The paper presents the SmartGridRPC model, an extension of the GridRPC model, which aims to achieve higher performance. The traditional GridRPC provides a programming model and API for mapping individual tasks of an application in a distributed Grid environment, which is based on the client‐server model characterized by the star network topology. SmartGridRPC provides a programming model and API for mapping a group of tasks of an application in a distributed Grid environment, which is based on the fully connected network topology. The SmartGridRPC programming model and API and its performance advantages over the GridRPC model are outlined in this paper. In addition, experimental results using a real‐world application are also presented. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
8.
While existing work concentrates on developing QoS models of business workflows and Web services, few tools have been developed
to support the monitoring and performance analysis of scientific workflows in Grids. This paper describes novel Grid services
for dynamic instrumentation of Grid-based applications, performance monitoring and analysis of Grid scientific workflows.
We describe a Grid dynamic instrumentation service that provides a widely accessible interface for other services and users
to conduct the dynamic instrumentation of Grid applications during the runtime. We introduce a Grid performance analysis service
for Grid scientific workflows. The analysis service utilizes various types of data including workflow graphs, monitoring data
of resources, execution status of activities, and performance measurements obtained from the dynamic instrumentation of invoked
applications, and provides a rich set of functionalities and features to support the online monitoring and performance analysis
of scientific workflows. Workflows and their relevant information including performance metrics are stored and utilized for
comparing the performance of constructs of different workflows and for supporting multi-workflow analysis.
The work described in this paper is supported in part by the Austrian Science Fund as part of the Aurora Project under contract
SFBF1104 and by the European Union through the IST-2002-511385 project K-WfGrid. 相似文献
9.
广域网虚拟平台:网格计算和对等计算的融合 总被引:4,自引:0,他引:4
近几年,分布式计算领域出现了两个研究热点:网格计算(Grid Computing)和对等计算(PeertoPeer Computing)。网格计算和对等计算以不同的方法组织大规模分布式的资源,包括计算能力、存储资源和带宽等。两者的研究领域有一定的重叠,又有很好的互补性,融合将是必然趋势。我们构想了一个广域网虚拟平台,全世界的计算机连接成一个整体,任何人随时随地都可以得到所需的资源和服务。正是这一理想,驱动着网格计算和对等计算技术的快速进步。 相似文献
10.
Three-dimensional simulation of discrete particle systems is performed by the discrete element method (DEM) software on the gLite-based BalticGrid infrastructure. The performance of a parallel algorithm for particles exchanging processors is investigated by using a number of benchmarks. Polydispersed particle systems are visualized by a novel grid e-service VizLitG designed for convenient access and interactive visualization of remote data files located on the grid. Partial dataset transfer from the storage element is implemented in the visualization e-service. The efficiency tests of VizLitG are performed on the datasets of different sizes. Two granular problems associated with triaxial compaction and hopper discharge are solved. 相似文献
11.
马季 《数字社区&智能家居》2006,(10):11-12
网格是互联网应用的新技术、新观念、新模式。它即将引发下一场信息产业的革命。本文对网格计算的基本概念进行了概要阐述。并从网格技术、网格应用价值前景方面进行了分析与探究。 相似文献
12.
网格计算——信息化应用的新浪潮 总被引:1,自引:0,他引:1
马季 《数字社区&智能家居》2006,(29)
网格是互联网应用的新技术、新观念、新模式。它即将引发下一场信息产业的革命。本文对网格计算的基本概念进行了概要阐述。并从网格技术、网格应用价值前景方面进行了分析与探究。 相似文献
13.
Computational Grids are emerging as a new infrastructure for high performance computing. Since the resources in a Grid can
be heterogeneous and distributed, mesh-based applications require a mesh partitioner that considers both processor and network
heterogeneity. We have developed a heterogeneous mesh partitioner, called PaGrid. PaGrid uses a multilevel graph partitioning
approach, augmented by execution time load balancing in the final uncoarsening phase. We show that minimization of total communication
cost (e.g., as used by JOSTLE) can lead to significant load being placed on processors connected by slow links, which results
in higher application execution times. Therefore, PaGrid balances the estimated execution time of the application across processors.
PaGrid performance is compared with two existing mesh partitioners, METIS 4.0 and JOSTLE 3.0, for mapping several application
meshes to two models of heterogeneous computational Grids. PaGrid is found to produce significantly better partitions than
JOSTLE and slightly better partitions than METIS in most cases, in terms of estimated application execution time averaged
over a large number of runs with different random number seeds. 相似文献
14.
Martin Waldburger Matthias Göhner Helmut Reiser Gabi Dreo Rodosek Burkhard Stiller 《Journal of Grid Computing》2009,7(2):181-204
Accounting of Grid resource and service usage determines the central support activity for Grid systems to be adopted as a
means for service-oriented computing in Dynamic Virtual Organizations (DVO). An all-embracing study of existing Grid accounting
systems has revealed that these approaches focus primarily on technical precision, while they lack a foundation of appropriate
economic accounting principles and the support for multi-provider scenarios or virtualization concepts. Consequently, a new,
flexible, resource-based accounting model for DVOs was developed, combining technical and economic accounting by means of
Activity-based Costing. Driven by a functional evaluation, this paper pursues a full-fledged evaluation of the new, generically
applicable Grid accounting model. This is done for the specific environment of the Leibniz Supercomputing Centre (LRZ) in
Garching, Germany. Thus, a detailed evaluation methodology and evaluation environment is outlined, leading to actual model-based
cost calculations for a defined set of considered Grid services. The results gained are analyzed and respective conclusions
on model applicability, optimizations, and further extensions are drawn. 相似文献
15.
当前,普适计算已经成为计算机科学中一个极具活力和影响力的研究领域。普适计算环境规模很大并且具有高度异构性,如网络架构的异构性、硬件平台的异构性、操作系统的异构性、应用服务的异构性等,而普适计算中间件技术可以解决异构性和跨平台特征,提供不同服务的集成应用,因此成为普适计算中的一个研究热点。基于此,本文对于目前国外关于普适计算中间件技术的研究现状做了一个总结;通过分析和比较,给出了普适计算中间件的设计原则;探讨了普适计算中间件技术的未来发展方向。 相似文献
16.
17.
贾玉罡 《数字社区&智能家居》2007,(9):1236-1237
网格计算是一种新型的分布计算技术。文章介绍了网格系统的概念、特点、功能,阐述了网格的体系结构。并对网格计算技术的应用前景作了分析。 相似文献
18.
Over the past few years, research and development in bioinformatics (e.g. genomic sequence alignment) has grown with each passing day fueling continuing demands for vast computing power to support better performance. This trend usually requires solutions involving parallel computing techniques because cluster computing technology reduces execution times and increases genomic sequence alignment efficiency. One example, mpiBLAST is a parallel version of NCBI BLAST that combines NCBI BLAST with message passing interface (MPI) standards. However, as most laboratories cannot build up powerful cluster computing environments, Grid computing framework concepts have been designed to meet the need. Grid computing environments coordinate the resources of distributed virtual organizations and satisfy the various computational demands of bioinformatics applications. In this paper, we report on designing and implementing a BioGrid framework, called G‐BLAST, that performs genomic sequence alignments using Grid computing environments and accessible mpiBLAST applications. G‐BLAST is also suitable for cluster computing environments with a server node and several client nodes. G‐BLAST is able to select the most appropriate work nodes, dynamically fragment genomic databases, and self‐adjust according to performance data. To enhance G‐BLAST capability and usability, we also employ a WSRF Grid Service Portal and a Grid Service GUI desk application for general users to submit jobs and host administrators to maintain work nodes. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
19.
The D0 experiment has used the European DataGrid (EDG) testbed to reprocess real data obtained from the Tevatron collider at the Fermi National Accelerator Laboratory. Pushing the use of the EDG software beyond feasibility studies has produced a set of recommendations for authors of experiment‐level software, for producers of middleware and for designers of Grid systems. This paper describes the D0 experience with the EDG software and the resulting recommendations. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
20.
What Does Grid Computing Cost? 总被引:1,自引:0,他引:1
Grid computing has gained considerable attention in research and industry. High expectations are associated with the approach. However, so far only few papers have been published about the costs caused by Grid computing. In this article we pursue two main goals: to analyze the different types of costs and to determine the total costs of a resource provider. Our approach is based on the discussion of general cost categories that have to be taken into account. We give concrete numbers for the different categories and use these numbers to estimate the costs in two real life Grids: the EGEE project and the Grid of the pharmaceutical company Novartis. A summarizing discussion concludes the paper. 相似文献