communication round
Recently Published Documents


TOTAL DOCUMENTS

8
(FIVE YEARS 1)

H-INDEX

2
(FIVE YEARS 0)

Author(s):  
Qinbin Li ◽  
Bingsheng He ◽  
Dawn Song

Federated learning enables multiple parties to collaboratively learn a model without exchanging their data. While most existing federated learning algorithms need many rounds to converge, one-shot federated learning (i.e., federated learning with a single communication round) is a promising approach to make federated learning applicable in cross-silo setting in practice. However, existing one-shot algorithms only support specific models and do not provide any privacy guarantees, which significantly limit the applications in practice. In this paper, we propose a practical one-shot federated learning algorithm named FedKT. By utilizing the knowledge transfer technique, FedKT can be applied to any classification models and can flexibly achieve differential privacy guarantees. Our experiments on various tasks show that FedKT can significantly outperform the other state-of-the-art federated learning algorithms with a single communication round.


The zone of wireless sensor networks (WSNs) is one of the developing and quickly developing fields in the logical world. This has realized growing ease, low-control and multiwork sensor hubs. Nonetheless, the real certainty that sensor hubs come up short on vitality rapidly has been an issue and numerous vitality effective directing conventions have been proposed to take care of this issue and safeguard the life span of the network. The proposed EEDBLEACH chooses bunch head with most elevated leftover vitality in every communication round of transmission and furthermore considers, the briefest good ways from the base station to the hubs in the group. By accepting the separation as a parameter which diminishes the vitality utilization. The EEDBLEACH Protocol is correlation with the current LEACH convention. Reproduction results demonstrate that EEDBLEACH Protocol drags out the lifetime of the network


2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Iraj Fathirad ◽  
John Devlin

The approach of instantiating authenticated group key exchange (GAKE) protocol from the multikey encapsulation mechanism (mKEM) has an important advantage of achieving classical requirement of GAKE security in one communication round. In spite of the limitations of this approach, for example, lack of forward secrecy, it is very useful in group environments when maximum communication efficiency is desirable. To enrich thismKEM-based GAKE construction, we suggest an efficient solution to convert this static GAKE framework into a partially dynamic scheme. Furthermore, to address the associated lack of forward-secrecy, we propose two variants of this generic construction which can also provide a means of forward secrecy at the cost of extra communication round. In addition, concerning associated implementation cost of deploying this generic GAKE construction in elliptic curve cryptosystem, we compare the possible instantiations of this model from existingmKEM algorithms in terms of the number of elliptic curve scalar multiplications.


2009 ◽  
Vol 19 (01) ◽  
pp. 129-139
Author(s):  
TEOFILO F. GONZALEZ

We consider the multimessage multicasting over the n processor complete (or fully connected) static network when there are l incoming (message) buffers on every processor. We present an efficient algorithm to route the messages for every degree d problem instance in d2/l + l - 1 total communication rounds, where d is the maximum number of messages that each processor may send (or receive). Our algorithm takes linear time with respect to the input length, i.e. O(n + q) where q is the total number of messages that all processors must receive. For l = d we present a lower bound for the total communication time. The lower bound matches the upper bound for the schedules generated by our algorithm. For convenience we assume that the network is completely connected. However, it is important to note that each communication round can be automatically translated into one communication round for processors interconnected via a replication network followed by a permutation network (e.g., two adjacent Benes networks), because in these networks all possible one-to-many communications can be performed in a single communication round.


2001 ◽  
Vol 11 (01) ◽  
pp. 125-138 ◽  
Author(s):  
H. MONGELLI ◽  
S. W. SONG

Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. A modification that we will allow is that the pattern can be scaled. We propose a new parallel algorithm for this problem, under the CGM (Coarse Grained Multicomputer) model. This algorithm requires linear local computing time in the input, linear memory and uses only one communication round, during which at most a linear amount of data is exchanged. To be the best of our knowledge, there are no known parallel algorithms for the bidimensional pattern matching problem with scaling in the literature. This proposed algorithm was implemented in C, using the PVM interface and was executed on a Parsytec PowerXplorer parallel machine. The experimental results obtained were very promising and showed significant speedups.


1993 ◽  
Vol 03 (04) ◽  
pp. 335-346 ◽  
Author(s):  
JEHOSHUA BRUCK ◽  
CHING-TIEN HO

We present a class of efficient algorithms for global combine operations in k-port message-passing systems. In the k-port communication model, in each communication round, a processor can send data to k other processors and simultaneously receive data from k other processors. We consider algorithms for global combine operations in n processors with respect to a commutative and associative reduction function. Initially, each processor holds a vector of m data items and finally the result of the reduction function over the n vectors of data items, which is also a vector of m data items, is known to all n processors. We present three efficient algorithms that employ various trade-offs between the number of communication rounds and the number of data items transferred in sequence. For the case m=1, we have an algorithm which is optimal in both the number of communication rounds and the number of data items transferred in sequence.


Sign in / Sign up

Export Citation Format

Share Document