Pub Date : 2002-11-07DOI: 10.1109/HPDC.2002.1029930
A. Rajasekar, M. Wan, Reagan Moore
Data Grids are becoming increasingly important in scientific communities for sharing large data collections and for archiving and disseminating them in a digital library framework. The Storage Resource Broker (SRB) provides transparent virtualized middleware for sharing data across distributed, heterogeneous data resources separated by different administrative and security domains. The MySRB is a Web-based interface to the SRB that provides a user-friendly interface to distributed collections brokered by the SRB. In this paper we briefly describe the use of the SRB infrastructure as tools in the data grid architecture for building distributed data collections, digital libraries, and persistent archives. We also provide details about the MySRB and its functionalities.
{"title":"MySRB and SRB - components of a Data Grid","authors":"A. Rajasekar, M. Wan, Reagan Moore","doi":"10.1109/HPDC.2002.1029930","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029930","url":null,"abstract":"Data Grids are becoming increasingly important in scientific communities for sharing large data collections and for archiving and disseminating them in a digital library framework. The Storage Resource Broker (SRB) provides transparent virtualized middleware for sharing data across distributed, heterogeneous data resources separated by different administrative and security domains. The MySRB is a Web-based interface to the SRB that provides a user-friendly interface to distributed collections brokered by the SRB. In this paper we briefly describe the use of the SRB infrastructure as tools in the data grid architecture for building distributed data collections, digital libraries, and persistent archives. We also provide details about the MySRB and its functionalities.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125146120","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029898
John Bent, Venkateshwaran Venkataramani, Nick LeRoy, A. Roy, Joseph Stanley, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, M. Livny
We present NeST a flexible software-only storage appliance designed to meet the storage needs of the Grid. NeST has three key features that make it well-suited for deployment in a Grid environment. First, NeST provides a generic data transfer architecture that supports multiple data transfer protocols (including GridFTP and NFS), and allows for the easy addition of new protocols. Second, NeST is dynamic, adapting itself on-the-fly so that it runs effectively on a wide range of hardware and software platforms. Third, NeST is Grid-aware, implying that features that are necessary for integration into the Grid, such as storage space guarantees, mechanisms for resource and data discovery, user authentication, and quality of service, are a part of the NeST infrastructure.
{"title":"Flexibility, manageability, and performance in a Grid storage appliance","authors":"John Bent, Venkateshwaran Venkataramani, Nick LeRoy, A. Roy, Joseph Stanley, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, M. Livny","doi":"10.1109/HPDC.2002.1029898","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029898","url":null,"abstract":"We present NeST a flexible software-only storage appliance designed to meet the storage needs of the Grid. NeST has three key features that make it well-suited for deployment in a Grid environment. First, NeST provides a generic data transfer architecture that supports multiple data transfer protocols (including GridFTP and NFS), and allows for the easy addition of new protocols. Second, NeST is dynamic, adapting itself on-the-fly so that it runs effectively on a wide range of hardware and software platforms. Third, NeST is Grid-aware, implying that features that are necessary for integration into the Grid, such as storage space guarantees, mechanisms for resource and data discovery, user authentication, and quality of service, are a part of the NeST infrastructure.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117151034","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029904
Chuang Liu, Lingyun Yang, Ian T Foster, D. Angulo
While distributed, heterogeneous collections of computers ("Grids") can in principle be used as a computing platform, in practice the problems of first discovering and then organizing resources to meet application requirements are difficult. We present a general-purpose resource selection framework that addresses these problems by defining a resource selection service for locating Grid resources that match application requirements. At the heart of this framework is a simple, but powerful, declarative language based on a technique called set matching, which extends the Condor matchmaking framework to support both single-resource and multiple-resource selection. This framework also provides an open interface for loading application-specific mapping modules to personalize the resource selector. We present results obtained when this framework is applied in the context of a computational astrophysics application, Cactus. These results demonstrate the effectiveness of our technique.
{"title":"Design and evaluation of a resource selection framework for Grid applications","authors":"Chuang Liu, Lingyun Yang, Ian T Foster, D. Angulo","doi":"10.1109/HPDC.2002.1029904","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029904","url":null,"abstract":"While distributed, heterogeneous collections of computers (\"Grids\") can in principle be used as a computing platform, in practice the problems of first discovering and then organizing resources to meet application requirements are difficult. We present a general-purpose resource selection framework that addresses these problems by defining a resource selection service for locating Grid resources that match application requirements. At the heart of this framework is a simple, but powerful, declarative language based on a technique called set matching, which extends the Condor matchmaking framework to support both single-resource and multiple-resource selection. This framework also provides an open interface for loading application-specific mapping modules to personalize the resource selector. We present results obtained when this framework is applied in the context of a computational astrophysics application, Cactus. These results demonstrate the effectiveness of our technique.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130674","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029933
G. Laszewski, Jarek Gawor, C. Peña, Ian T Foster
The research described in this paper is performed as part of the Globus Project. It introduces a new grid service called InfoGram that combines the ability of serving as information service and as a job execution service. Previously, both services were architected and implemented within the Globus Toolkit as two different services with different wire protocols. Our service demonstrates a significant simplification of the architecture while treating job submissions and information queries alike. The advantage of our service is that it provides backwards compatibility to existing grid services, while at the same time providing forwards compatibility to the emerging Web services world. Part of the work conducted within this effort is already reused by the current open grid services architecture prototype implementation.
{"title":"InfoGram: a grid service that supports both information queries and job execution","authors":"G. Laszewski, Jarek Gawor, C. Peña, Ian T Foster","doi":"10.1109/HPDC.2002.1029933","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029933","url":null,"abstract":"The research described in this paper is performed as part of the Globus Project. It introduces a new grid service called InfoGram that combines the ability of serving as information service and as a job execution service. Previously, both services were architected and implemented within the Globus Toolkit as two different services with different wire protocols. Our service demonstrates a significant simplification of the architecture while treating job submissions and information queries alike. The advantage of our service is that it provides backwards compatibility to existing grid services, while at the same time providing forwards compatibility to the emerging Web services world. Part of the work conducted within this effort is already reused by the current open grid services architecture prototype implementation.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314094","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029950
A. Jagatheesan, Reagan Moore, A. Rajasekar, Bing Zhu
Data grids enable next generation scientific explorations that require intensive computation and analysis of petabyte-scale shared data collections. Apart from the challenge in creation and management of the data, another major challenge is the discovery of derived data products that have already been created. This work addresses the later challenge in minimizing response time and conserving the computing cycles in the grids by using "virtual services" to access derived data products. We analyze the role of virtual services for long running services in a service-oriented architecture and contribute a technique called "semantic mirror". A prototype was developed to discover derived data products of grid services using SRB-MCAT technology and GriPhyN Virtual Data Language (VDL).
{"title":"Virtual services in data grids","authors":"A. Jagatheesan, Reagan Moore, A. Rajasekar, Bing Zhu","doi":"10.1109/HPDC.2002.1029950","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029950","url":null,"abstract":"Data grids enable next generation scientific explorations that require intensive computation and analysis of petabyte-scale shared data collections. Apart from the challenge in creation and management of the data, another major challenge is the discovery of derived data products that have already been created. This work addresses the later challenge in minimizing response time and conserving the computing cycles in the grids by using \"virtual services\" to access derived data products. We analyze the role of virtual services for long running services in a service-oriented architecture and contribute a technique called \"semantic mirror\". A prototype was developed to discover derived data products of grid services using SRB-MCAT technology and GriPhyN Virtual Data Language (VDL).","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054132","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029913
G. Matthews, R. Hood, Stephen Johnson, P. Leggett
In this work we describe a new approach using relative debugging to find differences in computation between a serial program and a parallel version of that program. We use a combination of re-execution and backtracking in order to find the first difference in computation that may ultimately lead to an incorrect value that the user has indicated. In our prototype implementation we use static analysis information from a parallelization tool in order to perform the backtracking as well as the mapping required between serial and parallel computations.
{"title":"Backtracking and re-execution in the automatic debugging of parallelized programs","authors":"G. Matthews, R. Hood, Stephen Johnson, P. Leggett","doi":"10.1109/HPDC.2002.1029913","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029913","url":null,"abstract":"In this work we describe a new approach using relative debugging to find differences in computation between a serial program and a parallel version of that program. We use a combination of re-execution and backtracking in order to find the first difference in computation that may ultimately lead to an incorrect value that the user has indicated. In our prototype implementation we use static analysis information from a parallelization tool in order to perform the backtracking as well as the mapping required between serial and parallel computations.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133852289","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029944
A. Bucur, D. Epema
In systems consisting of multiple clusters of processors interconnected by relatively slow communication links, co-allocation may be required. We study its performance by means of simulations, depending on the structure and sizes of jobs, and the communication speed ratio. We model a multicluster with C clusters of identical processors. The workload consists of rigid jobs that require fixed numbers of processors, possibly in multiple clusters simultaneously. A job is represented by a tuple of C values, each generated from a same distribution D. In an ordered request the positions of the components in the tuple specify the clusters from which the processors must be allocated. For an unordered request, by the components of the tuple the job only specifies the numbers of processors needed in the separate clusters. A flexible request specifies the total number of processors, obtained as the sum of the values in the tuple. For total requests, there is a single cluster and a request only specifies the total number of processors needed. All intracluster communication links have the same speed, as do all intercluster links. The communication speed ratio is the ratio between the time needed to complete a send operation between processors in different clusters and in the same cluster.
{"title":"The performance of processor co-allocation in multicluster systems","authors":"A. Bucur, D. Epema","doi":"10.1109/HPDC.2002.1029944","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029944","url":null,"abstract":"In systems consisting of multiple clusters of processors interconnected by relatively slow communication links, co-allocation may be required. We study its performance by means of simulations, depending on the structure and sizes of jobs, and the communication speed ratio. We model a multicluster with C clusters of identical processors. The workload consists of rigid jobs that require fixed numbers of processors, possibly in multiple clusters simultaneously. A job is represented by a tuple of C values, each generated from a same distribution D. In an ordered request the positions of the components in the tuple specify the clusters from which the processors must be allocated. For an unordered request, by the components of the tuple the job only specifies the numbers of processors needed in the separate clusters. A flexible request specifies the total number of processors, obtained as the sum of the values in the tuple. For total requests, there is a single cluster and a request only specifies the total number of processors needed. All intracluster communication links have the same speed, as do all intercluster links. The communication speed ratio is the ratio between the time needed to complete a send operation between processors in different clusters and in the same cluster.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251751","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029899
Rajiv Wickremesinghe, J. Chase, J. Vitter
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effective for a variety of problems. This paper explores opportunities to use active storage as a basis for exploiting asymmetric parallelism in applications using a streaming computation model on collections of fixed-size records. This model is the basis for much of the research in I/O-efficient algorithms, which deals with an important class of massive data problems not studied in previous work on active storage. We present an extension of a streaming computation model for an external memory toolkit to support a flexible mapping of computations to storage-based processors. Our approach enables load-managed active storage: it exposes parallelism, ordering constraints, and primitive computation units to the system, which can configure the application to balance load and make the best use of available processing power Emulation results from a sorting application demonstrate the potential of dynamic adaptation in load-managed active storage.
{"title":"Distributed computing with load-managed active storage","authors":"Rajiv Wickremesinghe, J. Chase, J. Vitter","doi":"10.1109/HPDC.2002.1029899","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029899","url":null,"abstract":"One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effective for a variety of problems. This paper explores opportunities to use active storage as a basis for exploiting asymmetric parallelism in applications using a streaming computation model on collections of fixed-size records. This model is the basis for much of the research in I/O-efficient algorithms, which deals with an important class of massive data problems not studied in previous work on active storage. We present an extension of a streaming computation model for an external memory toolkit to support a flexible mapping of computations to storage-based processors. Our approach enables load-managed active storage: it exposes parallelism, ordering constraints, and primitive computation units to the system, which can configure the application to balance load and make the best use of available processing power Emulation results from a sorting application demonstrate the potential of dynamic adaptation in load-managed active storage.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"36 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046745","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029953
M. Weeks, Victoria J. Hodge, J. Austin
Summary form only given. AURA (Advanced Uncertain Reasoning Architecture) is a generic family of techniques and implementations intended for high-speed approximate search and match operations on large unstructured datasets. AURA technology is fast, economical, and offers unique advantages for finding near-matches not available with other methods. AURA is based upon a high-performance binary neural network called a correlation matrix memory (CMM). Typically, several CMM elements are used in combination to solve soft or fuzzy pattern-matching problems. AURA takes large volumes of data and constructs a special type of compressed index. AURA finds exact and near-matches between indexed records and a given query, where the query itself may have omissions and errors. The degree of nearness required during matching can be varied through thresholding techniques. The PCI-based PRESENCE (Parallel Structured Neural Computing Engine) card is a hardware-accelerator architecture for the core CMM computations needed in AURA-based applications. The card is designed for use in low-cost workstations and incorporates 128 MByte of low-cost DRAM for CMM storage. To investigate the scalability of the distributed AURA system, we implement a word-to-document index of an AURA-based information retrieval system, called MinerTaur, over a distributed PRESENCE CMM.
{"title":"Scalability of a distributed neural information retrieval system","authors":"M. Weeks, Victoria J. Hodge, J. Austin","doi":"10.1109/HPDC.2002.1029953","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029953","url":null,"abstract":"Summary form only given. AURA (Advanced Uncertain Reasoning Architecture) is a generic family of techniques and implementations intended for high-speed approximate search and match operations on large unstructured datasets. AURA technology is fast, economical, and offers unique advantages for finding near-matches not available with other methods. AURA is based upon a high-performance binary neural network called a correlation matrix memory (CMM). Typically, several CMM elements are used in combination to solve soft or fuzzy pattern-matching problems. AURA takes large volumes of data and constructs a special type of compressed index. AURA finds exact and near-matches between indexed records and a given query, where the query itself may have omissions and errors. The degree of nearness required during matching can be varied through thresholding techniques. The PCI-based PRESENCE (Parallel Structured Neural Computing Engine) card is a hardware-accelerator architecture for the core CMM computations needed in AURA-based applications. The card is designed for use in low-cost workstations and incorporates 128 MByte of low-cost DRAM for CMM storage. To investigate the scalability of the distributed AURA system, we implement a word-to-document index of an AURA-based information retrieval system, called MinerTaur, over a distributed PRESENCE CMM.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863096","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}
Pub Date : 2002-07-24DOI: 10.1109/HPDC.2002.1029945
F. Bustamante, Patrick M. Widener, K. Schwan
In this paper, we argue that an exclusively inactive interface to directory services can hinder server scalability and indirectly restrict the behavior of potential applications. We propose to extend directory services' interfaces with a proactive mode by which clients can express their interest in (and be notified of) changes in the environment. These notification channels can be subsequently customized on a per-client basis through client-specified filters. Finally, in order to simplify the handling of client/server failures we adopt a leasing model for client registration to (and customization of) a notification channel. To validate our approach, we have designed and implemented the Proactive Directory Service (PDS).
{"title":"A case for proactivity in directory services","authors":"F. Bustamante, Patrick M. Widener, K. Schwan","doi":"10.1109/HPDC.2002.1029945","DOIUrl":"https://doi.org/10.1109/HPDC.2002.1029945","url":null,"abstract":"In this paper, we argue that an exclusively inactive interface to directory services can hinder server scalability and indirectly restrict the behavior of potential applications. We propose to extend directory services' interfaces with a proactive mode by which clients can express their interest in (and be notified of) changes in the environment. These notification channels can be subsequently customized on a per-client basis through client-specified filters. Finally, in order to simplify the handling of client/server failures we adopt a leasing model for client registration to (and customization of) a notification channel. To validate our approach, we have designed and implemented the Proactive Directory Service (PDS).","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122875628","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：