Middleware for Grid Computing最新文献

筛选
英文 中文
Removing the need for state dissemination in grid resource brokering 消除了网格资源代理中状态传播的需要
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376858
P. Hasselmeyer
{"title":"Removing the need for state dissemination in grid resource brokering","authors":"P. Hasselmeyer","doi":"10.1145/1376849.1376858","DOIUrl":"https://doi.org/10.1145/1376849.1376858","url":null,"abstract":"Resource brokering in Grids is nowadays handled by resource brokers that require detailed knowledge of the state of the resources that they broker. In business settings, surrendering internal information on resources to an outside party is not an option. The traditional resource brokering method based on intimate resource knowledge is therefore not a viable possibility.\u0000 This paper argues that the publication of resource state data is not needed for resource brokering. Instead, we advocate the use of service level agreements (SLAs). The use of SLAs for brokering lets providers keep state information internal and at the same time provides customers with guarantees on the used services.\u0000 The proposed model has been implemented in the form of a resource broker that is based on Web Service technology. It shows that the approach of using SLAs for scheduling is a possible solution to keeping resource state private.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126483222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Semantics-based grid resource management 基于语义的网格资源管理
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376856
A. Vidal, F. Silva, S. Kofuji, Fabio Kon
{"title":"Semantics-based grid resource management","authors":"A. Vidal, F. Silva, S. Kofuji, Fabio Kon","doi":"10.1145/1376849.1376856","DOIUrl":"https://doi.org/10.1145/1376849.1376856","url":null,"abstract":"Scheduling parallel and distributed applications efficiently onto grid environments is a difficult task and a great variety of scheduling heuristics have been developed aiming to address this issue. A successful grid resource allocation depends, among other things, on the quality of the available information about software artifacts and grid resources. In this paper, we propose a semantic approach to integrate selection of equivalent resources and selection of equivalent software artifacts in order to improve the schedule of resources suitable for a given set of application execution requirements. We also describe a prototype implementation of our approach based on the Integrade grid middleware and experimental results that indicate its benefits.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130360821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Using checkpointing to recover from poor multi-site parallel job scheduling decisions 使用检查点从糟糕的多站点并行作业调度决策中恢复
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376851
William M. Jones
{"title":"Using checkpointing to recover from poor multi-site parallel job scheduling decisions","authors":"William M. Jones","doi":"10.1145/1376849.1376851","DOIUrl":"https://doi.org/10.1145/1376849.1376851","url":null,"abstract":"Recent research in multi-site parallel job scheduling leverages user-provided estimates of job communication characteristics to effectively partition the job across multiple clusters. Previous research addressed the impact of inaccuracies in these estimates on overall system performance and found that multi-site scheduling techniques benefit from these estimates, even in the presence of considerable inaccuracy. While these results are encouraging, there are many instances where these errors result in poor scheduling decisions that cause network over-subscription. This situation can lead to significantly degraded application runtime performance and turnaround time.\u0000 In this paper, we explore the use of job checkpointing to selectively stop offending jobs in order to alleviate network congestion and subsequently restart them when (and where) sufficient network resources are available. We then characterize the conditions and the extent to which checkpointing improves overall performance. We demonstrate that checkpointing is beneficial even when the overhead of doing so is costly.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A multi-commodity flow approach to maximising utility in linked market-based grids 在以市场为基础的互联电网中实现效用最大化的多商品流方法
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376854
J. Broberg, R. Buyya
{"title":"A multi-commodity flow approach to maximising utility in linked market-based grids","authors":"J. Broberg, R. Buyya","doi":"10.1145/1376849.1376854","DOIUrl":"https://doi.org/10.1145/1376849.1376854","url":null,"abstract":"In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtualise and make available the resources of multiple service providers, achieving greater economies of scale, improving throughput and potentially reducing cost. Customers compete against each other by assigning a utility value or function to the successful processing of their jobs in an effort to have them prioritised in the face of contested and constrained resources. Brokers and service providers also attempt to maximise the utility they gain, choosing to process jobs that will earn them the highest profit with respect to the resources required. For this to be effective over many linked computing marketplaces highly distributed resource allocation is needed, where each participant can operate independently using only local information, and ideally reach a global state where all participants are satisfied. We model such a system by adapting the classical multi-commodity flow problem to the market-based, utility driven distributed systems, where all participants selfishly attempt to maximise their own gain. We then obtain a utility-aware distributed algorithm that generates increased utility for participants in such systems, especially under scenarios of high contention.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123501168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A pricing information service for grid computing 用于网格计算的定价信息服务
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376853
A. Caracas, J. Altmann
{"title":"A pricing information service for grid computing","authors":"A. Caracas, J. Altmann","doi":"10.1145/1376849.1376853","DOIUrl":"https://doi.org/10.1145/1376849.1376853","url":null,"abstract":"This paper addresses two shortcomings that exist in the area of pricing Grid services in an economic Grid environment. The first shortcoming is that there are no standards for pricing schemes, caused by a large difference in the units that are traded (e.g. CPU cycles or virtual clusters) in Grid computing. The second shortcoming is the lack of a model for managing the pricing of informational elements (e.g. software applications) and computational elements (e.g. virtual machines, which comprise resources such as CPU, memory, disk space, network bandwidth). This paper presents a pricing service for Grid computing services, which resolves the shortcomings by introducing a general pricing scheme for informational and computational elements. We describe the functional requirements, architecture, and the interfaces of the pricing service. The pricing service allows expressing the proposed general pricing scheme as an XML document, which can be linked to service level agreements. Contrary to other proposals on pricing, the pricing service is separated from the functionality of metering, accounting, and payment. To validate the concept of a pricing information service, we portray two Utility Computing scenarios.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130166702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
An autonomic network-aware scheduling architecture for grid computing 面向网格计算的自主网络感知调度体系结构
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376850
A. Caminero, O. Rana, María Blanca Caminero, C. Carrión
{"title":"An autonomic network-aware scheduling architecture for grid computing","authors":"A. Caminero, O. Rana, María Blanca Caminero, C. Carrión","doi":"10.1145/1376849.1376850","DOIUrl":"https://doi.org/10.1145/1376849.1376850","url":null,"abstract":"Grid technologies have enabled the aggregation of geographically distributed resources, in the context of a particular application. The network remains an important requirement for any Grid application, as entities involved in a Grid system (such as users, services, and data) need to communicate with each other over a network. The performance of the network must therefore be considered when carrying out tasks such as scheduling, migration or monitoring of jobs. Surprisingly, many existing QoS efforts ignore the network and focus instead on processor workload and disk access. Making use of the network in an efficient and fault tolerance manner, in the context of such existing research, leads to a significant number of research challenges. One way to address these problems is to make Grid middleware incorporate the concept of autonomic systems. Such a change would involve the development of \"self-configuring\" systems that are able to make decisions autonomously, and adapt themselves as the system status changes. We propose an autonomic network-aware scheduling infrastructure that is capable of adapting its behavior to the current status of the environment.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Fair access to scarce resources in ad-hoc grids using an economic-based approach 以经济为基础的方法,在特设电网中公平获取稀缺资源
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376857
B. Pourebrahimi, K. Bertels
{"title":"Fair access to scarce resources in ad-hoc grids using an economic-based approach","authors":"B. Pourebrahimi, K. Bertels","doi":"10.1145/1376849.1376857","DOIUrl":"https://doi.org/10.1145/1376849.1376857","url":null,"abstract":"In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In this paper, we present how using an economic-based approach, the tasks can be distributed evenly among the scarce resources. Such that all nodes which have tasks to be executed, receive more or less equal utilization from the Grid resources. We consider a continuous double auction protocol as the economic approach to share idle cpu cycles among the nodes in a local ad-hoc Grid. Each node is given a limited budget when joining the Grid. The node can use it to buy required resources or increases its budget by selling idle resources. Consumers and producers of resources determine their bid and ask prices using a dynamic pricing strategy and the auctioneer adopts a discriminatory pricing policy which sets the transaction price individually for each matched buyer-seller pair. We experiment in a network where the resources are scarce and the tasks outnumber the resources. The spread of task utilization at individual nodes and the level of load balancing are measured and compared with a non-economic approach. The results show that economic-based approach provides a fair and balanced basis for access to Grid resources for everyone while in the same time gives a satisfactory level of system performance.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124335766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Multiobjective differential evolution for workflow execution on grids 网格上工作流执行的多目标差分进化
Middleware for Grid Computing Pub Date : 2007-11-26 DOI: 10.1145/1376849.1376852
Akm Khaled Ahsan Talukder, M. Kirley, R. Buyya
{"title":"Multiobjective differential evolution for workflow execution on grids","authors":"Akm Khaled Ahsan Talukder, M. Kirley, R. Buyya","doi":"10.1145/1376849.1376852","DOIUrl":"https://doi.org/10.1145/1376849.1376852","url":null,"abstract":"Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (eg. execution cost and time may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics rather than a deterministic algorithm. In this paper we have proposed a workflow execution planning approach using Multiobjective Differential Evolution (MODE). Our goal was to generate a set of trade-off schedules according to two user specified QoS requirements (time and cost). The alternative tradeoff solutions offer more flexibility to users when estimating their QoS requirements of workflow executions. We have compared our results with two baseline multiobjective evolutionary algorithms. Simulation results show that our modified MODE is able to find a comparatively better spread of compromise solutions.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130705830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Hierarchical submission in a Grid environment 网格环境中的分层提交
Middleware for Grid Computing Pub Date : 2005-11-28 DOI: 10.1145/1101499.1101513
P. Vargas, I. Dutra, V. D. D. Nascimento, Lucas A. S. Santos, L. Silva, C. Geyer, B. Schulze
{"title":"Hierarchical submission in a Grid environment","authors":"P. Vargas, I. Dutra, V. D. D. Nascimento, Lucas A. S. Santos, L. Silva, C. Geyer, B. Schulze","doi":"10.1145/1101499.1101513","DOIUrl":"https://doi.org/10.1145/1101499.1101513","url":null,"abstract":"One of the challenges in grid computing research is to provide means to automatically submit, manage, and monitor applications which spread a large number of tasks. The usual way of managing these tasks is to represent each one as an explicit node in a graph, and this is the approach taken by many grid systems up to date. This approach can quickly saturate the machine where the application is launched, as we increase the number of tasks. In this work we present and validate a novel architectural model, GRAND (Grid Robust ApplicatioN Deployment), whose main objective is to deal with the problem of memory and load saturation of the submission machine. GRAND is implemented at a middleware level, aiming at providing a distributed task submission through a hierarchical organization. This paper provides an overview of the GRAND submission model as well our implementation. Initial results show that our approach can be much more effective than other approaches in the literature.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Peer-to-peer resource discovery in mobile Grids 移动网格中的点对点资源发现
Middleware for Grid Computing Pub Date : 2005-11-28 DOI: 10.1145/1101499.1101510
Luciana dos S. Lima, A. A. Gomes, A. Ziviani, M. Endler, L. Soares, B. Schulze
{"title":"Peer-to-peer resource discovery in mobile Grids","authors":"Luciana dos S. Lima, A. A. Gomes, A. Ziviani, M. Endler, L. Soares, B. Schulze","doi":"10.1145/1101499.1101510","DOIUrl":"https://doi.org/10.1145/1101499.1101510","url":null,"abstract":"Grids are likely to be the mainstay of distributed computing. Grid was firstly applied as a concept for sharing computing resources among wired nodes, but there has been a growing interest in extending this concept to mobile environments. Although significant work has been done towards mobile grids, much of it has followed centralized approaches based on infrastructure wireless networks. We believe that a less restrictive, decentralized approach that supports mobile collaboration in ad-hoc wireless networks can cater for novel grid applications. To address this issue, we propose a middleware architecture called MoGrid. MoGrid orchestrates the distribution of grid tasks among mobile devices in a peer-to-peer (P2P) fashion. In this paper, we focus on the P2P Discovery Protocol (P2PDP), which is a central element of our architecture. P2PDP aids in distributing tasks among the most resourceful devices, while mitigating the overhead of control messages exchanged among them. We describe a prototype implementation of our architecture and discuss some issues related to the adoption of P2PDP as an ad-hoc resource discovery mechanism in mobile grids.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126764517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信