Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)最新文献_第6页

A multithreaded message-passing system for high performance distributed computing applications 用于高性能分布式计算应用程序的多线程消息传递系统

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679521

Sung-Yong Park, Joohan Lee, S. Hariri

{"title":"A multithreaded message-passing system for high performance distributed computing applications","authors":"Sung-Yong Park, Joohan Lee, S. Hariri","doi":"10.1109/ICDCS.1998.679521","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679521","url":null,"abstract":"NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message passing system developed at Syracase University that provides high performance and flexible communication services over asynchronous transfer mode (ATM) based high performance distributed computing (HPDC) environments. NCS capitalizes on thread based programming model to overlap computations and communications, and develop a dynamic message passing environment with separate data and control paths. This leads to a flexible and adaptive message passing environment that can support multiple flow control, error control, and multicasting algorithms. We provide an overview of the NCS architecture and present how NCS point to point communication services are implemented. We also analyze the overhead incurred by using multithreading and compare the performance of NCS point to point communication primitives with those of other message passing systems such as p4, PVM, and MPI. Benchmarking results indicate that NCS shows comparable performance to other systems for small message sizes but outperforms other systems for large message sizes.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114518367","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

A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability 一种具有容错能力的时延最优群体互斥方案

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679773

G. Cao, M. Singhal, Yi Deng, N. Rishe, Wei Sun

{"title":"A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability","authors":"G. Cao, M. Singhal, Yi Deng, N. Rishe, Wei Sun","doi":"10.1109/ICDCS.1998.679773","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679773","url":null,"abstract":"The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. Lamport's (1978) algorithm and Ricart and Agrawal's (1981) algorithm both have a synchronization delay of T, but their message complexity is O(N). Maekawa's (1985) algorithm reduces message complexity to O(/spl radic/N); however, it increases the synchronization delay to 2T. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce message complexity or increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from long synchronization delay 2T. We propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to T and still has the low message complexity O(K) (K is the size of the quorum, which can be as low as log N). A correctness proof and detailed performance analysis are provided.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126327755","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}

引用次数: 15

Structuring remote object systems for mobile hosts with intermittent connectivity 为具有间歇性连接的移动主机构建远程对象系统

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679520

G. Welling, M. Ott

{"title":"Structuring remote object systems for mobile hosts with intermittent connectivity","authors":"G. Welling, M. Ott","doi":"10.1109/ICDCS.1998.679520","DOIUrl":"https://doi.org/10.1109/ICDCS.1998.679520","url":null,"abstract":"In distributed object systems, remote method invocation attempts to abstract communication between different machines to the level of object method invocation. Link failure in such systems often appears as a failed method invocation, which must be explicitly handled outside the remote object infrastructure. This usually implies that techniques to handle the effects of link failure are embedded within application functionality. The resulting application can become unnecessarily specialized to a particular environment, restricting the situations where it could be used. We explore the possibility of cleanly decoupling policies for handling a link failure from the application. With this goal in mind, we present extensions to the Java RMI system in the context of a distributed system with mobile hosts. An intermittent communication link is typical in such systems, and applications use techniques such as data caching or queuing of method calls to alleviate the effects. We show how such techniques and policies can be implemented generically so that not only does the application become oblivious of them, but also policies can be chosen dynamically depending on a particular situation.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"123-124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131708531","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}

引用次数: 6

Self-organizing cooperative WWW caching 自组织协作式WWW缓存

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679489

S. Inohara, Yoshimasa Masuoka, J. Min, Fumio Noda

引用次数: 10

Flexible batching and consistency mechanisms for building interactive groupware applications 灵活的批处理和一致性机制，用于构建交互式群件应用程序

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679747

S. Bhola, B. Mukherjee, S. Doddapaneni, M. Ahamad

引用次数: 10

CLIQUES: a new approach to group key agreement CLIQUES:一种新的组密钥协议方法

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679745

M. Steiner, G. Tsudik, M. Waidner

引用次数: 381

Fast, optimized Sun RPC using automatic program specialization 使用自动程序专门化的快速、优化的Sun RPC

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679507

Gilles Muller, R. Marlet, Eugen-Nicolae Volanschi, C. Consel, C. Pu, Ashvin Goel

引用次数: 76

Wide-area Nile: a case study of a wide-area data-parallel application 广域尼罗河:一个广域数据并行应用的案例研究

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679794

A. Amoroso, K. Marzullo, Aleta Ricciardi

引用次数: 24

Dynamic load balancing in geographically distributed heterogeneous Web servers 地理分布异构Web服务器的动态负载平衡

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679729

M. Colajanni, Philip S. Yu, V. Cardellini

引用次数: 129

Dynamic load distribution using anti-tasks and load state vectors 使用反任务和负载状态向量的动态负载分配

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) Pub Date : 1998-05-26 DOI: 10.1109/ICDCS.1998.679504

Qin Lu, S. Lau, K. Leung

引用次数: 6