Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300471
Jiannong Cao, Yifeng Chen, Kang Zhang, Yanxiang He
To provide fault tolerance to computer systems suffering from transient faults, checkpointing and rollback recovery is widely-used. Among other techniques, two primary checkpointing schemes have been proposed: independent and coordinated schemes. However, most existing work addresses only the need to employ a single checkpointing and rollback recovery scheme to a target system. In this paper, issues are discussed and a new algorithm is developed to address the need of integrating independent and coordinated checkpointing schemes for applications running in a hybrid distributed environment containing multiple heterogeneous subsystems. The required changes to the original checkpointing schemes for each subsystem and the overall prevented unnecessary rollbacks for the integrated system are presented. Also described is an algorithm for collecting garbage checkpoints in the combined hybrid system.
{"title":"Checkpointing in hybrid distributed systems","authors":"Jiannong Cao, Yifeng Chen, Kang Zhang, Yanxiang He","doi":"10.1109/ISPAN.2004.1300471","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300471","url":null,"abstract":"To provide fault tolerance to computer systems suffering from transient faults, checkpointing and rollback recovery is widely-used. Among other techniques, two primary checkpointing schemes have been proposed: independent and coordinated schemes. However, most existing work addresses only the need to employ a single checkpointing and rollback recovery scheme to a target system. In this paper, issues are discussed and a new algorithm is developed to address the need of integrating independent and coordinated checkpointing schemes for applications running in a hybrid distributed environment containing multiple heterogeneous subsystems. The required changes to the original checkpointing schemes for each subsystem and the overall prevented unnecessary rollbacks for the integrated system are presented. Also described is an algorithm for collecting garbage checkpoints in the combined hybrid system.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120984383","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300467
M. Rahman, S. Horiguchi
Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A hierarchical torus network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher level networks. The static network performance of the HTN has already been studied and has been shown to be good. Dynamic communication performance has been evaluated under uniform traffic patterns but not under a nonuniform traffic, such as matrix transpose traffic patterns. In this paper, we present a deadlock-free routing algorithm for the HTN using 3 virtual channels and evaluate the network's dynamic communication performance under matrix transpose traffic, using the proposed routing algorithm. We evaluate the dynamic communication performance of HTN, H3D-mesh, TESH, and mesh networks by computer simulation. We find that the dynamic communication performance of HTN is better than that of the H3D-mesh, TESH, and mesh networks.
{"title":"High performance hierarchical torus network under matrix transpose traffic patterns","authors":"M. Rahman, S. Horiguchi","doi":"10.1109/ISPAN.2004.1300467","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300467","url":null,"abstract":"Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A hierarchical torus network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher level networks. The static network performance of the HTN has already been studied and has been shown to be good. Dynamic communication performance has been evaluated under uniform traffic patterns but not under a nonuniform traffic, such as matrix transpose traffic patterns. In this paper, we present a deadlock-free routing algorithm for the HTN using 3 virtual channels and evaluate the network's dynamic communication performance under matrix transpose traffic, using the proposed routing algorithm. We evaluate the dynamic communication performance of HTN, H3D-mesh, TESH, and mesh networks by computer simulation. We find that the dynamic communication performance of HTN is better than that of the H3D-mesh, TESH, and mesh networks.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126398810","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300503
Tao Lin, Hai Zhao, Jiyong Wang, Guangjie Han, Jindong Wang
In this paper a design concept is proposed to accomplish a full function Web server on a strictly limited resource space. Through this embedded Web server user can access their equipments remotely. The equipment mentioned here could be home appliances and factory devices. This paper is focused on realization of the TCP/IP suite and user development platform for this embedded Web server. A key goal of the present paper is to provide an effective approach of access to traditional equipments that have no Internet interface and a reduction policy of the TCP/IP protocol suite.
{"title":"An embedded Web server for equipment","authors":"Tao Lin, Hai Zhao, Jiyong Wang, Guangjie Han, Jindong Wang","doi":"10.1109/ISPAN.2004.1300503","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300503","url":null,"abstract":"In this paper a design concept is proposed to accomplish a full function Web server on a strictly limited resource space. Through this embedded Web server user can access their equipments remotely. The equipment mentioned here could be home appliances and factory devices. This paper is focused on realization of the TCP/IP suite and user development platform for this embedded Web server. A key goal of the present paper is to provide an effective approach of access to traditional equipments that have no Internet interface and a reduction policy of the TCP/IP protocol suite.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063289","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300450
W. Qu, Hong Shen
Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. This paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding the destination) and the distribution of mobile agents running in the network. To our knowledge, little work has been done on these two aspects. Our results show that the number of mobile agents can be controlled by adjusting the number of agents generated per request and the number of jumps each mobile agent can move. Thus, we can improve network performance by tuning relevant parameters.
{"title":"Some analysis on mobile-agent based network routing","authors":"W. Qu, Hong Shen","doi":"10.1109/ISPAN.2004.1300450","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300450","url":null,"abstract":"Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. This paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding the destination) and the distribution of mobile agents running in the network. To our knowledge, little work has been done on these two aspects. Our results show that the number of mobile agents can be controlled by adjusting the number of agents generated per request and the number of jumps each mobile agent can move. Thus, we can improve network performance by tuning relevant parameters.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129962983","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300455
Dongmei Zhao, Xuemin Shen, J. Mark
Soft handoff and packet transmission scheduling are studied for cellular CDMA downlinks. A power distribution law is developed first in order to guarantee the required signal-to-interference ratio for each connection in soft handoff. Based on this, packet transmission scheduling for integrated voice and data traffic is proposed. Simulation results show that the proposed packet scheduling scheme using the derived power distribution law can significantly improve the voice connection reliability, increase the system capacity, and achieve high data packet transmission throughput.
{"title":"Effect of soft handoff on packet transmissions in cellular CDMA downlinks","authors":"Dongmei Zhao, Xuemin Shen, J. Mark","doi":"10.1109/ISPAN.2004.1300455","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300455","url":null,"abstract":"Soft handoff and packet transmission scheduling are studied for cellular CDMA downlinks. A power distribution law is developed first in order to guarantee the required signal-to-interference ratio for each connection in soft handoff. Based on this, packet transmission scheduling for integrated voice and data traffic is proposed. Simulation results show that the proposed packet scheduling scheme using the derived power distribution law can significantly improve the voice connection reliability, increase the system capacity, and achieve high data packet transmission throughput.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553500","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300499
János Tapolcai, P. Ho
This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.
{"title":"A deeper study on segment shared protection","authors":"János Tapolcai, P. Ho","doi":"10.1109/ISPAN.2004.1300499","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300499","url":null,"abstract":"This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133809937","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300468
H. Sarbazi-Azad
The mesh structure has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this paper, we investigate some topological properties of meshes. In particular, we study the problem of finding the number of nodes located at a given distance from a given node (surface area) and the number of nodes located within a given distance from a given node (volume), and have derived some expressions calculating these numbers.
{"title":"On some combinatorial properties of meshes","authors":"H. Sarbazi-Azad","doi":"10.1109/ISPAN.2004.1300468","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300468","url":null,"abstract":"The mesh structure has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this paper, we investigate some topological properties of meshes. In particular, we study the problem of finding the number of nodes located at a given distance from a given node (surface area) and the number of nodes located within a given distance from a given node (volume), and have derived some expressions calculating these numbers.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123166849","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300454
Ying Zhao, Junli Zheng
The particle swarm optimization (PSO) algorithm, which originated as a simulation of a simplified social system, is an evolutionary computation technique. In this paper the binary and real-valued versions of PSO algorithm are exploited in two important signal processing paradigm: multiuser detection (MUD) and blind extraction of sources (BES), respectively. The novel approaches are effective and efficient with parallel processing structure and relatively feasible implementation. Simulation results validate either PSO-MUD or PSO-BES has a significant performance improvement over conventional methods.
{"title":"Particle swarm optimization algorithm in signal detection and blind extraction","authors":"Ying Zhao, Junli Zheng","doi":"10.1109/ISPAN.2004.1300454","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300454","url":null,"abstract":"The particle swarm optimization (PSO) algorithm, which originated as a simulation of a simplified social system, is an evolutionary computation technique. In this paper the binary and real-valued versions of PSO algorithm are exploited in two important signal processing paradigm: multiuser detection (MUD) and blind extraction of sources (BES), respectively. The novel approaches are effective and efficient with parallel processing structure and relatively feasible implementation. Simulation results validate either PSO-MUD or PSO-BES has a significant performance improvement over conventional methods.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359179","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300496
Xianbing Wang, Jiannong Cao, Y. M. Teo
Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending messages in each round.
{"title":"An approach to achieve message efficient early-stopping uniform consensus protocols","authors":"Xianbing Wang, Jiannong Cao, Y. M. Teo","doi":"10.1109/ISPAN.2004.1300496","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300496","url":null,"abstract":"Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending messages in each round.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115703827","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 : 2004-05-10DOI: 10.1109/ISPAN.2004.1300498
R.K. Ege, Li Yang, Q. Kharma, Xudong Ni
The interchange of data between client and heterogeneous sources requires an efficient and dynamic approach to mediation. Our framework features three layers of mediators: presence, integration, and homogenization. On arrival of a request for data exchange, a session initiation server forks to the mediator group to elect one mediator as global presence mediator that is responsible for data caching and service provision. Using distributed hash table (DHT), the presence mediator dispatches the data stream request to other mediators and tracks down to the source, which is then integrated and connected to the client in a user-relevant way. Our mediation process is adaptive and dynamic upon the user request and takes QoS factors into consideration.
{"title":"Three-layered mediator architecture based on DHT","authors":"R.K. Ege, Li Yang, Q. Kharma, Xudong Ni","doi":"10.1109/ISPAN.2004.1300498","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300498","url":null,"abstract":"The interchange of data between client and heterogeneous sources requires an efficient and dynamic approach to mediation. Our framework features three layers of mediators: presence, integration, and homogenization. On arrival of a request for data exchange, a session initiation server forks to the mediator group to elect one mediator as global presence mediator that is responsible for data caching and service provision. Using distributed hash table (DHT), the presence mediator dispatches the data stream request to other mediators and tracks down to the source, which is then integrated and connected to the client in a user-relevant way. Our mediation process is adaptive and dynamic upon the user request and takes QoS factors into consideration.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137455","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
扫码关注我们
求助内容：
应助结果提醒方式：