检索结果-内蒙古大学图书馆

15th International Parallel and distributed Processing Symposium, IPDPS 2001

作者： Buntinas, D. Panda, D.K. Sadayappan, P. Network-Based Computing Laboratory Department of Computer and Information Science Ohio State University ColumbusOH43210 United States

ISBN: (纸本)0769509908

Barrier synchronization is a common operation in parallel and distributed systems. A fast implementation is important because it allows fine grained parallel programs to be more efficient. It is therefore important to minimize the latency of barrier operations. Modern network interface cards (NICs) have programmable processors which can be used to support collective communications such as barrier. In [4] we have designed and implemented a NIC-based barrier feature over GM. This new NIC-based barrier operation raises many open questions which must be answered. Does the NIC-based barrier perform better than the host-based barrier? How does the performance of the NIC-based barrier change with better NICs? Is the NIC-based barrier scalable? How does the performance of the NIC-based barrier affect the granularity of computation? How does the NIC-based barrier affect the performance of applications? In this paper, we take on these challenges. We find that the NIC-based barrier performs better than the host-based barrier with up to a 2.22 factor of improvement on an eight node system at the MPI-level. We also find that the factor of improvement values increase with the number of nodes indicating that the NIC-based barrier is more scalable. We find that the NIC-based barrier also allows for finer grained computation without affecting the efficiency of the program. Finally, by using synthetic applications on an eight node system, we find up to a 1.93 factor of improvement in the applications using a NIC-based barrier versus using a host-based barrier. These results indicate that NIC-based barrier in current and future clusters can deliver significant performance benefits to the applications. © 2001 IEEE.

关键词： Interfaces (computer)

来源：评论

学校读者我要写书评

暂无评论

Core-stateless guaranteed rate scheduling algorithms

Core-stateless guaranteed rate scheduling algorithms

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： J. Kaur H.M. Vin Distributed Multimedia Computing Laboratory Department of Computer Sciences University of Texas Austin USA

ISBN: (纸本)0780370163

Many per-flow scheduling algorithms have been proposed to provide rate and delay guarantees to flows. It is often argued that the need for maintaining per-flow state and performing per-packet classification seriously limits the scalability of routers that employ such per-flow scheduling algorithms. Consequently, design of algorithms that can provide per-flow rate and delay guarantees without requiring per-flow functionality in the network core routers has become an active area of research. We propose a methodology to transform any guaranteed rate (GR) per-flow scheduling algorithm into a version that does not require per-flow state to be maintained in the core routers. We prove that a network of such core-stateless servers provides the same delay guarantee as a corresponding network of GR servers.

关键词： Scheduling algorithm Scalability Delay network servers Aggregates Laboratories Web server Web and internet services Telecommunication traffic Jitter

来源：评论

学校读者我要写书评

暂无评论

Web search engine:characteristics of user behaviors and their implication

引用

Science in China(Series F) 2001年第5期44卷 351-365页

作者：王建勇单松巍雷鸣谢正茂李晓明 1. Networking and Distributed Computing Systems Laboratory Department of Computer Science and Technology Peking University 100871 Beijing China

In this paper, first studied are the distribution characteristics of user behaviors based on log data from a massive web search engine. Analysis shows that stochastic distribution of user queries accords with the characteristics of power-law function and exhibits strong similarity, and the user' s queries and clicked URLs present dramatic locality, which implies that query cache and 'hot click' cache can be employed to improve system performance. Then three typical cache replacement policies are compared, including LRU, FIFO, and LFU with attenuation. In addition, the distribution character-istics of web information are also analyzed, which demonstrates that the link popularity and replica pop-ularity of a URL have positive influence on its importance. Finally, variance between the link popularity and user popularity, and variance between replica popularity and user popularity are analyzed, which give us some important insight that helps us improve the ranking algorithms in a search engine.

关键词： world wide web search engine distribution characteristic web information user behavior.

来源：评论

学校读者我要写书评

暂无评论

Dynamic reconfiguration in high-speed computer clusters

Dynamic reconfiguration in high-speed computer clusters

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： D. Avresky N. Natchev V. Shurbanov Network Computing Lab Department of El. and Computer Engineering Northeastern University Boston MA USA Network Computing Laboratory Department of El. and Computer Engineering Northeastern University Boston MA USA

来源：评论

学校读者我要写书评

暂无评论

Fast NIC-based barrier over Myrinet/GM

Fast NIC-based barrier over Myrinet/GM

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： D. Buntinas D.K. Panda P. Sadayappan Network-Based Computing Laboratory Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

ISBN: (纸本)0769509908

An efficient barrier implementation is desirable on parallel systems to obtain good parallel speedup and to support finer-grained computation. Some modern network Interface Cards (NICs) have programmable processors which can be used to provide support for collective communications such as barrier In this paper we utilize such a programmable NIC to provide an efficient barrier synchronization operation. This paper describes the design, implementation and evaluation of a NIC-based barrier operation as an addition to Myricom's GM message passing system. Our NIC-based barrier implementation achieved a barrier latency of 102.14 /spl mu/s for 16 nodes which is a 1.78 factor of improvement over the host-based barrier using the same algorithm for LANai 4.3 NIC cards. Using LANai 7.2 cards, which has a faster processor, we achieved a 1.83 factor of improvement for eight nodes. Our NIC-based barrier operation promises scalable fine-grained parallel computation over clusters of workstations. To the best of our knowledge, this is the first NIC-level barrier implementation on a cluster with Myrinet/GM.

