ACM/IEEE SC 1997 Conference (SC'97)最新文献_第6页

Page Replacement Using Marginal Loss Functions 使用边际损失函数替换页面

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509643

M. Ujaldón, Shamik D. Sharma, J. Saltz

引用次数: 1

FM-QoS: Real-time Communication using Self-synchronizing Schedules FM-QoS:使用自同步调度的实时通信

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509595

Kay Connelly, A. Chien

{"title":"FM-QoS: Real-time Communication using Self-synchronizing Schedules","authors":"Kay Connelly, A. Chien","doi":"10.1145/509593.509595","DOIUrl":"https://doi.org/10.1145/509593.509595","url":null,"abstract":"FM-QoS employs a novel communication architecture based on network feedback to provide predictable communication performance (e.g. deterministic latencies and guaranteed bandwidths) for high speed cluster interconnects. Network feedback is combined with self-synchronizing communication schedules to achieve synchrony in the network interfaces (NIs). Based on this synchrony, the network can be scheduled to provide predictable performance without special network QoS hardware. We describe the key element of the FM-QoS approach, feedback-based synchronization (FBS), which exploits network feedback to synchronize senders. We use Petri nets to characterize the set of self-synchronizing communication schedules for which FBS is effective and to describe the resulting synchronization overhead as a function of the clock drift across the network nodes. Analytic modeling suggests that for clocks of quality 300 ppm (such as found in the Myrinet NI), a synchronization overhead less than 1% of the total communication traffic is achievable -- significantly better than previous software-based schemes and comparable to hardware-intensive approaches such as virtual circuits (e.g. ATM). We have built a prototype of FBS for Myricom s Myrinet network (a 1.28 Gbps cluster network) which demonstrates the viability of the approach by sharing network resources with predictable performance. The prototype, which implements the local node schedule in software, achieves predictable latencies of 23 µs for a single-switch, 8-node network and 2 KB packets. In comparison, the best-effort scheme achieves 104 µs for the same network without FBS. While this ratio of over four to one already demonstrates the viability of the approach, it includes nearly 10 µs of overhead due to the software implementation. For hardware implementations of local node scheduling, and for networks with cascaded switches, these ratios should be much larger factors.","PeriodicalId":315276,"journal":{"name":"ACM/IEEE SC 1997 Conference (SC'97)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126745328","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}

引用次数: 25

Implementing a Performance Forecasting System for Metacomputing The Network Weather Service 基于元计算的网络气象服务性能预报系统的实现

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509600

R. Wolski, N. Spring, C. Peterson

{"title":"Implementing a Performance Forecasting System for Metacomputing The Network Weather Service","authors":"R. Wolski, N. Spring, C. Peterson","doi":"10.1145/509593.509600","DOIUrl":"https://doi.org/10.1145/509593.509600","url":null,"abstract":"In this paper we describe the design and implementation of a system called the Network Weather Service (NWS) that takes periodic measurements of deliverable resource performance from distributed networked resources, and uses numerical models to dynamically generate forecasts of future performance levels. These performance forecasts, along with measures of performance fluctuation (e.g the mean square prediction error) and forecast lifetime that the NWS generates, are made available to schedulers and other resource management mechanisms at runtime so that they may determine the quality-of-service that will be available from each resource. We describe the architecture of the NWS and implementations that we have developed and are currently deploying for the Legion [13] and Globus/Nexus [7] metacomputing infrastructures. We also detail NWS forecasts of resource performance using both the Legion and Globus/Nexus implementations. Our results show that simple forecasting techniques substantially outperform measurements of current conditions (commonly used to gauge resource availability and load) in terms of prediction accuracy. In addition, the techniques we have employed are almost as accurate as substantially more complex modeling methods. We compare our techniques to a sophisticated time-series analysis system in terms of forecasting accuracy and computational complexity.","PeriodicalId":315276,"journal":{"name":"ACM/IEEE SC 1997 Conference (SC'97)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127814040","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}

引用次数: 143

Issues in the Design of a Flexible Distributed Architecture for Supporting Persistence and Interoperability in Collaborative Virtual Environments 支持协作虚拟环境中持久性和互操作性的灵活分布式体系结构设计中的问题

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509614

J. Leigh

引用次数: 49

Compiling Parallel Code for Sparse Matrix Applications 编译并行代码稀疏矩阵应用程序

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509603

V. Kotlyar, K. Pingali, Paul V. Stodghill

引用次数: 27

The Effects of Communication Parameters on End Performance of Shared Virtual Memory Clusters 通信参数对共享虚拟内存集群终端性能的影响

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509594

A. Bilas, J. Singh

{"title":"The Effects of Communication Parameters on End Performance of Shared Virtual Memory Clusters","authors":"A. Bilas, J. Singh","doi":"10.1145/509593.509594","DOIUrl":"https://doi.org/10.1145/509593.509594","url":null,"abstract":"Recently there has been a lot of effort in providing cost-effective Shared Memory systems by employing software only solutions on clusters of high-end workstations coupled with high-bandwidth, low-latency commodity networks. Much of the work so far has focused on improving protocols, and there has been some work on restructuring applications to perform better on SVM systems. The result of this progress has been the promise for good performance on a range of applications at least in the 16-32 processor range. New system area networks and network interfaces provide significantly lower overhead, lower latency and higher bandwidth communication in clusters, inexpensive SMPs have become common as the nodes of these clusters, and SVM protocols are now quite mature. With this progress, it is now useful to examine what are the important system bottlenecks that stand in the way of effective parallel performance; in particular, which parameters of the communication architecture are most important to improve further relative to processor speed, which ones are already adequate on modern systems for most applications, and how will this change with technology in the future. Such information can assist system designers in determining where to focus their energies in improving performance, and users in determining what system characteristics are appropriate for their applications. We find that the most important system cost to improve is the overhead of generating and delivering interrupts. Improving network interface (and I/O bus) bandwidth relative to processor speed helps some bandwidth-bound applications, but currently available ratios of bandwidth to processor speed are already adequate for many others. Surprisingly, neither the processor overhead for handling messages nor the occupancy of the communication interface in preparing and pushing packets through the network appear to require much improvement.","PeriodicalId":315276,"journal":{"name":"ACM/IEEE SC 1997 Conference (SC'97)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122026428","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}

引用次数: 35

The Starfire SMP Interconnect Starfire SMP互连

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509630

Alan E. Charlesworth, Nicholas E. Aneshansley, Mark Haakmeester, Dan Drogichen, Gary Gilbert, Ricki Williams, Andy Phelps

引用次数: 17

A Checkpointing Strategy for Scalable Recovery on Distributed Parallel Systems 分布式并行系统可扩展恢复的检查点策略

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-11-15 DOI: 10.1145/509593.509625

V. Naik, S. Midkiff, J. Moreira

引用次数: 16

Pentium Pro Inside: I. A Treecode at 430 Gigaflops on ASCI Red, II. Price/Performance of $50/Mflop on Loki and Hyglac Pentium Pro内部:1 .在ASCI Red上运行430千兆次浮点运算的Treecode;Loki和Hyglac的性价比为50美元/Mflop

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1997-06-01 DOI: 10.1109/SC.1997.10057

Michael S. Warren, J. Salmon, D. Becker, M. Goda, T. Sterling, W. Winckelmans

引用次数: 49

Divide and Conquer Spot Noise 分而治之点噪

ACM/IEEE SC 1997 Conference (SC'97) Pub Date : 1900-01-01 DOI: 10.1145/509593.509612

W. D. de Leeuw

引用次数: 0