the proceedings contain 53 papers. the special focus in this conference is on Concurrency, Biological and Chemical Networks, Robot Coordination, Scheduling, Robot Coordination, Scheduling, Radio Networks, Dynamic and ...
详细信息
ISBN:
(纸本)9783662451731
the proceedings contain 53 papers. the special focus in this conference is on Concurrency, Biological and Chemical Networks, Robot Coordination, Scheduling, Robot Coordination, Scheduling, Radio Networks, Dynamic and Social Networks, Transactional Memory and Concurrent Data Structures and distributed Graph Algorithms. the topics include: Automatically adjusting concurrency to the level of synchrony;fault-tolerant ANTS;task allocation in ant colonies;communication-efficient randomized consensus;tight bound on mobile byzantine agreement;unbeatable consensus;reliable broadcast with respect to topology knowledge;evacuating robots via unknown exit in a disk;randomized pattern formation algorithm for asynchronous oblivious mobile robots;a theoretical foundation for scheduling and designing heterogeneous processors for interactive applications;vertex fault tolerant additive spanners;approximate local sums and their applications in radio networks;on correctness of data structures under reads-write concurrency;solo-fast universal constructions for deterministic abortable objects;space bounds for adaptive renaming;lower bounds for structuring unreliable radio networks;random walks on evolving graphs with recurring topologies;randomized rumor spreading in poorly connected small-world networks;making sense of relativistic distributed systems;safety of live transactions in transactional memory;decomposing opacity;the adaptive priority queue with elimination and combining;improving average performance by relaxing distributed data structures;almost-tight distributed minimum cut algorithms;distributed algorithms for coloring interval graphs;distributed symmetry breaking in hypergraphs;on streaming and communication complexity of the set cover problem;on the communication complexity of linear algebraic problems in the message passing model and near-constant-time distributed algorithms on a congested clique.
the proceedings contain 22 papers. the topics discussed include: SpotWeb: running latency-sensitive distributed web services on transient cloud servers;Parsl: pervasive parallel programming in python;kleio: a hybrid m...
ISBN:
(纸本)9781450366700
the proceedings contain 22 papers. the topics discussed include: SpotWeb: running latency-sensitive distributed web services on transient cloud servers;Parsl: pervasive parallel programming in python;kleio: a hybrid memory page scheduler with machine intelligence;MANA for MPI: MPI-agnostic network-agnostic transparent checkpointing;multi-level analysis of compiler-induced variability and performance tradeoffs;making root cause analysis feasible for large code bases: a solution approach for a climate model;HEXO: offloading HPC compute-intensive workloads on low-cost, low-power embedded systems;scheduling beyond CPUs for HPC;paths to fast barrier synchronization on the node;and combining data duplication and graph reordering to accelerate parallel graph processing.
Bounded timestamping systems (Israeli and Li in Proceedings of the 28th Annual IEEE symposium on Foundations of Computer Science (FOCS), pp 371-382, 1987;Dolev and Shavit in SIAM J Comput 26 (2):418-455, 1997) allow a...
详细信息
Bounded timestamping systems (Israeli and Li in Proceedings of the 28th Annual IEEE symposium on Foundations of Computer Science (FOCS), pp 371-382, 1987;Dolev and Shavit in SIAM J Comput 26 (2):418-455, 1997) allow a temporal ordering of events in executions of concurrent algorithms. they are a fundamental and well-studied building block used in many shared-memory algorithms (Haldar and Vit & aacute;nyi in J ACM, 49 (1):101-126, 2002;Afek et al. in ACM Trans Program Lang Syst 16:939-953, 1994;Abrahamson in Proceedings of the 7th ACM symposium on principles of distributedcomputing (PODC), pp 291-302, 1988;Bashari and Woelfel in Proceedings of the 40th ACM symposium on principles of distributedcomputing (PODC), pp 545-555, 2021). A concurrent bounded timestamping system keeps track of m timestamps, which is usually greater or equal to the number of processes in the system, n. A process may, at any point, obtain a new timestamp, and later determine a total order of all process's most recent timestamps. Known bounded timestamping algorithms (Dolev and Shavit in SIAM J Comput 26(2):418-455, 1997;Dwork and Waarts in J ACM 46(5):633-666, 1999;Dwork et al. in SIAM J Comput 28(5):1848-1874, 1999;Gawlick et al. in theory of computing and systems (ISTCS), pp 171-183, 1992;Israeli and Pinhasov in distributed algorithms, pp 95-109, 1992;Haldar and Vit & aacute;nyi in J ACM 49(1):101-126, 2002) do not scale well in the number of processes as getting a new timestamp takes at least Omega(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega (n)$$\end{document} steps. Moreover, a lower bound by Israeli and Li (Proceedings of the 28th annual IEEE symposium on foundations of computer science (FOCS), pp 371-382, 1987) implies that timestamps need to be represented by Omega(m)\documentclass[12pt]{minim
the proceedings contain 30 papers. the topics discussed include: relaxed atomic broadcast: state-machine replication using bounded memory;when and how to change quorums on wide area networks;multithreading-enabled act...
ISBN:
(纸本)9780769538266
the proceedings contain 30 papers. the topics discussed include: relaxed atomic broadcast: state-machine replication using bounded memory;when and how to change quorums on wide area networks;multithreading-enabled active replication for event stream processing operators;performance evaluation of a metaprotocol for database replication adaptability;reliable and highly available distributed publish/subscribe service;resource-aware migratory services in wide-area shared computing environments;the effects of threading, infection time, and multiple-attacker collaboration on malware propagation;polyvaccine: protecting web servers against zero-day, polymorphic and metamorphic exploits;constraint based automated synthesis of nonmasking and stabilizing fault-tolerance;genuine versus non-genuine atomic multicast protocols for wide area networks: an empirical study;and a holistic solution to pursuer-evader tracking in sensor networks.
the proceedings contain 210 papers. the topics discussed include: towards a green, QoS-enabled heterogeneous cloud infrastructure;predicting job completion time in heterogeneous MapReduce environments;minimizing renta...
ISBN:
(纸本)9781509021406
the proceedings contain 210 papers. the topics discussed include: towards a green, QoS-enabled heterogeneous cloud infrastructure;predicting job completion time in heterogeneous MapReduce environments;minimizing rental cost for multiple recipe applications in the cloud;providing fairness in heterogeneous multicores with a predictive, adaptive scheduler;dynamic resource management for parallel tasks in an oversubscribed energy-constrained heterogeneous environment;evaluation of emerging energy-efficient heterogeneous computing platforms for biomolecular and cellular simulation workloads;latency, power, and security optimization in distributed reconfigurable embedded systems;and a reconfigurable fixed-point architecture for adaptive beamforming.
the proceedings contain 28 papers. the topics discussed include: automatic generation of simulation models for digital twins from state-of-the-art simulation frameworks;improving the simulation performance for aggrega...
ISBN:
(纸本)9798331527211
the proceedings contain 28 papers. the topics discussed include: automatic generation of simulation models for digital twins from state-of-the-art simulation frameworks;improving the simulation performance for aggregate programs through compiler plugins;digital twins and simulations for scalable deployment of connected and automated vehicles;a data-driven predictive control driver for racing car simulation;serialization-oriented data layout for distributed and real-time agent-based simulation;computational optimization of a vehicle dynamic simulation model;an architecture and prototype for monitoring distributed simulations of distributed systems;evolving the interaction with simulators;and towards real-time urban physics simulations with digital twins.
the proceedings contain 114 papers. the topics discussed include: cost-optimal execution of Boolean query trees with shared streams;exploiting geometric partitioning in task mapping for parallel computers;communicatio...
ISBN:
(纸本)9780769552071
the proceedings contain 114 papers. the topics discussed include: cost-optimal execution of Boolean query trees with shared streams;exploiting geometric partitioning in task mapping for parallel computers;communication-efficient distributed variance monitoring and outlier detection for multivariate time series;pythia: faster big data in motion through predictive software-defined network optimization at runtime;power and performance characterization and modeling of GPU-accelerated systems;scibox: online sharing of scientific data via the cloud;active measurement of the impact of network switch utilization on application performance;multi-resource real-time reader/writer locks for multiprocessors;remote invalidation: optimizing the critical path of memory transactions;and revisiting asynchronous linear solvers: provable convergence rate through randomization.
the concept of extension-based proofs models the idea of a valency argument which is widely used in distributedcomputing. Extension-based proofs have been shown to be limited in power: there is no extension-based pro...
详细信息
暂无评论