Proceedings the Ninth International Symposium on High-Performance Distributed Computing最新文献_第2页

Bypass: a tool for building split execution systems 旁路:用于构建分割执行系统的工具

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868637

D. Thain, M. Livny

引用次数: 27

The Cactus Code: a problem solving environment for the grid Cactus Code:一个解决网格问题的环境

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868657

Gabrielle Allen, W. Benger, T. Goodale, H. Hege, Gerd Lanfermann, André Merzky, T. Radke, E. Seidel, J. Shalf

引用次数: 135

Uintah: a massively parallel problem solving environment untah:一个大规模并行解决问题的环境

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868632

J., Davison de St. Germain, J. McCorquodale, S. Parker, Christopher R. Johnson

引用次数: 195

Grid-based file access: the Legion I/O model 基于网格的文件访问:军团I/O模型

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868647

B. White, A. Grimshaw, A. Nguyen-Tuong

引用次数: 60

Using idle workstations to implement predictive prefetching 利用空闲工作站实现预测性预取

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868638

Jasmine Y. Q. Wang, J. Ong, Y. Coady, M. Feeley

{"title":"Using idle workstations to implement predictive prefetching","authors":"Jasmine Y. Q. Wang, J. Ong, Y. Coady, M. Feeley","doi":"10.1109/HPDC.2000.868638","DOIUrl":"https://doi.org/10.1109/HPDC.2000.868638","url":null,"abstract":"The benefits of Markov-based predictive prefetching have been largely overshadowed by the overhead required to produce high-quality predictions. While both theoretical and simulation results for prediction algorithms appear promising, substantial limitations exist in practice. This outcome can be partially attributed to the fact that practical implementations ultimately make compromises in order to reduce overhead. These compromises limit the level of algorithm complexity, the variety of access patterns and the granularity of trace data that the implementation supports. This paper describes the design and implementation of GMS-3P (Global Memory System with Parallel Predictive Prefetching), an operating system kernel extension that offloads prediction overhead to idle network nodes. GMS-3P builds on the GMS global memory system, which pages to and from remote workstation memory. In GMS-3P, the target node sends an online trace of an application's page faults to an idle node that is running a Markov-based prediction algorithm. The prediction node then uses GMS to prefetch pages to the target node from the memory of other workstations in the network. Our preliminary results show that predictive prefetching can reduce the remote-memory page fault time by 60% or more and that, by offloading prediction overhead to an idle node, GMS-3P can reduce this improved latency by between 24% and 44%, depending on the Markov model order.","PeriodicalId":400728,"journal":{"name":"Proceedings the Ninth International Symposium on High-Performance Distributed Computing","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117347983","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}

引用次数: 8

CAVEStudy: an infrastructure for computational steering in virtual reality environments CAVEStudy:虚拟现实环境中计算导向的基础设施

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868655

L. Renambot, H. Bal, D. Germans, H. Spoelder

引用次数: 21

Evaluating cluster-based network servers 评估基于集群的网络服务器

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868635

R. Bianchini, E. V. Carrera

{"title":"Evaluating cluster-based network servers","authors":"R. Bianchini, E. V. Carrera","doi":"10.1109/HPDC.2000.868635","DOIUrl":"https://doi.org/10.1109/HPDC.2000.868635","url":null,"abstract":"Uses analytic modeling and simulation to evaluate network servers implemented on clusters of workstations. More specifically, we model the potential benefits of locality-conscious request distribution within the cluster and evaluate the performance of a cluster-based server called L2S (Locality and Load-balancing Server) which we designed in light of our experience with the model. Our most important modeling results show that locality-conscious distribution on a 16-node cluster can increase server throughput with respect to a locality-oblivious server by up to seven-fold, depending on the average size of the files requested and on the size of the server's working set. Our simulation results demonstrate that L2S achieves throughput that is within 22% of the full potential of locality-conscious distribution on 16 nodes, outperforming and significantly outscaling the best-known locality-conscious server. Based on our results and on the fact that the files serviced by network servers are becoming larger and more numerous, we conclude that our locality-conscious network server should prove very useful for its performance, scalability and availability.","PeriodicalId":400728,"journal":{"name":"Proceedings the Ninth International Symposium on High-Performance Distributed Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124735269","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

Performance evaluation of a firewall-compliant Globus-based wide-area cluster system 兼容防火墙的基于globus的广域集群系统的性能评估

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868642

Yoshio Tanaka, Motonori Hirano, M. Sato, H. Nakada, S. Sekiguchi

{"title":"Performance evaluation of a firewall-compliant Globus-based wide-area cluster system","authors":"Yoshio Tanaka, Motonori Hirano, M. Sato, H. Nakada, S. Sekiguchi","doi":"10.1109/HPDC.2000.868642","DOIUrl":"https://doi.org/10.1109/HPDC.2000.868642","url":null,"abstract":"Presents a performance evaluation of a wide-area cluster system based on a firewall-enabled Globus metacomputing toolkit. In order to establish communication links beyond the firewall, we have designed and implemented a resource manager called RMF (Resource Manager beyond the Firewall) and the Nexus Proxy, which relays TCP communication links beyond the firewall. In order to extend the Globus metacomputing toolkit to become firewall-enabled, we have built the Nexus Proxy into the Globus toolkit. We have built a firewall-enabled Globus-based wide-area cluster system in Japan and run some benchmarks on it. In this paper, we report various performance results, such as the communication bandwidth and latencies obtained, as well as application performance involving a tree search problem. In a wide-area environment, the communication latency through the Nexus Proxy is approximately six times larger when compared to that of direct communications. As the message size increases, however, the communication overhead caused by the Nexus Proxy can be negligible. We have developed a tree search problem using MPICH-G. We used a self-scheduling algorithm, which is considered to be suitable for a distributed heterogeneous metacomputing environment since it performs dynamic load balancing with low overhead. The performance results indicate that the communication overhead caused by the Nexus Proxy is not a severe problem in metacomputing environments.","PeriodicalId":400728,"journal":{"name":"Proceedings the Ninth International Symposium on High-Performance Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125197449","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}

引用次数: 26

Constructing the ASCI computational grid 构建ASCI计算网格

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868650

J. Beiriger, Wilbur R. Johnson, H. Bivens, S. Humphreys, R. Rhea

引用次数: 42

A local area system network RHiNET-1: a network for high performance parallel computing 一个局域系统网络RHiNET-1:用于高性能并行计算的网络

Proceedings the Ninth International Symposium on High-Performance Distributed Computing Pub Date : 2000-08-01 DOI: 10.1109/HPDC.2000.868665

H. Nishi, K. Tasho, J. Yamamoto, T. Kudoh, H. Amano

引用次数: 2