发布求助
文献互助 智能选刊 最新文献

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)最新文献

筛选
英文 中文
Agent-Based Resource Management for Grid Computing 网格计算中基于agent的资源管理
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2011-07-07 DOI: 10.1109/CCGRID.2002.1017159
Junwei Cao, D. P. Spooner, James D. Turner, S. Jarvis, D. Kerbyson, S. Saini, G. Nudd
{"title":"Agent-Based Resource Management for Grid Computing","authors":"Junwei Cao, D. P. Spooner, James D. Turner, S. Jarvis, D. Kerbyson, S. Saini, G. Nudd","doi":"10.1109/CCGRID.2002.1017159","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017159","url":null,"abstract":"It is envisaged that the grid infrastructure will be a large-scale distributed software system that will provide high-end computational and storage capabilities to differentiated users. A number of distributed computing technologies are being applied to grid development work, including CORBA and Jini. In this work, we introduce an A4 (Agile Architecture and Autonomous Agents) methodology, which can be used for resource management for grid computing. An initial system implementation utilises the performance prediction techniques of the PACE toolkit to provide quantitative data regarding the performance of complex applications running on local grid resources. At the meta-level, a hierarchy of identical agents is used to provide an abstraction of the system architecture. Each agent is able to cooperate with other agents to provide service advertisement and discovery to schedule applications that need to utilise grid resources. A performance monitor and advisor (PMA) is in development to optimize the performance of agent behaviours.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130246360","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}
引用次数: 71
A Malleable-Job System for Timeshared Parallel Machines 分时并行机的可塑作业系统
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017131
L. Kalé, Sameer Kumar, J. Desouza
{"title":"A Malleable-Job System for Timeshared Parallel Machines","authors":"L. Kalé, Sameer Kumar, J. Desouza","doi":"10.1109/CCGRID.2002.1017131","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017131","url":null,"abstract":"Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of such jobs is that a job scheduler for malleable jobs can provide improved system utilization and average response time over a scheduler for traditional jobs. In this paper, we present a programming system for creating malleable jobs that is more general than other current malleable systems. In particular, it is not limited to the master-worker paradigm or the Fortran SPMD programming model, but can also support general purpose parallel programs including those written in MPI and Charm++, and has built-in migration and load-balancing, among other features.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126174230","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}
引用次数: 86
Adaptive Scheduling under Memory Pressure on Multiprogrammed Clusters 多程序集群内存压力下的自适应调度
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017108
Dimitrios S. Nikolopoulos, C. Polychronopoulos
{"title":"Adaptive Scheduling under Memory Pressure on Multiprogrammed Clusters","authors":"Dimitrios S. Nikolopoulos, C. Polychronopoulos","doi":"10.1109/CCGRID.2002.1017108","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017108","url":null,"abstract":"This paper presents scheduling techniques that enable the adaptation of parallel programs to clustered computational farms with limited memory capacity. The purpose of the techniques is to coschedule communicating processes and prevent paging, using two cooperating extensions to the kernel scheduler. A paging prevention module enables memory-bound programs to adapt to memory short-age, by suspending their threads at well-defined execution points. The associated operating system interface provides a generic mechanism that enables programs to adapt in different ways, including application-specific forms of adaptation. At the same time, a dynamic coscheduling heuristic implemented in the kernel scheduler increases periodically the priority of communicating processes so that parallel jobs are eased through communication points. We show that when a parallel job competes with randomized sequential load running in the nodes of the cluster, the combination of coscheduling and paging prevention reduces drastically the slowdown of the job at high levels of memory utilization. We also show that if memory resources are ample, coscheduling should take priority over paging prevention, whereas if memory resources are scarce, preventing paging should take priority over coscheduling.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115335118","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}
引用次数: 11
Scalability Analysis of the Contract Net Protocol 合约网协议的可扩展性分析
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017157
Z. Juhász, P. Paul
{"title":"Scalability Analysis of the Contract Net Protocol","authors":"Z. Juhász, P. Paul","doi":"10.1109/CCGRID.2002.1017157","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017157","url":null,"abstract":"Multi-agent systems have been proposed for creating large grid computing systems. This paper investigates the performance and scalability of the Contract Net protocol. We have developed a testbed multi-agent system and measured the task execution times under different agent load. The paper shows how the system response time depends on the number of agents and the deadline value.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953378","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}
引用次数: 28
Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid 数据网格上基于经济的文件访问和复制优化
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017156
Mark James Carman, F. Zini, L. Serafini, Kurt Stockinger
{"title":"Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid","authors":"Mark James Carman, F. Zini, L. Serafini, Kurt Stockinger","doi":"10.1109/CCGRID.2002.1017156","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017156","url":null,"abstract":"We are working on a system for the optimised access and replication of data on a Data Grid. Our approach is based on the use of an economic model that includes the actors and the resources in the Grid. Optimisation is obtained via interaction of the actors in the model, whose goals are maximising the profits and minimising the costs of data resource management. In the system, local optimisation results in global optimisation through emergent marketplace behaviour. In this paper we give an overview of our model and present part of the complex economic reasoning required to support this desired marketplace interaction model.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123632240","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}
引用次数: 108
The Virtual Shared Memory Performance of a Parallel Graph Reducer 并行图减速器的虚拟共享内存性能
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017152
Hans-Wolfgang Loidl
{"title":"The Virtual Shared Memory Performance of a Parallel Graph Reducer","authors":"Hans-Wolfgang Loidl","doi":"10.1109/CCGRID.2002.1017152","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017152","url":null,"abstract":"This paper assesses the costs of maintaining a virtual shared heap in our parallel graph reducer (GUM), which implements a parallel functional language. GUM performs automatic and dynamic resource management for both work and data. We introduce extensions to the original design of GUM, aiming at a more flexible memory management and communication mechanism to deal with high-latency systems. We then present measurements of running GUM on a Beowulf cluster, evaluating the overhead of dynamic distributed memory management and the effectiveness of the new memory management and communication mechanisms.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211301","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}
引用次数: 10
Three Tools to Help with Cluster and Grid Computing: SANS-Effort, PAPI, and NetSolve 帮助集群和网格计算的三个工具:SANS-Effort, PAPI和NetSolve
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017098
J. Dongarra
{"title":"Three Tools to Help with Cluster and Grid Computing: SANS-Effort, PAPI, and NetSolve","authors":"J. Dongarra","doi":"10.1109/CCGRID.2002.1017098","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017098","url":null,"abstract":"In this tutorial, we will look at some methods for generating automatically fast robust numerical kernels for numerical operations and methods for measuring the performance on today’s processors. In addition, we will look at a system called NetSolve that allows users to access computational resources, such as hardware and software, distributed across the network. This project has been motivated by the need for an easy-to-use, efficient mechanism for using computational resources remotely. Ease of use is obtained as a result of different interfaces, some of which do not require any programming effort from the user. Good performance is ensured by a load-balancing policy that enables NetSolve to use the computational resource available as efficiently as possible. NetSolve offers the ability to look for computational resources on a network, choose the best one available, solve a problem (with retry for fault-tolerance) and return the answer to the user.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121657213","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}
引用次数: 1
Scheduling Co-Reservations with Priorities in Grid Computing Systems 网格计算系统中具有优先级的协同预留调度
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017136
Rui Min, Muthucumaru Maheswaran
{"title":"Scheduling Co-Reservations with Priorities in Grid Computing Systems","authors":"Rui Min, Muthucumaru Maheswaran","doi":"10.1109/CCGRID.2002.1017136","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017136","url":null,"abstract":"This paper presents three algorithms for co-reserving resources. A novel mechanism for specifying QoS constraints with the requests is introduced. The performance of the algorithms are studied through extensive simulations. The results indicate that depending on the objective of optimization different algorithms should be used. One of the distinguishing features of our algorithms is that they operate in a pseudo-online mode (called the “batch” mode).","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293815","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}
引用次数: 51
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities 通过大型点对点社区中的动态模型驱动复制提高数据可用性
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017164
K. Ranganathan, Adriana Iamnitchi, Ian T Foster
{"title":"Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities","authors":"K. Ranganathan, Adriana Iamnitchi, Ian T Foster","doi":"10.1109/CCGRID.2002.1017164","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017164","url":null,"abstract":"Efficient data sharing in global peer-to-peer systems is complicated by erratic node failure, unreliable network connectivity and limited bandwidth. Replicating data on multiple nodes can improve availability and response time. Yet determining when and where to replicate data in order to meet performance goals in large-scale systems with many users and files, dynamic network characteristics, and changing user behavior is difficult. We propose an approach in which peers create replicas automatically in a decentralized fashion, as required to meet availability goals. The aim of our framework is to maintain a threshold level of availability at all times. We identify a set of factors that hinder data availability and propose a model that decides when more replication is necessary. We evaluate the accuracy and performance of the proposed model using simulations. Our preliminary results show that the model is effective in predicting the required number of replicas in the system.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134146583","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}
引用次数: 235
Agents Based Load Balancing with Component Distribution Capability 具有组件分发能力的基于代理的负载平衡
2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02) Pub Date : 2002-05-21 DOI: 10.1109/CCGRID.2002.1017161
S. Desic, D. Huljenic
{"title":"Agents Based Load Balancing with Component Distribution Capability","authors":"S. Desic, D. Huljenic","doi":"10.1109/CCGRID.2002.1017161","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017161","url":null,"abstract":"Distributed processing has become inevitable in many areas today. It can be found in localized systems like multiprocessor computers, in client-server network configurations, in computer clusters or in widely dispersed systems like the Internet. Development of effective techniques for task distribution is considered as one of the biggest issues in parallel and distributed operating environment. Over the past years, a number of load balancing methods has been proposed. This paper describes simulation used for methods comparison. Contrary to the vast of known methods, which are based on client/server technology, a few recent methods are based on mobile agents. This article gives short review of achievements in this area and describes simulation used for agents based load balancing methods comparison. The paper also suggests enhancement in load balancing: mobile agents could include fresh node into the system by installing and starting necessary software components.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124547194","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书