In this paper, we consider the following question: can free spectrum be shared efficiently? We study this problem in the context of 802.11 or WiFi networks. Each access point (AP) in a WiFi network must be assigned a channel for it to service users. There are only finitely many possible ...
A classic question for local computation is whether a locally definable problem is locally computable. Mathematically, this asks whether a feasible solution for a given local CSP can beconstructedusing only local information. There is a substantial body of research works dedicated to this question [2...
Goldwasser, Sudan, and Vaikuntanathan =-=[16]-=- addressed the natural question of whether weak sources can be used in distributed computing. They showed how to solve Byzantine agreement even if each processor has a weak source, and these weak sour...Vinod Vaikuntanathan. Distributed computing ...
Lower Bounds in Distributed Computing 来自 Semantic Scholar 喜欢 0 阅读量: 31 作者:FE Fich,E Ruppert 摘要: From the introduction: What can be computed in a distributed system in which faults can occur? This is a very broad question. There are many different models of distributed systems and...
A big part of distributed computing is designing good protocols.分布式计算的重要部分是设计良好的协议.4.And distributed itto the people who were sitting there.然后把他分给了那些坐着的人.5.Considered as distributed computing and mobile computing environment,this paper presents the development trend of...
In this paper we investigated the inter- and intra-node parallelism of computing betweenness centrality on distributed memory systems. We developed the implementation based on the algorithm proposed by Edmonds et al. using X10 programming language [2]. We further improved the performance of the ...
This motivates a question. Can otherwise monolithic jobs running on single resources be distributed over more than one machine such that there is an overall reduction in the time-to-solution? In this paper, we briefly discuss the development and performance of a parallel molecular dynamics code ...
Practical analysis tools for distributed authorization need to answer quickly and accurately the question: who can access this resource? DAP (Delegation wi... M Mowbray,A Lain - Workshop on Programming Languages & Analysis for Security 被引量: 4发表: 2008年 A Decomposition-based Architecture for...
The key insight underlying our paper is that the general Byzantine SGD problem, even when neither the workers nor the servers are trusted, is easier than consensus (which is based on SMR in the distributed computing sense), i.e., total ordering of updates is not required in the context of...
In this section, we specify the research question that we used to conduct our survey. The research questions that we addressed in this paper are: 1. which/what are post-quantum distributed ledger technologies? Why are they important?