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

{"title":"Brain Activity Detection in Functional Magnetic Resonance Imaging on Heterogeneous Cluster","authors":"J. Tamames, J. L. Bosque, J. Canto","doi":"10.1109/CCGRID.2002.1017138","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017138","url":null,"abstract":"In this paper we show a cluster-based solution for analyzing magnetic resonance imaging from the brain in order to obtain information about the brain activity in conscious and awake subjects. The huge amount of data to be analyzed makes sense the use of computer clusters. Furthermore, one heterogeneous cluster has been chosen because is a more realistic net environment in the most of the medical institutions. The complete method in the future would be a new approach to real time detection of brain activity.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"74 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":"127551537","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}

{"title":"A Study of Discovery Mechanisms for Peer-to-Peer Applications","authors":"Mandar Kelaskar, V. Matossian, Preeti Mehra, Dennis Paul, M. Parashar","doi":"10.1109/CCGRID.2002.1017187","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017187","url":null,"abstract":"Peer-to-peer applications allow peers to connect or disconnect from a network at any time and are based on a loosely coupled resource distribution model. As a result, robust and efficient discovery mechanisms are central to the efficient functioning of such applications. In this paper we evaluate four discovery mechanisms (flooding and the forward routing algorithms CHORD, Pastry and CAN) against the requirements of three prevalent classes of peer-to-peer applications, and investigate the suitability of these mechanisms for the applications.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"106 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":"128078820","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}

