Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)最新文献_第9页

Routing in hypercubes with large number of faulty nodes 具有大量故障节点的超立方体中的路由

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741160

Q. Gu, S. Peng

{"title":"Routing in hypercubes with large number of faulty nodes","authors":"Q. Gu, S. Peng","doi":"10.1109/ICPADS.1998.741160","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741160","url":null,"abstract":"One of the fundamental routing problems is to find a path from a source node s to a target node t in computer/communication networks. In an n-connected network, a nonfaulty path from s to t exists if there are at most n-1 faulty nodes. However, the network can be disconnected by n faulty nodes. Since the connectivity is usually a worst-case measure which is unlikely to happen in practice, it is important to develop routing algorithms for the case that more than n-1 faulty nodes present. We propose algorithms for finding the routing path from s to t in a hypercube with a large number of faulty nodes. Let H/sub n/ be the n-dimensional hypercube and H/sub n//F be the reduced graph obtained by removing the nodes of F from H/sub n/. The reduced graph H/sub n/F is called k-safe if each node of H/sub n//F has degree at least k. Our first algorithm, given a set F of faulty nodes in H/sub n/ such that |F|/spl les/2/sup k/(n-k)-1 and H/sub n//F is k-safe for 0/spl les/k/spl les/n/2, and s,t /spl isin/H/sub n//F, finds a nonfaulty free path s/spl rarr/t of length d(s,t)+O(k/sup 2/) in O(|F|+n) optimal time, where d(s,t) is the distance between s and t. We show that a lower bound on the length of the nonfaulty path s/spl rarr/t is d(s,t)+2(k+1) for 0/spl les/k/spl les/n/2. Furthermore, for k=1 and 2, we give O(n) time algorithms which find a nonfaulty path s/spl rarr/t of length at most d(s,t)+4 and d(s,t)+6, respectively, which is tight to the lower bound.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123803961","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}

引用次数: 0

Synchronous flow control in wormhole routed optical networks 虫洞路由光网络中的同步流量控制

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741159

C. Sue, S. Kuo

{"title":"Synchronous flow control in wormhole routed optical networks","authors":"C. Sue, S. Kuo","doi":"10.1109/ICPADS.1998.741159","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741159","url":null,"abstract":"In this paper, we propose a synchronous flow control mechanism in wormhole routed optical networks. It is expected that the benefit of shorter routing delay and smaller buffer size requirement in wormhole routing will be significant in optical networks. Different from the traditional bi-directional asynchronous back-pressure flow control, the flow control is modified to be unidirectional and synchronous. The size of synchronized control slot does not depend on the routing path length and the number of bits is a constant which is equal to the total number of virtual channels and nodes. The proposed flow control takes advantage of the restricted order of accessing channels in deadlock-free routing to broadcast their control information in a corresponding restricted order. Furthermore, in order to reduce the buffer size to only one unit, the virtual channels which share the same physical channel must be able to simultaneously transmit data. The low channel utilization induced by such mechanism is overcome by our modified source routing. In summary, this paper introduces a flow control mechanism which easily incorporates the benefit of wormhole routing into the limited-resource optical networks.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"100 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976173","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}

引用次数: 0

Hierarchical commitment algorithm for permanent time stamp ordering 永久时间戳排序的分层承诺算法

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741022

Shin-ya Kobayashi, Koji Matsuura

引用次数: 0

Decompositions of de Bruijn networks 他的父亲是一名律师，母亲是一名律师。

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741136

P. Kopriva, P. Tvrdík

引用次数: 2

A comparison of two torus-based k-coteries 两个以环为基础的k群的比较

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741086

S. Lang, L. Mao

{"title":"A comparison of two torus-based k-coteries","authors":"S. Lang, L. Mao","doi":"10.1109/ICPADS.1998.741086","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741086","url":null,"abstract":"We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logically arranged in a rectangle, called a torus, in which the last row (column) is followed by the first row (column) using end wraparound. A torus quorum consists of a head and a tail, where the head contains one entire row and the tail contains one node from each of the s succeeding rows, s/spl ges/1 is a system parameter. It has been shown that by setting s=[h/2], where h=the number of rows, the collection of torus quorums form an equal-sized, equal-responsibility coterie. In this paper we propose two extensions to k-coteries: the Div-Torus method divides the system nodes into k clusters and runs a separate instance of a torus coterie in each cluster; the k-Torus method uses quorums of tail s=[h/(k+1)]. We compare the quorum size and quorum availability of the two proposed methods, and against the DIV method which is based on the majority quorums in each of the k divided clusters, assuming the node reliability is a constant. Numerical data demonstrate that DIV and Div-Torus have similar system availability, better than that of the k-Torus, although all 3 methods' availability becomes comparable when the node reliability is higher than 0.9. However, Div-Torus has the smallest quorum size and k-Torus the second smallest, which has the potential of causing less network traffic when requesting permissions from a quorum.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970573","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

Decoding unit with high issue rate for x86 superscalar microprocessors 用于x86超标量微处理器的高发放率解码单元

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741119

S.-K. Cheng, R.-Ming Shiu, J. Shann

引用次数: 1

Electronic exchange check system on the Internet 互联网上的电子兑换支票系统

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741115

S. O. Hwang

引用次数: 3

Reusing MS-Windows software applications under CORBA environment CORBA环境下MS-Windows软件应用程序的重用

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741144

Renhao Lin, J.-M. Lin, H. J. Jiau

{"title":"Reusing MS-Windows software applications under CORBA environment","authors":"Renhao Lin, J.-M. Lin, H. J. Jiau","doi":"10.1109/ICPADS.1998.741144","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741144","url":null,"abstract":"CORBA is becoming the most important middleware that supports object oriented and client/server paradigm in distributed computing systems. However the application systems based on CORBA are still scarce to date. One main reason is that only few CORBA object services have been developed. Without added help mechanisms, to have a new CORBA application, a programmer should make efforts to design a program with a CORBA interface from scratch. In our previous work (K. Liang et al., 1997), a reengineering approach was proposed to convert RPC based programs to CORBA objects, which successfully speeded up the development of CORBA applications. However the source code is required in this approach. In many cases, software designers may not be able to get hold of the source code, so it is necessary to adapt existing PC software applications, particularly for Windows applications, in binary code mode to the object services under CORBA. Our study addresses this problem. A graphic factory temperature monitor system, which integrates MS-Excel under MS-Windows has been implemented to demonstrate the feasibility of our approach.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114700690","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}

引用次数: 0

An optimal routing scheme for multiple broadcast 多广播的最优路由方案

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741094

C. Yeh, Emmanouel Varvarigos, Hua Lee

引用次数: 3

Automatically partitioning threads based on remote paths 基于远程路径自动对线程进行分区

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI: 10.1109/ICPADS.1998.741146

Xinan Tang, G. Gao

引用次数: 3