Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040909
Lakshmish Ramaswamy, B. Ravindran
In this paper, we present a best-effort communication protocol, called ABA, that seeks to maximize aggregate application benefit and deadline-satisfied ratio of asynchronous real-time distributed systems that use CSMA/DDCR broadcast networks. ABA considers an application model where end-to-end timeliness requirements of trans-node application tasks are expressed using Jensen's benefit functions. Furthermore, the protocol assumes that the application is designed using CSMA/DDCR feasibility conditions that is driven by a "best" possible estimate of upper bounds on message arrival densities that is possible at design-time. When such design-time postulations get violated at run-time, ABA directs message traffic so that messages that will increase applications' aggregate benefit are only transmitted, buffering others, until such time when the workloads respect their design-time postulated values. To study the performance of ABA, we consider a previously studied algorithm called RBA* as a baseline algorithm. Our experimental results indicate that ABA yields higher aggregate benefit and higher deadline-satisfied ratio than RBA* when message arrival densities increase at faster rates or at the same rates as that of process execution latencies due to the dynamics of the workload.
{"title":"A best-effort communication protocol for real-time broadcast networks","authors":"Lakshmish Ramaswamy, B. Ravindran","doi":"10.1109/ICPP.2002.1040909","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040909","url":null,"abstract":"In this paper, we present a best-effort communication protocol, called ABA, that seeks to maximize aggregate application benefit and deadline-satisfied ratio of asynchronous real-time distributed systems that use CSMA/DDCR broadcast networks. ABA considers an application model where end-to-end timeliness requirements of trans-node application tasks are expressed using Jensen's benefit functions. Furthermore, the protocol assumes that the application is designed using CSMA/DDCR feasibility conditions that is driven by a \"best\" possible estimate of upper bounds on message arrival densities that is possible at design-time. When such design-time postulations get violated at run-time, ABA directs message traffic so that messages that will increase applications' aggregate benefit are only transmitted, buffering others, until such time when the workloads respect their design-time postulated values. To study the performance of ABA, we consider a previously studied algorithm called RBA* as a baseline algorithm. Our experimental results indicate that ABA yields higher aggregate benefit and higher deadline-satisfied ratio than RBA* when message arrival densities increase at faster rates or at the same rates as that of process execution latencies due to the dynamics of the workload.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306699","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040911
A. Pal, A. Doğan, F. Özgüner
Providing quality of service (QoS) to high bandwidth video, voice and data applications in wireless networks is an important problem. Such applications are in the class of real-time applications; they need communication operations to complete within certain targeted deadlines. Based on this premise, this paper addresses the design of distributed MAC layer protocols that incorporate explicit support for real-time traffic in an ad-hoc wireless network. Specifically, we have developed two new MAC layer protocols, namely the elimination by sieving (ES-DCF) and the deadline bursting (DB-DCF) protocols. Both algorithms use deterministic collision resolution algorithms in order to provide timely delivery guarantees to different classes of real-time traffic. The extensive simulation studies conducted confirmed that ES-DCF and DB-DCF perform well for hard-real-time traffic and soft-real-time traffic, respectively.
{"title":"MAC layer protocols for real-time traffic in ad-hoc wireless networks","authors":"A. Pal, A. Doğan, F. Özgüner","doi":"10.1109/ICPP.2002.1040911","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040911","url":null,"abstract":"Providing quality of service (QoS) to high bandwidth video, voice and data applications in wireless networks is an important problem. Such applications are in the class of real-time applications; they need communication operations to complete within certain targeted deadlines. Based on this premise, this paper addresses the design of distributed MAC layer protocols that incorporate explicit support for real-time traffic in an ad-hoc wireless network. Specifically, we have developed two new MAC layer protocols, namely the elimination by sieving (ES-DCF) and the deadline bursting (DB-DCF) protocols. Both algorithms use deterministic collision resolution algorithms in order to provide timely delivery guarantees to different classes of real-time traffic. The extensive simulation studies conducted confirmed that ES-DCF and DB-DCF perform well for hard-real-time traffic and soft-real-time traffic, respectively.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115036918","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040867
DeQing Chen, Chunqiang Tang, Xiangchuan Chen, S. Dwarkadas, M. Scott
As a result of advances in processor and network speeds, more and more applications can productively be spread across geographically distributed machines. In this paper we present a transparent system for memory sharing, InterWeave, developed with such applications in mind. InterWeave can accommodate hardware coherence and consistency within multiprocessors (level-1 sharing), software distributed shared memory (S-DSM) within tightly coupled clusters (level-2 sharing), and version-based coherence and consistency across the Internet (level-3 sharing). InterWeave allows processes written in multiple languages, running on heterogeneous machines, to share arbitrary typed data structures as if they resided in local memory. Application-specific knowledge of minimal coherence requirements is used to minimize communication. Consistency information is maintained in a manner that allows scaling to large amounts of shared data. In C, operations on shared data, including pointers, take precisely the same form as operations on non-shared data. We demonstrate the ease of use and efficiency of the system through an evaluation of several applications. In particular, we demonstrate that InterWeave's support for sharing at higher (more distributed) levels does not reduce the performance of sharing at lower (more tightly coupled) levels.
{"title":"Multi-level shared state for distributed systems","authors":"DeQing Chen, Chunqiang Tang, Xiangchuan Chen, S. Dwarkadas, M. Scott","doi":"10.1109/ICPP.2002.1040867","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040867","url":null,"abstract":"As a result of advances in processor and network speeds, more and more applications can productively be spread across geographically distributed machines. In this paper we present a transparent system for memory sharing, InterWeave, developed with such applications in mind. InterWeave can accommodate hardware coherence and consistency within multiprocessors (level-1 sharing), software distributed shared memory (S-DSM) within tightly coupled clusters (level-2 sharing), and version-based coherence and consistency across the Internet (level-3 sharing). InterWeave allows processes written in multiple languages, running on heterogeneous machines, to share arbitrary typed data structures as if they resided in local memory. Application-specific knowledge of minimal coherence requirements is used to minimize communication. Consistency information is maintained in a manner that allows scaling to large amounts of shared data. In C, operations on shared data, including pointers, take precisely the same form as operations on non-shared data. We demonstrate the ease of use and efficiency of the system through an evaluation of several applications. In particular, we demonstrate that InterWeave's support for sharing at higher (more distributed) levels does not reduce the performance of sharing at lower (more tightly coupled) levels.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127973358","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040886
Ling Zhuo, Cho-Li Wang, F. Lau
How documents of a Web site are replicated and where they are placed among the server nodes have an important bearing on balance of load in a geographically distributed Web server (DWS) system. The traffic generated due to movements of documents at runtime could also affect the performance of the DWS system. In this paper, we prove that minimizing such traffic is NP-hard. We propose a new document distribution scheme that periodically performs partial replication of a site's documents at selected server locations to maintain load balancing. Several approximation algorithms are used in it to minimize traffic generated. The simulation results show that this scheme can achieve better load balancing than a dynamic scheme, while the internal traffic it causes has a negligible effect on the system's performance.
{"title":"Load balancing in distributed Web server systems with partial document replication","authors":"Ling Zhuo, Cho-Li Wang, F. Lau","doi":"10.1109/ICPP.2002.1040886","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040886","url":null,"abstract":"How documents of a Web site are replicated and where they are placed among the server nodes have an important bearing on balance of load in a geographically distributed Web server (DWS) system. The traffic generated due to movements of documents at runtime could also affect the performance of the DWS system. In this paper, we prove that minimizing such traffic is NP-hard. We propose a new document distribution scheme that periodically performs partial replication of a site's documents at selected server locations to maintain load balancing. Several approximation algorithms are used in it to minimize traffic generated. The simulation results show that this scheme can achieve better load balancing than a dynamic scheme, while the internal traffic it causes has a negligible effect on the system's performance.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120924361","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040900
T. Horozov, A. Grama, V. Vasudevan, Sean Landis
This paper describes the design and implementation of MOBY, a network for mobile peer-to-peer exchange of services and data. Constraints on computing power of mobile devices, limited hardware, networking, and software resources, and ad-hoc nature of mobile clients pose considerable challenges from the points of view of supporting performance goals, ease of service integration, and adaptation. These challenges are addressed in MOBY by dynamic service location and client mapping, surrogates for mobile clients, and standardized interfaces built upon off-the-shelf software components.
{"title":"MOBY-a mobile peer-to-peer service and data network","authors":"T. Horozov, A. Grama, V. Vasudevan, Sean Landis","doi":"10.1109/ICPP.2002.1040900","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040900","url":null,"abstract":"This paper describes the design and implementation of MOBY, a network for mobile peer-to-peer exchange of services and data. Constraints on computing power of mobile devices, limited hardware, networking, and software resources, and ad-hoc nature of mobile clients pose considerable challenges from the points of view of supporting performance goals, ease of service integration, and adaptation. These challenges are addressed in MOBY by dynamic service location and client mapping, surrogates for mobile clients, and standardized interfaces built upon off-the-shelf software components.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123330382","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040894
Ioannis Ioannidis, A. Grama, M. Atallah
Dot-products form the basis of various applications ranging from scientific computations to commercial applications in data mining and transaction processing. Typical scientific computations utilizing sparse iterative solvers use repeated matrix-vector products. These can be viewed as dot-products of sparse vectors. In database applications, dot-products take the form of counting operations. With widespread use of clustered and distributed platforms, these operations are increasingly being performed across networked hosts. Traditional APIs for messaging are susceptible to sniffing, and the data being transferred between hosts is often enough to compromise the entire computation. Due to the large computational requirements of underlying applications, it is highly desirable that secure protocols add minimal overhead to the original algorithm. Finally, by its very nature, dot-products leak limited amounts of information - one of the parties can detect an entry of the other party's vector by simply probing it with a vector with a I in a particular location and zeros elsewhere. We present an extremely efficient and sufficiently secure protocol for computing the dot-product of two vectors using linear algebraic techniques. Using analytical as well as experimental results, we demonstrate superior performance in terms of computational overhead, numerical stability, and security. We show that the overhead of a two-party dot-product computation using MPI as the messaging API across two high-end workstations connected via a Gigabit ethernet approaches multiple 4.69 over an unsecured dot-product. We also show that the average relative error in dot-products across a large number of random (normalized) vectors was roughly 4.5 /spl times/ 10/sup -9/.
{"title":"A secure protocol for computing dot-products in clustered and distributed environments","authors":"Ioannis Ioannidis, A. Grama, M. Atallah","doi":"10.1109/ICPP.2002.1040894","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040894","url":null,"abstract":"Dot-products form the basis of various applications ranging from scientific computations to commercial applications in data mining and transaction processing. Typical scientific computations utilizing sparse iterative solvers use repeated matrix-vector products. These can be viewed as dot-products of sparse vectors. In database applications, dot-products take the form of counting operations. With widespread use of clustered and distributed platforms, these operations are increasingly being performed across networked hosts. Traditional APIs for messaging are susceptible to sniffing, and the data being transferred between hosts is often enough to compromise the entire computation. Due to the large computational requirements of underlying applications, it is highly desirable that secure protocols add minimal overhead to the original algorithm. Finally, by its very nature, dot-products leak limited amounts of information - one of the parties can detect an entry of the other party's vector by simply probing it with a vector with a I in a particular location and zeros elsewhere. We present an extremely efficient and sufficiently secure protocol for computing the dot-product of two vectors using linear algebraic techniques. Using analytical as well as experimental results, we demonstrate superior performance in terms of computational overhead, numerical stability, and security. We show that the overhead of a two-party dot-product computation using MPI as the messaging API across two high-end workstations connected via a Gigabit ethernet approaches multiple 4.69 over an unsecured dot-product. We also show that the average relative error in dot-products across a large number of random (normalized) vectors was roughly 4.5 /spl times/ 10/sup -9/.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131538327","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040879
Yuanyuan Yang, Jianchao Wang
High-speed interconnects have been gaining much attention from the computer industry recently as interconnects are becoming a limiting factor to the performance of modern computer systems. This trend will even continue in the near future as technology improves. In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable multistage networks. We consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes. In particular, routing with node-disjoint paths has important applications in the emerging optical interconnects. We employ and further expand the Latin square technique used in the all-to-all personalized exchange algorithms for this class of multistage networks for general permutation routing. The implementation is optimal in number of passes and near-optimal in network transmission time.
{"title":"Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks","authors":"Yuanyuan Yang, Jianchao Wang","doi":"10.1109/ICPP.2002.1040879","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040879","url":null,"abstract":"High-speed interconnects have been gaining much attention from the computer industry recently as interconnects are becoming a limiting factor to the performance of modern computer systems. This trend will even continue in the near future as technology improves. In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable multistage networks. We consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes. In particular, routing with node-disjoint paths has important applications in the emerging optical interconnects. We employ and further expand the Latin square technique used in the all-to-all personalized exchange algorithms for this class of multistage networks for general permutation routing. The implementation is optimal in number of passes and near-optimal in network transmission time.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131888854","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040887
Peizong Lee, Jan-Jan Wu, Chih Chang
Partitioning meshes is a preprocessing step for parallel scientific simulation. The quality of a partitioning is measured by load balance and communication overhead. The effectiveness of a partitioning significantly influences the performance of parallel computation. In this paper, we propose a quadtree spatial-based domain decomposition method for partitioning unstructured meshes. The background quadtree, which is originally used to represent the density distribution among elements within the computing domain, can be used to obtain an initial partitioning and to do multi-level refinement. As the quadtree implicitly defines hierarchical relationship, which is a natural way to define coarsening and uncoarsening phases, we can repeatedly apply coarsening, partitioning, and uncoarsening multilevel refinement phases, until no improvement can be made. Thus, for most cases, the partitioning results by our method are better than those produced by other graph-based partitioning methods. Experimental studies for the NACA0012 airfoil, the NASA EET wing, and an artillery shell within a shock tube are reported.
{"title":"Partitioning unstructured meshes for homogeneous and heterogeneous parallel computing environments","authors":"Peizong Lee, Jan-Jan Wu, Chih Chang","doi":"10.1109/ICPP.2002.1040887","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040887","url":null,"abstract":"Partitioning meshes is a preprocessing step for parallel scientific simulation. The quality of a partitioning is measured by load balance and communication overhead. The effectiveness of a partitioning significantly influences the performance of parallel computation. In this paper, we propose a quadtree spatial-based domain decomposition method for partitioning unstructured meshes. The background quadtree, which is originally used to represent the density distribution among elements within the computing domain, can be used to obtain an initial partitioning and to do multi-level refinement. As the quadtree implicitly defines hierarchical relationship, which is a natural way to define coarsening and uncoarsening phases, we can repeatedly apply coarsening, partitioning, and uncoarsening multilevel refinement phases, until no improvement can be made. Thus, for most cases, the partitioning results by our method are better than those produced by other graph-based partitioning methods. Experimental studies for the NACA0012 airfoil, the NASA EET wing, and an artillery shell within a shock tube are reported.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114414080","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040877
S. Adabala, J. Fortes
In this paper, an online heuristic is proposed and evaluated, for managing the dynamic memory in a computer system with active disks, by physically colocating in disk memory or main memory, the data pages being accessed by a computation slice. This enables a runtime system that can offload the corresponding computation slice to the appropriate processing unit at the disk memory or main memory. A modified version of SEQUITUR, an online compression algorithm, is used to identify the affinity among sets of pages in a virtual memory page reference stream, and a page allocation and replacement policy is presented. The sets of pages identified are shown to closely match the sets of pages referenced by computation slices, using a suite of data access kernels as benchmarks. The paging policy is evaluated with page traces of micro benchmarks and real applications. In memory constrained environments, with additional memory at the disk, most of the benchmarks see improved performance, due to fewer page faults. The paging heuristic can colocate 50% of the affinity sets on average and can offload up to 100% of the computation to disk.
{"title":"An online heuristic for data placement in computer systems with active disks","authors":"S. Adabala, J. Fortes","doi":"10.1109/ICPP.2002.1040877","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040877","url":null,"abstract":"In this paper, an online heuristic is proposed and evaluated, for managing the dynamic memory in a computer system with active disks, by physically colocating in disk memory or main memory, the data pages being accessed by a computation slice. This enables a runtime system that can offload the corresponding computation slice to the appropriate processing unit at the disk memory or main memory. A modified version of SEQUITUR, an online compression algorithm, is used to identify the affinity among sets of pages in a virtual memory page reference stream, and a page allocation and replacement policy is presented. The sets of pages identified are shown to closely match the sets of pages referenced by computation slices, using a suite of data access kernels as benchmarks. The paging policy is evaluated with page traces of micro benchmarks and real applications. In memory constrained environments, with additional memory at the disk, most of the benchmarks see improved performance, due to fewer page faults. The paging heuristic can colocate 50% of the affinity sets on average and can offload up to 100% of the computation to disk.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114569736","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}
Pub Date : 2002-08-18DOI: 10.1109/ICPP.2002.1040860
Jianer Chen, Iyad A. Kanj, Guojun Wang
Extensive experience has shown that hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme situations thus significantly underestimating the fault tolerance power of hypercube networks, while for more realistic fault tolerance models, the analysis becomes much more complicated. We develop new techniques to analyze a realistic fault tolerance model and derive lower bounds for the probability of hypercube network fault tolerance. Our results are both theoretically significant and practically important. Theoretically, our method offers very general and powerful techniques for formally proving lower bounds on the probability of network connectivity, while practically, our results provide formally proven and precisely given upper bounds on node failure probabilities for manufacturers to achieve a desired probability for network connectivity. Our techniques are also useful for analysis of the performance of routing algorithms.
{"title":"Hypercube network fault tolerance: a probabilistic approach","authors":"Jianer Chen, Iyad A. Kanj, Guojun Wang","doi":"10.1109/ICPP.2002.1040860","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040860","url":null,"abstract":"Extensive experience has shown that hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme situations thus significantly underestimating the fault tolerance power of hypercube networks, while for more realistic fault tolerance models, the analysis becomes much more complicated. We develop new techniques to analyze a realistic fault tolerance model and derive lower bounds for the probability of hypercube network fault tolerance. Our results are both theoretically significant and practically important. Theoretically, our method offers very general and powerful techniques for formally proving lower bounds on the probability of network connectivity, while practically, our results provide formally proven and precisely given upper bounds on node failure probabilities for manufacturers to achieve a desired probability for network connectivity. Our techniques are also useful for analysis of the performance of routing algorithms.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068363","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：