2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.最新文献

{"title":"An introduction to the renaming problem","authors":"M. Raynal","doi":"10.1109/PRDC.2002.1185627","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185627","url":null,"abstract":"The aim of this paper is to provide a brief introduction to the renaming problem for unfamiliar readers. In the renaming problem the processes have to acquire new names from a small bounded space despite possible process crashes and asynchrony. The problem is first introduced. Then two solutions are presented. One considers the shared memory model, while the second considers the message-passing model.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117195200","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":"Energy efficient and robust multicast protocol for mobile ad hoc networks","authors":"S. Moh, Chansu Yu, Ben Lee, H. Youn","doi":"10.1109/PRDC.2002.1185631","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185631","url":null,"abstract":"This paper reevaluates the multicast protocols for MANETs in terms of energy efficiency and proposes a new robust multicast protocol, called two-tree multicast (TTM). Multicast protocols can be broadly categorized into two types, tree-based multicast and mesh-based multicast, based on the network structure along which multicast packets are delivered to multiple receivers. Mesh-based protocols are more robust to mobility and result in high packet delivery ratio. On the other hand, multicast trees are more energy efficient than multicast meshes. This is because mesh-based protocols depend on broadcast flooding within the mesh and therefore, mobile nodes in the mesh must receive all multicast packets during the multicast communication. The proposed TTM uses two trees, a primary and an alternative backup tree, to improve energy efficiency compared to the mesh-based protocols and to offer a better energy balance and packet delivery ratio than the free-based protocols. Performance evaluation study shows that the proposed TTM saves energy consumption by a factor of 1.9/spl sim/4.0 compared to the mesh-based multicast. In terms of combined performance metric, energy per delivered packet, TTM shows up to 80% and 40% improved performance than the mesh-based multicast and the conventional shared tree multicast, respectively.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124574891","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":"Enhancing delay fault testability for iterative logic arrays","authors":"Shyue-Kung Lu, Chien-Hung Yeh","doi":"10.1109/PRDC.2002.1185648","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185648","url":null,"abstract":"Iterative logic arrays are widely used in many applications, e.g., general-purpose processors, digital signal processors, and embedded processors. Owing to the advanced VLSI technology, new defect mechanisms exist in the fabricated circuits. Therefore, in order to improve the quality of manufactured products, the traditional single cell fault model is not sufficient. Therefore, more realistic fault models such as the sequential fault models and the delay fault models should also be considered. Therefore, delay fault testability conditions are proposed for iterative logic arrays (ILAs) in this paper. Our approach applies to ILAs with an arbitrary dimension, e.g., linear and mesh-connected ILAs, etc. Moreover, it can also be applied to various other connection types, e.g., butterfly-connected and shuffle-connected ones. A design for-testability approach is used to make these arrays delay fault testable based on the proposed testability conditions. To illustrate our approach, we give a delay fault testable FFT processor as an example and show that an overhead of no more than 5% is sufficient to make it C-testable. It requires only 128 2-pattern tests to achieve 100% cell-delay-fault coverage regardless of the word length and the computation points of the FFT processor. Our approaches also guarantee that the test set is easy to generate, and the corresponding BIST structure requires smaller hardware overhead and has a more regular structure.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125146336","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":"Caveat emptor: making grid services dependable from the client side","authors":"M. Livny, D. Thain","doi":"10.1109/PRDC.2002.1185626","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185626","url":null,"abstract":"Grid computing relies on fragile partnerships. Clients with hundreds or even thousands of pending service requests must seek out and form temporary alliances with remote servers eager to satisfy them. Yet, despite the high quality and reliability of these servers and their software, unexpected events and behavior are common. Communication networks, power systems, operating systems, middleware and operator intervention all conspire to attack even the most carefully arranged client-server interaction. To survive in such an imperfect world, customers of grid resources must be equipped with resilient client software that tolerates failures while aggressively representing their interests. Following our tradition of developing technology that harnesses the power of opportunistic resources, the Condor Project is actively engaged in developing the basic mechanisms for building dependable and effective grid computing clients. Guided by our experience and the practical needs of production users in disciplines as diverse as astronomy and sociology, the Project aims to equip users with powerful software that complements the reliability of the servers that they exploit. Our most visible product is the Condor-G job manager. Other research ventures, including the full Condor distributed system, offer valuable lessons in dependable client-side management. Dependability has been explored in a number of branches of computing, ranging from database systems to programming languages. The hard-earned lessons from these fields are also essential to grid computing. Fundamental concepts such as timeouts, logging, checkpoints, transactions, leases, and atomic operations must be employed and expressed in basic protocols and interfaces for CPU and I/O access. Without these techniques, clients and servers lose track of the other’s state, leading to missed opportunities, wasted resources, incorrect results, and unnecessary failures. This principle is espoused in systems such as Condor-G and protocols such as the most recent version of GRAM. In a Grid environment we must never view failure as a disaster. Rather, failures occur at every level and every interface, and must be expected and structured. No single failure must bring a computation to a halt, nor can any type of failure be retried indefinitely. Jobs may be retracted even from systems deemed reliable when better performance may be found elsewhere. In addition, we must always be careful to determine whether the source of a failure lies in the system or in the job itself. Examples of this principle are found in the DAGMan meta-scheduler and the fault-tolerant shell.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116857208","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":"Reliability evaluation of multi-state systems subject to imperfect coverage using OBDD","authors":"Yung-Ruei Chang, S. Amari, S. Kuo","doi":"10.1109/PRDC.2002.1185638","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185638","url":null,"abstract":"This paper presents an efficient approach based on OBDD for the reliability analysis of a multi-state system subject to imperfect fault-coverage with combinatorial performance requirements. Since there exist dependencies between combinatorial performance requirements, we apply the multi-state dependency operation (MDO) of OBDD to deal with these dependencies in a multi-state system. In addition, this OBDD-based approach is combined with the conditional probability methods to find solutions for the multi-state imperfect coverage models. Using conditional probabilities, we can also apply this method for modular structures. The main advantage of this algorithm is that it will take computational time that is equivalent to the same problem without assuming imperfect coverage (i.e. with perfect coverage). This algorithm is very important for complex systems such as fault-tolerant computer systems, since it can obtain the complete results quickly and accurately even when there exist a number of dependencies such as shared loads (reconfiguration), degradation and common-cause failures.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"437 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134421362","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":"Comparison of defect compensation methods for feedforward neural networks","authors":"K. Takahashi, K. Yamamori, I. Yoshihara, S. Horiguchi","doi":"10.1109/PRDC.2002.1185649","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185649","url":null,"abstract":"Recently, many defect compensation methods have been proposed for feedforward neural networks implemented in hardware devices. However, there are few accurate quantitative comparisons with the performance of these defect compensation methods. In this paper, we compare the following three defect compensation methods; partial retraining (PR) scheme, whole network backpropagation (BP) retraining and FT (fault-tolerant) BP method. The BP algorithm and PR scheme retrain the neural network after defects have occurred. The FTBP method tries to obtain the weights those are robust for the defects. We can say that both the BP algorithm and PR scheme are cure-type compensation methods and the FTBP method is a precaution-type compensation method. We compare the average recognition rate, average training time and the generalization ability among these three methods in detail. The experiments show that the whole network retraining by the BP algorithm has the highest reliability on the XOR problem and face image recognition problem on the neural networks with a single broken link defect and two broken link defects.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"31 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423367","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":"Hardware/software co-reliability of configurable digital systems","authors":"Minsu Choi, N. Park, Yong-Bin Kim, F. Lombardi","doi":"10.1109/PRDC.2002.1185620","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185620","url":null,"abstract":"This paper investigates the co-effect of hardware and software on the reliability as measured by quality level (or defect level) of configurable multichip module (CMCM) systems. Hardware architecture of CMCM can be configured to accommodate target application design. An application, as provided in a form of software, is partitioned and mapped on the provided configurable hardware. Granularity of an application can be used as a criteria of partitioning and mapping, and can determine the utilization pattern of hardware resources. The utilization pattern of CMCM determines the configuration strategy of available hardware resources based on the application's granularity. Different utilization patterns of an application design on CMCM may result in various impacts on escape tolerance (i.e. the probability to avoid inclusion of hardware resources in the configuration that escaped from testing). A quality level model of CMCM is proposed to capture and trace the co-effect of hardware and software, referred to as co-reliability, with respect to escape-tolerance. Various configuration strategies are proposed and evaluated against various criterion granularity and utilization distributions based on the proposed models and evaluation techniques. Extensive analytical and parametric simulation results are shown.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"117 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131153512","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":"On characteristics of DEF communication-induced checkpointing protocols","authors":"Jichiang Tsai, Jenn-Wei Lin","doi":"10.1109/PRDC.2002.1185615","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185615","url":null,"abstract":"Domino-Effect Freedom (DEF) is a property stating that unbounded, cascading rollback propagation will not occur during the process of finding a consistent global checkpoint. DEF checkpointing protocols can be classified into two different categories: index-based and model-based. An index-based protocol timestamps local checkpoints with sequence numbers for achieving consistency, while a model-based one prohibits the formation of particular checkpoint and communication patterns in the execution. We explore several characteristics of communication-induced checkpointing protocols with the DEF property. First, we demonstrate that there is no optimal online scalar DEF protocol, in terms of the number of forced checkpoints. Then some techniques for comparing protocols are proposed. We construct some patterns or give formal proofs to compare the performance of both index-based and model-based protocols.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116465096","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":"Using software implemented fault inserter in dependability analysis","authors":"P. Gawkowski, J. Sosnowski","doi":"10.1109/PRDC.2002.1185622","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185622","url":null,"abstract":"We investigate program susceptibility to hardware faults in Win32 environment. For this purpose we use the software implemented fault injector FITS. We analyze natural fault resistivity of COTS systems and the effectiveness of various software techniques improving system dependability. The problems of experiment tuning and result interpretation are discussed in context of a wide spectrum of applications.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437226","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 packet-based caching proxy with loss recovery for video streaming","authors":"Kuan-Sheng Hsueh, Sheng-de Wang","doi":"10.1109/PRDC.2002.1185637","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185637","url":null,"abstract":"With the popularity of broadband networks, video streaming is growing rapidly in the Internet. By deployment of caching proxies, backbone bandwidth can be saved significantly. In this paper, we propose a packet-based caching architecture for video streaming. The proposed caching scheme is based on streamed packets instead of video files and the consideration of packet loss recovery. We also propose an effective cache replacement algorithm, PLFU, and evaluate it through simulation.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"519 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133226386","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}