发布求助
文献互助 智能选刊 最新文献

Proceedings 20th IEEE International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
Boosting the performance of NOW-based shared memory multiprocessors through directory hints 通过目录提示提高基于now的共享内存多处理器的性能
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840976
Hung-Chang Hsiao, C. King
{"title":"Boosting the performance of NOW-based shared memory multiprocessors through directory hints","authors":"Hung-Chang Hsiao, C. King","doi":"10.1109/ICDCS.2000.840976","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840976","url":null,"abstract":"Directory hints help a node in a NOW-based shared memory multiprocessor to keep track of where valid copies of a memory block may reside. With this information the node can fetch the block directly from those nodes on a read miss. In this way the number of network transactions to serve the miss may be reduced and the expensive directory lookup operation may be removed from the critical path. We discuss the issues involved in implementing the directory hint scheme on a NOW-based shared memory multiprocessor and examine one such implementation, which employs a small and fast cache to store the hints. Our simulation results show that the directory hint scheme can effectively reduce the read stall time. Also its performance is very competitive compared with a more expensive implementation which uses a large level-three cache. A drawback of the scheme is that it will introduce extra network traffic. We believe that the state-of-the-art interconnection networks, such as those built upon the SCI Spider (Galles, 1996) and the Intel Cavallino (Carbonaro and Verhoorn, 1996) chips, provide the opportunity to make the directory hint scheme feasible even with the slower network such as the one built by Myrinet switches (N.J.B et al., 1996).","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114382887","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
An asynchronous recovery scheme based on optimistic message logging for mobile computing systems 一种基于乐观消息日志的移动计算异步恢复方案
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840956
T. Park, H. Yeom
{"title":"An asynchronous recovery scheme based on optimistic message logging for mobile computing systems","authors":"T. Park, H. Yeom","doi":"10.1109/ICDCS.2000.840956","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840956","url":null,"abstract":"This paper presents an asynchronous recovery scheme to provide fault-tolerance for mobile computing systems. The proposed scheme is based on optimistic message logging, since the checkpointing-only schemes are not suitable for the mobile environment in which unreliable mobile hosts and fragile network connection may hinder any kind of coordination for checkpointing and recovery. Also, in order to reduce the overhead imposed on mobile hosts, mobile support stations take charge of logging and dependency tracking, and mobile hosts maintain only a small amount of information for mobility tracking. As a result, truly asynchronous recovery for mobile systems can be achieved with little overhead.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117321994","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}
引用次数: 50
TabSum: a flexible and dynamic table summarization approach TabSum:一个灵活和动态的表汇总方法
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840979
Ming-Ling Lo, Kun-Lung Wu, Philip S. Yu
{"title":"TabSum: a flexible and dynamic table summarization approach","authors":"Ming-Ling Lo, Kun-Lung Wu, Philip S. Yu","doi":"10.1109/ICDCS.2000.840979","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840979","url":null,"abstract":"Many diverse small devices, such as smart phones and personal digital assistants, are being deployed to access the Internet. Small devices typically have limited display and processing capabilities. It is thus difficult to effectively present a large table of information on these different devices such that the table can be easily browsed by the users. We present the design and prototype implementation of TabSum, a flexible and dynamic table summarization approach to reducing tables into smaller but still meaningful representations for various devices. TabSum supports easy browsing of a large table by various devices and provides personalization by taking into account both device capabilities and user preferences. A multi-source multi-layered specification methodology is proposed to describe summarization rules preferred by various sources. On request, a set of table reduction rules are dynamically applied to the rows and columns of a table to reduce its size. The approach is flexible and dynamic. It summarizes both numeric and non-numeric data types.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432795","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}
引用次数: 14
The effect of nogood learning in distributed constraint satisfaction 无良学习在分布式约束满足中的作用
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840919
M. Yokoo, K. Hirayama
{"title":"The effect of nogood learning in distributed constraint satisfaction","authors":"M. Yokoo, K. Hirayama","doi":"10.1109/ICDCS.2000.840919","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840919","url":null,"abstract":"We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constraint satisfaction algorithms and can efficiently make effective nogoods. We combine the method with the asynchronous weak-commitment search algorithm (AWC) and evaluate the performance of the resultant algorithm on distributed 3-coloring problems and distributed 3SAT problems. As a result, we found that the resolvent-based learning works well compared to previous learning methods for distributed constraint satisfaction algorithms. We also found that the AWC with the resolvent-based learning is able to find a solution with fewer cycles than the distributed breakout algorithm, which was known to be the most efficient algorithm (in terms of cycles) for solving distributed constraint satisfaction problems.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512876","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}
引用次数: 52
HydraNet-FT: network support for dependable services HydraNet-FT:提供可靠服务的网络支持
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840987
Gurudatt Shenoy, Suresh Satapati, R. Bettati
{"title":"HydraNet-FT: network support for dependable services","authors":"Gurudatt Shenoy, Suresh Satapati, R. Bettati","doi":"10.1109/ICDCS.2000.840987","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840987","url":null,"abstract":"With the Internet increasingly being used as the access medium for a variety of critical services, there is a growing need to provide fault-tolerant (FT) services over internetworks, in a completely client-transparent fashion. We present HydraNet-FT, an infrastructure to dynamically replicate services across an internetwork and have the replicas provide a single fault-tolerant service access point to clients. HydraNet-FT uses the TCP communication protocol with a few modifications on the server side to allow one-to-many message delivery from a client to service replicas and many-to-one message delivery from the replicas to the client. A communication channel between the replicas provides atomicity and message ordering. A low-latency failure estimator is used to detect failures of servers in the system and to initiate fail-over mechanisms. An implementation and measurements on a local testbed show that the overhead of our scheme is reasonably small.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126410111","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}
引用次数: 40
Suez: a cluster-based scalable real-time packet router Suez:基于集群的可扩展实时数据包路由器
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840915
T. Chiueh, P. Pradhan
{"title":"Suez: a cluster-based scalable real-time packet router","authors":"T. Chiueh, P. Pradhan","doi":"10.1109/ICDCS.2000.840915","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840915","url":null,"abstract":"Suez is a high-performance real-time packet router that supports fast best-effort packet routing and scalable QoS-guaranteed packet scheduling, and is built on a hardware platform consisting of a cluster of commodity PCs connected by a gigabit/sec system area network. The major goal of the Suez project is to demonstrate that the PC cluster architecture can be as cost-effective a platform for high-performance network packet routing as for parallel computing. Suez features a cache-conscious routing-table search algorithm that exploits CPU caching hardware for fast lookup by treating IP addresses directly as virtual addresses. To scale the number of real-time connections supportable with the link speed, Suez implements a fixed-granularity fluid fair queuing (FGFFQ) algorithm that completely eliminates the per-packet sorting overhead associated with conventional weighted fair queuing algorithms. This paper presents the architectural features of Suez, and reports the performance measurements of the Linux-based Suez prototype, which is built on four Pentium-II 400 MHz machines and Myrinet.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126558448","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}
引用次数: 17
Scheduling using genetic algorithms 利用遗传算法进行调度
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840983
U. Fissgus
{"title":"Scheduling using genetic algorithms","authors":"U. Fissgus","doi":"10.1109/ICDCS.2000.840983","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840983","url":null,"abstract":"Considers the scheduling of mixed task- and data-parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task- and data-parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine. We present a scheduling derivation step based on the genetic algorithm paradigm. The scheduling takes not only decisions on the execution order (independent modules can be executed consecutively by all processors available or concurrently by independent groups of processors) but also on appropriate data distributions and task implementation versions. We demonstrate the efficiency of the algorithm by an example from numerical analysis.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124931973","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}
引用次数: 19
Aggregate TCP congestion control using multiple network probing 使用多个网络探测聚合TCP拥塞控制
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840904
P. Pradhan, T. Chiueh, A. Neogi
{"title":"Aggregate TCP congestion control using multiple network probing","authors":"P. Pradhan, T. Chiueh, A. Neogi","doi":"10.1109/ICDCS.2000.840904","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840904","url":null,"abstract":"Extensive research in TCP's congestion control mechanism has resulted in an effective algorithm that gives fairly precise estimates on the available bandwidth on a given network path (J. Postel, 1981; V. Jacobson, 1988). However, most past efforts focused on enhancing the accuracy and robustness of the path bandwidth estimation algorithms for individual TCP connections. Relatively fewer attempts have been made to further improve data transport efficiency by sharing path bandwidth information among concurrent TCP connections with the same sources and destinations. The paper proposes an aggregate TCP-based congestion control algorithm (ATCP) that allows individual TCP connections to reach their fair shares of the available network path bandwidth more quickly, while still observing TCP's congestion control semantics. In addition, the proposed algorithm is guaranteed to perform no worse than current TCP congestion control algorithm in all cases, and is designed to be implemented in a way that is completely transparent to both ends of a TCP connection. ATCP is particularly useful for TCP connections that are short-lived and yet have a long round-trip delay, such as Web page transfers using HTTP 1.0. Our trace-driven simulation study shows that the aggregate congestion control algorithm can reduce the normalized transaction latency by a factor of up to 2, compared to standard TCP.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200547","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}
引用次数: 44
MPEG-4 support to multiuser virtual environments MPEG-4支持多用户虚拟环境
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840909
G. Todesco, R. B. Araujo
{"title":"MPEG-4 support to multiuser virtual environments","authors":"G. Todesco, R. B. Araujo","doi":"10.1109/ICDCS.2000.840909","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840909","url":null,"abstract":"The few existing virtual reality distributed systems integrated to multimedia suffer from technical limitations on the number of users supported and on the presentation quality of the scenes. These limitations are due, among other things, to the slow progress of the VRML language to deal with multimedia integration. Today, the MPEG-4 standard is one of the most attractive alternative technologies to the development of multiuser virtual environments integrated to multimedia. The paper evaluates the current status of multimedia integration to virtual environments in the WWW and proposes a tool called SVRT-MM (Shared Virtual Reality Tool Integrated with Multimedia) that extends an existing MPEG-4 player to support multiuser. The article intends to be a contribution to the ongoing developments of the MPEG-4 standard related to multiuser support in 3D environments.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124447357","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}
引用次数: 4
Design and analysis of clusters with single I/O space 单I/O空间集群的设计与分析
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840913
Roy S. C. Ho, K. Hwang, Hai Jin
{"title":"Design and analysis of clusters with single I/O space","authors":"Roy S. C. Ho, K. Hwang, Hai Jin","doi":"10.1109/ICDCS.2000.840913","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840913","url":null,"abstract":"Support of single system image (SSI) services is the main approach that enables better utilization of PC/workstation clusters. Some SSI services can be easily built with the support of other low-level, elementary, SSI services. In this paper, we describe a single I/O space architecture for achieving a SSI at the I/O subsystem level. Furthermore, we demonstrate how the single I/O space can facilitate the development of other key SSI services. Typical SSI services which can benefit from the single I/O space include single file hierarchy, single memory space, checkpointing systems and single process space with process migration facilities. Benchmark performance results show that our design achieves both performance and storage size scalabilities that are essential to building I/O-intensive clusters.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122317962","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}
引用次数: 14
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信