The Experts below are selected from a list of 17220 Experts worldwide ranked by ideXlab platform
Philip K. Mckinley - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Multicast Communication in wormhole-routed torus networks
IEEE Transactions on Parallel and Distributed Systems, 1995Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m-1 destinations in [log/sub 2/ m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks with up to 4096 nodes are also given. >
-
Multicast Communication in staircase multichannel networks
Journal of Parallel and Distributed Computing, 1994Co-Authors: Philip K. MckinleyAbstract:Abstract This paper addresses Multicast Communication in a family of multichannel networks with staircase topologies. Although the topologies are single-hop , in that every node can reach every other node in a single hop, several channels may be required in order to reach multiple destinations. The topologies are analyzed with respect to their ability to support Multicast Communication, and algorithms are proposed that determine the set of channels on which to send a Multicast message in order to reach a particular set of destinations. The algorithms are provably optimal for the majority of topologies under consideration.
-
Unicast-based Multicast Communication in wormhole-routed networks
IEEE Transactions on Parallel and Distributed Systems, 1994Co-Authors: Philip K. Mckinley, Abdol-hossein EsfahanianAbstract:Multicast Communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported Multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement Multicast Communication in wormhole-routed direct networks, in the absence of hardware Multicast support, by exploiting the properties of the switching technology. Minimum-time Multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a Multicast message to m-1 destinations in [log/sub 2/ m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given. >
-
ICPP (1) - Optimal Multicast Communication in Wormhole-Routed Torus Networks
1994 International Conference on Parallel Processing (ICPP'94), 1994Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks are also given.
-
SRDS - A token-based protocol for reliable, ordered Multicast Communication
Proceedings of the Eighth Symposium on Reliable Distributed Systems, 1Co-Authors: B. Rajagopalan, Philip K. MckinleyAbstract:A description is given of the token-passing Multicast (TPM) protocol, a token-based protocol that provides reliable, ordered Multicast Communication for distributed process groups in the presence of failures and network partitions. The TPM protocol combines several positive features of other reliable Multicast schemes into a single protocol, yet maintains a relatively simple structure and requires that only a minimal amount of state information be kept by process group members. It is designed specifically for computing environments with relatively low error rates, such as local area networks, and for process groups in which Communication is symmetric, that is, each group member can send messages to the group, and the source must be a member of the group. >
Betty H. C. Cheng - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Multicast Communication in wormhole-routed torus networks
IEEE Transactions on Parallel and Distributed Systems, 1995Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m-1 destinations in [log/sub 2/ m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks with up to 4096 nodes are also given. >
-
ICPP (1) - Optimal Multicast Communication in Wormhole-Routed Torus Networks
1994 International Conference on Parallel Processing (ICPP'94), 1994Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks are also given.
Xiaoxiang Wang - One of the best experts on this subject based on the ideXlab platform.
-
joint social energy and transfer rate cluster head selection strategy for d2d Multicast Communication
International Conference on Information Systems, 2018Co-Authors: Fuxin Ren, Xiaoxiang Wang, Dongyu Wang, Yufang Zhang, Yanwen LanAbstract:Content sharing among users through Device-to-Device (D2D) Multicast Communication is an attractive solution to offload the mobile traffic. To achieve stable and effective sharing of content among nearby users, how to select D2D Multicast cluster heads (DMCHs) is important. In this paper, a D2D Multicast cluster head selection strategy based on Chinese Restaurant Process (CRP) is proposed. Firstly, in order to establish stable D2D Multicast links, some requesting users (RUs) are classified as D2D Multicast users (DMUs) taking account of their mobility. Secondly, to help the base station (BS) distributing data to DMUs effectively, DMCHs are selected from DMUs jointly considering DMUs' social attributes, available energy of their devices and the transfer rate from the BS to DMUs. At last, simulation results show that the proposed strategy can not only improve throughput, but also reduce the energy consumption and the transmission delay.
-
joint social energy and transfer rate to select cluster heads in d2d Multicast Communication
International Conference on Measuring Technology and Mechatronics Automation, 2018Co-Authors: Fuxin Ren, Xiaoxiang Wang, Dongyu Wang, Yufang Zhang, Yanwen LanAbstract:Content sharing among users through Device-to-Device (D2D) Multicast Communication is an attractive solution to offload the mobile traffic. To achieve stable and effective sharing of content among nearby users, how to select D2D Multicast cluster heads (DMCHs) is important. In this paper, a D2D Multicast cluster head selection strategy based on Chinese Restaurant Process (CRP) is proposed. Firstly, in order to establish stable D2D Multicast links, some requesting users (RUs) are classified as D2D Multicast users (DMUs) taking account of their mobility. Secondly, to help the base station (BS) distributing data to DMUs effectively, DMCHs are selected from DMUs jointly considering DMUs' social attributes, available energy of their devices and the transfer rate from the BS to DMUs. At last, simulation results show that the proposed strategy can not only improve throughput, but also reduce the energy consumption and the transmission delay.
-
Particle Swarm Optimization Based Power Allocation Schemes of Device-to-Device Multicast Communication
Wireless Personal Communications, 2015Co-Authors: Wenrong Gong, Xiaoxiang WangAbstract:Device-to-device (D2D) Multicast Communication is a useful way to improve the Communication efficiency of local services. In this paper, we study the power control of D2D Multicast Communication underlying cellular network. To improve the overall throughput of D2D and cellular Communication, particle swarm optimization (PSO) algorithm based power allocation schemes are proposed under two scenarios. Firstly, we introduce a distributed controlled D2D Multicast group formation procedure. And then, the system model of both D2D Communication reuse the same frequency with one cellular user equipment (CUE) and with multi-CUEs is introduced. Under these two scenarios, the power allocation problems are transformed to constrained optimization problems. PSO algorithm is applied to get the solutions for optimization problems. Additionally, to get a compromise between fairness and the overall throughput of system, a new objective function with fairness factor is designed in the second scenario. Simulation results show that the proposed schemes significantly improve the throughput performance of system and guarantee the quality of both D2D and cellular Communication.
David Robinson - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Multicast Communication in wormhole-routed torus networks
IEEE Transactions on Parallel and Distributed Systems, 1995Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m-1 destinations in [log/sub 2/ m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks with up to 4096 nodes are also given. >
-
ICPP (1) - Optimal Multicast Communication in Wormhole-Routed Torus Networks
1994 International Conference on Parallel Processing (ICPP'94), 1994Co-Authors: David Robinson, Philip K. Mckinley, Betty H. C. ChengAbstract:This paper presents efficient algorithms that implement one-to-many, or Multicast, Communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time Multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a Multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks are also given.
Yanwen Lan - One of the best experts on this subject based on the ideXlab platform.
-
joint social energy and transfer rate cluster head selection strategy for d2d Multicast Communication
International Conference on Information Systems, 2018Co-Authors: Fuxin Ren, Xiaoxiang Wang, Dongyu Wang, Yufang Zhang, Yanwen LanAbstract:Content sharing among users through Device-to-Device (D2D) Multicast Communication is an attractive solution to offload the mobile traffic. To achieve stable and effective sharing of content among nearby users, how to select D2D Multicast cluster heads (DMCHs) is important. In this paper, a D2D Multicast cluster head selection strategy based on Chinese Restaurant Process (CRP) is proposed. Firstly, in order to establish stable D2D Multicast links, some requesting users (RUs) are classified as D2D Multicast users (DMUs) taking account of their mobility. Secondly, to help the base station (BS) distributing data to DMUs effectively, DMCHs are selected from DMUs jointly considering DMUs' social attributes, available energy of their devices and the transfer rate from the BS to DMUs. At last, simulation results show that the proposed strategy can not only improve throughput, but also reduce the energy consumption and the transmission delay.
-
joint social energy and transfer rate to select cluster heads in d2d Multicast Communication
International Conference on Measuring Technology and Mechatronics Automation, 2018Co-Authors: Fuxin Ren, Xiaoxiang Wang, Dongyu Wang, Yufang Zhang, Yanwen LanAbstract:Content sharing among users through Device-to-Device (D2D) Multicast Communication is an attractive solution to offload the mobile traffic. To achieve stable and effective sharing of content among nearby users, how to select D2D Multicast cluster heads (DMCHs) is important. In this paper, a D2D Multicast cluster head selection strategy based on Chinese Restaurant Process (CRP) is proposed. Firstly, in order to establish stable D2D Multicast links, some requesting users (RUs) are classified as D2D Multicast users (DMUs) taking account of their mobility. Secondly, to help the base station (BS) distributing data to DMUs effectively, DMCHs are selected from DMUs jointly considering DMUs' social attributes, available energy of their devices and the transfer rate from the BS to DMUs. At last, simulation results show that the proposed strategy can not only improve throughput, but also reduce the energy consumption and the transmission delay.
