2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing最新文献_第3页

mPlogP: A Parallel Computation Model for Heterogeneous Multi-core Computer 异构多核计算机的并行计算模型

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.60

Liang Li, Xingjun Zhang, Jinghua Feng, Xiaoshe Dong

引用次数: 9

Planning Large Data Transfers in Institutional Grids 规划机构网格中的大数据传输

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.68

Fatiha Bouabache, T. Hérault, Sylvain Peyronnet, F. Cappello

{"title":"Planning Large Data Transfers in Institutional Grids","authors":"Fatiha Bouabache, T. Hérault, Sylvain Peyronnet, F. Cappello","doi":"10.1109/CCGRID.2010.68","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.68","url":null,"abstract":"In grid computing, many scientific and engineering applications require access to large amounts of distributed data. The size and number of these data collections has been growing rapidly in recent years. The costs of data transmission take a significant part of the global execution time. When communication streams flow concurrently on shared links, transport control protocols have issues allocating fair bandwidth to all the streams, and the network becomes sub-optimally used. One way to deal with this situation is to schedule the communications in a way that will induce an optimal use of the network. We focus on the case of large data transfers that can be completely described at the initialization time. In this case, a plan of data migration can be computed at initialization time, and then executed. However, this computation phase must take a small time when compared to the actual execution of the plan. We propose a best effort solution, to compute approximately, based on the uniform random sampling of possible schedules, a communication plan. We show the effectiveness of this approach both theoretically and by simulations.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125769830","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

Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks 非结构化对等网络中基于ttl的动态搜索

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.66

Imen Filali, F. Huet

{"title":"Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks","authors":"Imen Filali, F. Huet","doi":"10.1109/CCGRID.2010.66","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.66","url":null,"abstract":"Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorithms used in such systems. Blind flooding is not scalable because of its high communication cost. On the other hand, the performance of random walks approaches largely depends on the random choice of walks. Some informed mechanisms use additional information, usually obtained from previous queries, for routing. Such approaches can reduce the traffic overhead but they limit the query coverage. Furthermore, they usually rely on complex protocols to maintain information at each peer. In this paper, we propose two schemes which can be used to improve the search performance in unstructured peer-to-peer networks. The first one is a simple caching mechanism based on resource descriptions. Peers that offer resources send periodic advertisement messages. These messages are stored into a cache and are used for routing requests. The second is a dynamic Time-To-Live (TTL) which enables messages to break their horizon. Instead of decreasing the query TTL by 1 at each hop, it is decreased by a value v such as 0","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124564907","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}

引用次数: 25

Energy Efficient Allocation of Virtual Machines in Cloud Data Centers 云数据中心中虚拟机的节能分配

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.45

A. Beloglazov, R. Buyya

引用次数: 492

Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS 基于DVFS集群的优先级约束并行任务能量感知调度研究

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.19

Lizhe Wang, G. Laszewski, Jai Dayal, Fugang Wang

{"title":"Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS","authors":"Lizhe Wang, G. Laszewski, Jai Dayal, Fugang Wang","doi":"10.1109/CCGRID.2010.19","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.19","url":null,"abstract":"Reducing energy consumption for high end computing can bring various benefits such as, reduce operating costs, increase system reliability, and environment respect. This paper aims to develop scheduling heuristics and to present application experience for reducing power consumption of parallel tasks in a cluster with the Dynamic Voltage Frequency Scaling (DVFS) technique. In this paper, formal models are presented for precedence-constrained parallel tasks, DVFS enabled clusters, and energy consumption. This paper studies the slack time for non-critical jobs, extends their execution time and reduces the energy consumption without increasing the task’s execution time as a whole. Additionally, Green Service Level Agreement is also considered in this paper. By increasing task execution time within an affordable limit, this paper develops scheduling heuristics to reduce energy consumption of a tasks execution and discusses the relationship between energy consumption and task execution time. Models and scheduling heuristics are examined with a simulation study. Test results justify the design and implementation of proposed energy aware scheduling heuristics in the paper.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126682075","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}

引用次数: 238

Mobility Support Through Caching in Content-Based Publish/Subscribe Networks 在基于内容的发布/订阅网络中通过缓存实现移动性支持

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.22

Vasilis Sourlas, G. Paschos, P. Flegkas, L. Tassiulas

引用次数: 38

An MPI-Stream Hybrid Programming Model for Computational Clusters 计算集群的mpi -流混合规划模型

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.33

E. Mancini, Gregory Marsh, D. Panda

{"title":"An MPI-Stream Hybrid Programming Model for Computational Clusters","authors":"E. Mancini, Gregory Marsh, D. Panda","doi":"10.1109/CCGRID.2010.33","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.33","url":null,"abstract":"The MPI programming model hides network type and topology from developers, but also allows them to seamlessly distribute a computational job across multiple cores in both an intra and inter node fashion. This provides for high locality performance when the cores are either on the same node or on nodes closely connected by the same network type. The streaming model splits a computational job into a linear chain of decoupled units. This decoupling allows the placement of job units on optimal nodes according to network topology. Furthermore, the links between these units can be of varying protocols when the application is distributed across a heterogeneous network. In this paper we study how to integrate the MPI and Stream programming models in order to exploit network locality and topology. We present a hybrid MPI-Stream framework that aims to take advantage of each model's strengths. We test our framework with a financial application. This application simulates an electronic market for a single financial instrument. A stream of buy and sell orders is fed into a price matching engine. The matching engine creates a stream of order confirmations, trade confirmations, and quotes based on its attempts to match buyers with sellers. Our results show that the hybrid MPI-Stream framework can deliver a 32% performance improvement at certain order transmission rates.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124363426","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}

引用次数: 12

Bandwidth Allocation for Iterative Data-Dependent E-science Applications 迭代数据依赖电子科学应用的带宽分配

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.114

Eun-Sung Jung, S. Ranka, S. Sahni

引用次数: 2

Expanding the Cloud: A Component-Based Architecture to Application Deployment on the Internet 扩展云:基于组件的体系结构到Internet上的应用程序部署

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.14

M. Wallis, F. Henskens, M. Hannaford

{"title":"Expanding the Cloud: A Component-Based Architecture to Application Deployment on the Internet","authors":"M. Wallis, F. Henskens, M. Hannaford","doi":"10.1109/CCGRID.2010.14","DOIUrl":"https://doi.org/10.1109/CCGRID.2010.14","url":null,"abstract":"Cloud Computing allows us to abstract distributed, elastic IT resources behind an interface that promotes scalability and dynamic resource allocation. The boundary of this cloud sits outside the application and the hardware that hosts it. For the end user, a web application deployed on a cloud is presented no differently to a web application deployed on a stand-alone web server. This model works well for web applications but fails to cater for distributed applications containing components that execute both locally for the user and remotely using non-local resources. This research proposes extending the concept of the cloud to encompass not only server-farm resources but all resources accessible by the user. This brings the resources of the home PC and personal mobile devices into the cloud and promotes the deployment of highly-distributed component based applications with fat user interfaces. This promotes the use of the Internet itself as a platform. We compare this to the standard Web 2.0 approach and show the benefits that deploying fat-client component based systems provide over classic web applications. We also describe the benefits that expanding the cloud provides to component migration and resources utilisation.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128713019","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}

引用次数: 13

Supporting OFED over Non-InfiniBand SANs 支持非ib san的OFED

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing Pub Date : 2010-05-17 DOI: 10.1109/CCGRID.2010.62

Devesh Sharma

引用次数: 2