Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263856
A. Richards, T. Ginige, A. Seneviratne, Teresa Buczkowska, M. Fry
It has been shown that protocol processing represents a severe bottle-neck for high speed computer networks. The disadvantage of proposed solutions are their incompatibility with existing standardised protocol implementations and/or their complexity. One method of alleviating this limitation is to have an adaptable protocol stack, as proposed in this paper. Preliminary results are presented which show that significant gains in throughput can be achieved while still maintaining compatibility with existing standard protocol stacks.<>
{"title":"DARTS-a dynamically adaptable transport service suitable for high speed networks","authors":"A. Richards, T. Ginige, A. Seneviratne, Teresa Buczkowska, M. Fry","doi":"10.1109/HPDC.1993.263856","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263856","url":null,"abstract":"It has been shown that protocol processing represents a severe bottle-neck for high speed computer networks. The disadvantage of proposed solutions are their incompatibility with existing standardised protocol implementations and/or their complexity. One method of alleviating this limitation is to have an adaptable protocol stack, as proposed in this paper. Preliminary results are presented which show that significant gains in throughput can be achieved while still maintaining compatibility with existing standard protocol stacks.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116561119","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263845
Taitin Chen, Jim Feeney, G. Fox, G. Frieder, S. Ranka, Bill Wilhelm, Fang-Kuo Yu
This paper discusses the architecture and performance of a prototype switch for interconnecting IBM RISC System/6000 workstations. The paper describes the interconnection architecture and performance on a cluster of four IBM RISC System 6000 model 340 workstations. It also describes the driver level software interface to the switch and the features incorporated to minimize communication overhead. The performance measurements cover communication latency and bandwidth. In addition, performance measurements of Express, a popular parallel-programming interface, are provided.<>
本文讨论了一种用于IBM RISC /6000工作站互连的原型交换机的结构和性能。本文描述了一个由4个IBM RISC System 6000 model 340工作站组成的集群的互连体系结构和性能。它还描述了交换机的驱动级软件接口，以及为最小化通信开销而集成的功能。性能测量包括通信延迟和带宽。此外，还提供了流行的并行编程接口Express的性能测量。
{"title":"A low-latency programming interface and a prototype switch for scalable high-performance distributed computing","authors":"Taitin Chen, Jim Feeney, G. Fox, G. Frieder, S. Ranka, Bill Wilhelm, Fang-Kuo Yu","doi":"10.1109/HPDC.1993.263845","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263845","url":null,"abstract":"This paper discusses the architecture and performance of a prototype switch for interconnecting IBM RISC System/6000 workstations. The paper describes the interconnection architecture and performance on a cluster of four IBM RISC System 6000 model 340 workstations. It also describes the driver level software interface to the switch and the features incorporated to minimize communication overhead. The performance measurements cover communication latency and bandwidth. In addition, performance measurements of Express, a popular parallel-programming interface, are provided.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533802","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263827
S. Srbljic, L. Budin
The proposed distributed shared memory model is based on a data replication scheme that provides an environment for a collection of processes that interact to solve a parallel programming problem. In the implementation of the scheme the authors suppose that the replicas of the shared data are present at each node and that an appropriate coherence protocol for maintaining the consistency among the replicas is applied. The performance of the distributed computation is very sensitive to the data-access behavior of the application and to the applied coherence protocol. Communication cost is regarded as an appropriate performance measure. Therefore, the authors first introduce a model characterizing the computation behavior with five workload parameters. Second, they formally describe the coherence protocols as cooperating state machines in order to evaluate their communication costs as functions of workload parameters.<>
{"title":"Analytical performance evaluation of data replication based shared memory model","authors":"S. Srbljic, L. Budin","doi":"10.1109/HPDC.1993.263827","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263827","url":null,"abstract":"The proposed distributed shared memory model is based on a data replication scheme that provides an environment for a collection of processes that interact to solve a parallel programming problem. In the implementation of the scheme the authors suppose that the replicas of the shared data are present at each node and that an appropriate coherence protocol for maintaining the consistency among the replicas is applied. The performance of the distributed computation is very sensitive to the data-access behavior of the application and to the applied coherence protocol. Communication cost is regarded as an appropriate performance measure. Therefore, the authors first introduce a model characterizing the computation behavior with five workload parameters. Second, they formally describe the coherence protocols as cooperating state machines in order to evaluate their communication costs as functions of workload parameters.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131724207","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263825
A. Banerji, D. Kulkarni, J. Tracey, P. M. Greenawalt, D. Cohn
In order to exploit the latest advances in hardware technology, application developers need high-performance, easy-to-use cooperation tools that spun interconnections of standard hardware. Distributed shared memory has been proposed as such a cooperation tool, but performance problems have limited its usefulness. This paper argues that a new approach to distributed shared memory implementation can make it an effective tool in its own right and a foundation for other tools. It describes a prototype implementation that allows sharing of memory resources in workstation cluster. The prototype is based on an innovative, low-overhead messaging protocol which utilizes the high bandwidth of the underlying hardware, while adding very little latency overhead. Finally, the interface exported by this software is designed to function effectively as a substrate for a variety of cooperation tools.<>
{"title":"High-performance distributed shared memory substrate for workstation clusters","authors":"A. Banerji, D. Kulkarni, J. Tracey, P. M. Greenawalt, D. Cohn","doi":"10.1109/HPDC.1993.263825","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263825","url":null,"abstract":"In order to exploit the latest advances in hardware technology, application developers need high-performance, easy-to-use cooperation tools that spun interconnections of standard hardware. Distributed shared memory has been proposed as such a cooperation tool, but performance problems have limited its usefulness. This paper argues that a new approach to distributed shared memory implementation can make it an effective tool in its own right and a foundation for other tools. It describes a prototype implementation that allows sharing of memory resources in workstation cluster. The prototype is based on an innovative, low-overhead messaging protocol which utilizes the high bandwidth of the underlying hardware, while adding very little latency overhead. Finally, the interface exported by this software is designed to function effectively as a substrate for a variety of cooperation tools.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934761","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263832
A. Nakamura, M. Takizawa
The authors discuss a distributed broadcast protocol which provides priority-based receipt ordering of protocol data units (PDUs) for the application entities by using the high-speed single-channel network in the presence of the loss of PDUs. There is a starvation problem, i.e. lower-priority PDUs can be left waiting indefinitely in the receipt queue since higher-priority PDUs jump over lower-priority ones. They present a method by which even lower-priority PDUs are delivered to the application entities in some pre-defined time by partitioning the receipt sequence of PDUs into runs, where each runs is priority-based ordered.<>
{"title":"Starvation-prevented priority-based total ordering broadcast protocol on high-speed single channel network","authors":"A. Nakamura, M. Takizawa","doi":"10.1109/HPDC.1993.263832","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263832","url":null,"abstract":"The authors discuss a distributed broadcast protocol which provides priority-based receipt ordering of protocol data units (PDUs) for the application entities by using the high-speed single-channel network in the presence of the loss of PDUs. There is a starvation problem, i.e. lower-priority PDUs can be left waiting indefinitely in the receipt queue since higher-priority PDUs jump over lower-priority ones. They present a method by which even lower-priority PDUs are delivered to the application entities in some pre-defined time by partitioning the receipt sequence of PDUs into runs, where each runs is priority-based ordered.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124635515","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263854
S. Hariri, Jong Park, Fang-Kuo Yu, M. Parashar, G. Fox
The proliferation of high performance workstations and the emergence of high speed networks have attracted a lot of interest in parallel and distributed computing (PDC). The authors envision that PDC environments with supercomputing capabilities will be available in the near future. However, a number of hardware and software issues have to be resolved before the full potential of these PDC environments can be exploited. The presented research has the following objectives: (1) to characterize the message-passing primitives used in parallel and distributed computing; (2) to develop a communication protocol that supports PDC; and (3) to develop an architectural support for PDC over gigabit networks.<>
{"title":"A message passing interface for parallel and distributed computing","authors":"S. Hariri, Jong Park, Fang-Kuo Yu, M. Parashar, G. Fox","doi":"10.1109/HPDC.1993.263854","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263854","url":null,"abstract":"The proliferation of high performance workstations and the emergence of high speed networks have attracted a lot of interest in parallel and distributed computing (PDC). The authors envision that PDC environments with supercomputing capabilities will be available in the near future. However, a number of hardware and software issues have to be resolved before the full potential of these PDC environments can be exploited. The presented research has the following objectives: (1) to characterize the message-passing primitives used in parallel and distributed computing; (2) to develop a communication protocol that supports PDC; and (3) to develop an architectural support for PDC over gigabit networks.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115041528","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263830
A. Tripathi, Surya P. Koneru, Clifton Nock, Renu Tewari, Neeran M. Karnik, V. Bandi, Khaled Day, T. Noonan
This paper describes the approach taken for configuration management in the Nexus distributed operating system. Nexus uses kernel-level support for monitoring status of distributed components of an application. Periodic user-level messages are no longer required for status monitoring. Group and dependency relationships between such components can be defined by the programmer for the purpose of configuration monitoring and management. An object belonging to a distributed application can be monitored by its host kernel for some system-defined exception conditions. When any of these conditions arise, other objects are notified through signals or messages, as specified by the programmer.<>
{"title":"Reliable management of distributed computations in Nexus","authors":"A. Tripathi, Surya P. Koneru, Clifton Nock, Renu Tewari, Neeran M. Karnik, V. Bandi, Khaled Day, T. Noonan","doi":"10.1109/HPDC.1993.263830","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263830","url":null,"abstract":"This paper describes the approach taken for configuration management in the Nexus distributed operating system. Nexus uses kernel-level support for monitoring status of distributed components of an application. Periodic user-level messages are no longer required for status monitoring. Group and dependency relationships between such components can be defined by the programmer for the purpose of configuration monitoring and management. An object belonging to a distributed application can be monitored by its host kernel for some system-defined exception conditions. When any of these conditions arise, other objects are notified through signals or messages, as specified by the programmer.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789794","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263826
N. Sharma, D. Agrawal
Design of a large distributed system (DS) is becoming increasing important and with its added popularity, it is crucial to define its topology based on some objective function. This paper introduces a reliability-based systematic approach for defining the topology of a DS network in a hierarchical form, given the traffic requirements, a set of cluster topologies and the cost constraints. The authors scheme first identifies a group of permissible inter-cluster links which yields the maximum network reliability to cost ratio and then selects the gateways within each cluster for balancing the traffic through the inter-cluster links and the node degrees within each cluster. The usefulness of their method lies in a simultaneous consideration of the cost and the network reliability. Some examples are included to illustrate their design procedure.<>
{"title":"Hierarchical distributed system network design with cost-performance tradeoffs","authors":"N. Sharma, D. Agrawal","doi":"10.1109/HPDC.1993.263826","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263826","url":null,"abstract":"Design of a large distributed system (DS) is becoming increasing important and with its added popularity, it is crucial to define its topology based on some objective function. This paper introduces a reliability-based systematic approach for defining the topology of a DS network in a hierarchical form, given the traffic requirements, a set of cluster topologies and the cost constraints. The authors scheme first identifies a group of permissible inter-cluster links which yields the maximum network reliability to cost ratio and then selects the gateways within each cluster for balancing the traffic through the inter-cluster links and the node degrees within each cluster. The usefulness of their method lies in a simultaneous consideration of the cost and the network reliability. Some examples are included to illustrate their design procedure.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125193334","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263855
T. Braun, C. Schmidt
Requirements of emerging applications together with rapid changes in networking technology towards gigabit speeds require new adequate transport systems. Integrated designs of transport services, protocol architecture, and implementation platforms are needed for the requirements of forthcoming applications in high-speed network environments. The transport subsystem PATROCLOS (Parallel Transport subsystem for cell based high speed networks) is designed with special emphasis on a high degree of inherent parallelism to allow efficient implementations on multiprocessor architectures combined with specialised hardware for very time critical functions. The paper presents transport system design guidelines based on experiences gained with parallel implementations of transport and network layer protocols on transputer networks, an implementation architecture for PATROCLOS based on transputer networks and results of a performance evaluation, which indicate promising throughput values.<>
{"title":"Implementation of a parallel transport subsystem on a multiprocessor architecture","authors":"T. Braun, C. Schmidt","doi":"10.1109/HPDC.1993.263855","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263855","url":null,"abstract":"Requirements of emerging applications together with rapid changes in networking technology towards gigabit speeds require new adequate transport systems. Integrated designs of transport services, protocol architecture, and implementation platforms are needed for the requirements of forthcoming applications in high-speed network environments. The transport subsystem PATROCLOS (Parallel Transport subsystem for cell based high speed networks) is designed with special emphasis on a high degree of inherent parallelism to allow efficient implementations on multiprocessor architectures combined with specialised hardware for very time critical functions. The paper presents transport system design guidelines based on experiences gained with parallel implementations of transport and network layer protocols on transputer networks, an implementation architecture for PATROCLOS based on transputer networks and results of a performance evaluation, which indicate promising throughput values.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128811203","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}
Pub Date : 1993-07-20DOI: 10.1109/HPDC.1993.263864
H. T. Kung
Summary form only given. This paper argues that, for high-speed networks such as ATM, it is important to use link-by-link flow control on a per virtual circuit (VC) basis. It can effectively control congestion and maximize network utilization. Three progressively memory-efficient, credit-based flow control schemes, called N123, N123+ and N23, are described, and simulation results of these schemes are presented. An ATM switch, which supports credit-based flow control, is under joint development by BNR and Harvard.<>
{"title":"New flow control methods for high-speed networks","authors":"H. T. Kung","doi":"10.1109/HPDC.1993.263864","DOIUrl":"https://doi.org/10.1109/HPDC.1993.263864","url":null,"abstract":"Summary form only given. This paper argues that, for high-speed networks such as ATM, it is important to use link-by-link flow control on a per virtual circuit (VC) basis. It can effectively control congestion and maximize network utilization. Three progressively memory-efficient, credit-based flow control schemes, called N123, N123+ and N23, are described, and simulation results of these schemes are presented. An ATM switch, which supports credit-based flow control, is under joint development by BNR and Harvard.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344365","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：