The Experts below are selected from a list of 1146 Experts worldwide ranked by ideXlab platform
Saumay Dublish - One of the best experts on this subject based on the ideXlab platform.
-
PACT - Student Research Poster: Slack-Aware Shared Bandwidth Management in GPUs
Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, 2016Co-Authors: Saumay DublishAbstract:Due to lack of sufficient compute threads in memory-intensive applications, GPUs often exhaust all the active warps and therefore, the memory latencies get exposed and appear in the critical path. In such a scenario, the Shared on-chip and off-chip memory Bandwidth appear more performance critical to cores with few or no active warps, in contrast to cores with sufficient active warps. In this work, we use the slack of memory responses as a metric to identify the criticality of Shared Bandwidth to different cores. Consequently, we propose a slack-aware DRAM scheduling policy to prioritize requests from cores with negative slack, ahead of row-buffer hits. We also propose a request throttling mechanism to reduce the Shared Bandwidth demand of cores that have enough active warps to sustain execution. The above techniques help in reducing the memory latencies that appear in the critical path by increasing the memory latencies that can be hidden by multithreading.
-
Student research poster: Slack-aware Shared Bandwidth management in GPUs
2016 International Conference on Parallel Architecture and Compilation Techniques (PACT), 2016Co-Authors: Saumay DublishAbstract:Due to lack of sufficient compute threads in memory-intensive applications, GPUs often exhaust all the active warps and therefore, the memory latencies get exposed and appear in the critical path. In such a scenario, the Shared on-chip and off-chip memory Bandwidth appear more performance critical to cores with few or no active warps, in contrast to cores with sufficient active warps. In this work, we use the slack of memory responses as a metric to identify the criticality of Shared Bandwidth to different cores. Consequently, we propose a slack-aware DRAM scheduling policy to prioritize requests from cores with negative slack, ahead of row-buffer hits. We also propose a request throttling mechanism to reduce the Shared Bandwidth demand of cores that have enough active warps to sustain execution. The above techniques help in reducing the memory latencies that appear in the critical path by increasing the memory latencies that can be hidden by multithreading.
Hong-yi Chang - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Bandwidth Management System for Live Video Streaming on a Public-Shared Network
IEEE Transactions on Vehicular Technology, 2013Co-Authors: Hong-yi Chang, Nen-fu Huang, Yih-jou TzangAbstract:This paper presents a novel concept that is intended to exploit more thoroughly the sharable Bandwidth of public-Shared networks, such as FON networks, through the construction of an efficient, robust, and high-availability video delivery system. By using Bandwidth expansion, only a small amount of Bandwidth is spent on the video streaming source, despite the system being capable of streaming content to numerous clients simultaneously. Two algorithms were designed to optimize the public-Shared Bandwidth, wherein the needs of all clients are addressed, despite minimal usage of system resources. In this research, a resource management scheme was developed for recycling and reusing resources to improve the continuity of streaming experienced by clients and to reduce the overall system load on the devices involved. An implementation of the proposed system demonstrates the overall feasibility of the concept.
-
On the complexity of the Bandwidth management problem for scalable coding video streaming on a public-Shared network
IEEE Communications Letters, 2009Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct an efficient video delivery system. We show that the problem of constructing an architecture to serve the video streaming requests by using a minimum amount of sharable Bandwidth is NP-Hard. A linear approximation algorithm is also proposed to manage the public-Shared Bandwidth so that all clients are served and the total amount of employed sharable Bandwidth is no greater than twice of the optimal solution.
-
A Novel Bandwidth Management Scheme for Video Streaming Service on Public-Shared Network
2008 IEEE International Conference on Communications, 2008Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct a scalable, robust, and high availability video streaming delivering system. By the proposed "Bandwidth Expansion" concept and approach, the video streaming source spends only a small amount of Bandwidth to deliver the video streaming, but the system is capable to serve a large number of clients to receive the video streaming simultaneously. Two optimal algorithms are proposed to arrange the public-Shared Bandwidth so that all clients are served and the used resources are minimized. A workable prototype of the proposed PSnet system is also implemented to illustrate the feasibility of the whole concept.
-
ICC - A Novel Bandwidth Management Scheme for Video Streaming Service on Public-Shared Network
2008 IEEE International Conference on Communications, 2008Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct a scalable, robust, and high availability video streaming delivering system. By the proposed "Bandwidth Expansion" concept and approach, the video streaming source spends only a small amount of Bandwidth to deliver the video streaming, but the system is capable to serve a large number of clients to receive the video streaming simultaneously. Two optimal algorithms are proposed to arrange the public-Shared Bandwidth so that all clients are served and the used resources are minimized. A workable prototype of the proposed PSnet system is also implemented to illustrate the feasibility of the whole concept.
Kobi Cohen - One of the best experts on this subject based on the ideXlab platform.
-
Deep Multi-User Reinforcement Learning for Distributed Dynamic Spectrum Access
IEEE Transactions on Wireless Communications, 2019Co-Authors: Oshri Naparstek, Kobi CohenAbstract:We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The Shared Bandwidth is divided into K orthogonal channels. In the beginning of each time slot, each user selects a channel and transmits a packet with a certain transmission probability. After each time slot, each user that has transmitted a packet receives a local observation indicating whether its packet was successfully delivered or not (i.e., ACK signal). The objective is a multi-user strategy for accessing the spectrum that maximizes a certain network utility in a distributed manner without online coordination or message exchanges between users. Obtaining an optimal solution for the spectrum access problem is computationally expensive, in general, due to the large-state space and partial observability of the states. To tackle this problem, we develop a novel distributed dynamic spectrum access algorithm based on deep multi-user reinforcement leaning. Specifically, at each time slot, each user maps its current state to the spectrum access actions based on a trained deep-Q network used to maximize the objective function. Game theoretic analysis of the system dynamics is developed for establishing design principles for the implementation of the algorithm. The experimental results demonstrate the strong performance of the algorithm.
-
A Distributed Stable Strategy Learning Algorithm for Multi-User Dynamic Spectrum Access
2019 57th Annual Allerton Conference on Communication Control and Computing (Allerton), 2019Co-Authors: Tomer Gafni, Kobi CohenAbstract:We consider the problem of multi-user dynamic spectrum access (DSA) in cognitive radio networks. The Shared Bandwidth is divided into K orthogonal channels, and M (secondary) users aim at accessing the spectrum, where K ≥ M. Each user is allowed to choose a single channel for transmission at each time slot. The state of each channel is modeled by a restless unknown Markovian process. By contrast to existing studies that analyzed a special case of this setting, in which each channel yields the same expected rate for all users, in this paper we consider the more general model, where each channel yields a different expected rate for each user. This general model adds a significant challenge of how to efficiently learn a channel allocation in a distributed manner so as to yield a global system wide objective. We adopt the stable matching utility as the system objective, which is known to yield strong performance in multichannel wireless networks, and develop a novel Distributed Stable Strategy Learning (DSSL) algorithm to achieve the objective. We prove theoretically that the DSSL algorithm converges to the stable matching allocation, and the regret, defined as the loss in total rate with respect to the stable matching solution, has a logarithmic order with time. Finally, we present numerical examples that support the theoretical results and demonstrate strong performance of the DSSL algorithm.
-
Deep Multi-User Reinforcement Learning for Dynamic Spectrum Access in Multichannel Wireless Networks
GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017Co-Authors: Oshri Naparstek, Kobi CohenAbstract:We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The Shared Bandwidth is divided into K orthogonal channels, and the users access the spectrum using a random access protocol. In the beginning of each time slot, each user selects a channel and transmits a packet with a certain attempt probability. After each time slot, each user that has transmitted a packet receives a local observation indicating whether its packet was successfully delivered or not (i.e., ACK signal). The objective is to find a multi-user strategy that maximizes a certain network utility in a distributed manner without online coordination or message exchanges between users. Obtaining an optimal solution for the spectrum access problem is computationally expensive in general due to the large state space and partial observability of the states. To tackle this problem, we develop a distributed dynamic spectrum access algorithm based on deep multi-user reinforcement leaning. Specifically, at each time slot, each user maps its current state to spectrum access actions based on a trained deep-Q network used to maximize the objective function. Experimental results have demonstrated that users are capable to learn good policies that achieve strong performance in this challenging partially observable setting only from their ACK signals, without online coordination, message exchanges between users, or carrier sensing.
Hamid Sarbazi-azad - One of the best experts on this subject based on the ideXlab platform.
-
LCN - Providing mobile Internet service using MOnetary Wireless NETworking (MOWNET)
2011 IEEE 36th Conference on Local Computer Networks, 2011Co-Authors: Abbas Nayebi, Amin Dahesh, Hamid Sarbazi-azadAbstract:A MOWNET is a wireless network that uses financial incentives to make different agents collaborate. In this paper, architecture is proposed to use MOWNETs for Internet service providing. Limited Shared Bandwidth is a substantial problem in wireless Internet access, which can be alleviated by increasing the number of base stations and decreasing the transmission power of each station. A promising approach to commercialize this idea is using financial incentives to encourage people to collaborate in building the network. Adding financial incentives to the network protocols and using anonymous relay agents incur substantial considerations in network design, which are considered in our protocol.
-
Providing mobile Internet service using MOnetary Wireless NETworking (MOWNET)
2011 IEEE 36th Conference on Local Computer Networks, 2011Co-Authors: Abbas Nayebi, Amin Dahesh, Hamid Sarbazi-azadAbstract:A MOWNET is a wireless network that uses financial incentives to make different agents collaborate. In this paper, architecture is proposed to use MOWNETs for Internet service providing. Limited Shared Bandwidth is a substantial problem in wireless Internet access, which can be alleviated by increasing the number of base stations and decreasing the transmission power of each station. A promising approach to commercialize this idea is using financial incentives to encourage people to collaborate in building the network. Adding financial incentives to the network protocols and using anonymous relay agents incur substantial considerations in network design, which are considered in our protocol.
Nen-fu Huang - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Bandwidth Management System for Live Video Streaming on a Public-Shared Network
IEEE Transactions on Vehicular Technology, 2013Co-Authors: Hong-yi Chang, Nen-fu Huang, Yih-jou TzangAbstract:This paper presents a novel concept that is intended to exploit more thoroughly the sharable Bandwidth of public-Shared networks, such as FON networks, through the construction of an efficient, robust, and high-availability video delivery system. By using Bandwidth expansion, only a small amount of Bandwidth is spent on the video streaming source, despite the system being capable of streaming content to numerous clients simultaneously. Two algorithms were designed to optimize the public-Shared Bandwidth, wherein the needs of all clients are addressed, despite minimal usage of system resources. In this research, a resource management scheme was developed for recycling and reusing resources to improve the continuity of streaming experienced by clients and to reduce the overall system load on the devices involved. An implementation of the proposed system demonstrates the overall feasibility of the concept.
-
On the complexity of the Bandwidth management problem for scalable coding video streaming on a public-Shared network
IEEE Communications Letters, 2009Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct an efficient video delivery system. We show that the problem of constructing an architecture to serve the video streaming requests by using a minimum amount of sharable Bandwidth is NP-Hard. A linear approximation algorithm is also proposed to manage the public-Shared Bandwidth so that all clients are served and the total amount of employed sharable Bandwidth is no greater than twice of the optimal solution.
-
A Novel Bandwidth Management Scheme for Video Streaming Service on Public-Shared Network
2008 IEEE International Conference on Communications, 2008Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct a scalable, robust, and high availability video streaming delivering system. By the proposed "Bandwidth Expansion" concept and approach, the video streaming source spends only a small amount of Bandwidth to deliver the video streaming, but the system is capable to serve a large number of clients to receive the video streaming simultaneously. Two optimal algorithms are proposed to arrange the public-Shared Bandwidth so that all clients are served and the used resources are minimized. A workable prototype of the proposed PSnet system is also implemented to illustrate the feasibility of the whole concept.
-
ICC - A Novel Bandwidth Management Scheme for Video Streaming Service on Public-Shared Network
2008 IEEE International Conference on Communications, 2008Co-Authors: Nen-fu Huang, Hong-yi ChangAbstract:This paper proposes a novel concept of using the sharable Bandwidth of public-Shared network, like FON network, to construct a scalable, robust, and high availability video streaming delivering system. By the proposed "Bandwidth Expansion" concept and approach, the video streaming source spends only a small amount of Bandwidth to deliver the video streaming, but the system is capable to serve a large number of clients to receive the video streaming simultaneously. Two optimal algorithms are proposed to arrange the public-Shared Bandwidth so that all clients are served and the used resources are minimized. A workable prototype of the proposed PSnet system is also implemented to illustrate the feasibility of the whole concept.
