{"title":"A multithreaded message passing environment for ATM LAN/WAN","authors":"Rajesh Yadav, Rajashekar Reddy, S. Hariri","doi":"10.1109/HPDC.1995.518715","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518715","url":null,"abstract":"Large scale High Performance Computing and Communication (HPCC) applications (e.g. Video-on-Demand, and HPDC) would require storage and processing capabilities which are beyond existing single computer systems. The current advances in networking technology (e.g. ATM) have made high performance network computing an attractive computing environment for such applications. However, using only high speed network is not sufficient to achieve high performance distributed computing environment unless some hardware and software problems have been resolved. These problems include the limited communication bandwidth available to the application, high overhead associated with context switching, redundant data copying during protocol processing and lack of support to overlap computation and communication at application level. In this paper, we propose a multithreaded message passing system for parallel/distributed processing that we refer to as NYNET communication system (NCS). NCS, being developed for NYNET (ATM wide area network testbed), is built on top of an ATM application programmer interface (API). The multithreaded environment allows applications to overlap computations and communications and provides a modular approach to support efficiently HPDC applications with different quality of service (QOS) requirements.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114404080","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}
{"title":"Performance benefits of optimistic programming: a measure of HOPE","authors":"Crispin Cowan, H. Lutfiyya, M. Bauer","doi":"10.1109/HPDC.1995.518710","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518710","url":null,"abstract":"Optimism is a powerful technique for avoiding latency by increasing concurrency. By optimistically assuming the results of some computation, other computations can be executed in parallel, even when they depend on the assumed result. Optimistic techniques can be particularly beneficial to parallel and distributed systems because of the critical impact of inter-node communications latency. This paper describes how optimism can be used to enhance the performance of distributed programs by avoiding remote communications delay. We then present a new programming model that automates many of the difficulties of using optimistic techniques in a general programming environment, and describe a prototype implementation. Finally, we present performance measurements showing how optimism improved the performance of a test application in this environment.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114594583","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}
{"title":"An ATM-based multimedia integrated manufacturing system","authors":"J. Guillaud, M. R. Pokam, G. Michel","doi":"10.1109/HPDC.1995.518714","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518714","url":null,"abstract":"Along with the emergence of high-speed communication technologies and protocols, tools for multimedia applications are growing in terms of their variety and their performances, making multimedia data flows candidates to the integration in almost every computer system. We particularly focus on the case of the factory plant where audio and video equipments could soon take part in the control/monitoring of manufacturing processes. Our paper presents a novel architecture for real time distributed systems using a 155.52 Mbit/s ATM network. The system is based on an intelligent network interface board, which integrates a processor and a field programmable gate array component to implement flexible high level real time data services in an off-host implementation approach. Moreover, the embedded ATM switch allows to build a large variety of topologies and provides high speed communication links, in particular for audio and video streams, inside the workstation. We also propose an MMS-like multimedia application service element for the integrated service computer manufacturing system and present some target applications.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016616","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}
{"title":"Multimedia intra-group communication protocol","authors":"T. Tachikawa, M. Takizawa","doi":"10.1109/HPDC.1995.518708","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518708","url":null,"abstract":"In distributed applications, a group of multiple application processes have to send and receive multimedia messages by using the high-speed network. The multimedia message at the application level is decomposed into multiple smaller packets which are transmitted in the communication system. In this paper, we discuss the atomic and ordered delivery of messages at the application level rather than the system level. In some multimedia applications, the application processes do not mind if some packets are lost and in what order packets from different processes are received. The application process specifies the minimum receipt ratio /spl epsiv/ (/spl les/1) showing how many percentages of whole data in each message the destination processes have to be received at least. The communication system delivers the packets to the destinations in the group so as to satisfy the receipt ratio /spl epsiv/. The protocol is based on the fully distributed control scheme, i.e. no master controller.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690916","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}
C. Braun, V. Sirkay, H. Uriona, S. Seetharam, E. Yousefi, D. Petr, D. Niehaus, V. Frost, Joseph B. Evans, G. Minden
{"title":"A high speed implementation of adaptive shaping for dynamic bandwidth allocation","authors":"C. Braun, V. Sirkay, H. Uriona, S. Seetharam, E. Yousefi, D. Petr, D. Niehaus, V. Frost, Joseph B. Evans, G. Minden","doi":"10.1109/HPDC.1995.518699","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518699","url":null,"abstract":"Most algorithms proposed for controlling traffic prior to entering ATM networks are based on static mechanisms. Such static control mechanisms do not account for the dynamics of the user traffic or the network state. Some dynamic control algorithms have been proposed, but most of these algorithms are extremely complex and may make it difficult to provide real time control. In this paper, we present an adaptive rate control algorithm that has been implemented in hardware. The algorithm controls the traffic submitted by a source based on the indirectly observed average rate and burst size for the source. The algorithm is highly efficient and thereby provides real time control at high speed. Our implementation, in concert with flow control in the local area network, provides the basis for ATM-based high performance distributed systems.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114458932","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}
{"title":"The performance impact of scheduling for cache affinity in parallel network processing","authors":"James D. Salehi, J. Kurose, D. Towsley","doi":"10.1109/HPDC.1995.518696","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518696","url":null,"abstract":"We explore processor-cache affinity scheduling of parallel network protocol processing, in a setting in which protocol processing executes on a shared-memory multiprocessor concurrently with a general workload of non-protocol activity. We find that affinity-based scheduling can significantly reduce the communication delay associated with protocol processing, enabling the host to support a greater number of concurrent streams and to provide higher maximum throughput to individual streams. In addition, we compare the performance of two parallelization alternatives, locking and independent protocol stacks (IPS), with very different caching behaviors. We find that IPS (which maximizes cache affinity) delivers much lower message latency and significantly higher message throughput capacity, yet exhibits less robust response to infra-stream burstiness and limited intra-stream scalability.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133749425","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}
{"title":"Loop scheduling for heterogeneity","authors":"Michal Cierniak, Wei Li, Mohammed J. Zaki","doi":"10.1109/HPDC.1995.518697","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518697","url":null,"abstract":"In this paper we study the problem of scheduling parallel loops at compile-time for a heterogeneous network of machines. We consider heterogeneity in three aspects of parallel programming: program, processor and network. A heterogeneous program has parallel loops with different amount of work in each iteration; heterogeneous processors have different speeds; and a heterogeneous network has different cost of communication between processors. We propose a simple yet comprehensive model for use in compiling for a network of processors, and develop compiler algorithms for generating optimal and sub-optimal schedules of loops for load balancing, communication optimizations and network contention. Experiments show that a significant improvement of performance is achieved using our techniques.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345659","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}
{"title":"Nimrod: a tool for performing parametrised simulations using distributed workstations","authors":"D. Abramson, R. Sosič, J. Giddy, B. Hall","doi":"10.1109/HPDC.1995.518701","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518701","url":null,"abstract":"This paper discusses Nimrod, a tool for performing parametrised simulations over networks of loosely coupled workstations. Using Nimrod the user interactively generates a parametrised experiment. Nimrod then controls the distribution of jobs to machines and the collection of results. A simple graphical user interface which is built for each application allows the user to view the simulation in terms of their problem domain. The current version of Nimrod is implemented above OSF DCE and runs on DEC Alpha and IBM RS6000 workstations (including a 22 node SP2). Two different case studies are discussed as an illustration of the utility of the system.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132769057","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}
{"title":"A portable distributed implementation of the parallel multipole tree algorithm","authors":"W. T. Rankin, J. Board","doi":"10.1109/HPDC.1995.518690","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518690","url":null,"abstract":"Several variants of parallel multipole-based algorithms have been implemented to further research in fields such as computational chemistry and astro-physics. We present a distributed parallel implementation of a multipole-based algorithm that is portable to a wide variety of applications and parallel platforms. Performance data are presented for loosely coupled networks of workstations as well as for more tightly coupled distributed multiprocessors, demonstrating the portability and scalability of the application to large number of processors.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121957293","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}
{"title":"Efficient causally ordered communications for multimedia real-time applications","authors":"R. Baldoni, A. Mostéfaoui, M. Raynal","doi":"10.1109/HPDC.1995.518704","DOIUrl":"https://doi.org/10.1109/HPDC.1995.518704","url":null,"abstract":"Multimedia real-time collaborative applications or groupware real-time applications require participants to exchange real-time audio and video information over a communication network. This flow of information must preserve the causal dependency even though part of the information can be lost or can be discarded if it violates the tinting constraints imposed by a real-time interaction. In this paper we propose a communication abstraction to cope with unreliable communication networks with real-time delivery constraints: messages have a lifetime, /spl Delta/, after which their contents can no longer be used, moreover some of them can be lost. This new abstraction, called /spl Delta/-causal order, requires to deliver as much messages as possible within their lifetime in such a way that these deliveries respect causal order. An efficient protocol is proposed in the case of one-to-one communications. A variation of this protocol weld suited to broadcast communications is also shown.","PeriodicalId":280835,"journal":{"name":"Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127363148","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}