Proceedings 11th IEEE International Symposium on High Performance Distributed Computing最新文献

MySRB and SRB - components of a Data Grid MySRB和SRB——数据网格的组件

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-11-07 DOI: 10.1109/HPDC.2002.1029930

A. Rajasekar, M. Wan, Reagan Moore

引用次数: 68

Flexibility, manageability, and performance in a Grid storage appliance 网格存储设备中的灵活性、可管理性和性能

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029898

John Bent, Venkateshwaran Venkataramani, Nick LeRoy, A. Roy, Joseph Stanley, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, M. Livny

引用次数: 77

Design and evaluation of a resource selection framework for Grid applications 网格应用程序资源选择框架的设计和评估

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029904

Chuang Liu, Lingyun Yang, Ian T Foster, D. Angulo

引用次数: 250

InfoGram: a grid service that supports both information queries and job execution InfoGram:一种网格服务，既支持信息查询，也支持作业执行

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029933

G. Laszewski, Jarek Gawor, C. Peña, Ian T Foster

引用次数: 21

Virtual services in data grids 数据网格中的虚拟服务

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029950

A. Jagatheesan, Reagan Moore, A. Rajasekar, Bing Zhu

引用次数: 4

Backtracking and re-execution in the automatic debugging of parallelized programs 并行程序自动调试中的回溯和重新执行

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029913

G. Matthews, R. Hood, Stephen Johnson, P. Leggett

引用次数: 12

The performance of processor co-allocation in multicluster systems 多集群系统中处理器协同分配的性能

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029944

A. Bucur, D. Epema

{"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}

引用次数: 12

Distributed computing with load-managed active storage 具有负载管理的活动存储的分布式计算

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029899

Rajiv Wickremesinghe, J. Chase, J. Vitter

{"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}

引用次数: 47

Scalability of a distributed neural information retrieval system 分布式神经信息检索系统的可扩展性

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029953

M. Weeks, Victoria J. Hodge, J. Austin

{"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}

引用次数: 6

A case for proactivity in directory services 目录服务中主动性的一个案例

Proceedings 11th IEEE International Symposium on High Performance Distributed Computing Pub Date : 2002-07-24 DOI: 10.1109/HPDC.2002.1029945

F. Bustamante, Patrick M. Widener, K. Schwan

引用次数: 1