{"title":"RVision: An Open and High Configurable Tool for Cluster Monitoring","authors":"T. Ferreto, C. Rose, L. D. Rose","doi":"10.1109/CCGRID.2002.1017114","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017114","url":null,"abstract":"In this paper we present the design and implementation of RVision (Remote Vision), an open architecture, high configurable tool for cluster monitoring. We focus on the description of it's modular architecture, emphasizing the new concepts we are introducing for cluster monitoring, such as monitoring sessions and the support for dynamic linking of monitoring libraries. In addition, we measure intrusion with several benchmarks and applications under different scenarios. RVision distinguishes itself from other available tools for cluster monitoring because of its open architecture, high configurability, and low intrusion. It is being used in production mode, in our research center, and has proven itself as a powerful alternative for cluster monitoring, especially in heterogeneous clusters and cluster of clusters.","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":"123168258","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}

{"title":"Java Coglets","authors":"D. Webb, A. Wendelborn","doi":"10.1109/CCGRID.2002.1017180","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017180","url":null,"abstract":"This position paper considers how existing Grid infrastructure can be use to support Java computation on the Grid. We are interested in a class of Java applications characterize by distributed, mobile code. We identify and address these problems by building upon existing Grid services, resulting in a propose infrastructure called Coglets that supports homogenous, secure access to Java-enabled Grid resources.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"7 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":"114141447","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}

{"title":"MAPFS_MAS: A Model of Interaction among Information Retrieval Agents","authors":"María S. Pérez, Félix García, J. Carretero","doi":"10.1109/CCGRID.2002.1017135","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017135","url":null,"abstract":"MAPFS is a parallel file system integrated with a multiagent system responsible for the information retrieval [2]. The use of a multiagent system implies coordination among the agents such system consists of. The principal goal of the agents cooperation is the interaction among such agents for achieving a common objective in a distributed system. MAPFS consists of two subsystems: (i) the MAPFS FS, which provides the parallel file system functionality and (ii) the MAPFS MAS, responsible for the information retrieval. The MAPFS MAS is an independent subsystem, which provides support to the major subsystem (MAPFS FS) in three different areas: (i) access to the information: This feature is the main task of the MAPFS MAS and consists of the information retrieval. The information is stored in the I/O nodes (a set of disks distributed among several nodes); (ii) caching service: MAPFS takes advantage of the temporal and spatial locality of data stored in the servers. Inside the MAPFS MAS, there are agents which manage this feature. These agents are named cache agents; and (iii) Fault tolerance service:Data distribution through a set of disks makes the system more vulnerable. For this reason, MAPFS must provide the fault tolerance feature. When we talk about fault tolerance in this work, we refer to data availability. For managing it, fault tolerance agents from the MAPFS MAS are used. With the aim of achieving these goals, the MAPFS MAS is constituted by a set of agents which interact among them, that is, a multiagent system (MAS). On the other hand, the files are stored finally in several servers, which constitute the server-side of the underlying architecture. The grouping of servers from a logical point of view in MAPFS is denominated storage group. There are two hierarchies in MAPFS: (i) several file servers form a storage group and (ii) several agents (more precisely, a multiagent system) form the infrastructure that gives support to a server. Therefore, there are several MAS belonging to a storage group. In this sense, there are also two cooperation levels: (i) cooperation inside a MAS and (ii) cooperation between two different MAS. This paper describes the coordination features of MAPFS.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"23 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":"117339033","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}

{"title":"Scalable Algorithms for Complete Exchange on Multi-Cluster Networks","authors":"A. Goldman","doi":"10.1109/CCGRID.2002.1017146","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017146","url":null,"abstract":"Inside a dedicated parallel computer the communication times were generally modeled in the same way, independently of which processors communicate. In a network where the links among the computers are heterogeneous, or in hierarchical clusters, this might not be true anymore. Computers that have faster links, or are closer to each other should be able to exchange messages faster. These differences on communication times should be considered, not only for attributing tasks to the processors but also in global synchronization/communication. The goal of this paper is to study irregular all-to-all communications in a network of dedicated clusters.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"50 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":"133354112","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}

{"title":"PVM Emulation in the Harness Metacomputing Framework - Design and Performance Evaluation","authors":"Dawid Kurzyniec, V. Sunderam, M. Migliardi","doi":"10.1109/CCGRID.2002.1017144","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017144","url":null,"abstract":"This paper describes the Harness-PVM emulation module that makes it possible to run legacy PVM applications within the Harness metacomputing system environment. We show benchmark results suggesting that component- and Java-based frameworks may provide substantial benefits without significantly compromising performance. Augmenting or implementing grids using such component based systems can thus be advantageous in a number of situations.","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":"130144245","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}

{"title":"Cluster Tools","authors":"Stephen Scott","doi":"10.1109/CCGRID.2002.1017100","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017100","url":null,"abstract":"While many of us have been using clusters for quite a few years, how many have had the time and opportunity to review the existing, evolving, and constantly emerging tools aimed at simplifying cluster use and administration tasks? This tutorial is designed to do that for you by condensing that material into the form of a review of the various tools that we at ORNL have found to be useful in dealing with our HPC clusters. In addition to tools used at ORNL, coverage will include material resulting from our internal review of a variety of cluster-oriented tools. The scope of material will include the entire range from the initial cluster build through use and maintenance operations. The target audience includes (1) those just starting out and looking for information on choices for cluster tools, (2) those already using clusters who are looking for better ways to do things, and (3) those looking for a briefing on what tools are available— perhaps before beginning their own tool-building effort.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"100 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":"130155675","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}

{"title":"evolution@home: Experiences with Work Units That Span More than 7 Orders of Magnitude in Computational Complexity","authors":"L. Loewe","doi":"10.1109/CCGRID.2002.1017176","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017176","url":null,"abstract":"Individual-based models in evolutionary biology easily lead to multi-parameter applications that need global computing power to exploit their full potential. Mainly due to varying population size parameters, they easily generate computational complexities from less than a second to more than 100 years in case of the Simulator005 of evolution@home. The poorly understood biology of the system leads to automated predictions that may be way off. This report describes first experiences of a global computing system, where users can choose between tasks of different complexity. Besides theoretical complexity limits of tasks that fit global computing, choices of users are analyzed. Potential of incomplete results to increase prediction accuracy is discussed as well as benchmarking computer systems that vary nearly 2 orders of magnitude in their idle processing power. Finally, prediction accuracy is analyzed with the help of a newly defined parameter: error of magnitude. It is concluded, that global computing has great potential for projects with poorly predictable single-run-complexities, if frameworks are designed to allow users to choose their commitment, and if they make use of incomplete results to improve predictions.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"147 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":"124721949","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}

{"title":"Latency Performance of SOAP Implementations","authors":"Dan Davis, M. Parashar","doi":"10.1109/CCGRID.2002.1017169","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017169","url":null,"abstract":"This paper presents an experimental evaluation of the latency performance of several implementations of Simple Object Access Protocol (SOAP) operating over HTTP, and compares these results with the performance Of JavaRMI, CORBA, HTTP, and with the TCP setup time. SOAP is an XML based protocol that supports RPC and message semantics. While SOAP has been designed as an interoperable business-to-business protocol usable over the Internet, we believe that applications will also use SOAP for interactive web applications running within an intranet. The objective of this paper is to identify the sources of inefficiency in the current implementations of SOAP and discuss changes that can improve their performance. SOAP implementations studied include Microsoft SOAP Toolkit, the SOAP: Lite Perl module, and Apache SOAP.","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":"124396585","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}