关键词： Concurrent computing Delay Computer networks Workstations Hardware Software algorithms network interfaces Message passing Clustering algorithms Laboratories

来源：评论

学校读者我要写书评

暂无评论

Performance benefits of NIC-based barrier on myrinet/GM

Performance benefits of NIC-based barrier on myrinet/GM

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： D. Buntinas D.K. Panda P. Sadayappan Network-Based Computing Laboratory Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

来源：评论

学校读者我要写书评

暂无评论

Optimal utilization of equivalent paths in computer networks with static routing

Optimal utilization of equivalent paths in computer networks...

引用

IEEE International Symposium on network computing and Applications

作者： D. Avresky V. Shurbanov N. Natchev F. Zuccarino P. Mehra Network Computing Laboratory Department of El. and Computer Engineering Northeastern University Boston MA USA Compaq Tandem Laboratories Cupertino CA USA

ISBN: (纸本)0769514324

Focuses on the utilization of alternative communication paths in local and system area networks with static routing. A lot of research work has been devoted to employing such paths for fault tolerance, but the issue of utilizing them for performance enhancement has been largely neglected, especially for static routing networks. This work formally proves that the throughput of multiple paths is maximal if the traffic is uniformly distributed over them. Based on this, a procedure for destination partitioning in static routing networks is introduced. It is applicable to arbitrary multi-path topologies and traffic patterns that lend themselves to partitioning. The procedure is applied to several topologies with different degree of equivalent paths coverage and their performance is evaluated through simulations. The results demonstrate that the network performance is significantly improved when the proposed partitioning procedure is applied.

关键词： Intelligent networks Computer networks Routing Telecommunication traffic Fault tolerance Throughput network topology Computer network reliability Electronic mail Delay

来源：评论

学校读者我要写书评

暂无评论

NIC-based rate control for proportional bandwidth allocation in Myrinet clusters

NIC-based rate control for proportional bandwidth allocation...

引用

International Conference on Parallel Processing (ICPP)

作者： A. Gulati D.K. Panda P. Sadayappan P. Wyckoff Department of Computer and Information Science Network-Based Computing Laboratory Ohio State Uinversity Columbus OH USA Ohio Supercomputer Center Columbus OH USA

Simultaneous advances in processor, network and protocol technologies have made clusters of workstations attractive vehicles for high performance computing. However, clusters are now being increasingly used in environments characterized by non-cooperating communication flows with a range of service requirements. This necessitates quality of service (QoS) mechanisms in clusters. The approaches to QoS in the wide-area networking context are not suitable for clusters because of the high overheads. Also, contention between flows at the end-nodes has not been addressed earlier. In this paper, we explore the use of "rate control" as a means for proportional bandwidth allocation in clusters. A NIC-based solution is presented, with details on implementation in Myrinet/GM. Experimental results show that rate control can handle both end-node and network contention, without adding significant overhead. Our approach is particularly attractive since it does not require hardware modifications, and can hence work with commodity systems with programmable NICs.

关键词： Proportional control Channel allocation Quality of service Communication system control Protocols Workstations Vehicles High performance computing Context Hardware

来源：评论

学校读者我要写书评

暂无评论

High performance computing in coastal and hydraulic applications

High performance computing in coastal and hydraulic applicat...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： S. Aliabadi A. Johnson C. Berger J. Smith J. Abedi B. Zellars A.A. Abatan Department of Engineering Clark Atlanta University Atlanta GA USA Army HPC Research Center Network Computing Services Inc. Minneapolis MN USA Engineer Research and Development Center Coastal and Hydraulics Laboratory Vicksburg MS USA

ISBN: (纸本)0769509908

Parallel computation of unsteady, free-surface flow applications are performed using stabilized finite element method. The finite element formulations are written for fix meshes and are based on the Navier-Stokes equations and an advection equation governing the motion of the interface function. To increase the accuracy of the method, an interface-sharpening/mass conservation algorithm is designed. The method has been implemented on the CRAY T3E and also IBM SP/6000 using the MPI libraries. We show the effectiveness of the method in simulating complex 3D costal and hydraulic applications such as flow in open channels, wave formation and wave interaction with ships in motion. Some simulations are performed on unstructured meshes with 200 million tetrahedral elements.

关键词： High performance computing Sea measurements Navier-Stokes equations Finite element methods Computational modeling Nonlinear systems Military computing Marine vehicles Nonlinear equations Newton method

来源：评论

学校读者我要写书评

暂无评论

High performance computing in coastal and hydraulic applications 15

High performance computing in coastal and hydraulic applicat...

引用

15th International Parallel and distributed Processing Symposium, IPDPS 2001

作者： Aliabadi, S. Johnson, A. Berger, C. Smith, J. Abedi, J. Zellars, B. Abatan, A.A. Department of Engineering Clark Atlanta University 223 James P. Brawley Dr. S. W. AtlantaGA30314 United States Network Computing Services Inc. Army HPC Research Center 1200 Washington Ave. S. MinneapolisMN55415 United States Engineer Research and Development Center Coastal and Hydraulics Laboratory ERDC-CHL 3909 Halls Ferry Road VicksburgMS39180-6199 United States

ISBN: (纸本)0769509908

关键词： Navier Stokes equations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：