The proceedings contain 62 papers. The topics discussed include: determining recoverable consensus numbers;history-independent concurrent objects;MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory;b...
ISBN:
(纸本)9798400706684
The proceedings contain 62 papers. The topics discussed include: determining recoverable consensus numbers;history-independent concurrent objects;MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory;brief announcement: randomized consensus: common coins are not the holy grail!;game dynamics and equilibrium computation in the population protocol model;brief announcement: optimally encoding information in chemical reaction networks;polylogarithmic time algorithms for shortest path forests in programmable matter;majority consensus thresholds in competitive Lotka-Volterra populations;brief announcement: self-stabilizing mis computation in the beeping model;brief announcement: on the limits of information spread by memory-less agents;and system optimizations for enabling training of extreme long sequence transformer models.
The proceedings contain 39 papers from the proceedings of the 23rd Annual acmsymposium on principles of distributedcomputing. The topics discussed include: completely fair SFE and coalition-safe cheap talk;mechanism...
详细信息
The proceedings contain 39 papers from the proceedings of the 23rd Annual acmsymposium on principles of distributedcomputing. The topics discussed include: completely fair SFE and coalition-safe cheap talk;mechanism design for policy routing;selfish caching in distributed systems: a game-theoretic analysis;bringing practical lock-free synchronization to 64-bit applications;an almost non-blocking stack and lock-free linked lists and skip lists.
The proceedings contains 43 papers. Topics discussed include distributedcomputing, time complexity, concurrent distributed queuing, quorum systems probes, abstraction, cone-based distributed topology control algorith...
详细信息
The proceedings contains 43 papers. Topics discussed include distributedcomputing, time complexity, concurrent distributed queuing, quorum systems probes, abstraction, cone-based distributed topology control algorithm, hybrid mix networks and semantic reasoning.
The proceedings contain 10 papers. The topics discussed include: computation offloading from mobile devices: can edge devices perform better than the cloud?;performance of approximate causal consistency for partially-...
ISBN:
(纸本)9781450342278
The proceedings contain 10 papers. The topics discussed include: computation offloading from mobile devices: can edge devices perform better than the cloud?;performance of approximate causal consistency for partially-replicated systems;modeling the scalability of real-time online interactive applications on clouds;the impact on the performance of co-running virtual machines in a virtualized environment;a gossip-based dynamic virtual machine consolidation strategy for large-scale cloud data centers;data management of sensor signals for high bandwidth data streaming to the cloud;cloud elasticity: going beyond demand as user load;and cloud live streaming system based on auto-adaptive overlay for cyber physical infrastructure.
The reality of multicore machines as a standard and the prevalence of distributed cloud computing has signaled a need for parallel and distributedcomputing to become integrated into the computer science curriculum. A...
详细信息
ISBN:
(纸本)9781450310987
The reality of multicore machines as a standard and the prevalence of distributed cloud computing has signaled a need for parallel and distributedcomputing to become integrated into the computer science curriculum. At the same time, operating system virtualization has become a common technique with open standard tools available to any practitioners. Virtual machines (VMs) installed on available computer lab resources can be used to simulate high-performance cluster computing environments. This paper describes two such virtual clusters in use at small colleges, demonstrates their effectiveness for parallel computing education, and provides information about how to obtain the VMs for use in an educational lab setting. We have used these clusters to introduce parallelism into several courses in our undergraduate curriculum.
In distributedcomputing, questions of computability are exquisitely sensitive to minute details of the model assumptions, and there is no universally agreed upon model of network computing. Here, we study which funct...
详细信息
We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has ...
详细信息
ISBN:
(纸本)9781450306911
We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected (every node knows in the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification, and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s - t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree, shortest paths, and minimum cut. Many of these results are the first non-trivial lower bounds for both exact and approximate distributed computation and they resolve previous open questions. Moreover, our unconditional lower bound of approximating minimum spanning tree (MST) subsumes and improves upon the previous hardness of approximation bound of Elkin [STOC 2004] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [FOCS 1999]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm, for any approximation factor. Our lower bound proofs show an interesting connection between communication complexity and distributedcomputing which turns out to be useful in establishing the time complexity of exact and approximate distributed computation of many problems.
Byzantine agreement, arguably the most fundamental problem in distributedcomputing, operates among n processes, out of which t 2) exchanged messages in the worst case. Since then, it remained unknown whether the quad...
详细信息
暂无评论