{"title":"Optimizing join index based join processing: a graph partitioning approach","authors":"S. Ravada, S. Shekhar, Chang-Tien Lu, S. Chawla","doi":"10.1109/RELDIS.1998.740513","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740513","url":null,"abstract":"The cost of join computation, which uses a join index in a sequential system with limited buffer space, depends primarily on the page access sequence used to fetch the pages of the base relations. We introduce a graph partitioning model that will minimize the length of the page access sequence thus minimizing the redundant I/O, given a fixed buffer. Experiments with Sequoia 2000 data sets show that the graph partitioning method outperforms the existing methods based on sorting and online clustering, particularly for a small number of buffers and high join selectivity.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122660771","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":"Tolerating Visitor Location Register failures in mobile environments","authors":"S. Biaz, N. Vaidya","doi":"10.1109/RELDIS.1998.740481","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740481","url":null,"abstract":"For mobile users who move frequently but receive relatively rare calls, a forwarding scheme has been shown to outperform the normal IS-41 location management scheme. But the forwarding scheme is more vulnerable to failure of intermediate Visitor Location Registers (VLRs) than the IS-41 scheme. We propose two simple variations to the forwarding scheme to address the fault tolerance weakness. One is based on the idea of maintaining two paths from the home location server to the last VLR. The second scheme is based on the knowledge of the neighbors of the faulty VLR. We evaluate and compare the performance of these location management schemes.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125408497","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":"Checkpoint-recovery protocol for reliable mobile systems","authors":"H. Higaki, M. Takizawa","doi":"10.1109/RELDIS.1998.740479","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740479","url":null,"abstract":"Information systems consist of mobile stations and fixed stations. Mission critical applications are required to be executed fault-tolerantly in these systems. However, mobile stations support neither enough volume of storage and processing power nor enough capacity of battery to do reliable, long-term communications. Moreover, wireless channels are less reliable. Hence, the channels with the mobile stations are often disconnected. Therefore, it is difficult for multiple mobile stations to synchronously take checkpoints since the communication channels with the mobile stations may be disconnected even during taking the checkpoints. In this paper, we propose a novel hybrid checkpointing protocol where the mobile stations take asynchronously and the fixed ones take synchronously checkpoints. Reliable information systems including mobile stations can be realized by the hybrid checkpointing protocol.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125766448","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":"Checkpoints-on-demand with active replication","authors":"S. Rangarajan, S. Garg, Yennun Huang","doi":"10.1109/RELDIS.1998.740477","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740477","url":null,"abstract":"Checkpointing and roll-back recovery is a well known technique for recovering from software process failures. Analytical models have been developed for computing the completion time of processes that use various checkpointing strategies such as periodic checkpointing, random checkpointing etc. In this paper, we show that with active replication of processes, a strategy that uses a mechanism we call checkpoints-on-demand will result in an expected completion time smaller than that can be achieved with traditional schemes that use periodic checkpoints. With checkpoints-on-demand, when a process fails, it is recovered from an induced checkpoint taken of a replica of the process. Recovery of persistent server processes through state-transfer from a replica has been proposed in the context of group communication systems and in the process cloning approach of the Delta-4 architecture. But it has not been previously proposed and analyzed as a mechanism for reducing the expected completion time of a long running process.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871240","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}
Udo Fritzke, Philippe Ingels, A. Mostéfaoui, M. Raynal
{"title":"Fault-tolerant Total Order Multicast to asynchronous groups","authors":"Udo Fritzke, Philippe Ingels, A. Mostéfaoui, M. Raynal","doi":"10.1109/RELDIS.1998.740503","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740503","url":null,"abstract":"While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention, the paper concentrates on Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. \"Multicast to Multiple Groups\" means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. \"Total Order\" means that all message deliveries must be totally ordered. The paper proposes a protocol for such a multicast primitive. This protocol is based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus. Its design characteristics lie in the two following properties. The first one is a minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the multicast of the message. The second property is a locality property: no execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus are executed on a \"per group\" basis). This locality property is particularly useful when one is interested in using the Total Order Multicast primitive in large scale distributed systems. An improvement that reduces the cost of the protocol is also suggested.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131732185","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}
Sahra Sedigh Sarvestani, J. Joshi, A. Bashandy, A. Ghafoor
{"title":"Evaluation of filtering mechanisms for MPEG video communications","authors":"Sahra Sedigh Sarvestani, J. Joshi, A. Bashandy, A. Ghafoor","doi":"10.1109/RELDIS.1998.740539","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740539","url":null,"abstract":"In this paper, we evaluate two video filtering mechanisms for MPEG-1 video, namely low-pass filtering and selective frame dropping. The evaluation provides tradeoffs between the reduction achieved in bandwidth requirements and the perceptual quality of the video sequences delivered to the client. Extensive experiments revealed that these filtering mechanisms result in a significant reduction in bandwidth requirements while maintaining acceptable perceptual quality.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134106856","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":"Cache injection on bus based multiprocessors","authors":"A. Milenković, V. Milutinovic","doi":"10.1109/RELDIS.1998.740520","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740520","url":null,"abstract":"Software-controlled cache prefetching and data forwarding are widely used techniques for tolerating memory latency in shared memory multiprocessors. However, some previous studies show that cache prefetching is not so effective on bus-based multiprocessors, while the effectiveness of data forwarding has not been explored in this environment, yet. In this paper, a novel technique called cache injection is proposed. Cache injection, tuned to the properties of bus-based architectures, combines advantages of both cache prefetching and data forwarding. Some preliminary experiments show that the proposed solution can significantly help in reducing the overall miss ratio and bus traffic in applications where write-shared data prevails.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133213848","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}
T. D. Braun, H. Siegel, N. Beck, Ladislau Bölöni, Muthucumaru Maheswaran, A. Reuther, J. Robertson, M. Theys, Bin Yao
{"title":"A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems","authors":"T. D. Braun, H. Siegel, N. Beck, Ladislau Bölöni, Muthucumaru Maheswaran, A. Reuther, J. Robertson, M. Theys, Bin Yao","doi":"10.1109/RELDIS.1998.740518","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740518","url":null,"abstract":"The problem of mapping (defined as matching and scheduling) tasks and communications onto multiple machines and networks in a heterogeneous computing (HC) environment has been shown to be NP-complete, in general, requiring the development of heuristic techniques. Many different types of mapping heuristics have been developed in recent years. However, selecting the best heuristic to use in any given scenario remains a difficult problem. Factors making this selection difficult are discussed. Motivated by these difficulties, a new taxonomy for classifying mapping heuristics for HC environments is proposed (Purdue HC Taxonomy). The taxonomy is defined in three major parts: the models used for applications and communication requests; the models used for target hardware platforms; and the characteristics of mapping heuristics, Each part of the taxonomy is described, with examples given to help clarify the taxonomy. The benefits and uses of this taxonomy are also discussed.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114333211","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 non-blocking recovery algorithm for causal message logging","authors":"J. Mitchell, V. Garg","doi":"10.1109/RELDIS.1998.740468","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740468","url":null,"abstract":"In the recovery of failed processes in a distributed program, causal logging schemes offer several benefits. These benefits include no rollback of unfailed processes and simple approaches to output commit. Unfortunately, previous approaches to the recovery of multiple simultaneous failures require that the distributed execution be blocked or that recovering processes coordinate. The latter requires assumptions which are not satisfactory. In this paper we present a solution that has neither of these drawbacks.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126810591","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":"Transformation-based reconstruction for audio transmissions over the Internet","authors":"B. Wah, Dong Lin","doi":"10.1109/RELDIS.1998.740499","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740499","url":null,"abstract":"The paper studies the design of data transformation algorithms for audio data transmitted over the Internet, with a goal of reconstructing the original signals by the receiver with little distortions in the presence of bursty loss of packets. It assumes that a single audio stream is interleaved into multiple packets, and a lost sample at the receiver is reconstructed as the interpolation of adjacent samples received. We propose a non redundant transformation based reconstruction algorithm that can minimize the reconstruction error for any fixed, interpolation based reconstruction algorithm. Its basic idea is that the sender transforms the input audio stream optimally, based on the reconstruction method used at the receiver before sending the data packets. Consequently, the receiver is able to recover much better from losses of packets than without any knowledge of what the signals should be. In particular, we study our transformation algorithm based on one popular linear interpolation based reconstruction algorithm. We found that our scheme can improve the signal to noise ratio (SNR) by 1 to 2 dB with very little extra computation efforts as compared to the scheme without transformation.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124680335","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}