Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Nuwan S. Ferdinand"'
Publikováno v:
CISS
Large-scale machine learning problems are often solved using distributed optimization techniques by dividing tasks across multiple compute nodes. Due to variability in compute time amongst nodes, distributed systems suffer from slow nodes known as st
Autor:
Matti Latva-aho, Ugo Silva Dias, Nuwan S. Ferdinand, Daniel Benevides da Costa, Rafael T. de Sousa
Publikováno v:
Transactions on Emerging Telecommunications Technologies. 27:828-841
Transmit antenna selection TAS in wiretap channels has arisen as a simple promising scheme to improve physical layer security. However, up to now, TAS schemes have aimed at maximising the instantaneous signal-to-noise ratio of the legitimate receiver
Publikováno v:
CWIT
In distributed computing systems slow working nodes, known as stragglers, can greatly extend finishing times. Coded computing is a technique that enables straggler-resistant computation. Most coded computing techniques presented to date provide robus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63a43f767e8aea2a690020e114a98acc
Autor:
Nuwan S. Ferdinand, Stark C. Draper
Publikováno v:
Allerton
In this paper, we focus on approaches to parallelizing stochastic gradient descent (SGD) wherein data is farmed out to a set of workers, the results of which, after a number of updates, are then combined at a central master node. Although such synchr
Publikováno v:
ISIT
In cloud computing systems slow processing nodes, often referred to as "stragglers", can significantly extend the computation time. Recent results have shown that error correction coding can be used to reduce the effect of stragglers. In this work we
Autor:
Stark C. Draper, Nuwan S. Ferdinand
Publikováno v:
ISIT
Coded computation is a method to mitigate “stragglers” in distributed computing systems through the use of error correction coding that has lately received significant attention. First used in vector-matrix multiplication, the range of applicatio
Publikováno v:
IEEE Transactions on Wireless Communications. 14:2309-2321
We propose a class of practical efficient lattice codes for real-valued full-duplex one- and two-way relay channels. First, we investigate the problem from a theoretical perspective, proposing lattice-coding instantiations of superposition block Mark
Publikováno v:
ICMLA
In this paper we propose an approach to parallelizing synchronous stochastic gradient descent (SGD) that we term “Anytime-Gradients”. The Anytime-Gradients is designed to exploit the work completed by slow compute nodes or “stragglers”. In ma
Publikováno v:
IEEE Wireless Communications Letters. 3:86-89
This letter investigates the secrecy performance of multiple-input single-output (MISO) wiretap channels when the eavesdropper channel is correlated with the main one. Assuming that the transmitter employs a transmit antenna selection (TAS) scheme, w
Publikováno v:
IEEE Wireless Communications Letters. 2:467-470
In this paper, the physical layer security of multiple-input multiple-output (MIMO) wiretap channels with orthogonal space-time block codes (OSTBCs) and arbitrary antenna correlation is investigated. In our analysis, we consider general correlation m