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

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)最新文献

筛选
英文 中文
Scheduling deadline-constrained bulk data transfers to minimize network congestion 调度受截止日期限制的批量数据传输以最小化网络拥塞
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.102
B. Chen, P. Primet
{"title":"Scheduling deadline-constrained bulk data transfers to minimize network congestion","authors":"B. Chen, P. Primet","doi":"10.1109/CCGRID.2007.102","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.102","url":null,"abstract":"Tight coordination of resource allocation among end points in Grid networks often requires a data mover service to transfer a voluminous dataset from one site to another in a specified time interval. With flexibility at its best, the transfer can start from any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. Given a set of such tasks, we study the Bulk Data Transfer Scheduling (BDTS) problem, which searches for the optimal bandwidth allocation profile for each task to minimize the overall network congestion. We show that the multi-interval scheduling, which divides the active window of a task into multiple intervals and assigns bandwidth value independently in each of them, is both sufficient and necessary to attain the optimality in BDTS. Specifically, we show that BDTS can be solved in polynomial time as a Maximum Concurrent Flow Problem. The optimal solution attained is in the form of multi-interval scheduling with the number of intervals upper-bounded. Simulations are conducted over several representative topologies to demonstrate the significant advantage of optimal solutions.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124420800","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}
引用次数: 60
Optimizing jobs timeouts on clusters and production grids 优化集群和生产网格上的作业超时
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.78
T. Glatard, X. Pennec
{"title":"Optimizing jobs timeouts on clusters and production grids","authors":"T. Glatard, X. Pennec","doi":"10.1109/CCGRID.2007.78","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.78","url":null,"abstract":"This paper presents a method to optimize the timeout value of computing jobs. It relies on a model of the job execution time that considers the job management system latency through a random variable. It also takes into account a proportion of outliers to model either reliable clusters or production grids characterized by faults causing jobs loss. Job management systems are first studied considering classical distributions. Different behaviors are exhibited, depending on the weight of the tail of the distribution and on the amount of outliers. Experimental results are then shown based on the latency distribution and outlier ratios measured on the EGEE grid infrastructure1. Those results show that using the optimal timeout value provided by our method reduces the impact of outliers and leads to a 1.36 speed-up even for reliable systems without outliers.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126640936","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
GiGi: An Ocean of Gridlets on a "Grid-for-the-Masses" GiGi:“大众电网”上的网格海洋
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.54
L. Veiga, R. Rodrigues, P. Ferreira
{"title":"GiGi: An Ocean of Gridlets on a \"Grid-for-the-Masses\"","authors":"L. Veiga, R. Rodrigues, P. Ferreira","doi":"10.1109/CCGRID.2007.54","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.54","url":null,"abstract":"There have been a few proposals aiming at bridging the gap between institutional grid infrastructures (e.g., Globus-based), popular cycle-sharing applications (e.g., SETIQhome), and massively used decentralized P2P file-sharing applications. Nonetheless, no such infrastructure was ever successful in allowing, in a large-scale, home users to run popular desktop applications faster, by using spare cycles in other users' machines and, in return, donate their spare cycles to run other users' applications. We present a novel application and programming model that was designed to overcome some of the barriers to the deployment of a generic peer-to-peer grid infrastructure. In particular, we want to enable a trivial deployment in such infrastructures of existing applications that are in widespread use but do not currently exploit parallelism for improved performance. The model presented in this paper revolves around the concept of a Gridlet, a semantics-aware unit of workload division and computation off-load. A gridlet is a chunk of data associated with the operations to be performed on the data, and in many cases these operations consist of unmodified application binaries. Moreover, the concept of gridlet is also employed for resource management, and accounting of peer contribution. We believe this new concept, absent in other proposals, will significantly lower the barriers for exploiting parallel execution in popular applications, thus improving the chances of the gridlet model being widely adopted.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703901","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}
引用次数: 31
Applications ported to the EELA e-Infrastructure 移植到EELA电子基础设施的应用程序
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.24
B. Marechal, P. Bello, D. Carvalho, R. Mayo
{"title":"Applications ported to the EELA e-Infrastructure","authors":"B. Marechal, P. Bello, D. Carvalho, R. Mayo","doi":"10.1109/CCGRID.2007.24","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.24","url":null,"abstract":"The EELA Project (E-Infrastructure shared between Europe and Latin America) is a collaboration between Latin American and European institutions that has developed a potent e-Infrastructure for e-Science applications. Nowadays, several groups have ported their applications to the EELA Grid framework and are obtaining their first results thanks to the e-Infrastructure that has been created. This paper describes the applications already ported and the progress achieved so far. The EELA project is funded by the European Commission under the contract number IST-2006-026409.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130634410","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}
引用次数: 2
Sustaining Incentive in Grid Resource Allocation: A Reinforcement Learning Approach 网格资源分配中的持续激励:一种强化学习方法
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.113
Li Lin, Yu Zhang, J. Huai
{"title":"Sustaining Incentive in Grid Resource Allocation: A Reinforcement Learning Approach","authors":"Li Lin, Yu Zhang, J. Huai","doi":"10.1109/CCGRID.2007.113","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.113","url":null,"abstract":"Encouraging resource sharing and cooperation among different parties is one of the central goals of grid computing. In real environments, however, selfish or malicious nodes can seriously degrade the sharing and cooperation performance of a grid. To solve this problem, we propose QIA, a novel Q-learning based resource Allocation mechanism that sustains Incentive for every participating node. Exploiting an economic model, QIA recognizes the importance of trust factor when allocating resources. Each provider considers a combined metric, which is composed of the bid price and the trust value, of a requester when allocating its resources. The incomplete information is a key issue for a provider in determining the relative weight of bid price and trust value. We propose a reinforcement Q- learning technique to resolve the issue, which is able to adapt the dynamics of grid environments. We implemented QIA in a real grid test-bed, CROWN grid. Comprehensive experiments have been conducted, which demonstrate the efficacy of QIA.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130678613","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
On the Advantages of an Alternative MPI Execution Model for Grids 一种网格替代MPI执行模型的优势
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.74
A. Sena, A. P. Nascimento, J. A. D. Silva, Daniela Vianna, Cristina Boeres, Vinod E. F. Rebello
{"title":"On the Advantages of an Alternative MPI Execution Model for Grids","authors":"A. Sena, A. P. Nascimento, J. A. D. Silva, Daniela Vianna, Cristina Boeres, Vinod E. F. Rebello","doi":"10.1109/CCGRID.2007.74","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.74","url":null,"abstract":"The MPI message passing library is used extensively in the scientific community as a tool for parallel programming. Even though improvements have been made to existing implementations to support execution on computational grids, MPI was initially designed to deal with homogeneous, fault- free, static environments such as computing clusters. The typical programming approach is to execute a single MPI process on each resource. However, this may not be appropriate for heterogeneous, non-dedicated and dynamic environments such as grids. This paper aims to show that programmers can implement parallel MPI solutions to their problems in an architectural independent style and obtain good performance on a grid by transferring responsibility to an application management system (AMS). A comparison of program implementations under a traditional MPI execution model and a fine-grain model highlight the advantages of using the latter.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125637001","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}
引用次数: 9
Impact of the execution context on Grid job performances 执行上下文对网格作业性能的影响
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.62
T. Glatard, D. Lingrand, J. Montagnat, M. Riveill
{"title":"Impact of the execution context on Grid job performances","authors":"T. Glatard, D. Lingrand, J. Montagnat, M. Riveill","doi":"10.1109/CCGRID.2007.62","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.62","url":null,"abstract":"In this paper, we examine how the execution context of grid jobs can help to refine submission strategies on a production grid. On this kind of infrastructure, the latency highly impacts performances. We present experiments that quantify the dependencies between the grid latency and both internal and external context parameters on the EGEE grid infrastructure. We show how job submission managers, job execution sites and the submission date can be statistically correlated to grid performances.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418255","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}
引用次数: 19
Economic Model for Replicated Database Placement in Grid 网格中复制数据库放置的经济模型
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.47
Cherif Haddad, Y. Slimani
{"title":"Economic Model for Replicated Database Placement in Grid","authors":"Cherif Haddad, Y. Slimani","doi":"10.1109/CCGRID.2007.47","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.47","url":null,"abstract":"Grid infrastructures enable the creation of virtual organizations for sharing distributed resources across the world with different usage or access policies, different cost models, and varying workloads and availability. Database plays an important role in fulfilling the data management requirements of Grid applications thanks to its advanced data management capability. However, when we want to integrate databases in a grid, we have to address a number of issues. One of them is the problem of database placement. In this paper, we define an economic model for the problem of database placement in Grid architecture. We propose an economic model for regulating data supply and queries. Our proposal is evaluated with OptorSim simulator. The experiments show that our proposed model results in a notable improvement for distributed query processing.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134209228","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
Virtual Clusters on the Fly - Fast, Scalable, and Flexible Installation 运行中的虚拟集群——快速、可伸缩和灵活的安装
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.121
H. Nishimura, N. Maruyama, S. Matsuoka
{"title":"Virtual Clusters on the Fly - Fast, Scalable, and Flexible Installation","authors":"H. Nishimura, N. Maruyama, S. Matsuoka","doi":"10.1109/CCGRID.2007.121","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.121","url":null,"abstract":"One of the advantages in virtualized computing clusters compared to traditional shared HPC environments is their ability to accommodate user-specific system customization. However, past attempts to providing virtual clusters are not scalable with increasing number of VMs, nor do they allow fine-grained customization of VMs, assuming that preconfigured VM images are always available on the grid. We propose a new virtual cluster installation technique that achieves efficiency and scalability, and yet simultaneously fine-grained customizability. It allows the user to create VMs on the fly for fine-grained customization of VMs, and pipelined data transfer for scalable installation with increasing number of VMs. To achieve efficiency in the presence of such full customization, it automatically caches frequently-constructed virtual disk images to save software installation time in common cases. Our experimental studies using a prototype implementation show that installation of a 190-node virtual cluster can be done in 40 seconds. From this result along with a scalability study, we estimate that installation of a 1000-node virtual cluster could be done in less than two minutes.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115094300","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}
引用次数: 85
Fair Game-Theoretic Resource Management in Dedicated Grids 专用网格中的公平博弈论资源管理
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.52
K. Rządca, D. Trystram, A. Wierzbicki
{"title":"Fair Game-Theoretic Resource Management in Dedicated Grids","authors":"K. Rządca, D. Trystram, A. Wierzbicki","doi":"10.1109/CCGRID.2007.52","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.52","url":null,"abstract":"We study two problems directly resulting from organizational decentralization of the grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has complete control of processors' schedules. Secondly, the problem of fair and feasible scheduling in decentralized case, in which the grid scheduler can only suggest a schedule, which can be later modified by a processor's owner. Using game theory, we show that scheduling in decentralized case is analogous to the prisoner's dilemma game. Moreover, the Nash equilibrium results in significant performance drop. Therefore, a strong community control is required to achieve acceptable performance.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948644","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}
引用次数: 72
首页 上一页 下一页 尾页
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学术官方微信