Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000最新文献

筛选
英文 中文
Limits and power of the simplest uniform and self-stabilizing phase clock algorithm 最简单的均匀自稳定相位时钟算法的限制和功率
F. Nolot, V. Villain
{"title":"Limits and power of the simplest uniform and self-stabilizing phase clock algorithm","authors":"F. Nolot, V. Villain","doi":"10.1109/IPDPS.2000.846033","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846033","url":null,"abstract":"In this paper, the phase clock algorithm which stabilizes on general graphs is studied on anonymous rings. The authors showed that this K-clock algorithm works with K/spl ges/2D, where D is the diameter of the graph. We prove that this algorithm works on unidirectional (bidirectional) rings iff K satisfies K>K'K/K'+n(2K>2K'-K/K'+n, respectively) where K' is the greatest divisor of K (K'/spl ne/K) and n is the size of the ring. From this characterization, we show that any ring stabilizes with some K<2D if K is odd. We also prove that, if K is prime, unidirectional and bidirectional rings stabilize with K<2[n/2]/spl sime/D and K<2[n/3]/spl sime/4D/3, respectively. Finally, we generalize the algorithm to synchronize any ring with any clock value.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130720948","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
Predicting performance on SMPs. A case study: the SGI Power Challenge 预测smp上的性能。一个案例研究:SGI权力挑战
N. Amato, J. Perdue, M. Mathis, A. Pietracaprina, G. Pucci
{"title":"Predicting performance on SMPs. A case study: the SGI Power Challenge","authors":"N. Amato, J. Perdue, M. Mathis, A. Pietracaprina, G. Pucci","doi":"10.1109/IPDPS.2000.846058","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846058","url":null,"abstract":"We study the issue of performance prediction on the SGI-Power Challenge, a typical SMP. On such a platform, the cost of memory accesses depends on their locality and on contention among processors. By running a carefully designed suite of microbenchmarks, we provide quantitative evidence that memory hierarchy effects impact performance far more substantially than other phenomena related to contention. We also fit three cost functions based on variants of the BSP model, which do not account for the hierarchy, and a newly defined function F expressed in terms of hardware counters, which captures both memory hierarchy and contention effects. We test the accuracy of all the functions on both synthetic and application benchmarks showing that, unlike the other functions, F achieves an excellent level of accuracy in all cases. Although hardware counters are only available at run-time, we give evidence that function F can still be employed as a prediction tool by extrapolating values of the counters from pilot runs on small input sizes.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"85 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113960899","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
Job scheduling that minimizes network contention due to both communication and I/O 最小化由于通信和I/O引起的网络争用的作业调度
Jens Mache, V. Lo, Sharad Garg
{"title":"Job scheduling that minimizes network contention due to both communication and I/O","authors":"Jens Mache, V. Lo, Sharad Garg","doi":"10.1109/IPDPS.2000.846022","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846022","url":null,"abstract":"As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performance. Whereas earlier allocation strategies were either sensitive to communication alone or sensitive to I/O alone, we present a new strategy that is sensitive to both communication and I/O. Our new strategy MC-Elongated, strives to achieve (1) the compactness needed to minimize communication-based contention as well as (2) the balance and orientation relative to I/O nodes needed to minimize I/O-based contention. We tested our new strategy using synthetic workloads and a real workload trace of 6087 jobs captured from a 400 node Intel Paragon. Our results show that with respect to system throughput and average job turnaround time, in environments with varying degree of communication and I/O traffic, MC-Elongated outperforms previous allocation strategies that are in use today. Regarding the tension between communication and I/O, our results show that spatial layout is more critical for I/O intensive jobs at lower utilization levels and more critical for communication-intensive jobs at higher utilization levels; and that in general, the impact of I/O traffic is dominant.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"75 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116698581","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}
引用次数: 16
A component framework for communication in distributed applications 分布式应用程序中用于通信的组件框架
Jeffrey M. Fischer, M. Ercegovac
{"title":"A component framework for communication in distributed applications","authors":"Jeffrey M. Fischer, M. Ercegovac","doi":"10.1109/IPDPS.2000.846047","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846047","url":null,"abstract":"The development of communications services for distributed applications that are both well-structured (layered) and efficient can be difficult. This paper presents a C++ framework which promotes the development of reusable components that can be combined to implement communications services. These flexible services can be built without incurring an unacceptable performance cost. The basic abstractions in the framework are presented, followed by a discussion of more specific services for unstructured binary messages. Then, the performance impact of the framework is analyzed using a simple test application. The framework is shown to have a minimal overhead that is independent of message size.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115181102","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}
引用次数: 3
JavaSpMT: A speculative thread pipelining parallelization model for Java programs JavaSpMT: Java程序的推测线程流水线并行化模型
I. Kazi, D. Lilja
{"title":"JavaSpMT: A speculative thread pipelining parallelization model for Java programs","authors":"I. Kazi, D. Lilja","doi":"10.1109/IPDPS.2000.846035","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846035","url":null,"abstract":"This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model to exploit coarse-grained parallelism on a shared-memory multiprocessor system. The parallelization model, called Java Speculative MultiThreading (JavaSpMT), combines control speculation with run-time dependence checking to parallelize a wide variety of loop constructs, including do-while loops, that cannot be parallelized using standard parallelization techniques. JavaSpMT is implemented using the standard Java multithreading mechanism and the parallelization is expressed using a Java source-to-source transformation. Thus, the transformed programs are still portable to any shared-memory multiprocessor system with a Java Virtual Machine implementation that supports native threads.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191089","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}
引用次数: 29
Enhancing NWS for use in an SNMP managed internetwork 增强NWS用于SNMP管理的网络
R. Busby, M. Neilsen, Daniel Andresen
{"title":"Enhancing NWS for use in an SNMP managed internetwork","authors":"R. Busby, M. Neilsen, Daniel Andresen","doi":"10.1109/IPDPS.2000.846028","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846028","url":null,"abstract":"The Network Weather Service (NWS) is a distributed resource monitoring and utilization prediction system, employed as an aid to scheduling jobs in a metacomputing environment. We have enhanced the Network Weather Service by providing a broader metric set, forecast trend visualization, and asynchronous notification. Three new components have been added to the NWS system. The first of these is an SNMP Sensor that may be used to collect data being tracked by SNMP agents. Secondly, a Notification Process provides asynchronous events to interested applications when metrics tracked by NWS are expected to exceed established normal ranges. Finally, an extended SNMP agent daemon has been developed to provide SNMP-enabled applications with the ability to retrieve information from NWS without the need for custom programming. The new modules help to position NWS as an integral component for performing QoS monitoring and fault prediction in an SNMP-based fault management architecture. We also demonstrate that the additional functionality adds a minimal amount of overhead to the system, and reported bandwidth utilization correlates closely with results from the invasive NWS bandwidth sensor.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126244223","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
Adaptive routing in RS/6000 SP-like bidirectional multistage interconnection networks RS/6000 SP 类双向多级互连网络中的自适应路由选择
M. Banikazemi, D. Panda, C. Stunkel, B. Abali
{"title":"Adaptive routing in RS/6000 SP-like bidirectional multistage interconnection networks","authors":"M. Banikazemi, D. Panda, C. Stunkel, B. Abali","doi":"10.1109/IPDPS.2000.845963","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845963","url":null,"abstract":"The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. In this paper, we present the adaptive routing scheme used in the new SP network switch chip called the Switch2. We show that the adaptive routing methods outperform the oblivious routing methods on SP like multistage networks. It is shown that the adaptive routing increases the network throughout by up to 229% over oblivious routing in some cases. We also study the effect of output selection, functions on the network performance. We present six different output selection functions and study their performance for different system parameters and communication patterns through extensive simulation. The results show that three of these selection functions perform similar to each other and outperform the other selection functions consistently. Therefore, unlike previous research findings for meshes and tori, there is no need to use multiple (or hybrid) selection functions to obtain the best performance for the SP like bidirectional multistage interconnection networks. We also provide an analysis of the cost-effectiveness of different selection functions with respect to the complexity of their hardware implementations.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127357801","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
Parallel maximum-likelihood inversion for estimating wavenumber-ordered spectra in emission spectroscopy 发射光谱学中估计波数有序光谱的并行最大似然反演
H. El-Sayed, M. Salit, J. Travis, J. Devaney, W. George
{"title":"Parallel maximum-likelihood inversion for estimating wavenumber-ordered spectra in emission spectroscopy","authors":"H. El-Sayed, M. Salit, J. Travis, J. Devaney, W. George","doi":"10.1109/IPDPS.2000.845966","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845966","url":null,"abstract":"We introduce a parallelization of the maximum likelihood cosine transform. This transform consists of a computationally intensive iterative fitting process, but is readily decomposed for parallel processing. The parallel implementation is not only scalable, but has also brought the execution time of this previously intractable problem to feasible levels using contemporary and cost-efficient high-performance computers, including an SGI Origin 2000, an SGI Onyx, and a cluster of Intel-based PCs.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130978","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
FIMD-MPI: a tool for injecting faults into MPI application find -MPI:将故障注入MPI应用程序的工具
D. Blough, Peng Liu
{"title":"FIMD-MPI: a tool for injecting faults into MPI application","authors":"D. Blough, Peng Liu","doi":"10.1109/IPDPS.2000.845991","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845991","url":null,"abstract":"Parallel computing is seeing increasing use in critical applications. The need therefore arises to test the robustness of parallel applications in the presence of exceptional conditions, or faults. Communication-software-based fault injection is an extremely flexible approach to robustness testing in message-passing parallel computers. A fault injection methodology and tool that use this approach are presented. The tool, known as FIMD-MPI, allows injection of faults into MPI-based applications. The structure and operation of FIMD-MPI are described and the use of the tool is illustrated on an example fault-tolerant MPI application.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124762123","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
Are global computing systems useful? Comparison of client-server global computing systems Ninf, NetSolve versus CORBA 全球计算系统有用吗?客户机-服务器全球计算系统Ninf、NetSolve与CORBA的比较
T. Suzumura, T. Nakagawa, S. Matsuoka, H. Nakada, S. Sekiguchi
{"title":"Are global computing systems useful? Comparison of client-server global computing systems Ninf, NetSolve versus CORBA","authors":"T. Suzumura, T. Nakagawa, S. Matsuoka, H. Nakada, S. Sekiguchi","doi":"10.1109/IPDPS.2000.846034","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846034","url":null,"abstract":"Recent developments of global computing systems such as Ninf, NetSolve and Globus have opened up the opportunities for providing high-performance computing services over wide-area networks. However, most research focused on the individual architectural aspects of the system, or application deployment examples, instead of the necessary characteristics such systems should intrinsically satisfy, nor how such systems relate with each other. Our comparative study performs deployment of example applications of network-based libraries using Ninf, NetSolve, and CORBA systems. There, we discover that dedicated systems for global computing such as Ninf and NetSolve have management, programmability, and it does not suffer performance disadvantages over more generic distributed computing capabilities provided by CORBA. Such results indicate the advantage of dedicated global computing systems over general systems, stemming further basic research is necessary across multiple systems to identify the ideal software architectures for global computing.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131420951","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}
引用次数: 14
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学术官方微信