发布求助
文献互助 智能选刊 最新文献

Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications最新文献

筛选
英文 中文
An enhanced scheduling approach in a distributed parallel environment using mobile agents 使用移动代理的分布式并行环境中的增强调度方法
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019152
M. Dantas, J. G. R. C. Lopes, T. G. Ramos
{"title":"An enhanced scheduling approach in a distributed parallel environment using mobile agents","authors":"M. Dantas, J. G. R. C. Lopes, T. G. Ramos","doi":"10.1109/HPCSA.2002.1019152","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019152","url":null,"abstract":"Our goal is to apply mobile agent technology to provide a better scheduling for MPI applications executing in a cluster configuration. This approach could represent in a distributed cluster environment an enhancement on the load balancing of the parallel processes. MPI in a cluster of heterogeneous machines could lead parallel programmers to obtain frustrated results, mainly because of the lack of an even distribution of the workload in the cluster. As a result, before submitting a MPI application to a cluster, we use our JOTA mobile agent approach to acquire a more precise information of machine's workload. Therefore, with a more precise knowledge of the load and characteristics in each machine, we are ready to gather lightweight workstations to form a cluster. Our empirical results indicate that it is possible to spend less elapsed time when considering the execution of a parallel application using the agent approach in comparison to an ordinary MPI environment.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"426 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227920","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}
引用次数: 11
Replication algorithms for the World-Wide Web 万维网的复制算法
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019138
Fathi Tenzekhti, K. Day, M. Ould-Khaoua
{"title":"Replication algorithms for the World-Wide Web","authors":"Fathi Tenzekhti, K. Day, M. Ould-Khaoua","doi":"10.1109/HPCSA.2002.1019138","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019138","url":null,"abstract":"This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a static centralized algorithm for replicating objects that can keep a balanced load on servers. To better meet the requirements of the dynamic nature of the Internet traffic and the rapid change in the access pattern of the WWW, we also propose a dynamic distributed algorithm where each server relies on some collected information to decide on where to replicate and migrate objects to achieve good performance and fault-tolerance levels.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125232088","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}
引用次数: 28
Increasing predictive accuracy by prefetching multiple program and user specific files 通过预取多个程序和用户特定文件来提高预测准确性
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019129
Tsozen Yeh, D. Long, S. Brandt
{"title":"Increasing predictive accuracy by prefetching multiple program and user specific files","authors":"Tsozen Yeh, D. Long, S. Brandt","doi":"10.1109/HPCSA.2002.1019129","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019129","url":null,"abstract":"Recent increases in CPU performance have outpaced increases in hard drive performance. As a result, disk operations have become more expensive in terms of CPU cycles spent waiting for disk operations to complete. File prediction can mitigate this problem by prefetching files into cache before they are accessed However, incorrect prediction is to a certain degree both unavoidable and costly. We present the Program-based and User-based Last n Successors (PULnS) file prediction model that identifies relationships between files through the names of the programs and the users accessing them. Our simulation results show that, in the worst case, PULnS makes at least 20% fewer incorrect predictions and roughly the same number of correct predictions as the last-successor model.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127988532","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}
引用次数: 11
Parallel Gaussian elimination using OpenMP and MPI 并行高斯消去使用OpenMP和MPI
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019151
S. McGinn, R. E. Shaw
{"title":"Parallel Gaussian elimination using OpenMP and MPI","authors":"S. McGinn, R. E. Shaw","doi":"10.1109/HPCSA.2002.1019151","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019151","url":null,"abstract":"In this paper, we present a parallel algorithm for Gaussian elimination: in both a shared memory environment using OpenMP, and in a distributed memory environment using MPI. Parallel LU and Gaussian algorithms for linear systems are studied extensively, and the the results of examining various load balancing schemes on both platforms are presented. The results show an improvement in many cases over the default implementation.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128170308","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}
引用次数: 30
A preliminary proposal of a complete environment for practical DSMs's evaluation based on benchmarks's execution 基于基准执行的实际dsm评估的完整环境的初步建议
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019161
M. Marino
{"title":"A preliminary proposal of a complete environment for practical DSMs's evaluation based on benchmarks's execution","authors":"M. Marino","doi":"10.1109/HPCSA.2002.1019161","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019161","url":null,"abstract":"In this study, it is presented a proposal of a complete environment for practical evaluation of the main parameters which describe the behavior of some DSMs under several benchmarks in a PC's network. Since the most important parameters of a DSM's evaluation are evolved in this study, it can be used as a part of a guide for a more complete study of DSM practical evaluations based on benchmarks's execution.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133182490","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}
引用次数: 0
PRO:a model for parallel resource-optimal computation 并行资源优化计算模型
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019141
A. Gebremedhin, I. G. Lassous, J. Gustedt, J. A. Telle
{"title":"PRO:a model for parallel resource-optimal computation","authors":"A. Gebremedhin, I. G. Lassous, J. Gustedt, J. A. Telle","doi":"10.1109/HPCSA.2002.1019141","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019141","url":null,"abstract":"We present a new parallel computation model that enables the design of resource-optimal scalable parallel algorithms and simplifies their analysis. The model rests on the novel idea of incorporating relative optimality as an integral part and measuring the quality of a parallel algorithm in terms of granularity.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131525104","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}
引用次数: 20
CoStore: a reliable and highly available storage system using clusters CoStore:采用集群的高可靠性、高可用性存储系统
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019128
Yong Chen, L. Ni, Chengzhong Xu, Mingyao Yang, J. Kusler, Pei Zheng
{"title":"CoStore: a reliable and highly available storage system using clusters","authors":"Yong Chen, L. Ni, Chengzhong Xu, Mingyao Yang, J. Kusler, Pei Zheng","doi":"10.1109/HPCSA.2002.1019128","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019128","url":null,"abstract":"The CoStore cluster architecture is proposed to construct a reliable and highly available storage system. A prototype CoStore was implemented and its performance was measured with the cluster being mirrored in various network environments. The preliminary results demonstrate that there is little impact on performance if the cluster is mirrored in efficient campus network environments with high bandwidth and low latency. As a result the CoStore architecture considerably reinforces a storage system's preparedness for disaster recovery without sacrificing performance.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134375015","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}
引用次数: 7
Concurrent and distributed data structures for multikey sorting on computer clusters 计算机集群上多键排序的并发和分布式数据结构
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019170
A. Fellah
{"title":"Concurrent and distributed data structures for multikey sorting on computer clusters","authors":"A. Fellah","doi":"10.1109/HPCSA.2002.1019170","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019170","url":null,"abstract":"Summary form only given. This paper focuses on theoretical and practical aspects of the high-performance multikey sorting problem on computer clusters, with particular emphasis on the Alpha Maci Cluster, a world-class high-performance supercomputer that has many processors interconnected by a wide range of high-speed network connections. Even though the focus of this paper is on multikey sorting problems, developing new data structures and techniques for designing high-performance algorithms on computer clusters are of both theoretical and practical interest. We investigate strategies for developing, implementing, and refining high-performance algorithms for sorting multi-dimensional data on computer clusters. In addition, maximizing the performance of such distributed memory machines requires efficient data structures coupled with good load balancing.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"25 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122830394","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}
引用次数: 2
Recovery distributed data using a virtual fragmentation method 使用虚拟分片方法恢复分布式数据
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 1900-01-01 DOI: 10.1109/HPCSA.2002.1019169
J.A. Aguilera Vazquez
{"title":"Recovery distributed data using a virtual fragmentation method","authors":"J.A. Aguilera Vazquez","doi":"10.1109/HPCSA.2002.1019169","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019169","url":null,"abstract":"The classical methods of fragmentation in a database distributed system helps, to a great extent, to make the information retrieval faster. This is particularly true for applications where the specifications are well known in advance at the time of the creation of the tables that compose the database which in some form or other, influenced the design and definition of the type of fragmentation and their distribution on different sites of processing. Nevertheless, the above characteristics cannot be used in applications where the distributed management cannot do inferences that help it to know in what sites the data with some specific characteristics are located. Under these conditions the time and amount of work used by the participants in the query solution can be highly increased. In this paper we show an approach called the virtual fragmentation method. It works as an alternative way that allows us to diminish the response time consumed by queries using horizontal fragmented tables.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123997531","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信