CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.最新文献_第4页

Multi-class applications for parallel usage of a guaranteed rate and a scavenger service 多类应用程序并行使用的保证率和清道夫服务

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199413

M. Fidler, V. Sander

{"title":"Multi-class applications for parallel usage of a guaranteed rate and a scavenger service","authors":"M. Fidler, V. Sander","doi":"10.1109/CCGRID.2003.1199413","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199413","url":null,"abstract":"Grid computing requires network services beyond what is currently provided by the Best-Effort Internet. Among the different approaches towards network Quality of Service, aggregate scheduling, which maps micro-flows to a small number of different service classes, offers sufficient scalability up to the size of the Internet. The Differentiated Services architecture of the Internet Engineering Task Force is such an approach. Recently further Best-Effort like services have been proposed that are based on aggregate scheduling, like the less than Best-Effort Scavenger Service and the Alternative Best-Effort Service. In this paper we introduce the existing aggregate based approaches to Quality of Service. We take a heterogeneous mix of Transmission Control Protocol and User Datagram Protocol flows into account and complement services by adding transport protocol specific elements, if appropriate. In particular we show multi-class applications that are designed to apply a Guaranteed Rate Service and a Scavenger Service in parallel. Doing so we can show a performance gain and achieve a more economical use of the available resources without impacting responsive Best-Effort flows.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121556913","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

Chameleon: a resource scheduler in a data grid environment 变色龙:数据网格环境中的资源调度器

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199376

Sang-Min Park, Jai-hoon Kim

{"title":"Chameleon: a resource scheduler in a data grid environment","authors":"Sang-Min Park, Jai-hoon Kim","doi":"10.1109/CCGRID.2003.1199376","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199376","url":null,"abstract":"Grid computing is moving into two ways. The Computational Grid focuses on reducing execution time of applications that require a great number of computer processing cycles. The Data Grid provides the way to solve large scale data management problems. Data intensive applications such as High Energy Physics and Bioinformatics require both Computational and Data Grid features. Job scheduling in Grid has been mostly discussed from the perspective of computational Grid. However, scheduling on Data Grid is just a recent focus of Grid computing activities. In Data Grid environment, effective scheduling mechanism considering both computational and data storage resources must be provided for large scale data intensive applications. In this paper, we describe new scheduling model that considers both amount of computational resources and data availability in Data Grid environment. We implemented a scheduler, called Chameleon, based on the proposed application scheduling model. Chameleon shows performance improvements in data intensive applications that require both large number of processors and data replication mechanisms. The results achieved from Chameleon are presented.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131520379","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}

引用次数: 94

Programming for dependability in a service-based grid 基于服务的网格中的可靠性编程

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199365

Win Bausch, C. Pautasso, G. Alonso

{"title":"Programming for dependability in a service-based grid","authors":"Win Bausch, C. Pautasso, G. Alonso","doi":"10.1109/CCGRID.2003.1199365","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199365","url":null,"abstract":"Service-based Grid infrastructures emphasize service composition rather than sharing of low level resources. The idea is to build Grid applications out of computational services provided by the different sites of the Grid. Recent developments in the area of Web services have strengthened this idea by standardizing procedures like service description, publication and invocation. What is still missing is the infrastructure necessary to support the complete life cycle of applications running on service based Grids, i.e., suitable programming paradigms, execution infrastructure, and the ability to monitor and control such computations. Moreover, once computations are made of composable services, dependability becomes a key issue that needs to be addressed by the infrastructure as it cannot be addressed separately by each individual service. To address these concerns, we have developed the BioOpera Grid computing platform. BioOpera is a process support system for dependable cluster computing that has been extended with additional functionality to provide adequate support for service-based Grids. In this paper we describe how BioOpera can be used to develop, execute, and administer highly dependable computations over service-based Grids.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296582","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}

引用次数: 21

A method to find unique sequences on distributed genomic databases 分布式基因组数据库中唯一序列的查找方法

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199353

K. Kurata, V. Breton, Hiroshi Nakamura

{"title":"A method to find unique sequences on distributed genomic databases","authors":"K. Kurata, V. Breton, Hiroshi Nakamura","doi":"10.1109/CCGRID.2003.1199353","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199353","url":null,"abstract":"Thanks to the development of genetic engineering, various kinds of genomic information are being unveiled. Hence, it becomes feasible to analyze the entire genomic information all at once. On the other hand, the quantity of the genomic information stocked on databases is increasing day after day. In order to process the whole information, we have to develop an effective method to deal with lots of data. Therefore, it is indispensable not only to make an effective and rapid algorithm but also to use high-speed computer resource so as to analyze the biological information. For this purpose, as one of the most promised computing environments, the grid computing architecture has appeared recently. The European Data Grid (EDG) is one of the data-oriented grid computing environments [11]. In the field of bioinformatics, it is important to find unique sequences to succeed in molecular biological experiments [6]. Once unique sequences have been found they can be useful for target specific probes/primers design, gene sequence comparison and so on. In this paper, we propose a method to discover unique sequences from among genomic databases located in a distributed environment. Next, we implement this method upon the European Data Grid and show the calculation results for E. coli genomes.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129066017","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}

引用次数: 6

Large scale dissemination using a peer-to-peer network 使用点对点网络的大规模传播

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199396

K. Zerfiridis, H. Karatza

引用次数: 10

Scalable infrastructure for peer-to-peer networks using web service registries and intelligent peer locators 使用web服务注册中心和智能对等定位器的对等网络的可伸缩基础设施

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199371

V. Prasad, Yugyung Lee

引用次数: 7

Decentralized resource allocation in application layer networks 应用层网络中分散的资源分配

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199427

Torsten Eymann, M. Reinicke, Oscar Ardaiz-Villanueva, Pau Artigas, Felix Freitag, L. Navarro

引用次数: 34

Data allocation and load balancing for heterogeneous cluster storage systems 异构集群存储系统的数据分配与负载均衡

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199438

J. M. Pérez, Félix García, J. Carretero, A. Calderón, Luis Miguel Sánchez

引用次数: 8

Preliminary evaluation of dynamic load balancing using loop re-partitioning on Omni/SCASH 在Omni/SCASH上使用循环重分区的动态负载平衡的初步评估

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199402

Y. Sakae, M. Sato, S. Matsuoka, H. Harada

引用次数: 11

Specifying and monitoring guarantees in commercial grids through SLA 通过SLA在商业电网中指定和监控保障

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199380

Akhil Sahai, S. Graupner, V. Machiraju, A. Moorsel

{"title":"Specifying and monitoring guarantees in commercial grids through SLA","authors":"Akhil Sahai, S. Graupner, V. Machiraju, A. Moorsel","doi":"10.1109/CCGRID.2003.1199380","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199380","url":null,"abstract":"Grid computing has relied on \"best effort\" as the guiding principal of operation. However, commercial grids need to provide much stricter guarantees. These guarantees have to be specified in terms of service level agreements and have to be monitored and assured. We propose an architecture for specifying and monitoring service level agreements to achieve the above. The architecture relies on a network of communicating proxies each maintaining SLAB committed within the administrative domain of the proxy. SLAB are either negotiated between or specified to management proxies, and they are responsible for automated monitoring of data and for triggering evaluations of the registered SLAs. An unambiguous and,flexible language for formalizing SLAB is presented to achieve the above. The management proxy allows reasoning about the overall status of SLAB related to an application context across multiple administrative domains by contacting and querying involved management proxies, obtaining measurement information from multiple proxies, if needed and performing a consolidated SLA evaluation. The process of measurement collection, and SLA evaluation is automated and based on web services technology. The scenario considers HP Utility Data Center as a typical Commercial Grid deployment environment.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132881614","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}

引用次数: 127